International Business Machines Corporation

John Robert Ehrman

Dan F Greiner

John Robert Dravnieks

Leona Dryden Baumgart

Allan Henry Kielstra

Barry L Lichtenstein

Richard E Lee

Mike S Fulton

Barbara Ann Lee

Timothy John Slegel

Charles W Gainey, Jr

Damian Leo Osisek

Mark S Farrell

Anthony Saporito

Aaron Tsai

Mark Anthony Check

Shyh-Mei Fang Ho

Peter Jeremy Relson

Mike Stephen Fulton

Jenny ChengYin Hung

Benjamin Johnson Sheats

Robert Kent McNeill

An instruction for parsing a buffer to be utilized within a data processing system including: an operation code field, the operation code field identifies the instruction; a control field, the control field controls operation of the instruction; and one or more general registers, wherein a first general register stores an argument address, a second general register stores a function code, a third general register stores length of an argument-character buffer, and the fourth of which contains the address of the function-code data structure.

Parsing-enhancement facility

A single architected instruction to move data is executed. The executing includes moving data of a specified length from a source location to a destination location in a right-to-left sequence to provide a predictable result. A predictable result is provided, even though a portion of the destination location is contained within the source location from which the data is being moved.

Instruction to move data in a right-to-left direction

Provided are a method, system, and article of manufacture for specifying user defined or translator definitions to use to interpret mnemonics in a computer program. A mnemonic is processed in the computer program having a user defined definition and a translator definition. The mnemonic is interpreted according to the user defined definition in response to previously processing a mnemonic command specifying the mnemonic and the user defined definition. The mnemonic is interpreted according to the translator definition in response to previously processing a mnemonic command specifying the mnemonic and the translator definition.

Specifying user defined or translator definitions to use to interpret mnemonics in a computer program

An approach for replacement of instructions in an assembly language program includes computers receiving an assembly language program and user selections of one or more classes of instructions. The approach includes computers reading a statement in the program and selecting a class of instructions from the user selections. The approach includes computers selecting a first group of instructions in the selected class and determining that the statement is an instruction in the first group of instructions. The approach includes computers reading a number of statements that match a number of instructions in the first group of instructions including the statement and replacing the first group of instructions with a group of replacement instructions when the read number of statements match the number of instructions in the first group of instructions. Furthermore, the approach includes computers sending the group of replacement instructions to output to update the assembly language program.

Selective instruction replacement for assembly language programs

External references are resolved in a software compiling and linking environment by identifying a group of related external references and by processing the group of external references until a stopping condition is satisfied. The external references are processed by selecting a next external reference from the group of external references as a current external reference and by resolving the current external reference with a matching definition if a matching definition for the current external reference exists. The stopping condition is designated as being satisfied if either the selected external reference is resolved, or if each external reference in the group of external references has been selected.

Conditional sequential selection of external reference solutions

Conditional sequential selection of external reference resolutions

For efficient computation of results for mathematical functions, a method receives a mathematical function call. The call includes a plurality of arguments for which a range of computable results for the mathematical function of the function call varies with respect to the values for the arguments. The method determines whether executing the mathematical function using the plurality of arguments will produce a result within the range of computable results. The method further aborts the mathematical function call prior to initiating execution of the mathematical function in response to determining that the values for the plurality of arguments produce a result outside the range of computable results.

Efficient and reliable computation of results for mathematical functions

Growing community of inventors

Sunnyvale, CA, United States of America

John Robert Ehrman