Basic direct access method

Basic, in IBM terminology, indicates a lower-level access method that deals with data sets in terms of physical blocks and does not provide either read-ahead, called anticipatory buffering, or synchronization — that is, the user program has to explicitly wait for completion of each input/output event.[2]^: p.31

With BDAM, "the programmer can directly store and retrieve a block by specifying either its actual device address, its relative position within a data set (relative block number), or the relative track within a data set at which the system is to begin a search.[2]^: p.63

BDAM provides no index or structure to the file except as programmed by the application. In many applications, a hashing or randomizing function may be used to assign the block address based on a key in the data. If physical keys are used, the key of the last record within the block must be written as the key for that block.

The BDAM application program interface can be compared with the interface offered by open, read, write and close calls (using file handles) in other operating systems such as Unix and Windows.

BDAM is still supported by IBM as of 2012. Because of its dependence on physical device geometry new IBM direct-access devices used with z/OS emulate IBM 3390 devices regardless of their real physical characteristics.

The programmer specifies DSORG=DA in his Data Control Block (DCB) to indicate use of BDAM. Space can be in up to 16 extents on each volume. The data set (equivalent to a "file") can reside in up to 255 extents across multiple volumes. If the application has a dependency on the space being on contiguous tracks, you can allocate space for the direct data set in contiguous tracks by coding SPACE=(,,CONTIG) on the DD statement.

Direct data sets must be preformatted before use by opening them as output and writing all the blocks sequentially. This can load all "dummy" records or load initial data.[3]

As a basic access method BDAM reads and writes member data in blocks and the I/O operation proceeds asynchronously and must be tested for completion using the CHECK macro.[4] BDAM uses the standard system macros OPEN, CLOSE, READ, WRITE,and CHECK. The READ or WRITE macro instructions must provide the block address or key of the desired record. The CHECK macro has to be used to wait for completion of a specific operation before the data can be accessed or the data buffer reused. It is possible to start multiple input/output operations to run concurrently.

Records in a direct data set can contain user-specified recorded keys of up to 255 bytes—all keys in a file must be the same length. Reads and writes can specify a key in addition to a disk address, and BDAM will search starting at the requested block up to the entire area of the file for a record with a matching key.[2] This allows multiple keys hashing to the same track to be handled automatically by the I/O subsystem.

BDAM accepts disk addresses as either actual device addresses, as relative track addresses, or as relative block numbers.

Device addresses are eight byte fields in the form MBBCCHHR. All subfields are binary numbers.[5]

• M is the extent number for files with more than one extent (non-contiguous files).
• BB is zero. Previously this indicated the bin on an IBM 2321 Data Cell.
• CC is the absolute cylinder number on the device.
• HH is the track (head) number.
• R is the record number on the track. Record zero contains control information for the track and can not be used.

Specifying device addresses makes the dataset unmovable.[2]^: p.106

Relative track addresses are three byte fields in the form TTR. All subfields are binary numbers.

• TT is the relative track number in the file, starting with zero.
• R is the record number on the track.

Relative block numbers are four byte (fullword) binary numbers indicating the block number in the file. The first block is block 0. This form of addressing can only be used with fixed length blocks (RECFM=F).[6]^: p.106

• Count Key Data

• Introduction to IBM Direct-Access Storage Devices and Organization Methods (PDF). IBM. February 1974. GC20-1649-9. Archived from the original (PDF) on 2011-03-22. Retrieved 2012-09-24.