diff options
| author | Stefan Monnier | 2007-06-29 03:37:33 +0000 |
|---|---|---|
| committer | Stefan Monnier | 2007-06-29 03:37:33 +0000 |
| commit | 8e50cc2df8df6f773422ab11805704eaa4bba016 (patch) | |
| tree | 5041fa64f3f1bc6d4ffd1465a88a40055b7b39ab /src/fns.c | |
| parent | df2d551eba1af9966308bb70da6dd5f4e03b650e (diff) | |
| download | emacs-8e50cc2df8df6f773422ab11805704eaa4bba016.tar.gz emacs-8e50cc2df8df6f773422ab11805704eaa4bba016.zip | |
Replace uses of GC_* macros with the non-GC_ versions.
Diffstat (limited to 'src/fns.c')
| -rw-r--r-- | src/fns.c | 12 |
1 files changed, 6 insertions, 6 deletions
| @@ -3831,7 +3831,7 @@ hashfn_eq (h, key) | |||
| 3831 | struct Lisp_Hash_Table *h; | 3831 | struct Lisp_Hash_Table *h; |
| 3832 | Lisp_Object key; | 3832 | Lisp_Object key; |
| 3833 | { | 3833 | { |
| 3834 | unsigned hash = XUINT (key) ^ XGCTYPE (key); | 3834 | unsigned hash = XUINT (key) ^ XTYPE (key); |
| 3835 | xassert ((hash & ~INTMASK) == 0); | 3835 | xassert ((hash & ~INTMASK) == 0); |
| 3836 | return hash; | 3836 | return hash; |
| 3837 | } | 3837 | } |
| @@ -3850,7 +3850,7 @@ hashfn_eql (h, key) | |||
| 3850 | if (FLOATP (key)) | 3850 | if (FLOATP (key)) |
| 3851 | hash = sxhash (key, 0); | 3851 | hash = sxhash (key, 0); |
| 3852 | else | 3852 | else |
| 3853 | hash = XUINT (key) ^ XGCTYPE (key); | 3853 | hash = XUINT (key) ^ XTYPE (key); |
| 3854 | xassert ((hash & ~INTMASK) == 0); | 3854 | xassert ((hash & ~INTMASK) == 0); |
| 3855 | return hash; | 3855 | return hash; |
| 3856 | } | 3856 | } |
| @@ -4271,7 +4271,7 @@ sweep_weak_table (h, remove_entries_p) | |||
| 4271 | /* Follow collision chain, removing entries that | 4271 | /* Follow collision chain, removing entries that |
| 4272 | don't survive this garbage collection. */ | 4272 | don't survive this garbage collection. */ |
| 4273 | prev = Qnil; | 4273 | prev = Qnil; |
| 4274 | for (idx = HASH_INDEX (h, bucket); !GC_NILP (idx); idx = next) | 4274 | for (idx = HASH_INDEX (h, bucket); !NILP (idx); idx = next) |
| 4275 | { | 4275 | { |
| 4276 | int i = XFASTINT (idx); | 4276 | int i = XFASTINT (idx); |
| 4277 | int key_known_to_survive_p = survives_gc_p (HASH_KEY (h, i)); | 4277 | int key_known_to_survive_p = survives_gc_p (HASH_KEY (h, i)); |
| @@ -4296,7 +4296,7 @@ sweep_weak_table (h, remove_entries_p) | |||
| 4296 | if (remove_p) | 4296 | if (remove_p) |
| 4297 | { | 4297 | { |
| 4298 | /* Take out of collision chain. */ | 4298 | /* Take out of collision chain. */ |
| 4299 | if (GC_NILP (prev)) | 4299 | if (NILP (prev)) |
| 4300 | HASH_INDEX (h, bucket) = next; | 4300 | HASH_INDEX (h, bucket) = next; |
| 4301 | else | 4301 | else |
| 4302 | HASH_NEXT (h, XFASTINT (prev)) = next; | 4302 | HASH_NEXT (h, XFASTINT (prev)) = next; |
| @@ -4360,7 +4360,7 @@ sweep_weak_hash_tables () | |||
| 4360 | do | 4360 | do |
| 4361 | { | 4361 | { |
| 4362 | marked = 0; | 4362 | marked = 0; |
| 4363 | for (table = Vweak_hash_tables; !GC_NILP (table); table = h->next_weak) | 4363 | for (table = Vweak_hash_tables; !NILP (table); table = h->next_weak) |
| 4364 | { | 4364 | { |
| 4365 | h = XHASH_TABLE (table); | 4365 | h = XHASH_TABLE (table); |
| 4366 | if (h->size & ARRAY_MARK_FLAG) | 4366 | if (h->size & ARRAY_MARK_FLAG) |
| @@ -4370,7 +4370,7 @@ sweep_weak_hash_tables () | |||
| 4370 | while (marked); | 4370 | while (marked); |
| 4371 | 4371 | ||
| 4372 | /* Remove tables and entries that aren't used. */ | 4372 | /* Remove tables and entries that aren't used. */ |
| 4373 | for (table = Vweak_hash_tables, used = Qnil; !GC_NILP (table); table = next) | 4373 | for (table = Vweak_hash_tables, used = Qnil; !NILP (table); table = next) |
| 4374 | { | 4374 | { |
| 4375 | h = XHASH_TABLE (table); | 4375 | h = XHASH_TABLE (table); |
| 4376 | next = h->next_weak; | 4376 | next = h->next_weak; |