X-Git-Url: http://git.hcoop.net/bpt/emacs.git/blobdiff_plain/2ec1b5ee3464999a18b8197101e8bf08a3c564a8..257210319f10abebbfd7c12784cf3a8e112c3562:/oldXMenu/XMakeAssoc.c diff --git a/oldXMenu/XMakeAssoc.c b/oldXMenu/XMakeAssoc.c index 84157399b4..143b264111 100644 --- a/oldXMenu/XMakeAssoc.c +++ b/oldXMenu/XMakeAssoc.c @@ -4,29 +4,22 @@ #include -#include +#include "XMenuInt.h" #include -#include "X10.h" #include #ifndef NULL #define NULL 0 #endif -struct qelem { - struct qelem *q_forw; - struct qelem *q_back; - char q_data[1]; -}; -void emacs_insque (struct qelem *elem, struct qelem *prev); - /* * XMakeAssoc - Insert data into an XAssocTable keyed on an XId. * Data is inserted into the table only once. Redundant inserts are * meaningless (but cause no problems). The queue in each association * bucket is sorted (lowest XId to highest XId). */ -XMakeAssoc(register Display *dpy, register XAssocTable *table, register XID x_id, register caddr_t data) +void +XMakeAssoc(register Display *dpy, register XAssocTable *table, register XID x_id, register void *data) { int hash; register XAssoc *bucket; @@ -84,6 +77,3 @@ XMakeAssoc(register Display *dpy, register XAssocTable *table, register XID x_id /* Insert the new entry. */ emacs_insque((struct qelem *)new_entry, (struct qelem *)Entry->prev); } - -/* arch-tag: d7e3fb8a-f3b3-4c5d-a307-75ca67ec1b49 - (do not change this comment) */