57 results about "Relocation" patented technology

The invention relates to a software efficient dynamic loading method based on an embedded platform, and belongs to the field of embedded operating systems. The method comprises the following steps: analyzing a target file of embedded software to obtain respective symbol table information; confirming a dynamic symbol in the application target file; repositioning symbols in the application target file, and converting a dynamic address into a static address relative to the system target file; and combining the system target file symbol table with all the loaded application target file symbol tables, and creating a linked list structure in the upper computer for storage. According to the method, the dynamic loading work performed on the lower computer with limited performance resources is reduced, and the processing time and performance occupation of dynamic loading of the program in the lower computer are shortened.

Method and apparatus for improvement of relocation with dedicated relocation information are disclosed. A Session Management Function (SMF) comprises a transceiver; and a processor coupled to the transceiver, wherein the processor is configured to receive, via the transceiver, dedicated relocation information for a specific application and targeting a collection of UEs from AF or dedicated relocation information for a specific application and targeting a specific UE belonging to the collection of UEs from PCF, wherein, the dedicated relocation information is used for routing decision for traffic and / or DNS handling decision for the specific application for each UE within the collection of UEs.

The invention relates to the technical field of computers, in particular to a hotfix loading method and device, electronic equipment and a storage medium so as to determine the offset of a TLS variable. Comprising the steps of compiling a patch function into a dynamic link library; obtaining a target offset of a thread local storage TLS variable in the patch function from the static link executable file, and obtaining relocation information of the TLS variable from the dynamic link library; after the patch file containing the patch function is dynamically loaded, a target memory address in the dynamic link library is determined based on the relocation information, and the target offset is stored in the target memory address; and when the to-be-repaired process is loaded to the to-be-repaired function, skipping to the patch function, and when the patch function is loaded, obtaining the target offset from the target memory address, and accessing the TLS variable of the patch function according to the target offset.

A method for managing an application includes: analyzing an unsigned executable file to at least infer relocation information for calculating a proper location for a symbol and generate an integrity signature for non-changing parts of the unsigned executable file; signing the unsigned executable file to obtain a signed executable file, in which the unsigned executable file is signed by adding the integrity signature into a read-only data block; and presenting the signed executable file to an administrator as the application in order to initiate deployment of the application to a database that provides computer-implemented services to a user, in which, before the user is allowed to use the application, the application checks an integrity of the application by invoking the integrity signature and without requiring an assistance from an operating system, in which the application checks the integrity at least when the application being executed in memory.

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.

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.

Described provides a device, method, apparatus and readable storage medium for control function relocation, where the apparatus according to an embodiment includes processor coupled with memory storing computer program codes, for causing the first device to: determine, for a first task performed by a first task control function (TCF), that the first TCF to be replaced by a second TCF, wherein the first TCF and the second TCF are managed by mission management (MM); and send, to the first TCF, a first synchronization request comprising information of the second TCF, for requesting the first TCF to send task execution (TE) information to the second TCF, wherein the TE information comprises execution information of the first task performed by the first TCF. As a result, relocation from o-TCF to n-TCF is realized.

Embodiments of the present application provide a decoding method, an encoding method, a code stream, a decoder, an encoder, and a storage medium. The decoding method comprises: at a decoding end, parsing a code stream to determine first syntax element information; when the first syntax element information indicates that a current block uses a prediction mode of intra template matching, determining a first block vector candidate list of the current block, wherein the first block vector candidate list is determined on the basis of a first candidate list constructed on the basis of template matching technology and / or a second candidate list constructed on the basis of merging candidate technology; determining a second block vector candidate list on the basis of the first block vector candidate list, wherein the second block vector candidate list comprises a relocation block vector constructed from a first candidate block vector in the first block vector candidate list; and determining a predicted value of the current block on the basis of the second block vector candidate list. In this way, the present application can improve the diversity of candidate block vectors, thereby improving the encoding and decoding efficiency.

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.

The invention provides a code processing method, and relates to the technical field of artificial intelligence, in particular to the technical field of chips and the technical field of heterogeneous computing. According to the specific implementation scheme, target function codes of multiple pieces of artificial intelligence acceleration equipment are compiled, multiple to-be-processed target function relocatable target files are obtained, and the multiple pieces of artificial intelligence acceleration equipment correspond to the host end relocatable target files; obtaining a plurality of processed target function relocatable target files according to a plurality of device end executable files and a plurality of to-be-processed target function relocatable target files used for a plurality of artificial intelligence acceleration devices; and linking the host end relocatable target file and the plurality of processed target function relocatable target files to obtain a heterogeneous program executable file. The invention further provides a code processing device, electronic equipment and a storage medium.

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.

