view oldXMenu/XCrAssoc.c @ 99594:f7610a7d319c

* ielm.el (ielm-noisy, ielm-dynamic-return, ielm-mode-hook) (ielm-dynamic-multiline-inputs): Remove * from defcustom docstrings. (ielm-prompt-read-only, ielm-font-lock-keywords): Fix docstring typos. (ielm-map): Define within defvar. Add docstring. (ielm-tab, ielm-eval-input, ielm-get-old-input, ielm-return) (ielm-complete-filename): Use `when', `unless'. (ielm-is-whitespace-or-comment): Use `string-match-p'. (ielm-return, ielm-get-old-input): Use `looking-at-p'. (ielm-change-working-buffer): Check that the buffer is live. (inferior-emacs-lisp-mode): Define with `define-derived-mode'. Simplify. Reflow docstring. (inferior-emacs-lisp-mode-hook, inferior-emacs-lisp-mode-map): New aliases, to satisfy `define-derived-mode' expectations.

/* Copyright    Massachusetts Institute of Technology    1985	*/
#include "copyright.h"


#include <config.h>
#include <X11/Xlib.h>
#include <errno.h>
#include "X10.h"

#ifndef NULL
#define NULL 0
#endif

extern int errno;

/*
 * XCreateAssocTable - Create an XAssocTable.  The size argument should be
 * a power of two for efficiency reasons.  Some size suggestions: use 32
 * buckets per 100 objects;  a reasonable maximum number of object per
 * buckets is 8.  If there is an error creating the XAssocTable, a NULL
 * pointer is returned.
 */
XAssocTable *XCreateAssocTable(size)
	register int size;		/* Desired size of the table. */
{
	register XAssocTable *table;	/* XAssocTable to be initialized. */
	register XAssoc *buckets;	/* Pointer to the first bucket in */
					/* the bucket array. */

	/* Malloc the XAssocTable. */
	if ((table = (XAssocTable *)malloc(sizeof(XAssocTable))) == NULL) {
		/* malloc call failed! */
		errno = ENOMEM;
		return(NULL);
	}

	/* calloc the buckets (actually just their headers). */
	buckets = (XAssoc *)calloc((unsigned)size, (unsigned)sizeof(XAssoc));
	if (buckets == NULL) {
		/* calloc call failed! */
		errno = ENOMEM;
		return(NULL);
	}

	/* Insert table data into the XAssocTable structure. */
	table->buckets = buckets;
	table->size = size;

	while (--size >= 0) {
		/* Initialize each bucket. */
		buckets->prev = buckets;
		buckets->next = buckets;
		buckets++;
	}

	return(table);
}

/* arch-tag: 5df3237d-ada0-4345-a3ab-282cafb397aa
   (do not change this comment) */