229 results about "Program compilation" patented technology

A reconfigurable test system including a host computer coupled to a reconfigurable test instrument. The reconfigurable test instrument includes reconfigurable hardware-i.e. a reconfigurable hardware module with one or more programmable elements such as Field Programmable Gate Arrays for realizing an arbitrary hardware architecture and a reconfigurable front end with programmable transceivers for interfacing with any desired physical medium-and optionally, an embedded processor. A user specifies system features with a software configuration utility which directs a component selector to select a set of software modules and hardware configuration files from a series of libraries. The modules are embedded in a host software driver or downloaded for execution on the embedded CPU. The configuration files are downloaded to the reconfigurable hardware. The entire selection process is performed in real-time and can be changed whenever the user deems necessary. Alternatively, the user may create a graphical program in a graphical programming environment and compile the program into various software modules and configuration files for host execution, embedded processor execution, or programming the reconfigurable hardware.

A computer system for generating a cause effect matrix as a user interface to develop a control program based on the cause effect matrix and to compile and download the resulting program into a programmable controller. A cause effect matrix diagram is used to develop a function block diagram program which is a standard IEC 1131-3 language. The function block diagram is translated into structured text which is compiled into intermediate code. The intermediate code is translated into the native code for the micro-processor of the target control system, including but not necessarily limited to the Motorola processor MPC-860. The automation of a cause effect matrix diagram to generate a function block diagram permits additional capability by allowing functions for causes, intersections, and effects. Because special functions may be included, the results of a cause generate timing functions or other computations before initiating the effect.

A system is presented for optimizing safe downcasting and similar programming idioms in an object-oriented programming language. The system operates by receiving a source program written in the object-oriented programming language. The system compiles this source program into an intermediate representation. Next, the system examines the intermediate representation to identify the use of a virtual function call to determine if an object of a given base class is a member of a given derived class. Such usage facilitates safe downcasting of the object from the given base class to the given derived class. If the intermediate representation uses the virtual function call in this manner, the system replaces the virtual function call with a comparison of a virtual function table pointer associated with the object to an address of a virtual function table associated with the given derived class. The compiler finishes compiling the intermediate representation into executable binary code.

A compiling system which translates a source program written in a high-level language into a machine language program, and includes a source level optimizer which converts an original source S program into an optimized source program by optimizing the original source program at the source program level, a compiler which converts the optimized source program into the machine language program, and a final debug information selection generation unit which generates final debug information which indicates a corresponding relationship between the original source program and the machine language program.

Source code is compiled using a multi-stage compiler that includes a tokenizer, a type checker, and a composer. The tokenizer segments source code into a sequence of tagged segments. The source code includes at least one instruction that composes a first abstraction and a second abstraction with a selected composition operator. The parser builds a tree using the sequence of tagged segments. The type checker performs a first pass of the tree to determine whether abstractions on the tree are well typed. The composer reduces the at least one instruction composing the first and the second abstractions on the tree to a third abstraction. The composer substitutes the first and the second abstractions on the tree with the third abstraction, wherein the type checker performs a second pass of the tree to determine whether the third abstraction is well typed.

One embodiment of the invention sets forth a mechanism for compiling a vertex shader program into two portions, a culling portion and a shading portion. The culling portion of the compiled vertex shader program specifies vertex attributes and instructions of the vertex shader program needed to determine whether early vertex culling operations should be performed on a batch of vertices associated with one or more primitives of a graphics scene. The shading portion of the compiled vertex shader program specifies the remaining vertex attributes and instructions of the vertex shader program for performing vertex lighting and performing other operations on the vertices in the batch of vertices. When the compiled vertex shader program is executed by graphics processing hardware, the shading portion of the compiled vertex shader is executed only when early vertex culling operations are not performed on the batch of vertices.

A method to revalidate a compiler intended for compilation of a user-written program for safety control in an industrial control system after it has been used. A test program is compiled a first time which test program is defined in a control language. The compiler is validated by verifying that the test program executes correctly. A first software is generated derived from the compiled test program intended for later comparison purposes. The test program is compiled a second time after the compilation of a user-written program. A second software is generated intended for a comparison based on the second compilation of the test program. The first software is compared with the second software, wherein the compiler is revalidated for any errors introduced between the first and the second compilation. Provided that the revalidation indicates no errors in the compiler, the user-written program is enabled to execute in a device with safety features for control of real world entities.

