Processing method for calling and returning function, and binary translation method and system

Abstract

The invention discloses a processing method for function call and return and a method and a system for binary translation. The processing method comprises: taking a return address of function call of a source program as a dummy order and storing the dummy order behind a function call order of an object program; storing an address of the dummy order in a stack at the beginning of the function callof the object program; taking out an address stored in the top of the stack when the function call of the object program is finished; and skipping behind the dummy order when the value of the addresstaken out from the stack top is equal to the return address of function call of the source program. The processing method can realize quick return after the function call and can avoid the problem oflow efficiency caused by Hash collision, thereby reducing the overhead of return-type indirect branch and improving performance of binary translation.

Description

technical field [0001] The invention relates to binary translation, in particular to a method for processing function calls and returns, a binary translation method and a system. Background technique [0002] Binary translation is the process of translating an executable program on one (source) machine into an executable program on another (target) machine. The binary translation system enables a large number of existing applications to be directly utilized by the new platform. . Such as figure 1 As shown, the executable program 111 of the source machine 11 (hereinafter referred to as the source program) is converted into the executable program 122 of the target machine (hereinafter referred to as the target program) by the binary translation system 121 on the target machine 12 . [0003] Function calls and returns are very common in programs. Although different high-level languages ​​call functions in different forms, they are similar in essence and follow the principle o...

AI Technical Summary

Problems solved by technology

Hash table is an efficient and fast data structure. Although the above method improves the slow problem of traditional mapping method, there will inevitably be troubles of hash collision when using hash table. In this case, we can only skip to The backup return address recovery module handles it. If there are many hash collisions, the hit rate will decrease, the performance of binary translation will decrease, and the operating efficiency of the program will also decrease accordingly.

Images