Mercurial > emacs
annotate oldXMenu/XLookAssoc.c @ 63784:7f1bb68ec043
*** empty log message ***
author | Stefan Monnier <monnier@iro.umontreal.ca> |
---|---|
date | Sun, 26 Jun 2005 18:14:40 +0000 |
parents | e8824c4f5f7e |
children | 3861ff8f4bf1 |
rev | line source |
---|---|
25858 | 1 /* Copyright Massachusetts Institute of Technology 1985 */ |
2 | |
3 /* | |
4 Permission to use, copy, modify, distribute, and sell this software and its | |
5 documentation for any purpose is hereby granted without fee, provided that | |
6 the above copyright notice appear in all copies and that both that | |
7 copyright notice and this permission notice appear in supporting | |
8 documentation, and that the name of M.I.T. not be used in advertising or | |
9 publicity pertaining to distribution of the software without specific, | |
10 written prior permission. M.I.T. makes no representations about the | |
11 suitability of this software for any purpose. It is provided "as is" | |
12 without express or implied warranty. | |
13 */ | |
14 | |
15 #include <X11/Xlib.h> | |
16 #include <X11/Xresource.h> | |
17 #include "X10.h" | |
18 | |
19 #ifndef NULL | |
20 #define NULL 0 | |
21 #endif | |
22 | |
49600
23a1cea22d13
Trailing whitespace deleted.
Juanma Barranquero <lekktu@gmail.com>
parents:
25858
diff
changeset
|
23 /* |
25858 | 24 * XLookUpAssoc - Retrieve the data stored in an XAssocTable by its XId. |
25 * If an appropriately matching XId can be found in the table the routine will | |
26 * return apointer to the data associated with it. If the XId can not be found | |
27 * in the table the routine will return a NULL pointer. All XId's are relative | |
28 * to the currently active Display. | |
29 */ | |
30 caddr_t XLookUpAssoc(dpy, table, x_id) | |
31 register Display *dpy; | |
32 register XAssocTable *table; /* XAssocTable to search in. */ | |
33 register XID x_id; /* XId to search for. */ | |
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 return(Entry->data); | |
54 } | |
55 /* Oops, identical XId's on different displays! */ | |
56 continue; | |
57 } | |
58 if (Entry->x_id > x_id) { | |
59 /* We have gone past where it should be. */ | |
60 /* It is apparently not in the table. */ | |
61 return(NULL); | |
62 } | |
63 } | |
64 /* It is apparently not in the table. */ | |
65 return(NULL); | |
66 } | |
67 | |
52401 | 68 /* arch-tag: d5075d0c-4b71-467d-b33c-3f5c4c4afcf2 |
69 (do not change this comment) */ |