Conditional branch instruction compaction for regional code size reduction
US9298436B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 25, 2014 |
| Grant date | Mar 29, 2016 |
| Priority date | — |
| Expiry date | Jun 28, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F11/302
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In an approach for decreasing an execution time of a computer code, one or more processors receive a computer code and identify a frequently executed region of the computer code. One or more processors identify a long-form conditional branch in the frequently executed region of the computer code that is infrequently taken. One or more processors generate a long-form unconditional branch with a target that is a target of the long-form conditional branch. One or more processors modify the long-form conditional branch to be a short-form conditional branch. One or more processors insert the long-form unconditional branch in the computer code within a branch distance of the short-form conditional branch. One or more processors modify a target of the short-form conditional branch to be a location of the long-form unconditional branch in the computer code.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.