Data Definition Language (DDL) Reference Manual

SPI Tokens
Data Definition Language (DDL) Reference Manual—529431-004
7-18
TOKEN-MAP Statement Output
•
A substructure containing only bit fields always starts and ends on a word
boundary, padded with implicit bit fillers when necessary. Such a substructure is
always an even number of bytes long, which conforms to how the C, Pascal (on D-
series systems), pTAL, and TAL compilers allocate space for structures containing
bit maps.
TOKEN-MAP Statement Output
If you request C, COBOL, Pascal (on D-series systems), pTAL, TACL, or TAL source-
code output, the DDL compiler generates compatible data structures for the token map
for the requested language. The SPI routines use these data structures to construct
and access the specified extensible structured token.
The DDL compiler replaces any hyphen in the DDL map name with a circumflex (^) in
a pTAL, TAL, or TACL map name, and an underscore (_) in a C or Pascal (on D-series
systems) map name.
Table 7-1. DDL Data Structures Generated for Token Maps
Language Data Structure
C
static int map_name = {v1,v2,...,vn};
For the C data structure, each element in the static integer array is the
value of one word in the token map.
COBOL
01 map-name.
02 FILLER NATIVE-2 VALUE v1.
02 FILLER NATIVE-2 VALUE v2.
...
02 FILLER NATIVE-2 VALUE vn.
END
For the COBOL data structure, each FILLER element specifies the value of
one word in the token map.
Pascal
(on D-series
systems)
VAR map_name : ARRAY [1..n] OF INT16 := [v1, v2,
..., vn];
For the Pascal data structure, each element in the integer array is the value
of one word in the token map.