Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Locating a Bit Storage using 370 Assembler

IP.com Disclosure Number: IPCOM000115584D
Original Publication Date: 1995-May-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 2 page(s) / 44K

Publishing Venue

IBM

Related People

Barry, AR: AUTHOR [+2]

Abstract

Many applications utilize a large string of bits in storage to represent status or settings for various reasons. A unique algorithm is proposed to locate a known bit in such a string.

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

Locating a Bit Storage using 370 Assembler

      Many applications utilize a large string of bits in storage to
represent status or settings for various reasons.  A unique algorithm
is proposed to locate a known bit in such a string.

      To utilize the proposed algorithm to check the setting of a bit
in storage, two pieces of information are required:
  o  the location of the bit in the string
  o  a pointer to the bit string

The first example shows how the two required fields relate to the
data, see example (Fig. 1).

      Fig. 2 contains the code necessary to determine the state of
the bit.  The algorithm is straight forward and avoids looping and
shifting to determine the bits location and setting.  Use of this
unique algorithm should improve the clarity of your code and the ease
of access when testing for bits in storage.