view oldXMenu/XDelAssoc.c @ 85451:e1af3a725ca4

* textmodes/two-column.el (2C-split, 2C-merge): * textmodes/bib-mode.el (bib-find-key, mark-bib): * progmodes/idlw-shell.el (idlwave-shell-move-or-history): * progmodes/etags.el (find-tag-in-order, etags-tags-apropos) * progmodes/ada-xref.el (ada-get-all-references): * obsolete/mlsupport.el (ml-next-line, ml-previous-line): * emulation/vi.el (vi-previous-line-first-nonwhite) (vi-effective-range, vi-put-before): * emulation/edt.el (edt-next-line, edt-previous-line) (edt-paragraph-forward): Use forward-line. * progmodes/etags.el (tags-apropos): Require apropos at compile time too. * progmodes/prolog.el: Require comint when compiling. (inferior-prolog-flavor): Move defvar before use.

/* Copyright    Massachusetts Institute of Technology    1985	*/

#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) */