An apparatus comprises a controller comprising an interface comprising circuitry to communicate with a host computing device; and a relocation manager comprising circuitry, the relocation manager to provide, for the host computing device, an identification of a plurality of data blocks to be relocated within a non-volatile memory; and relocate at least a subset of the plurality of data blocks in accordance with a directive provided by the host computing device in response to the identification of the plurality of data blocks to be relocated.

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.

The invention relates to a dynamic link library memory large-page method and system, and belongs to the technical field of computers. The invention provides a dynamic link library memory large-page method in the first aspect. The method comprises the steps that ELF files of one or more dynamic link libraries are obtained; compiling and linking the ELF file, and recording relocation information; and carrying out migration and fusion on the ELF file by utilizing the relocation information. According to the method, the limitation of an Ali cloud code large page technology is broken through, all dynamic link libraries can be actively upgraded into large pages, the iTLB miss of a program is further reduced, the 2MB iTLB utilization rate of a CPU is increased, the problem of memory fragmentation or memory expansion is avoided, and the memory utilization efficiency is improved.

The invention relates to an efficient linker design method based on multi-thread collaborative optimization. Firstly, dynamic task division and priority queue scheduling are adopted, the link process is decomposed into a plurality of task units capable of being executed in parallel, and the computing power of a multi-core processor is fully utilized. Secondly, a hierarchical symbol table is introduced, hot symbols are stored in a lockless hash table, cold data are stored in a read-write lock protected red-black tree, thread competition is effectively reduced, and efficient concurrent access is achieved; and meanwhile, a sectional relocation table and a progress counter supported by atomic operation are adopted, so that the concurrency performance is further improved. And finally, generating an intermediate file with a dependency label through a compiler, pre-obtaining a symbol dependency relationship and a dependency graph between modules, avoiding repeated analysis, and designing a dynamic feedback mechanism, so that the linker can feed back optimization data to the compiler to form a closed-loop optimization system. The method is suitable for large-scale projects and high-performance computing scenes, and the resource utilization rate is optimized while the link speed is increased.

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.

This invention relates to an efficient dynamic loading method for software based on an embedded platform, belonging to the field of embedded operating systems. The invention parses the target files of embedded software to obtain their respective symbol table information; identifies dynamic symbols in the application target files; relocates the symbols in the application target files, converting dynamic addresses to static addresses relative to the system target files; merges the symbol table of the system target files with the symbol tables of all loaded application target files, and stores this data in a linked list structure on the host computer. This invention reduces the dynamic loading work performed on resource-constrained lower-level machines, shortening the processing time and performance overhead of dynamic loading on the lower-level machine.

The invention relates to a binary file security reinforcement method based on dynamic link process randomization. The method comprises the following steps: firstly, adopting an encryption and decryption loading technology in a module loading stage to realize information protection work of a binary executable file; secondly, implementing a dynamic library function name randomization technology in a symbol analysis process so as to cope with a library function name replacement attack; and finally, designing a GOT table entry randomization technology based on a timestamp in an address relocation link, and enhancing the defense capability of a global offset table. And through a synergistic effect mechanism of the three, a whole-process security protection system for the dynamic link process is formed. The invention particularly provides a layered progressive dynamic randomization defense strategy for common attack vectors (including but not limited to attack forms such as ROP chain construction and GOT table hijacking) in modern control flow hijacking attacks. Experimental results show that the method can break the predictability of an attacker to the memory layout, and meanwhile, the overall performance loss ratio of the system is kept to be 1.56 averagely.

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 invention provides an SW64-based KASLR architecture design method and system. The method comprises the following steps: randomly setting a kernel running address, a module address and a linear mapping area address on an SW64 architecture; the KASLR architecture design is completed through random setting of a kernel operation address, a module address and a linear mapping area address. On one hand, specific randomization design and implementation of the kernel, the module and the initial address of the linear mapping area are covered, memory layout adjustment and design implementation, kernel page table mapping mechanism adjustment and design implementation and architecture relocation design implementation are also covered, and the system security is improved.

The application relates to the technical field of loading of reinforced ELF files, and discloses a loading method, a device, a storage medium and an apparatus for the reinforced ELF files. According to the application, a preset initialization function is called according to dynamic link library interface information in a reinforced ELF file; a decryption function and relocation information are obtained according to the preset initialization function; and the reinforced ELF file is decrypted and relocated according to the decryption function and the relocation information, so that the loading of the file is realized. Therefore, the dynamic link library interface information is arranged on the reinforced ELF file, the preset initialization function is called through the dynamic link library interface information, the decryption function and the relocation information are obtained, the loading of the reinforced ELF file is realized, the JNI_OnLoad function on the android platform is avoided, the loading of the reinforced ELF file of all platforms can be realized, and the compatibility of the reinforced ELF during loading is improved.

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.