×

Table of contents cache entry having a pointer for a range of addresses

  • US 10,691,600 B2
  • Filed: 11/29/2017
  • Issued: 06/23/2020
  • Est. Priority Date: 09/19/2017
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method of facilitating processing within a computing environment, the computer-implemented method comprising:

  • obtaining an address of a called routine and a pointer value of a pointer to a reference data structure to be entered into a reference data structure pointer cache, the reference data structure pointer cache comprising a plurality of entries, wherein an entry of the plurality of entries includes a stored pointer value for an address range;

    determining, based on the pointer value, whether an existing entry exists in the reference data structure pointer cache for the pointer value; and

    updating, based on determining the existing entry exists, one of an address_from field of the existing entry or an address_to field of the existing entry using the address of the called routine, wherein the stored pointer value of the existing entry is usable to access the reference data structure for the address range defined by the address_from field and the address_to field, and wherein the updating further comprises;

    determining whether the address of the called routine is less than an address in the address_from field; and

    updating the address_from field of the existing entry to the address of the called routine, based on determining the address of the called routine is less than the address of the address_from field.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×