A CPU is provided with an ability to modify its operation, with respect to error correction, as a programmable feature. An error correction scheme is selected to be performed by the error correcting circuit. The compiled program may have intentionally introduced errors which are predictably corrected by the selected error correction scheme. When a program is compiled, the program is modified by the intentional insertion of errors which would result from the execution of the program. By providing error correction schema selected during program compilation, errors can be inserted in the program code, but are handled in a predictable manner by the error correction.

A dynamic compiler program product, method, and device for sequentially compiling a partial computer program in a computer. The program product causes the computer to function as: an execution status acquisition unit for acquiring respective values of one or more pieces of current execution status information; a determination unit for reading, from the shared pool, the second list of the conditions associated with an executable instruction stream generated by compiling a partial program that is the same as a partial program to be compiled and determining whether respective values of corresponding pieces of current execution status information satisfy the conditions; and a dynamic compilation unit for generating an executable instruction stream by compiling the partial program to be compiled on the condition that a result of determination made by the determination unit is negative.

The invention provides a development document generation method and device. The method comprises the following steps of: importing a control parameter in a preset program development management tool, wherein the control parameter is used for compiling parameter names of parameters appearing in each method in an API program into a class file corresponding to each method during program compilation; injecting a RequestMappingHandlerMapping to obtain related parameter information of each method in the API program, wherein the related parameter information comprises a URL, a Controller, a request parameter and a returned Header type; analyzing the request parameter to obtain a parameter name, a parameter type and parameter annotation content by using a reflective analysis technology; and packaging the related parameter information of each method in the API program and various analyzed contents to obtain an API development document. According to the method and device, development documents can be automatically generated, so that the problem that development document needs manual programming is solved.

The invention discloses an intermediate code generation method and device for quantum program compiling. The method comprises the steps of obtaining that a source code of a quantum program is obtained;, wherein the logic structure of the source code at least comprises a quantum branch structure, a quantum circulation structure and a quantum logic gate; carrying out lexical analysis on the source code, and segmenting the source code into a plurality of grammatical unit tokens; performing grammatical analysis on all tokens, and constructing an abstract syntax tree AST; wherein the AST comprisesa root node, a plurality of sub-tree nodes and a plurality of leaf nodes, the root node and the sub-tree nodes comprise grammar rule information, and the leaf nodes comprise token information; and according to the node information of the AST and a preset construction rule, constructing an intermediate code corresponding to the source code. By utilizing the embodiment of the invention, repeated labor can be avoided, and resource occupation is reduced.

The invention provides a molecular-dynamics simulation method of predicting a diffusion coefficient of a combustion process of a nano-multilayer film. The method comprises the following steps: 1) constructing a nano-multilayer-film molecular-dynamics simulation model, and exporting a configuration file; 2) completing a control file; 3) using a molecular-dynamics method to calculate and output mean-square-displacement (MSD) data of each component; 4), drawing the MSD data as a curve of MSD versus step length; 5) calculating a slope of the MSD versus time; and 6), obtaining the diffusion coefficient by solving according to Einstein's law. According to the method, solving is carried out for the diffusion coefficient of each component of the nano-multilayer film, the problem that real-time atomic diffusion behaviors of the self-propagating reaction combustion process of the nano-multilayer film cannot be tested and analyzed by experiment means is solved, difficulty of program compilation is significantly reduced, atomic behaviors and processes of nano-connection are more accurately understood, and a reference is provided for structure design of nano-multilayer films through study on diffusion coefficients and diffusion behaviors of the multilayer films of different atomic proportions under different temperatures.

A compiler, that generates an object program file from a source program in which a plurality of procedures are written, compiles procedures, by regarding the procedures as source-program compile units, to generate corresponding object-program compile units. A plurality of object-program compile units generated are output to a memory together with the corresponding source-program compile units. When compiling a source program in which one procedure has been changed, the compiler compiles only the source-program compile unit corresponding to the changed procedure.

The embodiment of the invention provides a chip authentication method, a system, a printer, a consumable chip and consumable box. On one hand, according to the embodiment of the invention, the printer sends an authentication instruction to the consumable chip; the authentication instruction includes a designation code which is compiled in accordance with a program compilation format of the authentication consumable chip; the consumable chip receives the instruction sent by the printer, and identifies whether the received instruction is an authentication instruction; if the received instruction is identified as the authentication instruction, the consumable chip runs a designation code and obtains the running results; and the consumable chip returns the running result to the printer, and the printer receives the running result and judges whether the consumable chip is an authentication consumable chip. Therefore, the technical scheme provided by the embodiment of the invention can solve the problem of security vulnerability of an authentication method for the consumable chip by the printer in the prior art.

