Mercurial > emacs
annotate oldXMenu/XDestAssoc.c @ 111486:046351ea9819
Silence idlw*.el compilation.
* lisp/progmodes/idlw-complete-structtag.el: Remove unused dec `name'.
* lisp/progmodes/idlwave.el (idlwave-routine-entry-compare-twins)
(idlwave-study-twins): Prefix dynamic local variable `name'.
(idlwave-routine-twin-compare): Update for above change.
* lisp/progmodes/idlw-help.el (idlwave-do-mouse-completion-help):
Prefix dynamic local variables `name', `kwd', and `link'.
* lisp/progmodes/idlw-shell.el (idlwave-shell-complete-execcomm-help):
* lisp/progmodes/idlw-complete-structtag.el
(idlwave-complete-structure-tag-help):
* lisp/progmodes/idlwave.el (idlwave-complete-sysvar-help)
(idlwave-complete-sysvar-tag-help)
(idlwave-complete-class-structure-tag-help):
Update for above name changes.
author | Glenn Morris <rgm@gnu.org> |
---|---|
date | Wed, 10 Nov 2010 19:53:16 -0800 |
parents | 5cc91198ffb2 |
children | ef719132ddfa |
rev | line source |
---|---|
25858 | 1 /* Copyright Massachusetts Institute of Technology 1985 */ |
2 | |
76133
995b45abe69d
Remove license text in favour of including copyright.h, as was done in
Glenn Morris <rgm@gnu.org>
parents:
75348
diff
changeset
|
3 #include "copyright.h" |
995b45abe69d
Remove license text in favour of including copyright.h, as was done in
Glenn Morris <rgm@gnu.org>
parents:
75348
diff
changeset
|
4 |
25858 | 5 |
6 #include <X11/Xlib.h> | |
7 #include "X10.h" | |
8 | |
9 /* | |
10 * XDestroyAssocTable - Destroy (free the memory associated with) | |
49600
23a1cea22d13
Trailing whitespace deleted.
Juanma Barranquero <lekktu@gmail.com>
parents:
25858
diff
changeset
|
11 * an XAssocTable. |
25858 | 12 */ |
109124
5cc91198ffb2
Convert function definitions in oldXMenu to standard C.
Dan Nicolaescu <dann@ics.uci.edu>
parents:
76174
diff
changeset
|
13 XDestroyAssocTable(register XAssocTable *table) |
25858 | 14 { |
15 register int i; | |
16 register XAssoc *bucket; | |
17 register XAssoc *Entry, *entry_next; | |
18 | |
19 /* Free the buckets. */ | |
20 for (i = 0; i < table->size; i++) { | |
21 bucket = &table->buckets[i]; | |
22 for ( | |
23 Entry = bucket->next; | |
24 Entry != bucket; | |
25 Entry = entry_next | |
26 ) { | |
27 entry_next = Entry->next; | |
28 free((char *)Entry); | |
29 } | |
30 } | |
31 | |
32 /* Free the bucket array. */ | |
33 free((char *)table->buckets); | |
34 | |
35 /* Free the table. */ | |
36 free((char *)table); | |
37 } | |
38 | |
52401 | 39 /* arch-tag: a536bf02-8d63-45f2-8c1a-c7f9fd4da2cf |
40 (do not change this comment) */ |