35 results about "Relocation" patented technology

A computer-implemented method for transforming a library from a source operating system to a target operating system is disclosed. Thereby, the source operating system includes a source ABI; the target operating system comprises a target ABI; the target ABI is different from the binary interface of the source application, and the library is realized by the source object file; the source object file conforms to the source application binary interface and includes at least a source memory image, source symbol information, and source relocation information, where the source relocation information is free of relative relocation information. The method further includes creating a target memory image, the target memory image conforming to the target application binary interface and derived from the source memory image; enriching the target memory image with fixed-length eye mark information; and writing the target memory image into the target object file.

The embodiment of the present application provides a program compiling and loading method. In the embodiment of the present application, when an application program is compiled, on one hand, the code section and the data section of a plurality of object files compiled from application source code are subjected to merging processing to obtain a target code section and a target data section, thereby reducing table header information; on the other hand, only a symbol table corresponding to a relocation table required when the application is loaded is retained, thereby reducing the space consumption of the symbol table; therefore, the size of an executable file of the application generated according to the target code section, the target data section, the relocation table and the symbol table corresponding to the relocation table is reduced, and the memory consumption when the application is loaded is reduced.

This invention relates to a method for cross-version binary compatibility of Linux kernel modules, belonging to the field of computer operating system kernels. It includes the following steps: During the compilation phase, the compiler identifies specific keywords (__kabi_reloc_member, __kabi_check_member, __kabi_sizeof) and records instruction offsets, type identifiers, member variable name offsets, and relocation types, generating a .kabi_relocs segment. During the loading phase, the loader parses the .kabi_relocs segment, combines it with module BTF and kernel BTF information, and dynamically repairs instructions based on the relocation type. This invention achieves "compile once, run anywhere" binary compatibility for kernel modules, with the repair operation completed at load time, having no impact on runtime performance.

In an ECU (100), an arrangement determination unit (130) refers to a write count table (161) that stores a write count of data in each of areas obtained by dividing a program storage area (141) into predetermined sizes, and determines an arrangement of programs to even out data writing in the program storage area (141) as much as possible. Then, a rearrangement unit (140) executes rearrangement processing for moving each program within the program storage area (141) so as to achieve the determined arrangement.

A computer-implemented method for transforming a library from a source operating system to a target operating system is disclosed. Thereby, the source operating system comprises an ABI, the target operating system comprises a target ABI, the target ABI is different from the source ABI, the library is implemented by a source object file, the source object file conforms to the source application binary interface and comprises a source memory image, a source symbol and source relocation information. The method further includes creating a target memory image conforming to the target application binary interface, where the target memory is derived from the source memory image; enriching the target memory image with address information directed to the variable length information; and writing the target memory image to the target object file to implement the transformed library from the target object file.

This invention relates to a hybrid Rust, C, and assembly code construction method based on an embedded operating system, belonging to the field of embedded operating systems. This invention utilizes Rust's External Function Interface (FFI) and the "staticlib" and "rlib" code classes supported by the Rust compiler to align the Rust library API with the APIs of the C and assembly libraries in the embedded operating system. This aligns the Rust code with the relocatable files that can be recognized by the embedded operating system, guiding the build system to link the Rust library with the C and assembly libraries to form the final embedded operating system executable file. This invention can link Rust components with C and assembly components to form a single executable file, fully utilizing Rust's type safety and memory safety features to improve the overall security and reliability of the system, while also considering the reuse and expansion of existing code libraries.

The application provides an open instrument controller interface adaptation method and system, specifically, by performing static analysis on an interface driver library of an instrument to be adapted, extracting a unique fingerprint of an exported function and constructing a function index, loading the driver library in an independent logical address space, and completing address relocation and symbol resolution, realizing safe residence of the driver in a user state, when a standard instruction is issued by an upper application, matching a corresponding function fingerprint according to an instruction semantic, searching the index to obtain a function entry address, and constructing a call context containing a parameter stack rule and an entry pointer, before execution, performing logical verification on the instruction through a virtual state machine, ensuring that the state transition is legal before triggering an actual hardware call, and writing return data into a protected shared buffer.

