diff options
| author | Raymond Hettinger <python@rcn.com> | 2003-03-16 15:41:11 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2003-03-16 15:41:11 (GMT) |
| commit | ac2072920dd9bad7734dfff20ff6515ace7ab1e9 (patch) | |
| tree | b9571f5c1d6ff34fb18b249653d016221acc324f /Python/ceval.c | |
| parent | f606f87b31186e7614cbae8e5b8ef05700f6267e (diff) | |
| download | cpython-ac2072920dd9bad7734dfff20ff6515ace7ab1e9.zip cpython-ac2072920dd9bad7734dfff20ff6515ace7ab1e9.tar.gz cpython-ac2072920dd9bad7734dfff20ff6515ace7ab1e9.tar.bz2 | |
Fix comment and whitespace.
Diffstat (limited to 'Python/ceval.c')
| -rw-r--r-- | Python/ceval.c | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/Python/ceval.c b/Python/ceval.c index 384bfbe..38edb73 100644 --- a/Python/ceval.c +++ b/Python/ceval.c @@ -609,7 +609,7 @@ eval_frame(PyFrameObject *f) followed by a POP_TOP. Verifying the prediction costs a single high-speed test of register - variable against a constant. If the pairing was good, then the odds + variable against a constant. If the pairing was good, then the processor has a high likelihood of making its own successful branch prediction which results in a nearly zero overhead transition to the next opcode. @@ -618,9 +618,10 @@ eval_frame(PyFrameObject *f) its two unpredictable branches, the HASARG test and the switch-case. */ -#define PREDICT(op) if (*next_instr == op) goto PRED_##op +#define PREDICT(op) if (*next_instr == op) goto PRED_##op #define PREDICTED(op) PRED_##op: next_instr++ -#define PREDICTED_WITH_ARG(op) PRED_##op: oparg = (next_instr += 3, (next_instr[-1]<<8) + next_instr[-2]) +#define PREDICTED_WITH_ARG(op) PRED_##op: oparg = (next_instr += 3, \ + (next_instr[-1]<<8) + next_instr[-2]) /* Stack manipulation macros */ |