Browse Prior Art Database

XREF Browse Program

IP.com Disclosure Number: IPCOM000050100D
Original Publication Date: 1982-Sep-01
Included in the Prior Art Database: 2005-Feb-10
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Kellerman, E: AUTHOR

Abstract

The XREF Browse program permits interactive browsing of the file that cross references the indices of digital logic elements and their names.

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

Page 1 of 1

XREF Browse Program

The XREF Browse program permits interactive browsing of the file that cross references the indices of digital logic elements and their names.

The XREF Browse program is coded in APL and assembler. Some of the techniques used in the APL code are: Storing data which is logically one entity in several

variables. Thus, the APL primitives are used to perform

array operations on optimum-sized data items. The names of

these variables are created dynamically.

By storing the XREF into many optimum-sized variables, it is

possible to determine which of the variables includes the

name of interest, and then to perform array operations on

that specific variable.

Use of programs that create customized APL functions "on the

fly." This is somewhat similar to compiling APL. The

standard method of selecting data with a general purpose

program is considerably slower.

Use of an auxiliary processor that determines the

characteristics of data sets to be processed prior to

accessing them with APL. Using this APL, the APL programs

can quickly determine whether enough core is available,

whether the symbol table is large enough, etc., as well as

being able to give the user an estimate of processing time,

and if additional core required (if necessary).

Features of the XREF Browse programs are:

Masking out from the display unwanted records through the

use of masks.

Counting records that meet criteria specified by the masks.

1