7 results about "Local variable" patented technology

This application discloses a method, apparatus, device, and storage medium for calling function blocks in industrial control configuration software, relating to the field of industrial control. The method includes: storing the addresses of local variables of a target function block in the industrial control configuration software using a target structure based on preset storage rules, thereby completing the storage of the target function block; obtaining the structure variable corresponding to the target function block and writing values ​​to the structure variable based on configuration logic; converting the target function block into C language to obtain a corresponding .c file, and calling C functions in the .c file so that the .c file generates a controller executable file through a compilation module, and using the controller executable file to implement the industrial controller's call to the target function block, thereby completing the corresponding industrial control process. Therefore, this application solves the problems of function block storage and function block calling during the conversion of IEC logic into C language.

A method and apparatus for generating unit test code are provided. The method includes determining one or more assignment expressions and conditional expressions in a control flow of a function under test by traversing each expression of the control flow, wherein a variable in the conditional expression is associated with at least one of the one or more assignment expressions; eliminating the local variable in the conditional expression based on the at least one assignment expression; and generating the unit test code corresponding to the function under test based on the conditional expression in which the local variable is eliminated.

Embodiments of the present application provide a stack space allocation method and device, electronic equipment and a readable storage medium. The method comprises: obtaining a to-be-processed function containing local variables in a to-be-compiled program during the compilation of the to-be-compiled program; determining a target alignment value of the to-be-processed function based on the respective alignment attribute values of the local variables in the to-be-processed function; the target alignment value is not less than the minimum value of the respective alignment attribute values of the local variables; allocating the respective target memory areas of the local variables in the to-be-processed function based on the target alignment value, and determining the stack space of the to-be-processed function based on the respective target memory areas of the local variables; the starting address of the target memory area corresponds to an integer multiple of the target alignment value; and responding to the access operation of the to-be-processed function according to the stack space of the to-be-processed function. The execution efficiency of the to-be-processed function is improved to a certain extent.

The application relates to a register resource allocation method, computer equipment, a readable storage medium and a program product. The method comprises the following steps: constructing a function group through a calling relationship between functions, the function group comprising a coroutine kernel function and at least one coroutine sub-function; creating a resource record table corresponding to the function group, the resource record table being used for recording register resources allocated for the coroutine kernel function and / or the coroutine sub-function in the function group; and performing register allocation for the coroutine kernel function and the coroutine sub-function in the function group based on the resource record table. The method can meet the demand that local variable register resources are isolated and shared variable register resources are consistent in a cooperative mode, thereby improving parallel computing efficiency.

A method for accelerating Scloud+ algorithm based on multi-thread matrix multiplication. S1, a coarse-grained parallel architecture is constructed; S2, the AES-128 encryption module of the matrix A generation link in Scloud+.KEM is optimized by GPU native; S3, a local variable storage reuse strategy is adopted, and the local matrix variables with non-overlapping life cycle are stored in the storage space; S4, a pre-computation and persistence mechanism is introduced, and the pre-computation of the index data required for the generation of the matrix A is completed in the program initialization stage; S5, instruction level deep optimization; S6, a warp level fine-grained synchronization mechanism is constructed; S7, a double-thread cooperation fine-grained parallel implementation based on the coarse-grained architecture. Through the multi-dimensional collaborative innovation of architecture, memory hierarchy and instruction set, the computing, storage and communication bottlenecks of the post-quantum cryptography algorithm Scloud+ on the general parallel computing architecture are systematically solved.

The invention provides a hot-update abstract syntax tree memory mapping dynamic correction method and device, and the method comprises the steps: obtaining an abstract syntax tree of a target program, generating the identification information of each node, determining the node associated with a local variable in the abstract syntax tree as an associated node, and storing the associated node in the target program; establishing mapping between identification information of the abstract syntax tree and memory offset to obtain a memory mapping table, when the abstract syntax tree is changed due to hot update, identifying change nodes and types, and if the change is attribute change, keeping the memory offset and only updating the version identification; and if the change is the structure change, calculating the structural similarity of the nodes before and after the change, and if the similarity is greater than or equal to a preset threshold, multiplexing the original offset, otherwise, redistributing the offset and updating the mapping table. Therefore, incremental efficient correction of memory mapping is realized by dynamically evaluating the structural similarity of the abstract syntax tree nodes and intelligently multiplexing or redistributing the memory offset during hot update, so that the hot update speed is increased, and the memory overhead is reduced.

Embodiments of the invention provide a data processing method and apparatus, a device and a storage medium. The method comprises the steps of obtaining a source file for generating a special effect; adding the source file in an action range of an external function, wherein the source file can call a local variable of the external function in a process of quoting the source file in an external environment of the external function; and stopping a set application programming interface API in the local variable of the external function to obtain target data. According to the technical scheme, the security of special effect creation and application after the special effect script is opened is improved.