The invention provides a dynamic library determination method, electronic equipment, a storage medium and a program product. The method comprises the following steps: in a starting stage of an executable file, for a first external symbol of the executable file, searching a first dynamic library corresponding to the first external symbol in a predetermined global symbol hash table, the global symbol hash table records a corresponding relationship between a plurality of external symbols of the executable file and a dynamic library where the plurality of external symbols are located. Therefore, in the starting stage of the executable file, the dynamic library where the external symbol of the executable file is located can be determined according to the corresponding relation recorded in the global symbol hash table, and the dynamic library does not need to be searched one by one, so that the time for searching the dynamic library where the external symbol is located can be shortened, the external symbol searching and repositioning process can be accelerated, and the efficiency of searching the external symbol is improved. Therefore, the starting efficiency of the executable file is improved, and the starting performance of the network element equipment is accelerated.

A data storage device includes a relocation management system that determines whether to perform a relocation operation based on an operating temperature, performance metrics and / or energy metrics associated with the data storage device. The relocation management system uses the operating temperature to identify a performance threshold and an energy threshold. Each threshold indicates whether the relocation operation is a first relocation method or a second relocation method. If the validity count of a memory block included in the relocation operation is below each threshold, the first relocation method is selected. If the validity count of the memory block is above both thresholds, the second relocation method is selected. However, if the validity count of the memory block is in a tradeoff range, the relocation management system selects a relocation method based on a tradeoff between performance metrics and energy consumption metrics.

The present disclosure provides a code relocation method and device, which first acquires a target file to be relocated, and reads a load command list corresponding to target code from the target file; wherein the target file is used to generate an executable file through static linking; then, based on the load command list, a relocation information list corresponding to the target code is found from the target file; thereafter, based on the relocation information list, a target address calculation method and an address parameter of the target code are determined; finally, the address parameter is calculated by using the target address calculation method, to obtain address information of the target code after relocation. The present disclosure determines the target address calculation method and the address parameter of the target code through the relocation information list, calculates the address parameter by using the target address calculation method, and obtains the address information after relocation, without static linking, to determine the address information of the target code.

This invention discloses a Java code layout optimization method that does not interrupt application services. The method includes: acquiring front-end bottleneck data of the application; when it is determined that code layout optimization is needed based on the front-end bottleneck data, collecting the dynamic control flow graph of the application service; calculating a new code layout based on the dynamic control flow graph; generating new code according to the new code layout; correcting relocation information in all code, that is, redirecting function calls and data references pointing to the old code to the new code. During the correction process, memory barriers and cache maintenance instructions are used to ensure the atomicity and consistency of the modification operations, so as to achieve uninterrupted application services; only reclaiming the memory space used by the old code that is no longer executed to store the new code generated in the next optimization, retaining the function code still on the call stack, so that most of the memory space can be reclaimed without interrupting application services. This method effectively alleviates the processor front-end bottleneck of Java applications and improves application performance.

An apparatus, method, apparatus, and readable storage medium are described for controlling function relocation wherein, according to one embodiment, the apparatus includes a processor coupled with a memory storing computer program code, in one embodiment, a system includes computer program code to cause a first device to perform the following: for a first task executed by a first task control function (TCF), determining that the first TCF is to be replaced by a second TCF, where the first TCF and the second TCF are managed by mission management (MM), and for a second task executed by the first TCF, determining that the first TCF is to be replaced by the second TCF, where the first TCF and the second TCF are managed by the MM. And transmitting, to the first TCF, a first synchronization request including information of the second TCF for requesting the first TCF to transmit task execution (TE) information to the second TCF, the TE information including execution information of the first task executed by the first TCF. Therefore, the relocation from the o-TCF to the n-TCF is realized.

