diff options
| author | Dibyendu Majumdar <dibyendumajumdar@users.noreply.github.com> | 2023-12-07 09:26:54 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-12-07 09:26:54 +0000 |
| commit | 499906b94893cb808df96810d46441857ae432d4 (patch) | |
| tree | bad8c25c95ca59065f04bf24a9791962b51af017 /chapter01/README.md | |
| parent | 6415e3ae9013e3a9ae0437553ea0c3702381469b (diff) | |
| download | Simple-499906b94893cb808df96810d46441857ae432d4.tar.gz Simple-499906b94893cb808df96810d46441857ae432d4.zip | |
Backport some of the code refactoring to previous chapters (#50)
* #44 Revise docs and comments
* #44 Add starting scope to xScopes
* #44 back some of the code refactoring port to previous chapters
* #44 add_def should not be public
* #44 add_def should not be public. Rename method names so that they are camelcase
Diffstat (limited to 'chapter01/README.md')
| -rw-r--r-- | chapter01/README.md | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/chapter01/README.md b/chapter01/README.md index f5f31f82..62f142e6 100644 --- a/chapter01/README.md +++ b/chapter01/README.md @@ -112,8 +112,6 @@ The following control and data nodes appear in this chapter. | Return | Control | Represents the termination of a function | Predecessor control node, Data node value | Return value of the function | | Constant | Data | Represents constants such as integer literals | None, however Start node is set as input to enable graph walking | Value of the constant | -All control nodes implement a marker interface named `Control`. - Within a traditional basic block, instructions are executed in sequence. In the Sea of Nodes model, the correct sequence of instructions is determined by a scheduling algorithm that depends only on dependencies between nodes (including control dependencies) that are explicit as edges in the graph. This enables a number of optimizations at very little cost (nearly always small constant time) because all dependencies are always available. @@ -123,7 +121,7 @@ at very little cost (nearly always small constant time) because all dependencies Each node is assigned a unique dense integer Node ID when created. This ID is useful for debugging, efficiently computing equality and e.g. as an index into a bit vector, which in turn is used to efficiently visit a (possibly cyclic) -graph. We discuss Node equality in Chapter 8 Global Value Numbering. +graph. We discuss Node equality in Chapter 9 Global Value Numbering. ### Start Node |