Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions header.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -62,6 +62,7 @@ endif::[]
- Clarified that full synchronization also takes place on a privilege change (see <<sec:synchronization>> and <<sec:thaddr>>); +
- Reworded jump classifications in jump classifications in <<sec:InstructionInterfaceRequirements>> to align with terminology used in other specifications; +
- Clarified when to issue sync-support packet when trace is enabled (see <<sec:format33>>); +
- Clarified that branch_map can be set to 31 any time an address needs to be reported and the branch map is full (see <<sec:format1>>); +
- Updated reference encoding algorithm to generalize resync behaviour and add missing trap conditions (see <<Algorithm>>); +
- Clarified that implicit returns are not stored in the jump target cache (see <<sec:jump-cache>>); +
- Updated decoder to remove ECALL, EBREAK and C.EBREAK from is_uninferrable_jump function. Including them is harmless but unnecessary, as these instrucitons don't retire (see <<Decoder>>); +
Expand Down
4 changes: 1 addition & 3 deletions payload.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -556,9 +556,7 @@ See <<sec:updiscon>>.

When the branch map becomes full it must be reported, but in most cases
there is no need to report an address. This is indicated by setting
*branches* to 0. The exception to this is when the instruction
immediately prior to the final branch causes an uninferable
discontinuity, in which case *branches* is set to 31.
*branches* to 0. If the address does need to be reported for any reason (for example because the instruction immediately prior to the final branch causes an uninferable discontinuity) *branches* is set to 31.

The choice of sizes (1, 3, 7, 15, 31) is designed to minimize efficiency
loss. On average there will be some 'wasted' bits because the number of
Expand Down
Loading