This adds a 16-bit inline cache entry to the conditional branch instructions POP_JUMP_IF_{FALSE,TRUE,NONE,NOT_NONE} and their instrumented variants, which is used to keep track of the branch direction.
Each time we encounter these instructions we shift the cache entry left by one and set the bottom bit to whether we jumped.
Then when it's time to translate such a branch to Tier 2 uops, we use the bit count from the cache entry to decided whether to continue translating the "didn't jump" branch or the "jumped" branch.
The counter is initialized to a pattern of alternating ones and zeros to avoid bias.
The .pyc file magic number is updated. There's a new test, some fixes for existing tests, and a few miscellaneous cleanups.
|
||
|---|---|---|
| .. | ||
| _typing_backports.py | ||
| analysis.py | ||
| flags.py | ||
| formatting.py | ||
| generate_cases.py | ||
| instructions.py | ||
| interpreter_definition.md | ||
| lexer.py | ||
| mypy.ini | ||
| parsing.py | ||
| plexer.py | ||
| README.md | ||
| stacking.py | ||
Tooling to generate interpreters
Documentation for the instruction definitions in Python/bytecodes.c
("the DSL") is here.
What's currently here:
lexer.py: lexer for C, originally written by Mark Shannonplexer.py: OO interface on top of lexer.py; main class:PLexerparsing.py: Parser for instruction definition DSL; main classParsergenerate_cases.py: driver script to readPython/bytecodes.cand writePython/generated_cases.c.h(and several other files)analysis.py:Analyzerclass used to read the input filesflags.py: abstractions related to metadata flags for instructionsformatting.py:Formatterclass used to write the output filesinstructions.py: classes to analyze and write instructionsstacking.py: code to handle generalized stack effects
Note that there is some dummy C code at the top and bottom of
Python/bytecodes.c
to fool text editors like VS Code into believing this is valid C code.
A bit about the parser
The parser class uses a pretty standard recursive descent scheme,
but with unlimited backtracking.
The PLexer class tokenizes the entire input before parsing starts.
We do not run the C preprocessor.
Each parsing method returns either an AST node (a Node instance)
or None, or raises SyntaxError (showing the error in the C source).
Most parsing methods are decorated with @contextual, which automatically
resets the tokenizer input position when None is returned.
Parsing methods may also raise SyntaxError, which is irrecoverable.
When a parsing method returns None, it is possible that after backtracking
a different parsing method returns a valid AST.
Neither the lexer nor the parsers are complete or fully correct.
Most known issues are tersely indicated by # TODO: comments.
We plan to fix issues as they become relevant.