Mercurial > emacs
view oldXMenu/XMakeAssoc.c @ 76650:52354deba43e
Merge from gnus--rel--5.10
Patches applied:
* gnus--rel--5.10 (patch 209-210)
- Merge from emacs--devo--0
- Update from CVS
2007-03-20 Andreas Seltenreich <uwi7@rz.uni-karlsruhe.de>
* lisp/gnus/message.el (message-required-news-headers):
* lisp/gnus/gnus-util.el (gnus-intern-safe): Fix typo in docstring.
2007-03-15 Katsumi Yamaoka <yamaoka@jpl.org>
* lisp/gnus/message.el (message-generate-new-buffers): Change the meaning of the
nil value; add `standard' to the choices; treat t as `unique'; improve
doc string.
(gnus-select-frame-set-input-focus): Autoload.
(message-buffer-name): Search for the existing message buffer if
message-generate-new-buffers is nil or `standard'; treat the value t of
message-generate-new-buffers as `unique'.
(message-pop-to-buffer): Raise the frame already displaying the message
buffer; clear the echo area after querying.
(message-setup): Pass the `continue' argument to compose-mail.
(message-mail): Prefer `switch-function' if it is given; search for the
existing message buffer if the `continue' argument is non-nil; pass
continue and switch-function arguments to compose-mail by way of
message-setup.
(message-mail-other-window): Adjust argument of message-setup.
(message-mail-other-frame): Ditto.
2007-03-15 Katsumi Yamaoka <yamaoka@jpl.org>
* man/message.texi (Message Buffers): Update documentation for
message-generate-new-buffers.
2007-03-15 Daiki Ueno <ueno@unixuser.org>
* man/pgg.texi (Caching passphrase): Describe pgg-passphrase-coding-system.
Revision: emacs@sv.gnu.org/emacs--devo--0--patch-674
author | Miles Bader <miles@gnu.org> |
---|---|
date | Wed, 21 Mar 2007 13:28:53 +0000 |
parents | fec5e03aaf59 |
children | 77b2ab19bece ec58e5c426ef |
line wrap: on
line source
/* Copyright Massachusetts Institute of Technology 1985 */ #include "copyright.h" #include <config.h> #include <X11/Xlib.h> #include <X11/Xresource.h> #include "X10.h" #include <errno.h> #ifndef NULL #define NULL 0 #endif extern int errno; void emacs_insque(); struct qelem { struct qelem *q_forw; struct qelem *q_back; char q_data[1]; }; /* * 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(dpy, table, x_id, data) register Display *dpy; register XAssocTable *table; register XID x_id; register caddr_t data; { int hash; register XAssoc *bucket; register XAssoc *Entry; register XAssoc *new_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; /* If (Entry != bucket), the bucket is empty so make */ /* the new entry the first entry in the bucket. */ /* if (Entry == bucket), the we have to search the */ /* bucket. */ if (Entry != bucket) { /* The bucket isn't empty, begin searching. */ /* If we leave the for loop then we have either passed */ /* where the entry should be or hit the end of the bucket. */ /* In either case we should then insert the new entry */ /* before the current value of "Entry". */ for (; Entry != bucket; Entry = Entry->next) { if (Entry->x_id == x_id) { /* Entry has the same XId... */ if (Entry->display == dpy) { /* Entry has the same Display... */ /* Therefore there is already an */ /* entry with this XId and Display, */ /* reset its data value and return. */ Entry->data = data; return; } /* We found an association with the right */ /* id but the wrong display! */ continue; } /* If the current entry's XId is greater than the */ /* XId of the entry to be inserted then we have */ /* passed the location where the new XId should */ /* be inserted. */ if (Entry->x_id > x_id) break; } } /* If we are here then the new entry should be inserted just */ /* before the current value of "Entry". */ /* Create a new XAssoc and load it with new provided data. */ new_entry = (XAssoc *) xmalloc(sizeof(XAssoc)); new_entry->display = dpy; new_entry->x_id = x_id; new_entry->data = data; /* 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) */