view oldXMenu/XDestAssoc.c @ 51723:635066222916

(ALIGN): Add casts to simplify usage. (BLOCK_ALIGN, BLOCK_BYTES, ABLOCKS_PADDING, ABLOCKS_SIZE) (ABLOCKS_BYTES, ABLOCK_ABASE, ABLOCKS_BUSY, ABLOCKS_BASE): New macros. (struct ablock, struct ablocks): New types. (free_ablock): New global var. (lisp_align_malloc, lisp_align_free): New functions. (FLOAT_BLOCK_SIZE): Redefine in terms of BLOCK_BYTES. (struct float_block): Reorder and add gcmarkbits. (GETMARKBIT, SETMARKBIT, UNSETMARKBIT, FLOAT_BLOCK, FLOAT_INDEX) (FLOAT_MARKED_P, FLOAT_MARK, FLOAT_UNMARK): New macros. (init_float, make_float): Use lisp_align_malloc. (free_float, live_float_p): Don't use `type' any more. (make_float): Use FLOAT_UNMARK to access to mark bit. (mark_maybe_object, mark_maybe_pointer, survives_gc_p): Use FLOAT_MARKED_P to access the mark bit. (pure_alloc): Simplify use of ALIGN. (mark_object): Use FLOAT_MARK to access the mark bit. (gc_sweep): Use new macros to access the float's mark bit. (init_alloc_once): Init free_ablock.

/* $XConsortium: XDestAssoc.c,v 10.17 91/02/08 13:11:50 rws Exp $ */
/* Copyright    Massachusetts Institute of Technology    1985	*/

/*
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of M.I.T. not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission.  M.I.T. makes no representations about the
suitability of this software for any purpose.  It is provided "as is"
without express or implied warranty.
*/

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

/*
 * XDestroyAssocTable - Destroy (free the memory associated with)
 * an XAssocTable.
 */
XDestroyAssocTable(table)
	register XAssocTable *table;
{
	register int i;
	register XAssoc *bucket;
	register XAssoc *Entry, *entry_next;

	/* Free the buckets. */
	for (i = 0; i < table->size; i++) {
		bucket = &table->buckets[i];
		for (
	        	Entry = bucket->next;
			Entry != bucket;
			Entry = entry_next
		) {
		        entry_next = Entry->next;
			free((char *)Entry);
		}
	}

	/* Free the bucket array. */
	free((char *)table->buckets);

	/* Free the table. */
	free((char *)table);
}