diff options
| author | Stefan Monnier | 2011-03-21 12:42:16 -0400 |
|---|---|---|
| committer | Stefan Monnier | 2011-03-21 12:42:16 -0400 |
| commit | cafdcef32d55cbb44389d7e322e7f973cbb72dfd (patch) | |
| tree | 7ee0c41ea8a589650ce6f4311fb10e61a63807b9 /src/bytecode.c | |
| parent | a08a25d7aaf251aa18f2ef747be53734bc55cae9 (diff) | |
| parent | 4e05e67e4cd0bc1b0a4ef3176a4d0d91c6b3738e (diff) | |
| download | emacs-cafdcef32d55cbb44389d7e322e7f973cbb72dfd.tar.gz emacs-cafdcef32d55cbb44389d7e322e7f973cbb72dfd.zip | |
Merge from trunk
Diffstat (limited to 'src/bytecode.c')
| -rw-r--r-- | src/bytecode.c | 16 |
1 files changed, 9 insertions, 7 deletions
diff --git a/src/bytecode.c b/src/bytecode.c index ba3c012bd1a..d887668dd39 100644 --- a/src/bytecode.c +++ b/src/bytecode.c | |||
| @@ -76,11 +76,7 @@ Lisp_Object Qbyte_code_meter; | |||
| 76 | } \ | 76 | } \ |
| 77 | } | 77 | } |
| 78 | 78 | ||
| 79 | #else /* no BYTE_CODE_METER */ | 79 | #endif /* BYTE_CODE_METER */ |
| 80 | |||
| 81 | #define METER_CODE(last_code, this_code) | ||
| 82 | |||
| 83 | #endif /* no BYTE_CODE_METER */ | ||
| 84 | 80 | ||
| 85 | 81 | ||
| 86 | Lisp_Object Qbytecode; | 82 | Lisp_Object Qbytecode; |
| @@ -148,7 +144,9 @@ extern Lisp_Object Qand_optional, Qand_rest; | |||
| 148 | #define Bpreceding_char 0150 | 144 | #define Bpreceding_char 0150 |
| 149 | #define Bcurrent_column 0151 | 145 | #define Bcurrent_column 0151 |
| 150 | #define Bindent_to 0152 | 146 | #define Bindent_to 0152 |
| 147 | #ifdef BYTE_CODE_SAFE | ||
| 151 | #define Bscan_buffer 0153 /* No longer generated as of v18 */ | 148 | #define Bscan_buffer 0153 /* No longer generated as of v18 */ |
| 149 | #endif | ||
| 152 | #define Beolp 0154 | 150 | #define Beolp 0154 |
| 153 | #define Beobp 0155 | 151 | #define Beobp 0155 |
| 154 | #define Bbolp 0156 | 152 | #define Bbolp 0156 |
| @@ -156,8 +154,12 @@ extern Lisp_Object Qand_optional, Qand_rest; | |||
| 156 | #define Bcurrent_buffer 0160 | 154 | #define Bcurrent_buffer 0160 |
| 157 | #define Bset_buffer 0161 | 155 | #define Bset_buffer 0161 |
| 158 | #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer. */ | 156 | #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer. */ |
| 157 | #if 0 | ||
| 159 | #define Bread_char 0162 /* No longer generated as of v19 */ | 158 | #define Bread_char 0162 /* No longer generated as of v19 */ |
| 159 | #endif | ||
| 160 | #ifdef BYTE_CODE_SAFE | ||
| 160 | #define Bset_mark 0163 /* this loser is no longer generated as of v18 */ | 161 | #define Bset_mark 0163 /* this loser is no longer generated as of v18 */ |
| 162 | #endif | ||
| 161 | #define Binteractive_p 0164 /* Obsolete. */ | 163 | #define Binteractive_p 0164 /* Obsolete. */ |
| 162 | 164 | ||
| 163 | #define Bforward_char 0165 | 165 | #define Bforward_char 0165 |
| @@ -234,7 +236,6 @@ extern Lisp_Object Qand_optional, Qand_rest; | |||
| 234 | #define BdiscardN 0266 | 236 | #define BdiscardN 0266 |
| 235 | 237 | ||
| 236 | #define Bconstant 0300 | 238 | #define Bconstant 0300 |
| 237 | #define CONSTANTLIM 0100 | ||
| 238 | 239 | ||
| 239 | /* Whether to maintain a `top' and `bottom' field in the stack frame. */ | 240 | /* Whether to maintain a `top' and `bottom' field in the stack frame. */ |
| 240 | #define BYTE_MAINTAIN_TOP (BYTE_CODE_SAFE || BYTE_MARK_STACK) | 241 | #define BYTE_MAINTAIN_TOP (BYTE_CODE_SAFE || BYTE_MARK_STACK) |
| @@ -370,6 +371,7 @@ unmark_byte_stack (void) | |||
| 370 | We do this at every branch, to avoid loops that never GC. */ | 371 | We do this at every branch, to avoid loops that never GC. */ |
| 371 | 372 | ||
| 372 | #define MAYBE_GC() \ | 373 | #define MAYBE_GC() \ |
| 374 | do { \ | ||
| 373 | if (consing_since_gc > gc_cons_threshold \ | 375 | if (consing_since_gc > gc_cons_threshold \ |
| 374 | && consing_since_gc > gc_relative_threshold) \ | 376 | && consing_since_gc > gc_relative_threshold) \ |
| 375 | { \ | 377 | { \ |
| @@ -377,7 +379,7 @@ unmark_byte_stack (void) | |||
| 377 | Fgarbage_collect (); \ | 379 | Fgarbage_collect (); \ |
| 378 | AFTER_POTENTIAL_GC (); \ | 380 | AFTER_POTENTIAL_GC (); \ |
| 379 | } \ | 381 | } \ |
| 380 | else | 382 | } while (0) |
| 381 | 383 | ||
| 382 | /* Check for jumping out of range. */ | 384 | /* Check for jumping out of range. */ |
| 383 | 385 | ||