Trivial bytecomp.el change.
[emacs.git] / oldXMenu / XDelAssoc.c
blob7aca50aa56b10199c776b7f3aac8d055b1085b1c
1 /* Copyright Massachusetts Institute of Technology 1985 */
3 #include "copyright.h"
6 #include <X11/Xlib.h>
7 #include "X10.h"
8 struct qelem {
9 struct qelem *q_forw;
10 struct qelem *q_back;
11 char q_data[1];
13 void emacs_remque(struct qelem*);
16 * XDeleteAssoc - Delete an association in an XAssocTable keyed on
17 * an XId. An association may be removed only once. Redundant
18 * deletes are meaningless (but cause no problems).
20 XDeleteAssoc(register Display *dpy, register XAssocTable *table, register XID x_id)
22 int hash;
23 register XAssoc *bucket;
24 register XAssoc *Entry;
26 /* Hash the XId to get the bucket number. */
27 hash = x_id & (table->size - 1);
28 /* Look up the bucket to get the entries in that bucket. */
29 bucket = &table->buckets[hash];
30 /* Get the first entry in the bucket. */
31 Entry = bucket->next;
33 /* Scan through the entries in the bucket for the right XId. */
34 for (; Entry != bucket; Entry = Entry->next) {
35 if (Entry->x_id == x_id) {
36 /* We have the right XId. */
37 if (Entry->display == dpy) {
38 /* We have the right display. */
39 /* We have the right entry! */
40 /* Remove it from the queue and */
41 /* free the entry. */
42 emacs_remque((struct qelem *)Entry);
43 free((char *)Entry);
44 return;
46 /* Oops, identical XId's on different displays! */
47 continue;
49 if (Entry->x_id > x_id) {
50 /* We have gone past where it should be. */
51 /* It is apparently not in the table. */
52 return;
55 /* It is apparently not in the table. */
56 return;
59 /* arch-tag: 90981a7e-601c-487a-b364-cdf55d6c475b
60 (do not change this comment) */