The application discloses a controller stack calling method and device, equipment and storage medium, and relates to the field of industrial control, and comprises the following steps: writing preset type function data of a current execution function into a target stack space of an industrial controller, writing target function parameters into a reserved stack space in a read-only segment of a preset executable program, generating machine code through compiling, and generating a corresponding executable file through linking; determining an address of the target function parameters in the reserved stack space as a loading address of a target executable program according to a relocation code in the executable file; reading the target function parameters through the loading address, and running the current execution function by using the read target function parameters and the preset type function data, so as to execute corresponding industrial control operations. The application solves the problem that the controller cannot run when the parameter transmission occupies a space larger than the stack space by putting the function parameters into the read-only segment during compiling and accessing the read-only segment data through relocation.

The application discloses a kind of kernel start-up measurement and trusted verification method and system based on U-Boot, it is related to embedded system security technical field.In the initialization safety check module after U-Boot starts, establish initial trusted root and empty PCR register;Determine execution address range by loading kernel image and by decompression, relocation, according to kernel, start parameter and device tree data, hierarchically calculate first, second, third type of measurement value, extended write soft PCR register;After operating system kernel starts, extract measurement result and pass to kernel, compare with preset trusted reference value, any item mismatch triggers safety strategy, start blocking, limited mode, multi-dimensional alarm.The application constructs safety check module by software TPM and software PCR, without relying on hardware trusted module can realize kernel start-up whole process trusted protection, and measurement range is comprehensive, safety mechanism is perfect and strong universality, with wide application value.

The application provides a method for hiding a secret key in a module relocation table, comprising the following steps: selecting a memory address as a starting address in a module; generating secret key data, and splitting the secret key data into a secret key string; taking the starting address as a base address, constructing and generating a relocation table; storing the secret key string in the relocation table, constructing the relocation table based on a relocation characteristic, and hiding and storing the secret key data in the relocation table, so that the security is high.

The embodiment of the invention provides a data processing method and device, computer equipment and a readable storage medium. The method comprises the steps that S function calls meeting replacement conditions are obtained from client program codes of an application client; n function calls meeting the aggregation condition and S-N function calls not meeting the aggregation condition are obtained from the S function calls, the N function calls are aggregated into aggregated function calls, and a relocation function corresponding to the target function signature is generated according to the aggregated function calls and the S-N function calls; respectively replacing the S function calls with relocation function calls to obtain replaced first package program codes and replaced sub-package program codes; and writing a relocation function in the replaced first package program code to obtain a target first package program code. According to the invention, the compiling memory of the application client can be reduced, and the stability of the application client is improved.

A block of memory in a data storage device can be partitioned into two or more sub-blocks, where each sub-block is independent of the other sub-blocks. If the program-erase counts of the sub-blocks are sufficiently low, the same programming voltage can be used to program each of the sub-blocks. However, for higher program-erase counts, disturb effects can create issues in using the same programming voltage. With the embodiments presented herein, the programming voltage of a given sub-block can be based on the program-erase count of the sub-block. This can avoid the need to compare program-erase counts of various sub-blocks and perform a relocation operation.

This invention discloses a startup optimization method for a domestic operating system based on a dynamic loading mechanism, comprising the following steps: module-level trimming of the operating system kernel; using the graphical configuration interface provided by Linux itself to perform overall trimming of functional modules, determining the configuration items of the minimum operating system kernel under the dynamic loading mechanism; designing a dynamic loading method for target modules and interrupt service routines, downloading modules not found in the loaded module chain to the local machine through a communication mechanism; completing the dynamic linking operation after the target file is read into memory using dependency analysis, symbol resolution, and relocation methods for the target module; and designing a dynamic unloading method for specified modules, reclaiming the storage space allocated to the module in the operating system and canceling its external references, thus achieving the reverse operation of dynamic linking. This invention can clearly define the coupled data and behaviors that need to be loaded during module startup and runtime in the operating system, shortening startup time.

