Program transformation system for microcomputer and microcomputer employing transformed program
AssigneeNEC Corporation
InventorToshio Enomoto
Life of this patent
Estimating the term…
Abstract
An optimization compiler performs computation of hamming's distance between address of respective instruction of the temporarily arranged program string and a next execution address after temporary arrangement of program modules. Next, the optimization compiler checks whether a portion of the program string where address distance is smaller than a predetermined value has been optimized in the temporarily arranged program string. If not optimized, modifying process of branching condition or so forth for the instruction is performed. Finally, the optimization compiler further checks whether a portion of the program string where address distance is greater than or equal to the predetermined value. If not optimized, rearrangement of the program modules is performed.
Claims9
A program transformation system for a microcomputer for performing transformation of a source program into an object program by performing temporary arrangement of program modules depending upon results of parsing of the source program, comprising:
- hamming's distance computing means for computing hamming's distances between respective instructions of a temporarily arranged program string;
- local instruction modifying means for optimizing hamming's distance of the instruction by modifying instruction corresponding to a portion of the program string having an address distance smaller than a predetermined value;
- and
- global instruction modifying means for optimizing hamming's distance of the instruction by modifying instruction corresponding to a portion of the program string having an address distance greater than or equal to the predetermined value.
A microcomputer for executing an object program transformed from a source program by temporary arrangement of program modules depending upon result of parsing of said source program, comprising:
- storage means for storing said object program having optimized hamming's distance between addresses of respective instructions of the temporarily arranged program string, said object program being transformed from a source program according to the following steps:
- computing hamming's distances between respective instructions of a temporarily arranged program string,
- optimizing hamming's distance of the instruction by modifying instruction corresponding to a portion of the program string having an address distance smaller than a predetermined value, and
- optimizing hamming's distance of the instruction by modifying instruction corresponding to a portion of the program string having an address distance greater than or equal to the predetermined value, and
- address generating means for sequentially generating addresses with optimized hamming's distances upon execution of the object program.
Dependencies are inferred from the claim text.