Mercurial > emacs
comparison oldXMenu/XDelAssoc.c @ 25858:bbce331da1be
#
author | Dave Love <fx@gnu.org> |
---|---|
date | Sun, 03 Oct 1999 19:36:13 +0000 |
parents | |
children | 695cf19ef79e d7ddb3e565de |
comparison
equal
deleted
inserted
replaced
25857:fdc2bd91cf63 | 25858:bbce331da1be |
---|---|
1 /* $XConsortium: XDelAssoc.c,v 10.19 91/01/06 12:06:39 rws Exp $ */ | |
2 /* Copyright Massachusetts Institute of Technology 1985 */ | |
3 | |
4 /* | |
5 Permission to use, copy, modify, distribute, and sell this software and its | |
6 documentation for any purpose is hereby granted without fee, provided that | |
7 the above copyright notice appear in all copies and that both that | |
8 copyright notice and this permission notice appear in supporting | |
9 documentation, and that the name of M.I.T. not be used in advertising or | |
10 publicity pertaining to distribution of the software without specific, | |
11 written prior permission. M.I.T. makes no representations about the | |
12 suitability of this software for any purpose. It is provided "as is" | |
13 without express or implied warranty. | |
14 */ | |
15 | |
16 #include <X11/Xlib.h> | |
17 #include "X10.h" | |
18 void emacs_remque(); | |
19 struct qelem { | |
20 struct qelem *q_forw; | |
21 struct qelem *q_back; | |
22 char q_data[1]; | |
23 }; | |
24 | |
25 /* | |
26 * XDeleteAssoc - Delete an association in an XAssocTable keyed on | |
27 * an XId. An association may be removed only once. Redundant | |
28 * deletes are meaningless (but cause no problems). | |
29 */ | |
30 XDeleteAssoc(dpy, table, x_id) | |
31 register Display *dpy; | |
32 register XAssocTable *table; | |
33 register XID x_id; | |
34 { | |
35 int hash; | |
36 register XAssoc *bucket; | |
37 register XAssoc *Entry; | |
38 | |
39 /* Hash the XId to get the bucket number. */ | |
40 hash = x_id & (table->size - 1); | |
41 /* Look up the bucket to get the entries in that bucket. */ | |
42 bucket = &table->buckets[hash]; | |
43 /* Get the first entry in the bucket. */ | |
44 Entry = bucket->next; | |
45 | |
46 /* Scan through the entries in the bucket for the right XId. */ | |
47 for (; Entry != bucket; Entry = Entry->next) { | |
48 if (Entry->x_id == x_id) { | |
49 /* We have the right XId. */ | |
50 if (Entry->display == dpy) { | |
51 /* We have the right display. */ | |
52 /* We have the right entry! */ | |
53 /* Remove it from the queue and */ | |
54 /* free the entry. */ | |
55 emacs_remque((struct qelem *)Entry); | |
56 free((char *)Entry); | |
57 return; | |
58 } | |
59 /* Oops, identical XId's on different displays! */ | |
60 continue; | |
61 } | |
62 if (Entry->x_id > x_id) { | |
63 /* We have gone past where it should be. */ | |
64 /* It is apparently not in the table. */ | |
65 return; | |
66 } | |
67 } | |
68 /* It is apparently not in the table. */ | |
69 return; | |
70 } | |
71 |