초록 ▼

Automated generation of schema and interface methods is described. The system receives a schema definition file, which in one aspect of the system is an XML file. The system parses the schema definition file into an internal representation comprising collection classes. A SQL generator traverses the

Automated generation of schema and interface methods is described. The system receives a schema definition file, which in one aspect of the system is an XML file. The system parses the schema definition file into an internal representation comprising collection classes. A SQL generator traverses the collection classes and generates SQL statements that define tables, views and stored procedures. A component generator traverses the collection classes and generates computer program source code implementing components that access properties defined in the schema definition data, and methods that provide for persistent storage of the objects in a database.

대표청구항 ▼

Automated generation of schema and interface methods is described. The system receives a schema definition file, which in one aspect of the system is an XML file. The system parses the schema definition file into an internal representation comprising collection classes. A SQL generator traverses the

Automated generation of schema and interface methods is described. The system receives a schema definition file, which in one aspect of the system is an XML file. The system parses the schema definition file into an internal representation comprising collection classes. A SQL generator traverses the collection classes and generates SQL statements that define tables, views and stored procedures. A component generator traverses the collection classes and generates computer program source code implementing components that access properties defined in the schema definition data, and methods that provide for persistent storage of the objects in a database. int; and reversing an effect of each native instruction which has been executed and is subsequent to the checkpoint. 6. The method of claim 4, wherein: after the steps of changing and reversing have operated, any native instructions which correspond to original instructions which are sequentially prior to the checkpoint have been executed, and any native instructions which correspond to original instructions which are sequentially subsequent to the checkpoint have not been executed. 7. The method of claim 4, wherein the step of executing, via interpretation, successfully completes the section of code, the method further comprises the steps of: determining an address of the original code instruction that corresponds to the trapping native code instruction; counting a number of times the original code instruction has trapped; and blocking any reordering of the native code instruction when the number exceeds a predetermined number. 8. The method of claim 4, wherein the step of executing, via interpretation, has not successfully completed the section of code and has trapped, the method further comprises the steps of: notifying an application which comprises the original code of the trap; and providing the application with information relating to an original code instruction which corresponds to the trapping instruction. 9. The method of claim 4, wherein: the section is completed when a branch instruction removes flow control from the section. 10. The method of claim 4 wherein: the section is completed when the last instruction in the section has been executed. 11. The method of claim 1, wherein: the section of original code, contains multiple execution paths; and the native code is predicated code. 12. The method of claim 1, wherein: the step of reordering operates according to an optimization procedure. 13. The method of claim 1, wherein: an entry point into a block, of code in the section is designated as the checkpoint. 14. The method of claim 1, wherein the step of analyzing comprises the steps of: determining which instructions of the original code can be reordered; and determining which instructions of the original code cannot be reordered. 15. The method of claim 14, wherein: the step of designating designates an instruction that cannot be reordered as the checkpoint. 16. The method of claim 1, further comprising the step of: storing the native code instructions in a dynamic code cache. 17. The method of claim 1, further comprising the step of: storing a mapping of original code to native code. 18. The method of claim 1, further comprising the step of: storing an indication of the reodering of the at least one native code instruction. 19. A method for dynamically translating instructions in original code written fore first architecture into native code for a second architecture, the method comprising the steps of: analyzing a section of the original code; designating at least one checkpoint in the section; translating the instructions into native code instructions; reordering, speculatively, placement of at least one native code instruction; executing the one speculatively reordered native code instruction and any non-reordered native code instructions; and handling a trap that has occurred during the step of executing by resetting the original code to the checkpoint, and executing, via interpretation, the original code sequentially in a line-by-line manner until the section is completed. 20. The method of claim 19, wherein the step of handling comprises the steps of: identifying the section which is associated with the trapped executed code instruction; retranslating the section to determine the checkpoint; changing a program counter of the original code to the checkpoint; and reversing an effect of each native instruction which has been executed and is subsequent to the checkpoint. 21. The method of claim 20, wherein: after the s