(Info-extract-pointer): Undo last change.
[emacs.git] / oldXMenu / XCrAssoc.c
blob864ed9d4f1f725b66338c2031019bae79ccb93b4
1 /* $XConsortium: XCrAssoc.c,v 10.17 91/01/06 12:04:57 rws Exp $ */
2 /* Copyright Massachusetts Institute of Technology 1985 */
4 /*
5 Permission to use, copy, modify, distribute, and sell this software and its
6 documentation for any purpose is hereby granted without fee, provided that
7 the above copyright notice appear in all copies and that both that
8 copyright notice and this permission notice appear in supporting
9 documentation, and that the name of M.I.T. not be used in advertising or
10 publicity pertaining to distribution of the software without specific,
11 written prior permission. M.I.T. makes no representations about the
12 suitability of this software for any purpose. It is provided "as is"
13 without express or implied warranty.
16 #include <config.h>
17 #include <X11/Xlib.h>
18 #include <errno.h>
19 #include "X10.h"
21 #ifndef NULL
22 #define NULL 0
23 #endif
25 extern int errno;
28 * XCreateAssocTable - Create an XAssocTable. The size argument should be
29 * a power of two for efficiency reasons. Some size suggestions: use 32
30 * buckets per 100 objects; a reasonable maximum number of object per
31 * buckets is 8. If there is an error creating the XAssocTable, a NULL
32 * pointer is returned.
34 XAssocTable *XCreateAssocTable(size)
35 register int size; /* Desired size of the table. */
37 register XAssocTable *table; /* XAssocTable to be initialized. */
38 register XAssoc *buckets; /* Pointer to the first bucket in */
39 /* the bucket array. */
41 /* Malloc the XAssocTable. */
42 if ((table = (XAssocTable *)malloc(sizeof(XAssocTable))) == NULL) {
43 /* malloc call failed! */
44 errno = ENOMEM;
45 return(NULL);
48 /* calloc the buckets (actually just their headers). */
49 buckets = (XAssoc *)calloc((unsigned)size, (unsigned)sizeof(XAssoc));
50 if (buckets == NULL) {
51 /* calloc call failed! */
52 errno = ENOMEM;
53 return(NULL);
56 /* Insert table data into the XAssocTable structure. */
57 table->buckets = buckets;
58 table->size = size;
60 while (--size >= 0) {
61 /* Initialize each bucket. */
62 buckets->prev = buckets;
63 buckets->next = buckets;
64 buckets++;
67 return(table);