Browse Prior Art Database

A Table Driven Algorithm for Acquiring File Locks

IP.com Disclosure Number: IPCOM000107487D
Original Publication Date: 1992-Feb-01
Included in the Prior Art Database: 2005-Mar-21
Document File: 1 page(s) / 39K

Publishing Venue

IBM

Related People

Moran, CG: AUTHOR [+2]

Abstract

The overhead of obtaining file locks by heavily nested coding methods is solved with a two-table search algorithm which then performs a series of file-locking actions.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

A Table Driven Algorithm for Acquiring File Locks

      The overhead of obtaining file locks by heavily nested coding
methods is solved with a two-table search algorithm which then
performs a series of file-locking actions.

      Figure 1 shows the two table searches performed.  The lock
table search establishes a lock table entry index by setting an index
variable based on the type of lock request, the type of lock
requested, and the dataset type of the file to be locked.  The
strongest lock array search finds the strongest lock array element
based on the strongest lock held.

      With the lock table entry and strongest lock array element, the
program has direct access to the lock flag table setup entry.
Locking actions are performed by testing bits in the lock flag table
set-up entry.

      Disclosed anonymously.