18167001. PAGE-IN LINKING simplified abstract (Apple Inc.)

From WikiPatents
Jump to navigation Jump to search

PAGE-IN LINKING

Organization Name

Apple Inc.

Inventor(s)

Louis G. Gerbarg of Saratoga CA (US)

Joseph J. Bonasera of San Francisco CA (US)

Davide Italiano of San Francisco CA (US)

Nick Kledzik of Cupertino CA (US)

Peter Cooper of San Jose CA (US)

Mohamadou A. Abdoulaye of San Francisco CA (US)

PAGE-IN LINKING - A simplified explanation of the abstract

This abstract first appeared for US patent application 18167001 titled 'PAGE-IN LINKING

Simplified Explanation

Abstract: A dynamic linking system is described that can resolve symbol references of executable code as the code is paged into virtual memory. The system includes a dynamic linker in the operating system that uses metadata in the pages to identify symbol references. The dynamic linker generates a compact data structure containing the symbol references and sends it to the kernel for resolution. The kernel resolves the symbol references by determining pointer values for the symbols, which can be used to point to code or values. The resolved symbol references are stored in the data structure.

  • The patent describes a dynamic linking system that resolves symbol references of executable code as it is paged into virtual memory.
  • The system includes a dynamic linker in the operating system that uses metadata in the pages to identify symbol references.
  • The dynamic linker generates a compact data structure containing the symbol references.
  • The data structure and other relevant data are sent to the kernel for resolution of the symbol references.
  • The kernel resolves the symbol references by determining pointer values for the symbols.
  • The resolved symbol references are stored in the data structure.

Potential Applications:

  • Operating systems that use dynamic linking for efficient execution of executable code.
  • Systems that rely on shared libraries for code reuse and modularity.

Problems Solved:

  • Efficient resolution of symbol references in executable code as it is paged into virtual memory.
  • Simplification of the dynamic linking process by generating a compact data structure for symbol references.

Benefits:

  • Improved performance and efficiency in resolving symbol references.
  • Reduced memory usage due to the compact data structure.
  • Simplified dynamic linking process for developers.


Original Abstract Submitted

A dynamic linking system can be designed to dynamically resolve symbol references of pages associated with executable code as the pages are paged into virtual memory. The operating system can include a dynamic linker that uses metadata in the pages to determine symbol references that reference other code or values. Other code can include code in shared libraries. The dynamic linker can generate a data structure containing the symbol references in a small and dense format. The dynamic linker can send the data structure and other relevant data to the kernel once the symbol references have been identified. The kernel can perform the functions related to resolving the symbol references. For example, the kernel can resolve the symbol by determining a pointer value for the symbol, wherein the pointer value can be used to point to code or values. The kernel can resolve the symbol references and store the data structure, which contains the resolved symbol references.