view oldXMenu/XCrAssoc.c @ 80757:d315e19167d6

Fix typos (sync from trunk). * editfns.c (Ffield_string_no_properties): Fix typo in docstring. * fringe.c (Fdefine_fringe_bitmap): Doc fix. * minibuf.c (Fread_minibuffer, Feval_minibuffer): Reflow docstring. * textprop.c (syms_of_textprop) <text-property-default-nonsticky>: (Fremove_text_properties): Fix typos in docstrings. * w32fns.c (Fw32_define_rgb_color): Fix typo in docstring. * xdisp.c (syms_of_xdisp) <scroll-conservatively>: Fix typo in docstring. * xfaces.c (Fx_list_fonts, Finternal_copy_lisp_face): Fix typos in docstrings. * xselect.c (Fx_send_client_event): Doc fix.
author Juanma Barranquero <lekktu@gmail.com>
date Tue, 26 Aug 2008 11:11:41 +0000
parents fec5e03aaf59
children ec58e5c426ef 5cc91198ffb2
line wrap: on
line source

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