The invention enables appropriately concentrating instruction strings or data pieces sporadically present in a plurality of regions over more than one compilation unit and adjusting the front-and-rear relationship of executed instruction strings without changing the program compilation unit such as a file, subroutine, or function and also without creating a link processing program for batch processing of the system as a whole. Different section names are given to the executed instruction strings and the unexecuted instruction strings and the referenced data and the unreferenced data of an object program respectively, so that, when an execution module is generated from the object program by linking, the sections having an executed section name and the sections having an unexecuted section name in a plurality of files may be aggregated respectively to divide the instructions into an execution portion and an unexecution portion.

The invention belongs to the technical field of program compilation and in particular relates to a method for realizing automatic pipeline parallelism. The method of the invention mainly comprises the following steps of: (1) identification of the pipeline parallelism, namely judging a loop structure which is provided with cross-loop iteration dependence and a dependence distance vector is a constant; (2) synchronization among threads, namely inserting the synchronization according to the dependence distance vector and deleting the redundant synchronization with the same distance vector; and (3) thread scheduling in a static step length, namely self-defining a thread scheduling strategy for balancing the workload of each thread and reducing the communication expense. The type identification of the loop structure is depended on the conventional array data stream analysis and dependence tests, while the pipeline parallelism only processes the regular loop structure with backward cross-loop iteration. The synchronization expense of the pipeline parallelism is high, so the pipeline parallelism is only performed on the outmost layer of a nested loop. Profit of the pipeline parallelism depends on programs, the number of the cyclic iteration is larger and the dependence distance is longer, the performance promotion is greater. The method for realizing the pipeline parallelism improvesthe capacity of automatic parallel optimization and contributes to further improving the performance of scientific calculation programs.

A computer implemented method, system and computer program product for accessing threadprivate memory for threadprivate variables in a parallel program during program compilation. A computer implemented method for accessing threadprivate variables in a parallel program during program compilation includes aggregating threadprivate variables in the program, replacing references of the threadprivate variables by indirect references, moving address load operations of the threadprivate variables, and replacing the address load operations of the threadprivate variables by calls to runtime routines to access the threadprivate memory. The invention enables a compiler to minimize the runtime routines call times to access the threadprivate variables, thus improving program performance.

The invention belongs to the technical field of program compilation, in particular to a predicate-based automatic parallel optimizing method. The method mainly comprises the following: (1) a step of predicate establishment, which is to establish a parallel predicate of a program by using different kinds of known information of a user program, and remove simple dependence of the program; and (2) a step of parallel loop structure establishment, which is to perform subsequent parallel analysis and judge whether to use the parallel predicate or not under the restriction of a predicate condition. The parallel predicate establishment is based on the traditional array data flow analysis and loop dependence test. The loop simple dependence caused by imprecise loop information is eliminated through predicate establishment, so that the analysis range and the parallel optimization effect of the traditional automatic parallel optimization are widened and improved respectively. In the actual execution of the program, if the predicate is not satisfactory, the program executes the original serial version and the increased judgment operation and skip operation hardly influence the overall performance of the program; and if the predicate is satisfactory, the parallel version of the loop structure is executed, thus the program performance is obviously improved.

It is one object of the present invention to provide effective optimization for a program that includes commands that may cause exception processes. A novel compiler for converting source code for a program written in a programming language into object code in a machine language comprises: an optimization execution unit for performing an optimization process for an object program written in a machine language; and a pre-processor and a post-processor for modifying the object program in order to absorb a difference in content between the point of origin of an exception process, which occurs in response to the execution of a command in the object program, and a location whereat the exception process is performed.

A compiler program creates a program, which is executed on a platform where use of a pointer is limited and that can perform a pointer operation without specifying addresses allocated to a memory. When a source code, which is related with the pointer operation to be executed for data having references for simultaneously identifying respective data and offset information for simultaneously specifying positions in the data identified by the references, is read, a code for performing the pointer operation using a pseudo-pointer having a predetermined data length is created by the compiler program based on information simultaneously specified by the references for identifying the data and the offset information.

A compiler 134 for compiling a first computer program 110 written in a first computer programming language into a second computer program written in a machine language, the compiler comprises a code generator to generate the second computer program by generating tables 142 and machine language code 144, the generated tables and the generated machine language code together forming the second computer program, wherein the generated machine language code references the tables and the generated machine language code does not contain arithmetic or logic machine instructions, the tables comprising pre-computed results of arithmetic and/or logic machine instructions.