Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Fix some Markdown typos |
|---|---|
| Timelines: | family | ancestors | descendants | both | kbk-refactor-callframe |
| Files: | files | file ages | folders |
| SHA3-256: |
e1f3a19eb7b4690479baa773d011ee04 |
| User & Date: | kbk 2019-02-16 21:49:59.415 |
Context
|
2019-02-16
| ||
| 21:52 | Fix some Markdown typos check-in: 9a45fec3f8 user: kbk tags: kbk-refactor-callframe | |
| 21:49 | Fix some Markdown typos check-in: e1f3a19eb7 user: kbk tags: kbk-refactor-callframe | |
| 21:48 | Fix some Markdown typos check-in: bdd91a03bf user: kbk tags: kbk-refactor-callframe | |
Changes
Changes to doc/20190216callframe/callframe.md.
| ︙ | ︙ | |||
47 48 49 50 51 52 53 |
that is, extract the machine-native representation.
Nevertheless, all of these tests become redundant if a second access
to the variable is dominated by the first. In that case, partial
redundancy elimination will eliminate all five of these steps and
simply use the pure value in the arithmetic operation. The partial
redundancy elimination is based largely on the value-based algorithms
| | < | 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 |
that is, extract the machine-native representation.
Nevertheless, all of these tests become redundant if a second access
to the variable is dominated by the first. In that case, partial
redundancy elimination will eliminate all five of these steps and
simply use the pure value in the arithmetic operation. The partial
redundancy elimination is based largely on the value-based algorithms
developed in [][SIMP96][]
We therefore assume here that we will take the brutally simple
approach of generating code that:
+ whenever a local variable (whether potentially aliased or not) is
loaded, generate a `moveFromCallFrame` instruction transferring a
Tcl value into an SSA value.
|
| ︙ | ︙ |