International Business Machines Corporation

Lenovo (singapore) Pte. Ltd.

Robert John Donovan

William Jon Schmidt

Robert Ralph Roediger

Cary Lee Bates

Brian John Cragun

Jeffrey Michael Ryan

Daniel Rodman Hicks

Lee Hardy Wilson

Bryan Lester Striemer

Christopher A Peterson

Randall Scott Nelson

Mikko Herman Lipasti

William Jaaskelainen

Javier J Perez

James Albert Kryka

Joseph Patrick Reynolds

Scott Thomas Robinson

Taylor L Schreck

David John Lambert

Roger Wayne Southwick

Patrick Todd Haugen

John C Wingertsman, Iii

Keith Vernon Besaw

Andrew W Wojtowicz

Darrel W Raknerud

Tokunbo Adeshiyan

Paul Lu Verne Godtland

Sherri Lynn McMeeking

Keith V Besaw

Joseph C Lindsay

Judith Trousdell

Shmuel Sagiv

Mark Jonathon Hessler

Footwear

A method, system, and computer-readable storage media for granting a device access to a managed group are disclosed. Identification information may be exchanged between a management device in the managed group and a managed device through a secure first channel. If the identification information is verified by the management device, the managed device may be granted access to the managed group through the secure first channel. If access is granted, the managed device may access the managed group through a secure communication session on a network. If the identification information is not verified, the management device may send a cryptographic key to the managed device through the secure first channel. The cryptographic key may be used to create an encrypted communication session between the managed device and management device over the network.

Trusted system network

A compiler (or interpreter) detects source language instructions performing arithmetic operations using a fixed point format (preferably packed decimal). Where the operation can be performed without loss of precision or violation of other constraints of the source language, the compiler automatically converts the operands to a floating point format (preferably Decimal Floating Point (DFP)) having hardware support, and re-converts results to the original fixed point format. Preferably, the compiler may combine multiple operations and instructions in an expression tree, analyze the tree, and selectively convert where possible. The compiler preferably performs a heuristic cost judgment in determining whether to use a particular conversion.

Apparatus for automatically converting numeric data to a processor efficient format for performing arithmetic operations

A program feature set is compared to a processor feature set. The comparison may be performed in response to restoring the program onto a system or requesting its execution. The processor feature set represents zero, one or more optional hardware features supported by the processor, whereas the program feature set represents zero, one or more optional hardware features the program relies upon in its generated code. Comparison of the feature sets determines whether a particular program may run on a particular processor. Programs may be automatically or manually rebuilt to achieve full compatibility. If the comparison indicates that the program requires a feature not supported by the processor, the program is rebuilt based on the processor feature set. Alternatively, the program may be rebuilt in response to a rebuild request, rather than the comparison. The program is preferably rebuilt from an intermediate representation (IR) stored with or locatable from the program.

Adaptively generating code for a computer program

Method and apparatus for automatically converting numeric data to a processor efficient format for performing arithmetic operations

Apparatus and a method are provided for defining visibility boundaries in compiled code of an optimizing compiler used with a digital computer for converting a source program to an object code. The source program is received and a first intermediate representation of the source program is generated. A pseudo operation representing a predetermined event is inserted in the first intermediate representation. Sequential operations of the first intermediate representation including the inserted pseudo operations are processed for defining an internal data structure of the source program. A visibility boundary for a selected variable is identified responsive to identifying a pseudo operation in the first intermediate representation.

Optimizing apparatus and method for defining visibility boundaries in

A compiler and method of compiling provide enhanced performance by inlining one or more frequently executed paths through a child procedure into a parent procedure without inlining the entire child procedure. Accordingly, a substantial improvement in speed of execution of the program can be achieved by reducing procedure call overhead, with reduced expense in terms of program size as compared to traditional inlining. Various criteria for determining whether to inline particular child procedures are also described.

Profile driven optimization of frequently executed paths with inlining

A method and apparatus allows a compiler to optimize code in the presence of exception handlers. According to a first embodiment, arcs are added to a control flow graph, prior to performing global optimizations, to account for exception handling code. According to the second embodiment, information relating to control flow to exception handlers is provided in pseudo-references in the code, which allows the compiler to determine how to appropriately optimize the code.

Method and apparatus for enabling global compiler optimizations in the

An aliasing method and apparatus carried out on a digital computer are provided for generating an object code from a source program. An aliasing data structure is defined and includes an initial empty check-list for each variable in the source program. A pseudo variable is constructed to represent each predefined large alias class. The pseudo variable is attached to the check-list of each variable included in the predefined alias class. Inverse alias checking upon use of a variable is provided using the check-lists for the variable.

Complier and method for alias checking in a complier

Three separate methods are used to provide the user with sounds that help the user understand where a particular current position is relative to a 'location of interest' (LOI) within the viewable object. First, the user is able to use sound marks to mark specific LOIs within viewable objects so that the user may return to those LOIs at a later time. Second, the user is provided with view regions which aurally indicate the LOS of frequeuntly used portions of the viewable object. Lastly, the user is given an aural indication of the current position of the position identifier relative to the viewable object as a whole. This is called relational positioning. Each type of aural LOI indication can be presented to the user regardless of how the user is moving through the viewable object.

Aural position indicating mechanism for viewable objects

Growing community of inventors

Rochester, MN, United States of America

Robert John Donovan