METHOD AND APPARATUS FOR COMPUTER CODE PROCESSING IN A CODE TRANSLATOR

Abstract: A code translator, constructed similar to a compiler, accepts as an input to be translated the assembly code written for one architecture (e.g., VAX), and produces as an output object code for a different machine architecture (e.g., RISC). The input code is converted into an intermediate language, and a flow graph is constructed. The flow graph is referenced by a flow analyzer for recognizing certain architecture-specific and calling standard-specific coding pratices or idioms that cannot be automatically converted, particularly relating to stack usage, register usage, condition codes, and passing arguments for procedure calls. By tracking stack usage within routines, the compiler can distinguish up-level stack and return address references from valid local references. Also, it can inform the user of stack misalignment, which has a severe performance penalty, and can detect code segments where different flow paths may result in different stack depths at runtime, which may indicated a source code error. Register usage is likewise tracked to determine which registers are destroyed by a routine, and generate routine prologue and epilogue code which performs register saves, as well as provide register "hints" to aid the user in adding an entry point declaration or documentation for the routine. The usage of condition codes is likewise tracked, by a backward walk through the flow graph, so that code to fabricate needed values is generated. In addition, all argument pointer base memory references in the input code is tracked to determine how the same argument reference may be made in the target environment.

Description: METHOD AND APPARATUS FOR COMPUTER CODE PROCESSING IN A CODE TRANSLATOR BACKGROUND OF THE INVENTION This invention relates to programs for digital computers, and more particular ly to code translation for conversion of instruction code which was written for one computer architecture to code for a more advanced architecture. Computer architecture is the definition of the basic structure of a computer from the standpoint of what exactly can be performed by code written for this computer. Ordinarily, architecture is defined by such facts as the number of registers in the CPU, their size and content, the logic operations performed by the ALU, shifter, and the like, the addressing modes available, data types supported. memory management functions, etc. Usually, the architectural definition is ex¬ pressed as an instruction set, and related elaboration. As the technology used in constructing computers evolves, so does computer architecture. Semiconductor technology has served to make all structural features o a computer faster, less costly, smaller, lower in power dissipation, and more reliable. In view of such changes in the economics and performance of the comput er hardware, it is necessary to make corresponding changes in architecture to take full advantage of existing hardware technology. For example, the CPU data paths have evolved from 16-bit, to 32-bit, to 64-bit. And, as memory has become cheaper, the addressing range has been greatly extended. A major departure in computer architecture, however, has been the retreat from adding more complex an powerful instructions, and instead architectures with reduced instruction sets have been shown to provide performance advantages. Complex instruction set or CISC processors are characterized by having a large number of instructions in their instruction set, often including memory-to- memory instructions with complex memory accessing modes. The instructions are usually of variable length, with simple instructions being only perhaps one byte in length, but the length ranging up to dozens of bytes. The VAX™ instruction set is a primary example of CISC and employs instructions having one to two byte opcodes plus from zero to six operand specifiers, where each operand specifier is from one byte to many bytes in length. The size of the operand specifier depends upon the addressing mode, sizt of displacement (byte, word or longword), etc. The first byte of the operand specifier describes the addressing mode for that operand, while the opcode defines the number of operands: one, two or three. When the opcode itself is decoded, however, the total length of the instruction is not yet known to the processor because the operand specifiers have not yet been decoded. Another characteristic of processors of the VAX type is the use of byte or byte string memory references, in addition to quadword or longword references; that is. a memory reference may be of a length variable from one byte to multiple words, including unaligned byte references. Reduced instruction set or RISC processors are characterized by a smaller number of instructions which are simple to decode, and by requiring that all arithmeticΛogic operations be performed register-to-register. Another feature is that of allowing no complex memory accesses; all memory accesses are register load/- store operations, and there are a small number of relatively simple addressing modes, i.e., only a few ways of specifying operand addresses. Instructions are of only one length, and memory accesses are of a standard data width, usuaUy aligned. Instruction execution is of the direct hardwired type, as distinct from microcoding. There is a fixed instruction cycle time, and the instructions are defined to be relatively simple so that they all execute in one short cycle (on average, since pipelining will spread the actual execution over several cycles). One advantage of CISC processors is in writing source code. The variety of powerful CISC instructions, memory accessing modes and data types should result in more work being done for each line of code (actually, compilers do not produce code taking full advantage of this). However, whatever gain in compacmess of source code for a CISC processor is accomplished at the expense of execution time. Particularly as pipelining of instruction execution has become necessary to achieve performance levels demanded of systems presently, the data or state dependencies of successive instructions, and the vast differences in memory access time vs. machine cycle time, produce excessive stalls and exceptions, slowing execution. The advantage of a RISC processor is the speed of execution of code, but the disadvan¬ tage is that less is accomplished by each line of code, and the code to accomplish a given task is much more lengthy. One line of VAX code can accomplish the same as many lines of RISC code. When CPUs were much faster than memory, it was advantageous to do more work per instruction, because otherwise the CPU would always be waiting for the memory to deliver instructions - this factor lead to more complex instructions that encapsulated what would be otherwise implemented as subroutines. When CPU and memory speed became more balanced, a simple approach such as that of the RISC concepts became more feasible, assuming the memory system is able to deliver one instruction and some data in each cycle. Hierarchical memory techniques, as well as faster access cycles, provide these faster memory speeds. Another factor that has influenced the CISC vs. RISC choice is the change in relative cost of off-chip vs. on-chip interconneαion resulting from VLSI construction of CPUs. Construction on chips instead of boards changes the economics - first it pays to make the architec- ture simple enough to be on one chip, then more on-chip memory is possible (and needed) to avoid going off-chip for memory references. A further factor in the comparison is that adding more complex instructions and addressing modes as in a CISC solution complicates (thus slows down) stages of the instruction execution process. The complex function might make the function execute faster than an equivalent sequence of simple instructions, but it can lengthen the instruction cycle time, making all instructions execute slower; thus an added function must increase the overall performance enough to compensate for the decrease in the instruction execution rate. The performance advantages of RISC processors, taking into account these and other factors, is considered to outweigh the shortcomings, and, were it not for the existing software base, most new processors would probably be designed using RISC features. In order for software base, including operating systems and applica- tions programs, to build up to a high level so that potential and existing users will have the advantages of making use of the product of the best available program¬ ming talent, a computer architecture must exhibit a substantial market share for a long period of time. If a new architecture was adopted every time the technology advances allowed it, the software base would never reach a viable level. This issue is partly alleviated by writing code in high level languages; a program written in C should be able to be compiled to run on a VAX VMS operating system, or a UNIX operating system, or on MS/DOS, and used on various architectures supported by these operating systems. For performance reasons, however, a significant amount of code is written in assembly language, particularly operating systems, and critical parts of applications programs. Assembly language programs are architecture- dependent. Business enterprises (computer users, as well as hardware and software producers) have invested many years of operating background, including operator training as well as the cost of the code itself, in operating systems, applications programs and data structures using the CISC-type processors which were the most widely used in the past ten or fifteen years. The expense and disruption of opera¬ tions to rewrite the code and data structures by hand to accommodate a new processor architecture may not be justified, even though the performance advantages ultimately expected to be achieved would be substantial. Code translators are thus needed to ease the task of converting code written for one computer architecture to that executable on a more advanced architecture. The purpose of a code translator is to take in, as input, computer code written for execution on one type of architecture (e.g., VAX), and/or one operating system (e.g., VMS), and to produce as an output either executable code (object code) or assembly code for the advanced architecture. This is preferably to be done, of course, with a minimum of operator involvement. A particular task of a code translator is to detect latent error-producing features of the code, i.e., features that were acceptable in the prior use of the code as it executed on the previous operating system or architecture, but which may produce errors in the new environment. SUMMARY OF THE INVENTION In accordance with one embodiment of the invention, a code translator is constructed in a manner similar to a compiler, and may indeed be implemented as part of a compiler. The code translator accepts as an input the assembly code or source code which is to be translated, in a manner similar to the front end of any compiler. The input code is parsed to determine its content, with the basic building blocks of the code identified (separated) and converted into an intermediate lan- guage. The intermediate language version of the code is stored in a data structure referred to as a flow graph. The flow graph is referenced by flow analyzer tech¬ niques and optimization routines, before generating object code for the target machine. This translator is particularly adapted for translating VAX assembly language into an advanced RISC architecture. In translating code of one of the CISC architectures into code for a RISC architecture, there appear certain architecture-specific and calling standard-specific coding practices that cannot be automatically converted. The compiler must detect these idioms and report them (via display or printer) to allow the user to make manual code changes. Among these practices, an important one is stack references which rely on the operation of VAX procedure call instructions. A VAX procedure call (e.g., a CALLS instruction) uses the stack to pass arguments, and it has been a coding practice to use the VAX procedure call in ways that result in errors if translated literally. By tracking stack usage within routines, the compiler can distinguish up-level stack and return address references from valid local references. In addition, it can inform the user of stack misalignment, which has a severe performance penalty. Finally, it can detect code segments where different flow paths may result in different stack depths at runtime, which may indicate a source code error. For each routine being compiled, the compiler builds a flow graph and visits each basic block in flow order, beginning at the routine entry point. The compiler records the amount of which the stack pointer is changed in each block, and maintains the cumulative offset from the routine entry point. As it processes each instruction in the block, it can use this cumulative offset, along with any stack-base operand specifiers in the instruction (or stack reference implicit in the instruction), to distinguish whether the instruαion: - reads the return address from the stack - modifies the return address on the stack - removes the return address from the stack - issues a JSB procedure call through the return address to implement a co-routine linkage - makes an up-level stack reference - makes an unaligned stack reference - modifies SP such that it is no longer longword aligned In each of these cases, the compiler/translator detects these occurrences so that user can be advised of the specific usage, and thus the user can make the appropriate changes to the source code. Multiple flow paths to the same basic block are also detected; these may result in different cumulative stack depths - the user can be advised of this occurrence, which is sometimes an indication of an err in the original source code, where a value was inadvertently left on the stack. Another feature of interest in convening code from one architecture to another is that of register usage. Routines in VAX assembly language frequently preserve register values at routine entry points by pushing the values on the stack, and restore them before routine exit. In other instances, register values are pushed and popped around a small range of instructions which are known to destroy them. In code generated by the compiler for register saves for an advanced 64-bit RISC architecture, only the low 32-bits of the 64-bit register can be put on the stack, so that any references to higher stack addresses will continue to work. However, this compiled code will be executing in an environment where many routines use full 64-bit values, so that a 32-bit save/restore operation is not sufficient. Accordingly, in one embodiment of the invention, the compiler tracks register usage to determine which registers are destroyed by a routine, and generat routine prologue and epilogue code which performs 64-bit register saves. As a result of this tracking, the compiler can also advise the user of registers which are input registers to the routine, or appear to be output registers. These register "hint can aid the user in adding an entry point declaration or documentation for the routine. A declaration of routine output registers is required so that the compiler does not restore the original register value after it has been changed; the output register hints may also be useful in identifying these. The input register hints may also uncover bugs in which code incorrectly uses uninitialized register values. For each basic block in the routine being compiled, the compiler tracks which registers are read and written by the instructions in the block. At the same time, it accumulates the set of registers written for the entire routine. During a forward flow-order walk through the basic blocks, the compiler computes which registers are written but not subsequently read, to be reported as possible output registers of the routine. During backward flow-order walks from all exit points of the routine, the compiler computes which registers are read before being written, to be reported as possible input registers. When generating code for the routine, the compiler uses the list of registers written to determine which should be saved by routine prologue code. Registers which have been explicitly declared as routine output or scratch registers are removed from the set. Routine epilogue code is generated to perform the register restores. According to another feature of one embodiment of the invention, the usage of condition codes are tracked. Many computer architectures such as VAX make use of condition codes (overflow, equal to zero, not equal to zero, etc.) generated by the .ALU and internally stored for later reference in a conditional branch, for example. Nearly all VAX instructions modify these condition code bits which are part of the machine architecture. Other instructions test these bits to detect condi¬ tions such as overflow or perform conditional branches. In addition, because these bits survive jump-subroutine (JSB) routine invocations, they are sometimes used in assembly language as implicit routine parameters or return status codes (though this is not a recommended coding practice). An advanced RISC architecture has no condition code bits; instead, when a condition is to be needed, an explicit test is made and the result stored in a register for later use. As a result, when VAX code is translated for this RISC architecture, the compiler must track condition code usage in source programs so that the code to fabricate their values is only generate when the values are actually used. In the vast majority of instances, the condition codes automatically generated in the VAX architecture are not actually used, so it would be an unnecessary burden to generate all the condition codes. The translato must also detect the case where condition codes are used as implicit parameters or status return values and report it to the user, since that behavior cannot be emulate but instead must be recoded. It is also possible that a routine which uses a condi- tion code value set by its caller may actually contain a coding error. To accomplish this condition code tracking, according to one embodiment, the compiler builds a flow graph of each routine being compiled. It subsequently walks this graph in reverse flow order from all exit points, through all basic block up through the routine entry point, maintaining a map of which condition codes ar "required" for instructions it has processed. At entry to a basic block, the compile records which condition codes its successor requires. It then examines the instruc¬ tions in the block in reverse order. If the instruction sets any condition codes, it will remove them from the "required" set, and set corresponding bits in the instruc tion data structure, which direct the code generator to fabricate those condition codes. If the instruction reads any condition codes, it will add them to the "re¬ quired" set. When all instructions in the block have been read, the compiler will record the set of condition codes still "required as "input" to this block. This will continue through all predecessors of the current block. If a JSB instruction is encountered during this reverse-flow walk through th flow graph, and the "required" set is non-empty, the user is informed that conditio codes appear to be used as implicit JSB routine outputs. It is possible and likely that a node will be visited more than once during these backward walks. When a node is revisited, the compiler will compare the current "required" set against the initial set stored by the previous walk, and terminate the traversal if the required codes were previously searched for. After all backward paths have been examined, the compiler checks the basic block corresponding to the routine entry node. If the "input" set is not empty for this node, the user is informed that the routine expects condition codes as input and that a source code change is required. Another issue encountered in translating code to a different machine architec- ture is the way argument list references are handled. VAX assembly language routines rely on the argument list pointer (AP) established by the VAX CALLS/- CALLG instructions to refer to routine parameters. On an advanced 64-bit RISC machine, there is no architected argument list pointer, and the calling standard dictates that parameters are passed in registers, and, if necessary, on top of the stack. The code translator, according to another feature of one embodiment of the invention, resolves this difference without requiring all argument list references to be modified in the source code. The argument list references are mapped across the architectures in making the code translation. The compiler examines all AP-based memory references in the input code to determine how the same argument reference may be made in the target environ¬ ment. Element 0 of the argument list vector represents the argument count on VAX; in the target RISC architecture, the argument count appears in a defined register, e.g., the Argument Information Register (R25). Hence, in this instance, a memory reference of the form 0(AP) will be compiled to an R25 reference. The first six arguments are received in registers R16-R21 on in the target RISC architec¬ ture, so that 4(AP) will be compiled to use R16, 8(AP) to use R17, etc. In some cases, the compiler mimics VAX argument lists by packing the quadword register and stack arguments into a longword argument list on the stack. This argument list "homing" occurs if the compiler detects any AP uses which may result in aliased references to the argument list, any .AP references with variable indices, or any non-longword aligned .AP offsets. In this case, argument list references are compiled into FP (frame pointer) based references to the homed list, which is built by code generated for the routine entry point. When a CALLS (call subroutine) instruction is encountered in the input VAX code, the compiler generates code to copy arguments from the stack, where they have been placed by the original source code, into the RISC argument regis¬ ters. If there are more than six arguments (requiring more than R16-R21), the seventh and beyond must be copied to consecutive aligned 64-bit slots on top of the stack. The argument information register R25 receives the argument count, which, on VAX, would have been at 0(FP). Corresponding code to clean the stack after the called routine returns is also generated. BRIEF DESCRIPTION OF THE DRAWINGS The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as other features and ad¬ vantages thereof, will be best understood by reference to the detailed description of specific embodiments which follows, when read in conjunction with the accompany¬ ing drawings, wherein: Figure 1 is a diagram of the compiler or code translator functions, according to one embodiment of the invention; Figure 2 is an electrical diagram of a host computer for executing the code transla¬ tor program of Figure 1; Figure 3 is a diagram of an example of a line of code translated by the mechanism of Figures 1 and 2; Figure 4 is a diagram of the data structure of a tuple created in the code translator of Figure 1; Figure 5 is a more detailed diagram of the compiler front end in the translator of Figure 1; Figure 6 is a listing of a small example of code illustrating the basic blocks or nodes of the code; Figure 7 is a flow graph of the program expressed in the code of Figure 6; Figure 8 is a listing of another example of code used as the basis for the example of Appendix A; Figure 9 is a flow graph of the program expressed in the code of Figure 8; Figure 10 is a logic flow chart of a procedure referred to as Build_Flow_Graph, used in the method of the invention, according to one embodiment; Figure 11 is a logic flow chart of a procedure referred to as .Analyze_Flow_Graph, used in the method of the invention, according to one embodiment; Figure 12 is a logic flow chart of a procedure referred to as Tra- verse_Graph_Forward, used in the method of the invention, according to one embodiment; Figure 13 is a logic flow chart of a procedure referred to as Tra- verse_Graph_Backward, used in the method of the invention, according to one embodiment; Figures 14a and 14b are a logic flow chart of a procedure referred to as Process_Forward_Node, used in the method of the invention, according to one embodiment; Figure 15 is a logic flow chart of a procedure referred to as Pro- cess_Backward_Node, used in the method of the invention, according to one embodiment; Figure 16 is a logic flow chart of a procedure used for mapping argument list references in translating code to another machine architecture, used in the method of one feature of the invention, according to one embodiment. DETAILED DESCRIPTION OF SPECIFIC EMBODIMENT Referring to Figure 1, the code translator or interpreter 10 according to one embodiment of the invention resembles a compiler, and includes a portable operat¬ ing system interface referred to as the shell 11, as well as a front end for converting the code and a back end, with optimizer and code generator, as is the usual practice. The shell 11 may be portable in that can be adapted to function with any of several operating systems such as VAX/VMS, Unix, etc., executing on the host computer 12. The shell 11 operates under this host operating system 13 executing on a host computing system 12 of various architectures, as seen in Figure 2, typically includ¬ ing a CPU 14 coupled to a main memory 15 by a system bus 16, and coupled to disk storage 17 by an I O controller 18. The shell 11 and other elements are combined with a front end converter 20 to create a translator or "compiler" for converting code in a first language, e.g., VAX/VMS assembly language, into object code for a different target architecture, e.g., and advanced 64-bit RISC architecture. The front end convener 20 is the only component of the translator 10 which understands the input language being translated (compiled). This input language is that used in the file or files (module or modules) 21 which define the input of the translator. The front end convener 20 performs a number of functions. First, it calls the shell 11 to obtain command line information entered by the user (person operating the host computer 12 of Figure 2). Second, the front end 20 calls the shell 11 to control the listing file, write diagnostic messages, and the like, as is usual for compilers. Third, the front end 20 does lexical, syntactic, and semantic analysis to translate the code of the input file 21 to a language-independent internal representation used for the interface between the front end and the back end. Fourth, the front end convener 20 invokes the back end (remaining pans of the translator) to generate object code modules 23 from the information in the internal representation. Not included in the translator 10 of Fig. 1 is a linker 24 which links the object code modules or images 23 (with runtime library, etc.) to form an executable image to run on the target machine 25. The target machine 25 for which the back end 12 of the compiler creates code is a computer (generally of the form of Figure 2) of some specific architecture, i.e., it has a register set of some specific number and data width, the logic executes a specific instruction set, specific addressing modes are available, etc. Examples are (1) a RISC type of architecture based upon the 32-bit RISC chip available from MIPS, Inc., as pan number R2000 or R3000 and described by Lane in "MIPS R2000 RISC Architecture", Printice-Hall, 1987, and (2) an advanced RISC architec¬ ture with 64-bit registers as described in copending application Serial No. 547,589, filed June 29, 1990. Various other architectures could be likewise accommodated, 5 employing features of the invention. In general, the front end converter 20 need not consider the architecture of the target machine 25 upon which the object code 23 will be executed, when the front end 20 is translating from source code 15 to the internal representation, since the internal representation is independent of the target machine 25 architecture. 0 The back end of the translator 10 functions like a compiler to translate the internal representation constructed by the front end 20 into target system object code 23. To this end, the back end performs the basic functions of optimization 26, storage and register allocation 27, and code generation and object file emission 28. The optimization function is performed on the code when it is in its internal 5 representation. When the user (that is, a user of the computer system of Figure 2, where the computer system is executing the operating system 13) invokes the translator of Figure 1, the shell 11 receives control. The shell 11 invokes the front end convener 20 to compile an input stream from input module 21 into an object file 23; the front C end 20 invokes the back end to produce each object module within the object file 23. The front end 20 parses the input code 21 and generates an intermediate language version of the program expressed in the input code. This intermediate language version is stored in intermediate language tables 30 (including a symbol table), which are updated and rearranged by the stages of the compile functions as will be described. The elemental structure of the intermediate language is a tuple. A tuple is an expression which computer programming language performs one operation. For example, referring to Figure 3, an expression which might be written in a high level computer language as I = J + 1 would appear in the assembly-language input file as ADDL3 #1,J,I that is, add "1" to the contents of memory location J and place the result in memory location I. This code will be eventually translated into object code for a RISC machine which does only register-to-register arithmetic, and only register-to-memory or memory-to-register stores and loads, so it will appear as LO.AD Rn,J; Load memory location J to Register N ADD Rn,#l; Add constant 1 to Register N STORE Rn,I; Store Register N to memory location I In intermediate language, however, the code is in a more elemental (and generic) form than even RISC assembly, and would include five tuples, these being number $1, $2, $3, $4 and $5 in Figure 3. This way of expressing the code in IL includes a tuple $2 which is a fetch represented by an item 31, with the object of the fetch being a reference to symbol J, shown in tuple #1. The next tuple is a literal, item 32, making reference to the constant "1." The next tuple, item 33, is symbol reference to "I", which will bethe target of the addition operator. The last tuple is an Add, item 34, which makes reference to the source tuples $2 and $3, and to the destination tuple $4. The expression may also be expressed as a logic tree as seen in Figure 3, where the tuples are identified by the same reference numerals. A tuple (also referred to as an n-tuple), then, is the elemental expression of a computer program, and in the form used in this invention is a data structure 35 which contains at least the elements set forth in Figure 4, including (1) an operator field 36, e.g., Fetch, Store, Add, etc., (2) a locator 37 for defining where in the input module 21 the input-code equivalent to the tuple is located, (3) operand pointers 38 to other tuples, to literal nodes or symbol nodes, such as the pointers to I and #1 tuples $1 and $2 in Figure 3. A tuple also has attribute fields 39, which may include, for example, Label, Conditional Branch, .Argument (for Calls), or SymRef (a symbol in the symbol table). The tuple has a number field -40, repre¬ senting the order of this tuple in the block. Referring to Figure 4, the front end convener 20 parses the input code 21 to identify' tuples and to build an intermediate language tuple stream 41 and associated symbol table 42. The next step is performed by a flow analyzer 43 is to scan the tuple stream and identify basic blocks of code, called nodes. A block of code is defined to be a sequence of tuples with no entry or exit between the first and last tuple. Usually a block starts with a label or routine entry and ends with a branch to another label. A task of the converter 20 and flow analyzer 43 in the front end is t parse the input code 21 and identify the tuples and blocks (nodes), which of course requires the front end to be language specific. The tuple data structure 35 contains fields -44 and 45 that say whether or not this tuple is the beginning of a block, or the end of a block. A flow graph 46 is generated by the flow analyzer 43 in the front end. The flow graph 46 consists of nodes, which are the basic blocks of the program, and edges, which represent the flow between nodes. The flow graph is built by process¬ ing the tuples 35 (intermediate language) created by the front end converter 20 of the compiler. The process of building the flow graph 46 by the flow analyzer 43 includes walking the tuples sequentially for each program section. Referring to an example of code as seen in Figure 6, the flow analyzer 43 adds tuples to the current flow node until one of the following is encountered, thus defining when the previous node ends and a new node begins: (a) a label - branches to the label LABI will result in an edge being created to this node; hence, the label LABI is the first tuple in the new node Node-3, and it creates the edge ending Node-2; (b) a routine entry point, in this case JSB_entry (the first tuple in Node-1, which is treated like a label for purposes of flow - however, the routine entry has an additional symbol table entry Routl identifying it as a routine; (c) a branch instruction - the branch BEQL ends the preceding block, Node- 1, and the next instruction CLRL begins a new block, Node-2; (d) a return instruction, RSB, which is treated like a branch instruction which branches to a special routine exit node; thus RSB ends Node-3, which is only one tuple in length. A branch instruction such as the BEQL of Figure 6 also results in an edge being created, linking the node (Node-1) containing the branch to the node (Node-3) containing the label which is the branch destination (LABI). If the branch is conditional, as here, an edge to the immediately following node (Node-2) will also be created, since flow may "fall through" to it. Indeed, an edge is a bidirectional link; the flow needs to be traceable in both forward and backward directions. Accordingly, the intermediate language used in the code translator of Figure 1 is expressed in the tuple stream 41 and a symbol table 42, along with the flow graph 46. The primitive concept is the tuple, and the intermediate language flow graph 46 is made up to link the tuples into node or blocks representing the opera¬ tions to be executed, each tuple 35 having a data structure as in Figure 4. These tuples 35 within nodes are tied together by pointers which represent various relations. The most important relations are the operator-operand relation (a pointer 38 from an operator to each of its operands) and the linear ordering represented as a tuple number field 51 on all the tuples in each basic block of the intermediate language flow graph 46; the order of the tuples within a node provides the execu¬ tion order. As mentioned in reference to Figure 4, each tuple 35 has various fields, including the following: (a) Generic operator 36 - identifying the general operation performed by the tuple, e.g., .ADD, FETCH, etc. (b) Operator type 52 - a data type which, normally, determines the specific operation performed by the tuple. The operator data type is primarily of interest only on data storage tuples. Instruction tuples are by definition self-contained, and will not be referenced in later instructions; hence, their data type is null. (c) Result type 53 - the data type of the value computed by this tuple. This is set only on data reference tuples, e.g., those that can be used as operands of other tuples. (d) Operands 38 - an array of pointers to the operands of this tuple. The number of operands is determined by the generic operator. Each operand pointer 38 points to another intermediate language tuple node, or, in some cases, to a symbol or literal node in the symbol table as in tuples $1 and $2 of Figure 3. (e) Next/Pre v tuple 54 and 55 - pointers to the next and previous tuples in a doubly-linked list of tuples. The next tuple order is the implicit order of evaluation. (f) Locator 37 - the textual location in the input module 21, i.e., in the program source of the token or tokens which are compiled in this tuple. The locator is used in constructing error messages, source correlation tables, etc. (g) Use count 56 - this field is set by the analyzer to the number of referenc- es made in data reference tuples. Some types of tuples have additional fields, known as attributes 39. Instanc¬ es of attributes in the code translator in an embodiment of Figure 1 include: (a) Reference attributes, which point to nodes in the symbol table 42. These are always present in LITREF, SYMREF, LABEL and entry point tuples, pointing to literal nodes, symbol nodes, label nodes, and entry nodes, respectively. A pointer to a literal node may also be present in a COMPJDP tuple. These symbol table entry types are discussed in additional detail below. (b) Instruction attributes, which are VAX instruction type constants. These are present in INSTR (instruction) and CONDBR (conditional branch) tuples, and further specify the instruction or branch operation. (c) Register attributes, which are simply register numbers specified in REGREF (register reference) tuples. Other additional private fields may be introduced into the tuple structures by the analyzer or code generator; these include: (a) Condition code flags in field 57 on INSTR and CONDBR tuples. These are used by the flow analyzer 43 to indicate that the code generator 28 must instantiate one or more of the VAX condition code values for an instruction. (b) A register-loaded field 58 for SYMREF, MEMREF, TDXREF and FETCH tuples, used within the code generator 28 to allow re-use of addresses or values already loaded to registers. The flow graph 46 is a major component of the intermediate representation, and is constructed and used by the flow analyzer 43, then later traversed by the optimizer 26, the storage allocator 27 and code generator 28. The tuples 35 for a paπicular routine or program (or input module 21) are in the tuple stream 41, linked by pointers 38, 54, 55, and having blocks or nodes defined by fields 48, 49. The flow graph 46 identifies the nodes or blocks by pointers to the beginning and ending tuples of the tuple stream. Since routines, labels, etc., will have entries in the symbol table 42, the symbol table is the reference point for tracing the program, i.e., finding the blocks and their ordering. The flow graph of the code of Figure 6 may be illustrated as in Figure 7, where it is seen that there are two paths from Node-1, that is, to Node-3 via Node-2 if the conditional branch fails, or directly to Node-3 if the branch is taken. A routine such as that of Figure 7 has an entry or node 59 in the symbol table 42 as seen in Figure 5 which includes a pointer 60 to the flow node 61 in the flow graph 46, and this node 61 includes pointers 62 and 63 to the beginning and ending tuples 35 of the tuples stream 41. Each flow node 61 also has a number of other fields, e.g., for stack usage, register usage and condition code usage, as will be described. Once a pass over the tuples by the flow analyzer 43 has created the flow graph -46, the flow for each routine can be walked by the flow analyzer 43 for computing the stack, register, and condition code information of interest for certain features of the invention. A pass is made by the flow analyzer 43 through each routine in the module 21 as represented in intermediate language as illustrated in Figure 5. The routine node 59 in the symbol table 42 points to the flow node 61 for the entry point of the routine. The flow graph 46 is recursively traversed starting at this node; first, the tuples 35 of a node as referenced in the tuple stream 41 will be walked looking for constructs described below. Then, the graph traversal routine is called for each of its successors (nodes 61 linked by a forward edge) which has not already been visited. The recursive walk ends at nodes which have only routine exit nodes as successors. The tuples 35 of each node 61 are scanned looking for the following: (a) Register references - if the reference is a "read" reference, and the register has not yet been written in the current node, it is recorded as pan of the node 61 as an "input register" to the current node, in a field 64 for input registers. If it has been written, it is removed from the "output register" set, i.e., from a field 65 for output registers. If it is a "write" reference, it is added to the "output register" set of field 65, and the "written register" set of field 66 for the current node 61. The "output register" set of field 65 is passed on to each of the successor nodes 61 visited. Then, when the flow graph 46 walk completes, this set of field 65 represents the registers which are written but not subsequently read in the routine. This set is reported to the user in a "hint" message, as possible output registers of the routine. The user may use this information to add the conect OUTPUT register clause to the routine entry point declaration. (b) Stack references and modifications - modifications to the stack may be the result of explicit instructions, such as PUSH/POP, .ADD, etc., or due to the VAX addressing mode used, such as (SP)+, which implicitly pops the stack pointer. At the end of the tuples 35 for the current node 61, the net change to SP due to the tuples in this node is stored in a field 67 in the flow node. The total depth thus far in the routine flow is also computed. This is passed to the node processing routine with each recursive call, and stored in the node in a field 68. Thus, at every point during this walk, the compiler has available the total stack change since routine entry. This allows it to detect code which: (i) reads the return address from the stack (ii) modifies the return address on the stack (iii) removes the return address from the stack (iv) issues a jump-subroutine JSB procedure call through the return address to implement a co-routine linkage (v) makes an up-level stack reference (vi) makes an unaligned stack reference (vi) modifies SP such that it is no longer longword aligned These are all flagged with specific errors. The first five are machine architecture and calling standard-specific coding practices which must be changed manually in the source code. The latter two are flagged due to the performance penalties of unaligned stack references. As mentioned above, successor nodes 61 in the flow graph 46 which are already marked "visited" in a field 69 are not re-visited; however, the flow analyze 43 checks the initial stack depth stored with the node in field 68. If that depth is different than the total depth at the end of the current node 61, the compiler report a message indicating that this point in the code can be reached with different stack depths. This may indicate a source code enor, where the stack was not correctly adjusted by the user on some code path. A simplified example of this might be: pushl rl beql labl -.instructions which do not modify SP pushl r2 ; instructions which do not modify SP labl: popl r2 ; This point may be reached with 1 ; or 2 new longwords on the stack. rsb ; In this case, it is probably an ; enor, because the RSB instruction ; expects the return address ; to be on top of the stack The flow analyzer 43 the makes a second pass through each routine in the module. This time, the walk is in reverse flow order, starting at the routine exit node, and walking backward through all paths back to the routine entry point. Thi is also a recursive graph walk, using the edges which link each node 61 to its predecessors. This time, nodes 61 may be revisited multiple times. The tuples 35 of each node 61 are scanned in reverse order, looking for the following: (a) instructions which read the VAX condition codes. For example, condi¬ tional branch instructions. A set of which condition codes (CCs) are currently "required" as recorded in a field 70 is updated. For example, when a BEQL is seen, the Z bit will be added to this set. (b) instructions which set the VAX CCs which are currently in the "required" set of field 70. When found, a flag 57 corresponding to the particular CC is set in the instruction tuple 35, and it is removed from the "required" set of field 70. This flag 57 in the tuple tells the code generator phase 28 that it must realize the value of that condition code for this instruction. This allows the compiler to calculate CC information only when it is absolutely required. (c) JSB instructions. If the "required" set of field 70 is not empty when a JSB instruction is encountered, the source code as written relies on a CC being set by the JSB target routine, and still intact upon return. Since the CCs are not hardware bits on some advanced RISC architectures, for example, as they are on VAX. this architecture specific coding practice must be changed — so an error message is generated. At each call to process a node's predecessor, the current "required" set of field 70 is passed, and stored in field 70 of the predecessor node. The node is then processed as above. If the node is encountered later in another backward flow path, but the "required" set is a subset of the set previously stored, the node (and its predecessors) does not need to be revisited. However, if the new "required" set contains CCs not previously searched for, the node must be re-processed to insure the CC flag is set on the correct instruction. Also at each call to process a node's predecessor, the current node's "input register" set of field 64 (computed in the forward walk) is passed. The "input register" set of field 64 for the predecessor is then updated to include those regist in the passed set which are not in its own "written registers" set of field 66. -As a result, the "input register" set for a node will eventually reflect all registers read b this node or any of its successors which are "input" to this point in the flow. Als for each node, the node's "written registers" set of field 66 is added to the "writte set for the current routine. After all reverse paths through a routine have been processed thusly, the information stored in the flow node 61 for the routine entry point is examined. If the "required" CC set of field 70 is not empty, it implies that the corresponding condition codes are expected as input to this routine. This is a VAX architecture specific coding practice, and it therefore flagged as an enor, it is undesirable on some architectures and impossible on others. (This may also be indicative of a coding enor, rather than an intentional interface.) The particular CCs required as inputs are reported to the user is the printout. If the "input register" set stored in this node at field 64 is not empty, those registers are reported in a compiler "hint" message as possible input registers to the routine. These registers can then be added to the entry point declaration as input registers. (Again, this may also dete a coding enor, where an uninitialized register is inadvertently used.) The "written" set of field 66 for the routine is used in conjunction with the OUTPUT register declarations for the routine, to determine which registers the compiler must generate code to save. The original values of these modified registers may be saved in the source code, using, for example, PUSHL and POPL instructions. However, these instructions will only save the low 32-bits of the register value. Since the code will be executing in a 64-bit environment if code i being generated for the advanced 64-bit RISC architecture, the compiler must generate 64-bit register saves in routine prologue code, and restore them in routin epilogue code. The compiler saves those in the "written set" which are not declared to be OUTPUT (or SCRATCH) registers. (ROA 2) The following program is used to illustrate these concepts: This same program is also shown in Figure 8, where it is seen that the tuples are numbered $22 to $31, and the nodes are numbered Node-4 to Node-9. The flow of the nodes for this program is seen in Figure 9. For this program, the output of the front end converter 20 is shown in Appendix A, showing how the program is represented as the tuples $22-$31 in the intermediate language. The numbers such as 1725024 are the byte addresses of the data location for the present pan of a tuple, the previous part and the next pan, so the data structure of Figure 4 for a tuple 35 may be found in memory, and the ordered sequence of tuples is traceable. .Also, it is seen that the operands (fields 38 of Figure 4) are identified by pointers to the actual memory location of the specification of these elements. Next, the flow analyzer 43 output is given in Appendix B, showing the flow nodes and their linkages. Note that the tuples are re-ordered somewhat. The output code generated for this program as a result is given in Appendix C. In Appendix D, a listing is given for a different program (not that of Figure 6) showing some of the compiler messages mentioned above. This listing is printed out by the facility ordinarily included in a compiler for producing a source code listing for use in enor checking and correction. Referring to Figures 10-15, logic flow charts are illustrated which represent a view of the flow analysis involved in methods having features of the invention. The calling structure is summarized in the following paragraphs. The procedure referred to as Build_Flow_Graph, illustrated in Figure 10, is called once per compilation, and functions to build all of the routine flow graphs for the entire module being compiled. The procedure referred to as Analyze_Flow_Graph, illustrated in Figure 11, is called after Build_Flow_Graph, also once per compilation, and functions to perform the analysis on all the routines in the module. The procedure referred to as Traverse_GraphJForward, illustrated in Figure 12, is called by .AnalyzeJFlow_Graph, and itself calls Process_Forward_Node of Figure 14a, to process the tuples of the current node in forward order, and then calls itself recursively for each successor of the current node which has not already been visited. The procedure referred to as Traveree_Gτaph_B;ac*k w ar , *L illustrated in Figure 13, is called by .Analyze_Flow_Graph, and itself calls Process_Backward_Node of Figure 15, to process the tuples of the current node in reverse order, and then calls itself recursively for each predecessor of the current node, unless it has been visited and the register and condition code information stored in it indicate that a re-visit is not necessary. The procedure referred to as Process_Forward_Node, illustrated in Figure 14a-14b, is self-contained, and functions to simply walk the tuples in forward order. The procedure referred to as Process_Backward_Node, illustrated in Figure 15, is self-contained, and functions to simply walk the tuples in reverse order. The "pseudo-variables" used in the flow charts of Figures 10-15 will be described, before describing the flow charts in detail. The pseudo-variables are represented in the flow charts as names in quotes, and reference to the fields of Figures 4 or 5 is also given: "Input_CCs" or input condition codes (field 71) - for a flow node, "Input__CCs" are the set of condition codes which are "required" at entry to the flow node. That is, some instructions either in this node or one of its succes¬ sors read these condition codes, and the instructions which set them precede this node. "Input_regs" or input registers (field 64) - for a flow node, "Input_regs" are the set of registers which are read in this node or one of its successors, and the instructions which write into these registers proceed this node. "Output_regs" or output registers (field 65) - for a flow node, "Output_- regs" are the set of registers which are written in this node or one of its predecessors, but not subsequently read by this point in the flow graph. "Written_regs" or written registers (field 66) - for a flow node, "Writt- en_regs" are the set of registers which are written to in this node itself. "Required_CCs" or required condition codes (field 70) - at each point during backward flow analysis, the set of condition codes which are read by some subsequent instruction. They are "required" because some previous instruction must set them. "Required_regs" or required registers (field 72) - at each point during backward flow analysis, the set of registers which are read by some subse¬ quent instruction, which have not yet been written by any instructions. Note that for the "Required_CCs" and "Required_regs" the reference to "subsequent" means subsequent in the normal routine flow, not subsequent in the processing pass. "Previous" means earlier in the normal routine flow. The routine is being processed backward, so reference to "subsequent" and "previous" must be clearly kept in mind. Referring now the Figure 10, when BuildJFlow_Graph is invoked, the selected program section, i.e., tuple stream 41, is examined, and the decision point 80 examines to see if there are more tuples in this section. If not, the procedure is exited at point 81; if so, then the next tuple is fetched as indicated by the item 82. This next ruble is examined to see if it is a label or entry point tuple, at decision point 83. If so, then the current node is ended at the previous tuple, at item 84, an this tuple is noted as starting a new node, at item 85, after which control returns to the decision point 80 via path 86. If, at decision point 83, the tuple is found not to be a label or entry point, it is examined at point 87 to see if it is an unconditional branch or return tuple. If so, the current node is ended with this tuple, as indicated by item 88, and the next tuple is noted as starting a new node, at item 89. A flow edge is created from the current node - to the branch target node - as indicated by the item 90, after which control returns to the decision point 80 via path 86. If, at decision point 87, the tuple is found to be neither an unconditional branch or a return tuple, then it is examined to see if it is a conditional branch tuple, indicated by decision point 91. If so, again the cunent node is ended with this tuple, as indicated by item 92, and the next tuple is noted as starting a new node, at item 93. A flow edge is created from the cunent node - to the new node - as indicated by the item 94. Then, a flow edge is created from the current node - to the branch target node - as indicated by the item 95, after which control returns to the decision point 80 via path 86. If, at decision point 91, a conditional branch was not found, then control returns to point 80. Referring to Figure 11, the procedure .Analyze_Flow_Graph begins by getting the head of the routine list for the module being processed, as indicated by the item 100. Then, the list is checked to see if there are more routines in the module, at decision point 101. If so, then the procedure Traverse_Graph_Forward is called for the next routine, as indicated by the item 102; the Traverse_Graph_Forward is discussed below with reference to Figure 12. If not, then again the head of the routine list is fetched, at item 103, and again a check is made at decision point 104 of whether there arc more routines in the module. If yes, then the Tra- verse__Graph_Backward procedure is called for the next routine, as indicated by the item 105 of the flow chart, passing empty Required-CCs" and "Required-regs". As indicated by the item 106, the "Output-regs" value returned by Tra- veree 3raph_B ac k arcl is stored as output registers for the routine. If no is the result at decision point 104, then again the head of the routine list for the module is fetched, at item 107, and a test is made to see if there arc more routines in the module at point 108. If not, control returns to the calling procedure at point 109; if so, the flow node at head of routine is fetched at item 110, and this data is exam- ined at decision points 111, 112 and 113 to see if the "Input-regs", "Output-regs" and Input-CCs" are non-zero. Each of these showing non-zero results in a report hint at items 114, 115 or 116 as indicated. This is done for each flow node at head of each routine, and after the last routine control returns at point 109. Referring to Figure 12, the Traverse_GraphJForward routine, called from item 102 of Figure 11, begins at item 120 by calling the Process_Forward_Node procedure of Figure 14a, for this node. .After return from the Pro- cess_Forward_Node call, for each node, a check is made at decision point 121 to see if there are any successor nodes. If not, control returns to item 102 of Figure 11 via point 122. If so, information about the successor node is fetched at item 123, and checked to see if it has already been visited at decision point 124. If already visited, then at decision point 125 the initial stack depth of successor node 5 (isd,) is compared to a value of the final stack depth of the current node (isd c ): if these are equal then control returns to the item 121 via path 126, but if not the item 127 reports a "run-time stack difference" message, indicating that this code point can be reached with different stack depths. If at point 124 the successor node is found not previously visited, the item 128 is entered where the initial stack depth of iO the successor node (isd,) is set to the initial stack depth of the current node (isd c ) plus the total stack change in the cunent node. Then, the Traverse_Graph_Forward procedure is called for the successor node, at item 129. Return from Tra- verse_Graph_Forward passes control back to the point 121, checking for any successor nodes. 15 The Traverse_Graph_Backward procedure illustrated in Figure 13 begins by calling the Process_Bac.kward_Node procedure at item 130, passing "Required-CCs" as a parameter. Upon return from Process_Backward_Node, the item 131 is entered; in item 131 the operation is to add registers which are in "Required-regs" (but are not in the "Written-regs" set for the cunent node) to the "Input-regs" set for 20 the current node. Next, at decision point 132, a check is made to see if there are any predecessor nodes. If not, the control returns to the call Traverse_Graph_Back- ward point, with "Output-regs" as a parameter, via point 133. If so, information for the predecessor node is fetched at item 134, and a check is made at point 135 of whether the predecessor node has been visited already. If already visited, a check is ". - made at point 136 of whether the "Required-CCs" or "Required-regs" sets are different for this visit; if not control returns to point 132 to see if there are any predecessor nodes, but if so then item 137 is entered to call Traverse_Graph_Back- ward for the predecessor node, passing the Input-regs" set and "Input-CCs" set as parameters. The returned "Output-regs" which are not in the "Input-regs" or "Written-regs" sets are added to the "Output-regs" set for this node, at item 138. Control is returned to the point 132 to determine if there are any predecessor nodes. Referring to Figures 14a and 14b, the Process_Forward_Node procedure is illustrated in flow chart form. First, at point 140 of Figure 14a, a check is made to see if there arc more tuples in the node. If not, control is returned to the calling procedure, item 120 of Figure 12. If so, the next tuple is fetched at item 141, and the next tuple is checked at point 142 to see if it is a register reference. If so, then the mple is checked at points 143 and 144 to see if it is a read or write reference. If neither a read reference nor a write reference, control returns to point 140 via path 145. If the mple is a read reference, the tuple is checked at point 146 to see if it is in the "Written-regs" set, and, if so, it is removed from the "Output-regs" set at item 147, but if not then the register is added to the "Input-regs" set at item 148. If the mple is a write reference, then the register is added to the "Written-regs" set at item 149, and added to the "Output-regs" set at item 150, before returning to point 140 via path 145. If, at point 142 of Figure 14a, it is found that the tuple is not a register reference, then flow goes to the stack check beginning point 151 of Figure 14b. The mple is checked at point 152 to see if it indicates a stack pointer SP modifica- tion, and if so the stack pointer SP change is added to the total stack change for this node, at item 153, after which control is returned to the point 140 via path 154. If the mple does not indicate a SP modification, then it is checked at point 155 to see if it is a stack pointer reference with offset less than φ, where offset here indicates (offset specified in mple plus the total offset at this point in the routine flow). If so, an "uplevel stack reference" enor is reported at item 156, then return via path 154. If not, then the mple is checked at point 157 to see if it is a stack pointer reference with offset equal to φ; if so the mple is checked at point 158 to see if it is a "write" reference, and if a write reference a "return address modification" enor is reported at item 159, but if not a write reference then a "return address reference" enor is repoπed at item 160, before returning via path 154 in either case. A negative resul from the check at point 157 results in control passing to the check at point 161 where the mple is examined to see if it is a return-subroutine RSB instruction. If a RSB instruction, a check is made at point 162 to see if the current stack offset plus the initial stack value is greater than φ, and if so an "alternate return address on stack" enor is reported at item 163, but if not then a check is made at point 164 to see if the current stack offset plus the initial stack value is less than o, in which case an "uplevel return" enor is reported at point 165. If the mple is not an RSB instruction, then it is checked at point 166 to see if it is a jump-subroutine JSB instruction, in which case it is checked at point 167 to see if the JSB target is a stack pointer based location, with offset plus cunent stack offset plus initial stack value equal to φ, in which case a co-routine call" enor is reponed at item 168. If none of the tests at points 152, 155, 157, 161, or 166 is positive, the stack is not involved, and control passes back to the point 140 of Figure 14a via path 154. The Process_Backward_Node procedure illustrated in Figure 15 begins by checking to see if there are more tuples in the node, at point 170. If not, control returns via point 171. If so, the next mple is fetched at item 172. Then the next tuple is examined at point 173 to determine if it represents an instruction which set the condition codes. If so, then the condition codes which this instruction sets arc removed from the "Required-CCs" set, as indicated by the item 174. A flag is set (item 175) in the tuple indicating which condition codes which were required must be realized for this instruction. If the mple does not represent an instruction which sets condition codes, then control passes to a decision point 176 where the mple is checked to see if it represents an instruction which reads condition codes. If so, then the condition codes which the instruction reads are added to the "Required- CCs" set at item 174. If the mple does not represent an instruction which either sets or reads condition codes, then it is checked at point 178 to see if it represents a jump-subroutine JSB instruction, and if so then it is checked at point 179 to see if the "Required-CCs" set is empty and if not empty then a "Condition code required after JSB" enor is reported at item 180. If the test at point 179 is positive, i.e., the "Required-CCs" set is empty, control returns via path 181 to the point 170. Likewise, if the mple does not satisfy any of the tests of decision points 173, 176 or 178, control returns via path 181 to see if there are more tuples. According to another feature of the invention, argument list references are mapped across the architectures in making the code translation in the system of Figure 1. In translating code to a different machine architecture it is typically the case that the way argument list references are handled is different. VAX assembly language routines rely on the argument list pointer (AP) established by the VAX CALLS/CALLG instructions to refer to routine parameters. Referring to the following example of VAX code: .entrv routl Λ M<R2> tstl (AP) beql labl movl 4(AP),R0 movl 8(AP),R2 labl This routine routl is called by, for example: pushl#l pushl#5 calls#2,routl The stack thus has the literal #2 (number of arguments to be passed) at top-of-stac and literals #1 and #5 in the next two longwords of the stack. In referencing these via the AP registerestablished by the VAX hardware for the CALLS instruction, the code with the two movl instructions moves the first two longwords from the stack to RO and R2. In contrast, on an advanced 64-bit RISC machine, there is no architected argument list pointer (AP), and the calling standard dictates that parameters are passed in registers, or. if necessary, on top of the stack. A RISC machine has a large number of registers, e.g., thirty-two 64-bit registers, and these are used in passing arguments, instead of memory references to stack as VAX uses. For example, the argument information may be designated to be in register-25 (R25), and R16-R21 used for arguments. Then, if there are more than six arguments to b passed, the calling routine leaves the remainder of the arguments on top of the stack. Thus, an example of code to set up for a jump to a subroutine for this type of machine, assuming there are eight arguments, is as follows: LDQ R16,argl LDQ R17,arg2 LDQ R21,arg6 SUBQ SP,#16,SP STQ R5,8(SP) STQ R6,0(SP) JSR R28,R24 The code translator, according to another feature of one embodiment of the invention, resolves this difference in the way argument lists are passed, without requiring all argument list references to be modified by hand by the user through editing the source code. The compiler examines all AP-based memory references in the input code to determine how the same argument reference may be made in the target environ¬ ment. Element 0 of the argument list vector represents the argument count on VAX; in the target RISC architecture, the argument count appears in a defined register, e.g., the Argument Information Register (R25). Hence, in this instance, a memory reference of the form 0(.AP) will be compiled to an R25 reference. The first six arguments are received in registers R16-R21 on in the target RISC architec¬ ture, so that 4(AP) will be compiled to use R16, 8(AP) to use R17, etc. If there are variable offsets for the arguments in the VAX code, other steps must be taken. For example, if the VAX code is of the form MOVL 4(AP)[R0],R1 so that a run-time indexed reference is made, it is necessary to make a different translation. In this case, the compiler mimics VAX argument lists by packing the quadword register and stack arguments into a longword argument list on the stack. This is refened to as argument list "homing", and occurs if the compiler detects any AP uses which may result in aliased references to the .argument list, any AP references with variable indices, or any non-longword aligned .AP offsets. In this case, argument list references are compiled into FP (frame pointer) based references to the homed list, which is built by code generated for the routine entry point. Thus, when a CALLS (call subroutine) instruction is encountered in the input VAX code, the storage allocator 27 of the compiler generates code to copy argu¬ ments from the stack, where they have been placed by the original source code, into the RISC argument registers. If there are more than six arguments (requiring more than R16-R21), the seventh and beyond must be copied to consecutive aligned 64- bit slots on top of the stack. The argument information register R25 receives the argument count, which, on VAX, would have been at 0(FP). Conesponding code to clean the stack after the called routine returns is also generated. Referring to Figure 16, a logic flow chart of a procedure used in the storage allocation phase for mapping argument list references in translating VAX code to advanced 64-bit RISC machine architecture is illustrated, as used in the method of one feature of the invention, according to one embodiment. A mple is fetched at item 190, and examined to see if it is a memref at decision point 191. If not, the control returns via path 192. If so, it memref is checked to see if the base register is AP at point 193, and if so, checked at point 194 to see if the argument list has been homed; if not then checked at point 195 to see if the offset is « <28 (meaning the number of longword is less than seven). When the result at point 195 is yes, this means the argument is going to a register location, so at item the offset is divided by four to get the argument index in the registers R17 to R21, and the memory reference is changed to a register reference. If the result at point 195 is no, that means the argument is to be in the stack frame, so in item 197 the offset is divided by four to get the argument index, and 8*index is added to the stack frame size; also the memory reference is changed to an offset and the register reference is changed to the frame pointer. If it is found in decision point 194 that the argument list has been homed, then the operation in item 198 is to change the argument pointer AP to a frame pointer FP in the register reference, and add the offset to the homed list in the frame, to the offset. While this invention has been described with reference to specific embodi¬ ments, this description is not meant to be construed in a limiting sense. Various modifications of the disclosed embodiments, as well as other embodiments of the invention, will be apparent to persons skilled in the art upon reference to this description. It is therefore contemplated that the appended claims * will cover any such modifications or embodiments as fall within the true scope of the invention. APPENDIX A 00000000 1 00000000 22 T»«t: .31b aatry 1724164. jsb ' eatry (1.11 seat:1724936, prβv:1726016. {l Haae: TEST 00000000 23 pushl rβ 1724936: regret (1,9) eas :1724196 , prβv:1724164. flags: 0 Register: KO , raad, unaligned 1724696: nit: (1.1) aest:1725024 , prβ :1724936. flags: 0 Opeoda: 227, alloeatad oparaads: 1 tegs Used: aoaa Op 1: 1724936 00000002 24 baql lab2 1725024: syaref (1,21 aest:1724576 , prev:1724096 , ■•■•: LΛS2 Uae eouat: 1 Access: uaspecified 1724976: coodbr (1.1) aas :1725112. prav:1725024. Opeoda: 20, tegs Uaad: aoaa Op 1: 1725024 00000004 25 addl3 rl. r2, -<»pl 1725112: regret (1.9) oas :1725152, prβv:1724976, Register: t , raad, unaligned 1725152: regret (1.9) ββs :1725232, prav:1725112, aegister: 12, road, unaligned 1725232: regret (1,2) aox :1725192. prβv:1725152, segiater: SP, road, uaal gaed 1725192: aearef (2,9) aas :1725064 , prβ :1725232, λeeass: write autodβe Uao eouat: Op 1: 1725232 1725064: instr (1,11 aast:1725320 , prβv: 1725192. flags: 0 Opeodo: 190, allocated operaads: 3 legs Used: aonβ Op 1: 1725112 Op 2: 1725152 Op 3: 1725192 0000000* 26 blss labl 1725320: syaret (1.2) aest:1725272, prβv: 1725064, flags: 0 ■aaa: LAB Use eouat: 1 Access: unspecified (1.1) aext:1725440, prβv:1725320 , flags: 0 Opcode: 27, Kegs Used: none Op 1: 1725320 (βp)-t-, r3 (1.2) aest : 1725400. prβ :1725272. tlagβ: 0 ftagister: SP, read, uaaligaed (2.9) aoxt:172S4IO, pre :1725440. flags: 2 Aceess: read autoiac Use eouat: 1 Op 1: 1725440 (9,9) aest:1725520 , pre : 725400, flags: 0 Op 1: 1725400 (1,9) aest:l72536β, prβv:1725410. flags: 0 Register: K3, write, unaligned (1.1) ββst:1725600, prβv:1725520 , flags: 0 Opcode: 213. allocated operands: 2 tegs sed: aoaa Op 1: 1725400 Op 2: 1725520 0O00000D 28 brb lab2 APPENDIX A ( cont ' d) 1725600: syaref (1.2) nβst:l725560. pre : 725360. flags: !•«>•: LAB2 Use count: 1 Access: unspecified 1725560: braneh (1.1) nest:172S660. prβv : 1725600 , flags: Op 1: 1725600 OOOOOOOP 29 labl : addl2 14. sp 1725610 label (1.1) nβst:17257l2. prβv : 1725560. flags: Raae: LAR1 1725712 l tret (5.9) aest:172S744, prβ : 1725600 , flags: Literal Talue: 4 1725744 regret (1,9) aβιt.1725640 , prev: 1725712 , flags: Register: SP, read/write, unaligned 1725640 lastr (1,1) aest:172S944, prβv: 1725744 , flags: Opcode: 197, allocated operands * . 2 Regs Used: aβaβ Op 1: 1725712 Op 2: 1725744 00000012 30 lab2: popl rS 1725944: label (1,1) aest:l?2S»64, pre : 1725640 , flags: ■aae: LAR2 1725X4: regret (1.2) aβlt:172S<24, pra : 172594 , flags: Register: SP, raad, uaaligaed 1725124: aearef (2.9) aest:1725904, prev : 1725064. tlaga: Aeeeβs: read autoiac Use eouat: 1 Op 1: 1725064 1725904: fetch (9,9) Bβst:l72S976, pre : 1725(24 , flags Op 1: 1725(24 1725976: regret (1,9) aaιt:17257(4, pre : 725904 , flags Register: RS , write, uaaligaed 1725714: aatr (1.1) aβst:1726016, prβv : 1725976. flags Opeoda: 213, allocated operands: 2 Regs Used: aoae Op 1: 1725904 Op 2: 1725976 00000015 31 rsb 1726016: rsb (1.1) aeκt:1724(64. prβv:!7257(4, flags Flow An.. fset Output: ΪSECT " . BLΛBK APPENDIX • B O OB 4 - address: 1720120 start: 1724464 β nd:l725600 routine: TEST (lβaieaily: TEST1 1 pradeceaaors : 1 1 successors: 5 (depth first: 5 ) laitial Staek Depth: 0, Stack Chaaga: 0 taput Regsatets: 0-2 ritten Registers: none 72 • j βb entry (1,1) nest:1725024, prev.1726016 , flags: 0 Bane: TEST 72 syarβf (1,2) nes :1726360 , prev:1724 ( 64 , flags; Baae: LAB2 Use count: 1 Access: uaspeeified 72 regret 1.2) aββt:1726240, prev: 1725024, flags: Register: SP, read, uaaligaed 72 aearet 2,9) aest:1726320, prev:1726360. flags: Aeeass: read/write auto ac Use eouat: Op 1: 1726360 72 regret 1.2) aαst:1726200. prβv:1726240, flags: Register: SP, read, uaaligaed 72 aearet 2,9) nest:172S320, prev:1726320, flags: Access: write autodac Use eouat: 1 Op 1: 1726320 1725320: syaret 1,2) nest -1726210, prβv:172(200, flags: Raaa : LABI Use eouat: I Access: unspecified 17262(0: regret 1,2) nest:172S232, prβv:1725320, flags: Register: SP, read, uaaligaed 1725232: aearet 2,9) nβst:172S600, prβv:17262(0 , flags: Aeeass: read/write autoiac Use eouat: 1 Op 1: 17262(0 1725600: syarβf 1,2) nøst:172(04(, prev:1725232, flags: Baae: LAB2 Use eouat: 1 Access: unspecified • HOOK 5 - address: 1720320 start: 1726040 ead:1724 76 routine: TEST (lexically: TBST) 1 predecessors: 4 2 successors: 6 9 (depth first: 6) laitial Staek Depth: 0, Stack Chaaga: 4 Input Registers: 0-2, 29-30 Written Registers: noae CCs used: vwi 1726041; label (0,0) nβst:1724936, prβv:1725600, flags: 0 Baae: $11 1724936: regret (1,9) aest:1724(96 , prβv:172(041 , flags: 20 Register: R0 , raad, aligned 1724(96: instr (1,1) nβst:1724976 , prβv:1724936, flags: e Instruction flags: sβt_«s loeal_ns Opcode: 227, allocated operands: 1 Regs Used: 0 Op 1: 1724936 1724976: condbr (1,1) nβst:1725112, prβv:1724(96, flags: 0 Opcode: 20, Regs Used: aoae Op 1: 1725024 • BODE 6 - address: 1720792 start: 1725112 end:172S272 routine: TEST (lesieally: TEST) 1 predecessors: 5 2 successors: 7 I (depth first: () laitial Staek Depth: 4, Staek Change: 4 Input Registers: 1-2, 29-30 written Registers: aoae CCs used: CVHZ 1725112: regret (1,9) aest:1725l52, prβ :1724976 , flags: 20 Register: Rl, read, aligned 1725152: regret (1.9) aest:172S064, prβv: 1725112, flags: 20 Register: R2 , read, aligned 17250(4: instr (1.1) nect:1725272. prβv: 725152, flags: c Instruction flags: sβt_ns local_nt opeoda: 19(, allocated operands: 3 Rags Used: 1-2, 30 Op 1: 1725112 op 2: 1725152 op 3: 172(200 1725272: condbr (1.1) Best:17254(0 , prβv:172506 , flags: APPENDIX B Ccont'dϊ •• RODE 7 - address: 1720944 stirt*. 1725440 end : 172SS«0 routine: TEST ( lesieally: TEST) 1 predecessors : i 1 sueeessors: 9 (depth first: . ) Initial Staek Depth: (. Stack Change: -4 Input Registers: 29-10 written Registers: 3 CCs used: VSt 17254(0: fetch (9.9) nes : 1725520 , pre : 1725272. flags: 0 Op 1: 1725232 1725520: regret (1.9) aes : 1725360 , prev : 17254(0. flags: 20 Register: R3. write, aligned 17253(0: instr (1,1) aest : 1725560 , prβv: 1725520. flags: 0 Opcode: 213, allocated operands: 2 Regs Used: 3, 30 Op 1: 17254(0 Op 2: 1725520 1725560: branch (1.1) aest : 17256(0 , prβv: 1725360 , flags: 0 Op 1: 1725600 • RODE I - address: 1720536 start: 17256(0 end:172S640 routine: TEST (lesieally: TEST) 1 predecessors : i 2 sueeessors: 0 9 (depth first: 7) initial Staek Depth: I, Stack Chaaga: -4 Input Registers: 29-30 Written Registers: 30 CCs used: CVRΪ 17256(0 label (1,1) eas -.1725712 , prev. 1725560 , flags: Raae: LAIl 1725712 litref (5,9) nest:172S744, prβv : 17256(0 . flags; Literal Value: 4 1725744 regret (1.9) nest:172S640, prβv:l7257l2. flags: Register: SP. read/write, uaaligaed 1725640 iastr (1.1) aest:172S944, prev : 1725744 , flags: Opcode: 197, allocated operands: 2 Regs Used: 30 Op 1: 1725712 Op 2: 1725744 RODE 9 - address: 1720(40 start: 1725944 βnd:1726016 routine: TEST (lesieally: TEST. 3 predecessors: ( 7 5 1 successors: 0 Initial Stack Depth: 4, Staek Change: -4 Input Registers: 29-30 Written Registers: 5 CCs used: VttZ 1725944: label (1.1) nest : 1725904. prev : 1725640. flags: 0 Raae: LAB2 1725904: fetch (9,9) aes : 1725976 , prev : 1725944 , flags: 0 Op 1: 1726240 1725976: regret (1.91 nes : 17257(4. prβv: 1725904. flags: 20 Register: R5 , write, aligned 17257(4: iastr (1,1) nest: 172(016 , prav: 1725976 , flags: 0 Opcode: 213, allocated operands: 2 Regs Used: 5, 30 Op 1: 1725904 Op 2: 1725976 1726016: rsb (1.1) nest : 1724(64 , pr β v : 17257 ( 4. flags * . 0 CltC PSECT . BLANK . end APPENDIX C 000022 SP, -12(SP) ■2β, (SP) «J, l(SP) ■ 5, 1(«SP) ■11. 24<SF) ; *27. *U 000021 ! SP. 4. SP : ao, (SP) 000024 ; R0. LAB 000025 : SP, 4. SP ,« Rl. «2. «2S ; R2I, (SP) 000026 jζ ; R2S. LABI 000021 ; SP, * - * j Rl, »R2 ( I ; SP, 4. SP 000021 ; LAB2 000029 ; SP, 4, SP 000010 000011 000022 ) APPENDIX D 00000000 1 00000000 22 test: . jsb entry 1 %AMAC-E-CONDZIII. Il) Condition cede Z eapoctad as input tβ routine TEST 4AMAC-I -HINTRTN. (1) Coftpilar Rint: Possible Input Reqistera: RS in routine TEST 4A N AC-I -HINTRTN, (1) Coftpilar Hint: Passible Output Registers: R0 Rl in routine TES T tANAC- I -HINTRTN. Ill Coftpilar Rint: Auto-Prasar»βd Reqisters: Rl in routine TEST 00000000 1J beql labl .- Relies on a CC as input •B000002 24 00000002 25 øovl rO, rl R0 is an input register; rl is considered 00000005 2* output since it is not subsequen ly read •0000005 27 BOO0000S 2β ajovl 20(sp|, rO ; An uplevel stack reference t lANAC-E-UPLEVSTI. , (1) Up-lβvβl stack reference in routine TEST 00000009 29 00000009 10 i jsb R(sp| ; A co-routine cat! back to caller 1 1AHAC-E-COROOTCALL. (1) Co-routine call in routine TEST %A N AC-E-CONDZΛFT , 11) Condition code Z espected after JSB in routine TEST 0OOO0OOC 00OOO0OC ; Relies on CC returned froa JSB routine 0O00O0OE 0000000E Atteapts to chanqa the return address on 00000014 .* the stack 00000014 t A NAC-E-ΛLTRETΛDDR , II) Alternate return address on stack in routine TEST 00000015 17 00000015 II labl: pushl rO In this path, an βatra lonqword is pushed 00000017 19 Iab2: rsb So stack depth is unpredi a abI a here. 1 *ANAC-I -RtlN IHSTK. (I) Run tine stack differences prevent accurate stack tracinq 00000011 40 00000011 41 .end

