oldXMenu/XDelAssoc.c

   1 /* Copyright    Massachusetts Institute of Technology    1985   */
   2
   3 #include "copyright.h"
   4
   5
   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];
  12 };
  13 void emacs_remque(struct qelem*);
  14
  15 /*
  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).
  19  */
  20 void
  21 XDeleteAssoc(register Display *dpy, register XAssocTable *table, register XID x_id)
  22 {
  23         int hash;
  24         register XAssoc *bucket;
  25         register XAssoc *Entry;
  26
  27         /* Hash the XId to get the bucket number. */
  28         hash = x_id & (table->size - 1);
  29         /* Look up the bucket to get the entries in that bucket. */
  30         bucket = &table->buckets[hash];
  31         /* Get the first entry in the bucket. */
  32         Entry = bucket->next;
  33
  34         /* Scan through the entries in the bucket for the right XId. */
  35         for (; Entry != bucket; Entry = Entry->next) {
  36                 if (Entry->x_id == x_id) {
  37                         /* We have the right XId. */
  38                         if (Entry->display == dpy) {
  39                                 /* We have the right display. */
  40                                 /* We have the right entry! */
  41                                 /* Remove it from the queue and */
  42                                 /* free the entry. */
  43                                 emacs_remque((struct qelem *)Entry);
  44                                 free((char *)Entry);
  45                                 return;
  46                         }
  47                         /* Oops, identical XId's on different displays! */
  48                         continue;
  49                 }
  50                 if (Entry->x_id > x_id) {
  51                         /* We have gone past where it should be. */
  52                         /* It is apparently not in the table. */
  53                         return;
  54                 }
  55         }
  56         /* It is apparently not in the table. */
  57         return;
  58 }
  59