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 void emacs_remque();
   9 struct qelem {
  10         struct    qelem *q_forw;
  11         struct    qelem *q_back;
  12         char q_data[1];
  13 };
  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(dpy, table, x_id)
  22         register Display *dpy;
  23         register XAssocTable *table;
  24         register XID x_id;
  25 {
  26         int hash;
  27         register XAssoc *bucket;
  28         register XAssoc *Entry;
  29
  30         /* Hash the XId to get the bucket number. */
  31         hash = x_id & (table->size - 1);
  32         /* Look up the bucket to get the entries in that bucket. */
  33         bucket = &table->buckets[hash];
  34         /* Get the first entry in the bucket. */
  35         Entry = bucket->next;
  36
  37         /* Scan through the entries in the bucket for the right XId. */
  38         for (; Entry != bucket; Entry = Entry->next) {
  39                 if (Entry->x_id == x_id) {
  40                         /* We have the right XId. */
  41                         if (Entry->display == dpy) {
  42                                 /* We have the right display. */
  43                                 /* We have the right entry! */
  44                                 /* Remove it from the queue and */
  45                                 /* free the entry. */
  46                                 emacs_remque((struct qelem *)Entry);
  47                                 free((char *)Entry);
  48                                 return;
  49                         }
  50                         /* Oops, identical XId's on different displays! */
  51                         continue;
  52                 }
  53                 if (Entry->x_id > x_id) {
  54                         /* We have gone past where it should be. */
  55                         /* It is apparently not in the table. */
  56                         return;
  57                 }
  58         }
  59         /* It is apparently not in the table. */
  60         return;
  61 }
  62
  63 /* arch-tag: 90981a7e-601c-487a-b364-cdf55d6c475b
  64    (do not change this comment) */