US 12,487,982 B2
Fast reuse of locking data structures prior to movement of entries to a cache free list
Francisco Rafael Flores Michel, Belmont, CA (US); Andrew Stuart Ingham, Romsey (GB); Wilson Wai Shun Chan, San Francisco, CA (US); and Yu Kin Ho, Fremont, CA (US)
Assigned to Oracle International Corporation, Redwood Shores (CA)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Apr. 29, 2024, as Appl. No. 18/649,899.
Prior Publication US 2025/0335419 A1, Oct. 30, 2025
Int. Cl. G06F 16/23 (2019.01); G06F 16/2455 (2019.01); G06F 16/25 (2019.01)
CPC G06F 16/2343 (2019.01) [G06F 16/24562 (2019.01); G06F 16/256 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
maintaining a resource table having multiple buckets, wherein each bucket corresponds to a latch and comprises a resource list and a recycle list;
receiving a lock request for a lock on a resource; and
processing the lock request at least by:
taking a latch on a bucket corresponding to the lock request, and
allocating an entry for the resource using the latch by moving the entry from a corresponding recycle list in the bucket to a corresponding resource list in the bucket.