blob: 53192a54bf315fbc08a89335111354f43461eddc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* Copyright Massachusetts Institute of Technology 1985 */
/* Copyright (C) 2001, 2002, 2003, 2004, 2005,
2006, 2007 Free Software Foundation, Inc. */
#include "copyright.h"
#include <X11/Xlib.h>
#include "X10.h"
void emacs_remque();
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[1];
};
/*
* XDeleteAssoc - Delete an association in an XAssocTable keyed on
* an XId. An association may be removed only once. Redundant
* deletes are meaningless (but cause no problems).
*/
XDeleteAssoc(dpy, table, x_id)
register Display *dpy;
register XAssocTable *table;
register XID x_id;
{
int hash;
register XAssoc *bucket;
register XAssoc *Entry;
/* Hash the XId to get the bucket number. */
hash = x_id & (table->size - 1);
/* Look up the bucket to get the entries in that bucket. */
bucket = &table->buckets[hash];
/* Get the first entry in the bucket. */
Entry = bucket->next;
/* Scan through the entries in the bucket for the right XId. */
for (; Entry != bucket; Entry = Entry->next) {
if (Entry->x_id == x_id) {
/* We have the right XId. */
if (Entry->display == dpy) {
/* We have the right display. */
/* We have the right entry! */
/* Remove it from the queue and */
/* free the entry. */
emacs_remque((struct qelem *)Entry);
free((char *)Entry);
return;
}
/* Oops, identical XId's on different displays! */
continue;
}
if (Entry->x_id > x_id) {
/* We have gone past where it should be. */
/* It is apparently not in the table. */
return;
}
}
/* It is apparently not in the table. */
return;
}
/* arch-tag: 90981a7e-601c-487a-b364-cdf55d6c475b
(do not change this comment) */
|