The invention relates to the technical field of data processing, and provides an application loading method and device, equipment and a computer storage medium. The method comprises the following steps: acquiring an ELF file of a target application program stored in a FLASH memory; analyzing program header information of the ELF file to obtain a storage position of a code segment of the target application program in the FLASH, a storage position and a size of a data segment in the FLASH, and a size of an uninitialized data segment; copying the data segments from the FLASH to the RAM according to the sizes of the data segments and the uninitialized data segments; setting an initial address of a memory space in an RAM as a gp value of a global pointer register, and performing relocation correction on address reference in the initialized data segment based on a relocation model of an ePIC ABI specification and the gp value to obtain a relocated data segment; and loading the target application program based on the storage position of the repositioned data segment and code segment in the FLASH.

This helps to reduce the increase in application downtime. [Solution] The system dynamically places the application in one of several domains 13, 14, or 15 to which computing resources are allocated. The system comprises a determination unit and a decision unit. The determination unit determines the resource utilization rate in each domain. The decision unit determines the relocation destination for "Application C" which is located in domain 13, where the resource utilization rate is higher than the first criterion. Based on information regarding future fluctuations in computing resource usage in each domain, the decision unit determines domain 15, where usage is not expected to increase, as the relocation destination.

The embodiment of the application discloses a kind of redundant symbol search method, device, terminal and medium, belong to binary file field, the method includes: obtaining the ELF file of compilation completion, extract the reference relationship of function from the symbol table, relocation table, code section and debugging information of ELF file;From program entry and dynamic call point, recursively, according to the reference relationship, build symbol reference graph;From the preset function use starting point, traverse the symbol reference graph, obtain the use function set;All function symbols that appear in the code section of ELF file are compared with the use function set, and redundant function is obtained according to the comparison result.Can quickly and accurately find the redundant function in ELF file, provide accurate cleaning target for later on ELF file slimming.

The time required to read data, which increases when data is stored at discrete locations, is reduced. [Solution] The system comprises a storage means having a plurality of contiguous storage areas and storing each of the data entities of a first volume in a storage area at an arbitrary position; a replication means which compares the order of the data in the first volume with the order of the data in the storage means and replicates the data stored in a discontinuous state in the storage means to a second volume to which a plurality of contiguous storage areas are assigned in the order of the data in the first volume; and a read means which, upon receiving a read request for the second volume, reads data sequentially from the first storage area of ​​the second volume in the requested read range, and if the data to be read is not stored in the second volume, reads the data from the storage means via the first volume.

A computer-implemented method for transforming a library from a source operating system to a target operating system is disclosed. Thereby, the source operating system comprises an ABI, the target operating system comprising a target ABI, the target ABI being different from the source ABI, the library being implemented by a source object file that is compliant with the source application binary interface and comprising a source memory image, source symbol and source relocation information. The method comprises also creating a target memory image, that is compliant with the target application binary interface, wherein the target memory is derived from the source memory image, enriching the target memory image with an address information pointing to a variable length information, and writing the target memory image to the target object file to implement the transformed library by the target object file.

The application discloses a memory statistics method, a memory statistics device and a computer readable storage medium. The address of a target function is acquired, the target function including a function in a preset dynamic library and / or a function in an executable program. A self-defined function is constructed based on the prototype of the target function, wherein the self-defined function calls the target function. The position of the target function in a global offset table is acquired to obtain a relocation address. The global offset table is subjected to relocation processing based on the relocation address. The memory usage of the target function is obtained based on the self-defined function and the global offset table after relocation. In the foregoing manner, the application can simultaneously count the memory allocation of the executable program and the dynamic link library.

