DataMuseum.dk

Presents historical artifacts from the history of:

DKUUG/EUUG Conference tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about DKUUG/EUUG Conference tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download
Index: ┃ T X

⟦85e4d461e⟧ TextFile

    Length: 1594 (0x63a)
    Types: TextFile
    Names: »XLookUpAssoc.c«

Derivation

└─⟦a0efdde77⟧ Bits:30001252 EUUGD11 Tape, 1987 Spring Conference Helsinki
    └─ ⟦526ad3590⟧ »EUUGD11/gnu-31mar87/X.V10.R4.tar.Z« 
        └─⟦2109abc41⟧ 
            └─ ⟦this⟧ »./X.V10R4/Xlib/XLookUpAssoc.c« 

TextFile

#include <X/mit-copyright.h>

/* $Header: XLookUpAssoc.c,v 10.5 86/12/16 17:17:10 tony Exp $ */
/* Copyright    Massachusetts Institute of Technology    1985	*/

#include "XlibInternal.h"

/* 
 * XLookUpAssoc - Retrieve the data stored in an XAssocTable by its XId.
 * If an appropriately matching XId can be found in the table the routine will
 * return apointer to the data associated with it. If the XId can not be found
 * in the table the routine will return a NULL pointer.  All XId's are relative
 * to the currently active Display.
 */
caddr_t XLookUpAssoc(table, x_id)
	register XAssocTable *table;	/* XAssocTable to search in. */
	register XId x_id;			/* XId to search for. */
{
	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; entry != bucket; entry = entry->next) {
		if (entry->x_id == x_id) {
			/* We have the right XId. */
			if (entry->display == _XlibCurrentDisplay) {
				/* We have the right display. */
				/* We have the right entry! */
				return(entry->data);
			}
			/* 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(NULL);
		}
	}
	/* It is apparently not in the table. */
	return(NULL);
}