Red Hat, Inc.

Andrew Edward Dinn

Christine H Flood

Mario Torre

Implementations of the present disclosure provide for generating adjacency graph from a series of linear linked data structures. A method of one implementation includes receiving an input of a series of linear linked data structures (links). Each of the plurality of links includes an element among a plurality of elements. The method includes in response to determining that a first instance of a node among a plurality of nodes corresponding to an element among the plurality of elements does not exist in the tree graph, generating the first instance of the node in the tree graph. The method also includes creating an edge directly from a second node to the generated first instance of the node. The second node corresponds to a second element among the plurality of elements that is directly linked to the element. The method further generating an adjacency graph based on traversing of the tree graph.

Generating an adjacency graph from a series of linear linked data structures

A system, method, and techniques for managing memory are provided. An example method includes identifying a plurality of regions in a heap storing one or more objects of a first type and one or more objects of a second type. Each object of the first type includes application data and management data, and the management data is used by a managed runtime to manage the application data. The method also includes determining an object of the first type to read and computing, based on a last-known memory address of the object of the first type, a memory address of an object of the second type storing a current memory address of the object of the first type. The method further includes reading the current memory address stored in the object of the second type and locating the object of the first type at the read memory address.

Non-intrusive storage of garbage collector-specific management data

A method and system for optimizing application code via transformation of calls made by the application code during runtime. A computer system loads the application code that has been intermediately compiled into bytecode. The computer system then compiles and executes the application code. During runtime, the application code makes a call from a call site to an implementation of an operation that returns a value to the application code. The computer system runs an implementer of the implementation and an agent that operates independently of a compiler. The agent receives a notification of the call, performs an analysis on the application code during runtime to determine whether the value is used by the application code, and optimizes the application code by transforming the call site based on a result of the analysis.

Growing community of inventors

Newcastle upon Tyne, United Kingdom

Andrew Edward Dinn