Mercurial > emacs
view oldXMenu/XDestAssoc.c @ 83209:c06211125947
Merged in changes from CVS trunk.
Patches applied:
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-558
Merge from gnus--rel--5.10
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-559
Update from CVS
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-560
Update from CVS
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-561
Update from CVS
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-562
Update from CVS: lisp/subr.el (after-change-major-mode-hook): Doc fix.
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-563
Update from CVS
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-564
Update from CVS
* miles@gnu.org--gnu-2004/emacs--cvs-trunk--0--patch-565
Update from CVS
* miles@gnu.org--gnu-2004/gnus--rel--5.10--patch-30
Update from CVS
git-archimport-id: lorentey@elte.hu--2004/emacs--multi-tty--0--patch-249
author | Karoly Lorentey <lorentey@elte.hu> |
---|---|
date | Thu, 23 Sep 2004 10:32:54 +0000 |
parents | e8824c4f5f7e |
children | 3861ff8f4bf1 |
line wrap: on
line source
/* 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); } /* arch-tag: a536bf02-8d63-45f2-8c1a-c7f9fd4da2cf (do not change this comment) */