The application relates to the technical field of EDA simulation, in particular to a virtual table sparsity generation and dynamic filling method for EDA simulation, in which only actual relocation entries and symbolic references of virtual functions overwritten by the subclass are generated in the sparse virtual table of the subclass, a large number of virtual functions inherited from the parent class are replaced by light-weight inheritance marks and inheritance placeholders, the generation of huge repeated function pointer entries for all subclasses in the compiling stage is avoided, the compiling time is greatly reduced, and because the sparse virtual table only contains a small amount of relocation entries of overwritten functions, the amount of relocation information to be processed and analyzed by a linker is greatly reduced; in addition, the filling process of the virtual table is completed through simple copying operation after the parent class virtual table is initialized, the compiling time is further shortened, and the compiling efficiency is improved.

The application provides a DLL-crossing relocation repair method and system. The method comprises: when a second DLL is loaded in a system, a repair opportunity for a relocation data item in copied function code is obtained, wherein the copied function code is function code copied from a first DLL to the second DLL; and the relocation data item in the copied function code is repaired based on the repair opportunity. When the second DLL is loaded, the application uses a certain method to capture a repair opportunity for a relocation data item of the function code copied from the first DLL, and the relocation data item across DLLs is repaired based on the captured repair opportunity, so that the relocation data item across DLLs is repaired.

The embodiment of the invention discloses a redundant symbol searching method and device, a terminal and a medium, and belongs to the field of binary files, and the method comprises the following steps: obtaining a compiled ELF file, and extracting a reference relationship of a function from a symbol table, a relocation table, a code section and debugging information of the ELF file; performing downward recursion from a program entry and a dynamic calling point, and constructing a symbol reference graph according to the reference relationship; traversing the symbol reference graph from a preset function use starting point to obtain a use function set; and comparing all function symbols appearing in the ELF file code segment with the use function set, and obtaining a redundancy function according to a comparison result. According to the method, the redundant function in the ELF file can be quickly and accurately found, and an accurate clearing target is provided for the slimming of the ELF file in the later period.

Embodiments of the present application provide a program execution method and device, electronic equipment and a readable storage medium. The method comprises: obtaining a specified running address and a target running address of a target program; calculating an offset value between the specified running address and the target running address; if the offset value is not equal to 0, obtaining a first variable of a relocation symbol from a preset relocation table; obtaining an initial memory address of the relocation symbol from a global offset table based on the first variable; calculating a target address of the relocation symbol according to the initial memory address and the offset value, and updating a value of the relocation symbol in the global offset table based on the target address; and executing the target program according to the updated global offset table. The present application can ensure normal running of a program in the case that the target program is downloaded to any location, thereby realizing location independence of program running.

The invention provides a program compiling method and device, computer equipment and a medium, and belongs to the technical field of computers. The method comprises the following steps: executing compiling operation on a high-level language code through a target code model in a compiler so as to generate relocation information corresponding to a memory access target address generated by compiling the high-level language code according to an address loading strategy of the target code model; judging whether the actual address of the program or data object pointed based on the relocation information exceeds the constraint address range of the relocation information or not through a linker; when the length of the actual address exceeds the constraint address range, the target code model is updated through a standby code model larger than the constraint address range of the target code model, and compiling operation is executed on the high-level language code again based on the updated target code model; and when the length of the actual address does not exceed the constraint address range, linking the high-level language code based on the actual address and the relocation information.

The application discloses a fluid simulation method based on GPU octree acceleration and SPH algorithm, in order to reduce the load of the CPU and place the traversal of the octree in the GPU, the traditional octree algorithm is improved, a linear table is used to store the nodes of the octree, a pointer is replaced by an index in the linear table, so that the pointer can still be used when being transmitted into the GPU, the pointer does not need to be relocated, and an iteration method with O(1) space complexity is proposed to realize the traversal of the octree, the powerful parallel computing capacity of the GPU is utilized, and the performance advantage of the octree in the near neighbor search algorithm is also utilized, after the GPU and the linear octree are accelerated, the overall frame rate is greatly reduced due to the limitation of the number of water particles, and the load of the CPU is greatly reduced.