Claims: 39 PCI7US92/01841 44 WHAT IS CLAIMED IS: 1. Apparatus for processing computer code in a compiler or code translator, wherein said computer code in its initial form uses a stack referenced by an argument stack pointer comprising: means for generating a flow graph in an intermediate language from said cod the flow graph being composed of blocks, and the blocks being composed of tuples, where each tuple represents a single expression in said code, and where each block represents a sequence of one or more tuples beginning with an entry and ending in a branch or return with no intermediate exit or entry; means for tracing through each block of said flow graph to detect any tuples which have the effect of modifying the stack pointer, and means for recording for ea block the net change in the stack pointer by tuples of said block, and recording the n change in the total depth of the stack from the beginning of said tracing; and means responsive to said recording for reporting to a user the identity of bloc having potentially improper stack references. 2. Apparatus according to claim 1, including means for recording for each block that said block has been visited in said tracing, and in tracing through each block of said flow graph checking each block before entering to see if the block has been visited. and, if so, going to another path rather than visiting said block again. 3. Apparatus according to claim 1 including means for, upon completing said tracing of a block, reporting a difference in the content of recorded total depth of the stac for a current block and a successor block which has alreadv been visited. 45 4. A method of compiling input code written for a first machine architecture to produce object code for a different machine architecture, wherein said first machin architecture uses a stack referenced by an argument stack pointer, comprising the s of: generating a flow graph in an intermediate language from said input code b convener, the flow graph being composed of blocks, and the blocks being compose of tuples, where each tuple represents a single expression in said input code, and where each block represents a sequence of one or more tuples beginning with an e and ending in a branch or return with no intermediate exit or entry; tracing through each block of said flow graph to detect tuples which have t effect of modifying the stack pointer, and recording for each block the net change i the stack pointer by tuples of said block which have the effect of modifying the st pointer, and recording the net change in the total depth of the stack from the begin uf sold tracing; and reporting to a user the identity of blocks having potentially improper stack references. 5. A method according to claim 4 including the step of recording for each block t said block has been visited in said tracing, and in tracing through each block of sai flow graph checking each block before entering to see if the block has been visited and, if so, going to another path rather than visiting said block again. 6. A method according to claim 5 including the step of, upon completing said ste tracing, reporting the a difference in the content of recorded total depth of the stac for a current block and a successor block which has already been visited. 7. A method according to claim 6 wherein said code includes a plurality of callab routines. 46 8. A method according to claim 4 wherein each said block begins with an entrv- and ends in a branch or return with no intermediate entrv*. 9. Apparatus for processing computer code in a compiler or code translator, comprising: means for generating a flow graph in an intermediate language from said code. the flow graph being composed of blocks, and the blocks being composed of tuples. where each tuple represents a single expression in said code, and where each block represents a sequence of one or more tuples; means for tracing through each block of said flow graph to detect reference to registers and to create an output-register set, and in each said block: means for recording identity of a register in an input-register set for this block if a register reference is a read from a register not yet wriπen to in the current block, means for removing identity of a register from the output-register set if a register reference is a read from a register already written to in the current block. means for adding identity of a register to the output-register set if a register reference is a write to a register, means for recording identity of a register in a written-register set for this block if a register reference is a write to a register, means for passing said output-register set to the succeeding block. 10. Apparatus according to claim 9, including means for tracing through each block of said flow graph in a reverse direction, and for each said block passing the input- register set to a predecessor block, and in each predecessor block updating the input- register set to include registers in the input-register set passed to this predecessor block by a successor block and not in the written-register set for this predecessor block. 11. Apparatus according to claim 9 including means for reporting to a user the content of said output-register set for said code upon completing said tracing for said blocks, and means for said input-register set for said code and reporting said written-register set for said code upon completing said step of tracing in the reve direction. 12. A method of compiling input code written for a first machine architecture to produce object code for a second different machine architecture, comprising the s of: generating a flow graph in an intermediate language from said input code convener, the flow graph being composed of blocks, and the blocks being compo of tuples, where each tuple represents a single expression in said input code, and where each block represents a sequence of one or more tuples beginning with an άύd fendifig in a branch or return with no intermediate entry; tracing through each block of said flow graph to detect reference to regist and to create an output-register set, and in each said block: if a register reference is a read from a register not yet written to in current block, recording such register in an input-register set for this block if a register reference is a read from a register already written to i current block, removing such register from the output-register set, if a register reference is a write, adding such register to the output register set, passing said output-register set to the succeeding block, upon completing said step of tracing for all of said blocks, repoπing o a user th content of said output -register set for said code. 13. A method according to claim 12 wherein said output-register set is recorded each block. 48 14. A method according to claim 12 wherein said input code contains one or more routines, and the content of said output-register set is reported to the user for each s routine. 15. A method according to claim 12 wherein said step of tracing includes, if a register reference is a write to a register, recording such register in a written-register set for this block. 16. A method according to claim 12 including the step of, upon completing said ste of tracing, reporting the content of said output-register set for said code, reporting s input-register set for said code, and reporting said written-register set for said code. 17. Apparatus for translating computer code written for a first machine arciύtecture code for a second machine architecture, wherein said first architecture uses a stack referenced by an argument pointer to pass arguments in procedure calls, and wherei said second machine architecture uses registers to pass arguments in procedure calls. comprising: means for generating a flow graph in an intermediate language from said cod the flow graph being composed of blocks, and the blocks being composed of tuples, where each tuple represents a single expression in said code, and where each block represents a sequence of one or more tuples beginning with an entry and ending in a branch or return with no intermediate entry; means for tracing said flow graph to find a tuple corresponding to a memory reference defined by said argument pointer and an offset to an argument, means for converting said offset to an index giving the number of said argument, means for converting said memory reference to a register reference; 49 means for compiling using said flow graph to produce object code for said second machine architecture. 18. Apparatus according to claim 17 wherein said stack may be of any size and number of registers to pass arguments is a fixed number. 19. Apparatus according to claim 18 wherein, if the number of arguments is great than said fixed number, then for an offset representing greater than said fixed num generating a stack frame referenced by a frame pointer to pass an argument repres ed by said offset. 20. Apparatus according to claim 19 including the step of generating a frame offs from said offset and generating a memory reference using said frame pointer and s fiαuic offset. 21. A method of translating computer code written for a first machine architectur code for a second machine architecture, wherein said first architecture uses a stack referenced by an argument pointer to pass arguments in procedure calls, and wher said second machine architecture uses registers to pass arguments in procedure cal comprising the steps of: generating a flow graph in an intermediate language from said code, the fl graph being composed of blocks, and the blocks being composed of intermediate - language elements, where each element represents a single expression in said code and where each block represents a sequence of one or more elements; tracing said flow graph to find a element corresponding to a memory refer defined by said argument pointer and an offset to an argument, converting said offset to an index giving the number of said argument, converting said memory reference to a register reference; 14 compiling using said flow graph to produce object code for said second 15 machine architecture. 1 22. A method according to claim 21 wherein said stack may be of any sizt and s 2 number of registers to pass arguments is a fixed number. 1 23. A method according to claim 22 wherein, if the number of arguments is greate 2 than said fixed number, then for an offset representing greater than said fixed numb 3 generating a stack frame referenced by a frame pointer to pass an argument represe 4 ed by said offset. 1 24. A method according to claim 23 including the step of generating a frame offset 2 from said offset and generating a memory reference using said frame pointer and sa , frame offset. 1 25. A method according to claim 21 wherein each of said blocks begins with an en 2 and ends in a branch or return with no intermediate entry. 1 26. A method according to claim 21 wherein said elements are tuples. 1 27. Apparatus for processing computer code in a compiler or code translator, comp 2 ing: 3 means for generating a flow graph in an intermediate language from said cod the flow graph being composed of blocks, and the blocks being composed of tuples, where each tuple represents a single expression in said code, and where each block : represents a sequence of one or more tuples beginning with an entry and ending in a branch or return with no intermediate exit or entry; PCr/US92/0.84. 51 8 means for tracing in a reverse direction through each block of said flow gra 9 to detect any tuples which read or set condition codes, 10 means for generating from detected tuples which read condition codes a 11 required set of condition codes stored with the block, 12 means for updating said required set for tuples setting said condition codes. 1 28. Apparatus according to claim 27, wherein said condition codes include overflo 2 equal to zero, negative and carry. 1 29. Apparatus according to claim 28 wherein said means for updating said require 2 set for tuples setting said condition codes includes means for resetting bits in said 3 required set which have previously been set. 1 30. A method of compiling input code written for a first machine architecture to 2 produce object code for a different machine architecture, said first machine archite 3 ture including condition codes in arithmetic and logic operation, said different mac 4 architecture not including condition codes, comprising the steps of: 5 generating a flow graph in an intermediate language from said input code b 6 converter, the flow graph being composed of blocks, and the blocks being compose 7 of tuples, where each tuple represents a single expression in said input code, and 8 where each block represents a sequence of one or more tuples; 9 tracing through each block of said flow graph in a reverse direction to dete O any tuples which read or set condition codes, 11 generating from detected tuples which read condition codes a required set o 12 condition codes stored with the block, V- updating said required set for tuples setting said condition codes, and _A generating operations in said object code using said required set for each bl • c to simulate setting and reading the condition codes in said required set. 52 1 31. A method according to claim 30 including the step of, upon calling the predeces . 2 sor block for a given block, passing said required set of said given block to said 3 predecessor block, and thereafter: 4 if said predecessor block is encountered in another backward flow path, and t 5 required set is a subset of said required set passed to said predecessor block, then 6 omitting visiting said predecessor block again, or 7 if said required set passed to said predecessor block does not include a 8 condition code of a required set of a block in said another backward flow path, then 9 visiting said predecessor block again. 1 32. A method according to claim 30 wherein said step of tracing includes tracing all 2 paths from the end of said code to the beginning of said code even if some blocks ar 3 visited more than once in said tracing. 1 33. A method according to claim 32 wherein said step of updating said required set ft for tuples setting said condition codes includes resetting bits in said required set whic have previously been set. 34. A method according to claim 33 wherein said step of tracing includes the step of 1 detecting any tuples for jump-to-subroutine instructions where the required set is not -> empty, and reporting such occurrence as a possible error in said input code. 35. A method according to claim 30 wherein said first machine architecture is a CIS architecture and said different machine architecture is a RISC architecture. 36. A method according to claim 30 wherein said input code includes a plurality of callable routines. SUBSTITUTE SHEET

Inventors: BENSON THOMAS R, BENSON, THOMAS, R.
Applicants: DIGITAL EQUIPMENT CORP, DIGITAL EQUIPMENT CORPORATION
Application year: 1992
Main classification: G06F9
IPC codes: G06F9, G06F11