COMPILATION LISTING OF SEGMENT scan_token_table Compiled by: Multics PL/I Compiler, Release 32c, of June 16, 1989 Compiled at: Bull HN, Phoenix AZ, System-M Compiled on: 07/31/89 1407.2 mst Mon Options: optimize map 1 /* *********************************************************** 2* * * 3* * Copyright, (C) Honeywell Information Systems Inc., 1982 * 4* * * 5* * Copyright (c) 1972 by Massachusetts Institute of * 6* * Technology and Honeywell Information Systems, Inc. * 7* * * 8* *********************************************************** */ 9 10 11 /* SCAN_TOKEN_TABLE - Program to check for duplicate declarations. */ 12 13 /* Modified Dec 1978 by David Spector to fix bug 1784 */ 14 15 scan_token_table: 16 procedure; 17 18 /* automatic */ 19 20 dcl (p,q,q1,q2,q3) pointer; 21 dcl i fixed bin; 22 23 /* builtins */ 24 25 dcl (hbound, lbound, null) builtin; 26 27 /* include files */ 28 1 1 /* BEGIN INCLUDE FILE ... declare_type.incl.pl1 */ 1 2 1 3 /* Modified: 25 Apr 1979 by PCK to implement 4-bit decimal */ 1 4 1 5 dcl ( by_declare initial("001"b), 1 6 by_explicit_context initial("010"b), 1 7 by_context initial("011"b), 1 8 by_implication initial("100"b), 1 9 by_compiler initial("101"b)) int static bit(3) aligned options(constant); 1 10 1 11 /* END INCLUDE FILE ... declare_type.incl.pl1 */ 29 2 1 /****^ ********************************************************* 2 2* * * 2 3* * Copyright, (C) BULL HN Information Systems Inc., 1989 * 2 4* * * 2 5* ********************************************************* */ 2 6 2 7 /* BEGIN INCLUDE FILE ... language_utility.incl.pl1 */ 2 8 2 9 2 10 /****^ HISTORY COMMENTS: 2 11* 1) change(89-07-10,RWaters), approve(89-07-10,MCR8118), audit(89-07-19,Vu), 2 12* install(89-07-31,MR12.3-1066): 2 13* Removed the obsolete parameter source_line from the dcl of error_(). 2 14* END HISTORY COMMENTS */ 2 15 2 16 /* Modified: 6 Jun 1979 by PG to add rank and byte 2 17* * Modified: 9 Jul 1989 by RW updated the declaration of error_ 2 18* */ 2 19 2 20 declare adjust_count entry(pointer); 2 21 /* parameter 1: (input) any node pointer */ 2 22 2 23 declare bindec entry(fixed bin(31)) reducible 2 24 returns(character(12) aligned); 2 25 /* parameter 1: (input) bin value */ 2 26 /* return: (output) character value with blanks */ 2 27 2 28 declare bindec$vs entry(fixed bin(31)) reducible 2 29 returns(character(12) aligned varying); 2 30 /* parameter 1: (input) binary value */ 2 31 /* return: (output) char value without blanks */ 2 32 2 33 declare binoct entry(fixed bin(31)) reducible 2 34 returns(char(12) aligned); 2 35 /* parameter 1: (input) binary value */ 2 36 /* return: (output) char value with blanks */ 2 37 2 38 declare binary_to_octal_string entry(fixed bin(31)) reducible 2 39 returns(char(12) aligned); 2 40 /* parameter 1: (input) binary value */ 2 41 /* return: (output) right-aligned char value */ 2 42 2 43 declare binary_to_octal_var_string entry(fixed bin(31)) reducible 2 44 returns(char(12) varying aligned); 2 45 /* parameter 1: (input) binary value */ 2 46 /* returns: (output) char value without blanks */ 2 47 2 48 declare compare_expression entry(pointer,pointer) reducible 2 49 returns(bit(1) aligned); 2 50 /* parameter 1: (input) any node pointer */ 2 51 /* parameter 2: (input) any node pointer */ 2 52 /* return: (output) compare bit */ 2 53 2 54 declare constant_length entry (pointer, fixed bin (71)) 2 55 returns (bit (1) aligned); 2 56 /* parameter 1: (input) reference node pointer */ 2 57 /* parameter 2: (input) value of constant length */ 2 58 /* return: (output) "1"b if constant length */ 2 59 2 60 declare convert entry(pointer,bit(36) aligned) 2 61 returns(pointer); 2 62 /* parameter 1: (input) any node pointer */ 2 63 /* parameter 2: (input) target type */ 2 64 /* return: (output) target value tree pointer */ 2 65 2 66 declare convert$to_integer entry(pointer,bit(36)aligned) 2 67 returns(pointer); 2 68 /* parameter 1: (input) any node pointer */ 2 69 /* parameter 2: (input) target type */ 2 70 /* return: (output) target value tree pointer */ 2 71 2 72 declare convert$from_builtin entry(pointer,bit(36) aligned) 2 73 returns(pointer); 2 74 /* parameter 1: (input) any node pointer */ 2 75 /* parameter 2: (input) target type */ 2 76 /* return: (output) target value tree pointer */ 2 77 2 78 declare convert$validate entry(pointer,pointer); 2 79 /* parameter 1: (input) source value tree pointer */ 2 80 /* parameter 2: (input) target reference node pointer */ 2 81 2 82 declare convert$to_target_fb entry(pointer,pointer) 2 83 returns(pointer); 2 84 /* parameter 1: (input) source value tree pointer */ 2 85 /* parameter 2: (input) target reference node pointer */ 2 86 /* return: (output) target value tree pointer */ 2 87 2 88 declare convert$to_target entry(pointer,pointer) 2 89 returns(pointer); 2 90 /* parameter 1: (input) source value tree pointer */ 2 91 /* parameter 2: (input) target reference node pointer */ 2 92 /* return: (output) target value tree pointer */ 2 93 2 94 declare copy_expression entry(pointer unaligned) 2 95 returns(pointer); 2 96 /* parameter 1: (input) any node pointer */ 2 97 /* return: (output) any node pointer */ 2 98 2 99 declare copy_expression$copy_sons entry(pointer,pointer); 2 100 /* parameter 1: (input) father symbol node pointer */ 2 101 /* parameter 2: (input) stepfather symbol node ptr */ 2 102 2 103 declare copy_unique_expression entry(pointer) 2 104 returns(pointer); 2 105 /* parameter 1: (input) any node pointer */ 2 106 /* return: (output) any node pointer */ 2 107 2 108 declare create_array entry() 2 109 returns(pointer); 2 110 /* return: (output) array node pointer */ 2 111 2 112 declare create_block entry(bit(9) aligned,pointer) 2 113 returns(pointer); 2 114 /* parameter 1: (input) block type */ 2 115 /* parameter 2: (input) father block node pointer */ 2 116 /* return: (output) block node pointer */ 2 117 2 118 declare create_bound entry() 2 119 returns(pointer); 2 120 /* return: (output) bound node pointer */ 2 121 2 122 declare create_context entry(pointer,pointer) 2 123 returns(pointer); 2 124 /* parameter 1: (input) block node pointer */ 2 125 /* parameter 2: (input) token pointer */ 2 126 /* return: (output) context node pointer */ 2 127 2 128 declare create_cross_reference entry() 2 129 returns(pointer); 2 130 /* return: (output) cross reference node pointer */ 2 131 2 132 declare create_default entry 2 133 returns(pointer); 2 134 /* return: (output) default node pointer */ 2 135 2 136 declare create_identifier entry() 2 137 returns(pointer); 2 138 /* return: (output) token node pointer */ 2 139 2 140 declare create_label entry(pointer,pointer,bit(3) aligned) 2 141 returns(pointer); 2 142 /* parameter 1: (input) block node pointer */ 2 143 /* parameter 2: (input) token node pointer */ 2 144 /* parameter 3: (input) declare type */ 2 145 /* return: (output) label node pointer */ 2 146 2 147 declare create_list entry(fixed bin(15)) 2 148 returns(pointer); 2 149 /* parameter 1: (input) number of list elements */ 2 150 /* return: (output) list node pointer */ 2 151 2 152 declare create_operator entry(bit(9) aligned,fixed bin(15)) 2 153 returns(pointer); 2 154 /* parameter 1: (input) operator type */ 2 155 /* parameter 2: (input) number of operands */ 2 156 /* return: (output) operator node pointer */ 2 157 2 158 declare create_reference entry(pointer) 2 159 returns(pointer); 2 160 /* parameter 1: (input) symbol node pointer */ 2 161 /* return: (output) reference node pointer */ 2 162 2 163 declare create_statement entry(bit(9) aligned,pointer,pointer,bit(12) aligned) 2 164 returns(pointer); 2 165 /* parameter 1: (input) statement type */ 2 166 /* parameter 2: (input) block node pointer */ 2 167 /* parameter 3: (input) label node pointer */ 2 168 /* parameter 4: (input) conditions */ 2 169 /* return: (output) statement node pointer */ 2 170 2 171 declare create_statement$prologue entry(bit(9) aligned,pointer,pointer,bit(12) aligned) 2 172 returns(pointer); 2 173 /* parameter 1: (input) statement type */ 2 174 /* parameter 2: (input) block node pointer */ 2 175 /* parameter 3: (input) label node pointer */ 2 176 /* parameter 4: (input) conditions */ 2 177 /* return: (output) statement node pointer */ 2 178 2 179 declare create_storage entry(fixed bin(15)) 2 180 returns(pointer); 2 181 /* parameter 1: (input) number of words */ 2 182 /* return: (output) storage block pointer */ 2 183 2 184 declare create_symbol entry(pointer,pointer,bit(3) aligned) 2 185 returns(pointer); 2 186 /* parameter 1: (input) block node pointer */ 2 187 /* parameter 2: (input) token node pointer */ 2 188 /* parameter 3: (input) declare type */ 2 189 /* return: (output) symbol node pointer */ 2 190 2 191 declare create_token entry (character (*), bit (9) aligned) 2 192 returns (ptr); 2 193 /* parameter 1: (input) token string */ 2 194 /* parameter 2: (input) token type */ 2 195 /* return: (output) token node ptr */ 2 196 2 197 declare create_token$init_hash_table entry (); 2 198 2 199 declare create_token$protected entry (char (*), bit (9) aligned, bit (18) aligned) 2 200 returns (ptr); 2 201 /* parameter 1: (input) token string */ 2 202 /* parameter 2: (input) token type */ 2 203 /* parameter 3: (input) protected flag */ 2 204 /* return: (output) token node ptr */ 2 205 2 206 declare decbin entry(character(*) aligned) reducible 2 207 returns(fixed bin(31)); 2 208 /* parameter 1: (input) decimal character string */ 2 209 /* return: (output) binary value */ 2 210 2 211 declare declare_constant entry(bit(*) aligned,bit(36) aligned,fixed bin(31),fixed bin(15)) 2 212 returns(pointer); 2 213 /* parameter 1: (input) value */ 2 214 /* parameter 2: (input) type */ 2 215 /* parameter 3: (input) size */ 2 216 /* parameter 4: (input) scale */ 2 217 /* return: (output) reference node pointer */ 2 218 2 219 declare declare_constant$bit entry(bit(*) aligned) 2 220 returns(pointer); 2 221 /* parameter 1: (input) bit */ 2 222 /* return: (output) reference node pointer */ 2 223 2 224 declare declare_constant$char entry(character(*) aligned) 2 225 returns(pointer); 2 226 /* parameter 1: (input) character */ 2 227 /* return: (output) reference node pointer */ 2 228 2 229 declare declare_constant$desc entry(bit(*) aligned) 2 230 returns(pointer); 2 231 /* parameter 1: (input) descriptor bit value */ 2 232 /* return: (output) reference node pointer */ 2 233 2 234 declare declare_constant$integer entry(fixed bin(31)) /* note...should really be fixed bin(24) */ 2 235 returns(pointer); 2 236 /* parameter 1: (input) integer */ 2 237 /* return: (output) reference node pointer */ 2 238 2 239 declare declare_descriptor entry(pointer,pointer,pointer,pointer,bit(2) aligned) 2 240 returns(pointer); 2 241 /* parameter 1: (input) block node pointer */ 2 242 /* parameter 2: (input) statement node pointer */ 2 243 /* parameter 3: (input) symbol node pointer */ 2 244 /* parameter 4: (input) loc pointer */ 2 245 /* parameter 5: (input) array descriptor bit 2 246* cross_section bit */ 2 247 /* return: (output) reference node pointer */ 2 248 2 249 declare declare_descriptor$ctl entry(pointer,pointer,pointer,pointer,bit(2) aligned) 2 250 returns(pointer); 2 251 /* parameter 1: (input) block node pointer */ 2 252 /* parameter 2: (input) statement node pointer */ 2 253 /* parameter 3: (input) symbol node pointer */ 2 254 /* parameter 4: (input) loc pointer */ 2 255 /* parameter 5: (input) array descriptor bit 2 256* cross_section bit */ 2 257 /* return: (output) reference node pointer */ 2 258 2 259 declare declare_descriptor$param entry(pointer,pointer,pointer,pointer,bit(2) aligned) 2 260 returns(pointer); 2 261 /* parameter 1: (input) block node pointer */ 2 262 /* parameter 2: (input) statement node pointer */ 2 263 /* parameter 3: (input) symbol node pointer */ 2 264 /* parameter 4: (input) loc pointer */ 2 265 /* parameter 5: (input) array descriptor bit 2 266* cross_section bit */ 2 267 /* return: (output) reference node pointer */ 2 268 2 269 declare declare_integer entry(pointer) 2 270 returns(pointer); 2 271 /* parameter 1: (input) block node pointer */ 2 272 /* return: (output) reference node pointer */ 2 273 2 274 declare declare_picture entry(char(*)aligned,pointer,fixed bin(15)); 2 275 /* parameter 1: (input) picture string */ 2 276 /* parameter 2: (input) symbol node pointer */ 2 277 /* parameter 3: (output) error code, if any */ 2 278 2 279 declare declare_picture_temp entry(char(*) aligned,fixed bin(31),bit(1) aligned,bit(1) aligned) 2 280 returns(pointer); 2 281 /* parameter 1: (input) picture string */ 2 282 /* parameter 2: (input) scalefactor of picture */ 2 283 /* parameter 3: (input) ="1"b => complex picture */ 2 284 /* parameter 4: (input) ="1"b => unaligned temp */ 2 285 /* return: (output) reference node pointer */ 2 286 2 287 declare declare_pointer entry(pointer) 2 288 returns(pointer); 2 289 /* parameter 1: (input) block node pointer */ 2 290 /* return: (output) reference node pointer */ 2 291 2 292 declare declare_temporary entry(bit(36) aligned,fixed bin(31),fixed bin(15),pointer) 2 293 returns(pointer); 2 294 /* parameter 1: (input) type */ 2 295 /* parameter 2: (input) precision */ 2 296 /* parameter 3: (input) scale */ 2 297 /* parameter 4: (input) length */ 2 298 /* return: (output) reference node pointer */ 2 299 2 300 declare decode_node_id entry(pointer,bit(1) aligned) 2 301 returns(char(120) varying); 2 302 /* parameter 1: (input) node pointer */ 2 303 /* parameter 2: (input) ="1"b => capitals */ 2 304 /* return: (output) source line id */ 2 305 2 306 declare decode_source_id entry( 3 1 1 structure unaligned, 3 2 2 /* file_number */ bit(8), 3 3 2 /* line_number */ bit(14), 3 4 2 /* stmt_number */ bit(5), 2 307 2 308 bit(1) aligned) 2 309 returns(char(120) varying); 2 310 /* parameter 1: (input) source id */ 2 311 /* parameter 2: (input) ="1"b => capitals */ 2 312 /* return: (output) source line id */ 2 313 2 314 declare error entry(fixed bin(15),pointer,pointer); 2 315 /* parameter 1: (input) error number */ 2 316 /* parameter 2: (input) statement node pointer or null*/ 2 317 /* parameter 3: (input) token node pointer */ 2 318 2 319 declare error$omit_text entry(fixed bin(15),pointer,pointer); 2 320 /* parameter 1: (input) error number */ 2 321 /* parameter 2: (input) statement node pointer or null*/ 2 322 /* parameter 3: (input) token node pointer */ 2 323 2 324 declare error_ entry(fixed bin(15), 4 1 1 structure unaligned, 4 2 2 /* file_number */ bit(8), 4 3 2 /* line_number */ bit(14), 4 4 2 /* stmt_number */ bit(5), 2 325 2 326 pointer,fixed bin(8),fixed bin(23),fixed bin(11)); 2 327 /* parameter 1: (input) error number */ 2 328 /* parameter 2: (input) statement id */ 2 329 /* parameter 3: (input) any node pointer */ 2 330 /* parameter 4: (input) source segment */ 2 331 /* parameter 5: (input) source starting character */ 2 332 /* parameter 6: (input) source length */ 2 333 2 334 declare error_$no_text entry(fixed bin(15), 5 1 1 structure unaligned, 5 2 2 /* file_number */ bit(8), 5 3 2 /* line_number */ bit(14), 5 4 2 /* stmt_number */ bit(5), 2 335 2 336 pointer); 2 337 /* parameter 1: (input) error number */ 2 338 /* parameter 2: (input) statement id */ 2 339 /* parameter 3: (input) any node pointer */ 2 340 2 341 declare error_$initialize_error entry(); 2 342 2 343 declare error_$finish entry(); 2 344 2 345 declare free_node entry(pointer); 2 346 /* parameter 1: any node pointer */ 2 347 2 348 declare get_array_size entry(pointer,fixed bin(3)); 2 349 /* parameter 1: (input) symbol node pointer */ 2 350 /* parameter 2: (input) units */ 2 351 2 352 declare get_size entry(pointer); 2 353 /* parameter 1: (input) symbol node pointer */ 2 354 2 355 declare merge_attributes external entry(pointer,pointer) 2 356 returns(bit(1) aligned); 2 357 /* parameter 1: (input) target symbol node pointer */ 2 358 /* parameter 2: (input) source symbol node pointer */ 2 359 /* return: (output) "1"b if merge was unsuccessful */ 2 360 2 361 declare optimizer entry(pointer); 2 362 /* parameter 1: (input) root pointer */ 2 363 2 364 declare parse_error entry(fixed bin(15),pointer); 2 365 /* parameter 1: (input) error number */ 2 366 /* parameter 2: (input) any node pointer */ 2 367 2 368 declare parse_error$no_text entry(fixed bin(15),pointer); 2 369 /* parameter 1: (input) error number */ 2 370 /* parameter 2: (input) any node pointer */ 2 371 2 372 declare pl1_error_print$write_out 2 373 entry(fixed bin(15), 6 1 1 structure unaligned, 6 2 2 /* file_number */ bit(8), 6 3 2 /* line_number */ bit(14), 6 4 2 /* stmt_number */ bit(5), 2 374 2 375 pointer,fixed bin(11),fixed bin(31),fixed bin(31),fixed bin(15)); 2 376 /* parameter 1: (input) error number */ 2 377 /* parameter 2: (input) statement identification */ 2 378 /* parameter 3: (input) any node pointer */ 2 379 /* parameter 4: (input) source segment */ 2 380 /* parameter 5: (input) source character index */ 2 381 /* parameter 6: (input) source length */ 2 382 /* parameter 7: (input) source line */ 2 383 2 384 declare pl1_error_print$listing_segment 2 385 entry(fixed bin(15), 7 1 1 structure unaligned, 7 2 2 /* file_number */ bit(8), 7 3 2 /* line_number */ bit(14), 7 4 2 /* stmt_number */ bit(5), 2 386 2 387 pointer); 2 388 /* parameter 1: (input) error number */ 2 389 /* parameter 2: (input) statement identification */ 2 390 /* parameter 3: (input) token node pointer */ 2 391 2 392 declare pl1_print$varying entry(character(*) aligned varying); 2 393 /* parameter 1: (input) string */ 2 394 2 395 declare pl1_print$varying_nl entry(character(*) aligned varying); 2 396 /* parameter 1: (input) string */ 2 397 2 398 declare pl1_print$non_varying entry(character(*) aligned,fixed bin(31)); 2 399 /* parameter 1: (input) string */ 2 400 /* parameter 2: (input) string length or 0 */ 2 401 2 402 declare pl1_print$non_varying_nl entry(character(*) aligned,fixed bin(31)); 2 403 /* parameter 1: (input) string */ 2 404 /* parameter 2: (input) string length or 0 */ 2 405 2 406 declare pl1_print$string_pointer entry(pointer,fixed bin(31)); 2 407 /* parameter 1: (input) string pointer */ 2 408 /* parameter 2: (input) string size */ 2 409 2 410 declare pl1_print$string_pointer_nl entry(pointer,fixed bin(31)); 2 411 /* parameter 1: (input) string pointer */ 2 412 /* parameter 2: (input) string length or 0 */ 2 413 2 414 declare pl1_print$unaligned_nl entry(character(*) unaligned,fixed bin(31)); 2 415 /* parameter 1: (input) string */ 2 416 /* parameter 2: (input) length */ 2 417 2 418 declare pl1_print$for_lex entry (ptr, fixed bin (14), fixed bin (21), fixed bin (21), bit (1) aligned, bit (1) aligned); 2 419 /* parameter 1: (input) ptr to base of source segment */ 2 420 /* parameter 2: (input) line number */ 2 421 /* parameter 3: (input) starting offset in source seg */ 2 422 /* parameter 4: (input) number of chars to copy */ 2 423 /* parameter 5: (input) ON iff shd print line number */ 2 424 /* parameter 6: (input) ON iff line begins in comment */ 2 425 2 426 declare refer_extent entry(pointer,pointer); 2 427 /* parameter 1: (input/output) null,ref node,op node pointer */ 2 428 /* parameter 2: (input) null,ref node,op node pointer */ 2 429 2 430 declare reserve$clear entry() 2 431 returns(pointer); 2 432 /* return: (output) pointer */ 2 433 2 434 declare reserve$declare_lib entry(fixed bin(15)) 2 435 returns(pointer); 2 436 /* parameter 1: (input) builtin function number */ 2 437 /* return: (output) pointer */ 2 438 2 439 declare reserve$read_lib entry(fixed bin(15)) 2 440 returns(pointer); 2 441 /* parameter 1: (input) builtin function number */ 2 442 /* return: (output) pointer */ 2 443 2 444 declare semantic_translator entry(); 2 445 2 446 declare semantic_translator$abort entry(fixed bin(15),pointer); 2 447 /* parameter 1: (input) error number */ 2 448 /* parameter 2: (input) any node pointer */ 2 449 2 450 declare semantic_translator$error entry(fixed bin(15),pointer); 2 451 /* parameter 1: (input) error number */ 2 452 /* parameter 2: (input) any node pointer */ 2 453 2 454 declare share_expression entry(ptr) 2 455 returns(ptr); 2 456 /* parameter 1: (input) usually operator node pointer */ 2 457 /* return: (output) tree pointer or null */ 2 458 2 459 declare token_to_binary entry(ptr) reducible 2 460 returns(fixed bin(31)); 2 461 /* parameter 1: (input) token node pointer */ 2 462 /* return: (output) converted binary value */ 2 463 2 464 /* END INCLUDE FILE ... language_utility.incl.pl1 */ 30 8 1 /* BEGIN INCLUDE FILE ... nodes.incl.pl1 */ 8 2 8 3 /* Modified: 26 Dec 1979 by PCK to implement by name assignment */ 8 4 8 5 dcl ( block_node initial("000000001"b), 8 6 statement_node initial("000000010"b), 8 7 operator_node initial("000000011"b), 8 8 reference_node initial("000000100"b), 8 9 token_node initial("000000101"b), 8 10 symbol_node initial("000000110"b), 8 11 context_node initial("000000111"b), 8 12 array_node initial("000001000"b), 8 13 bound_node initial("000001001"b), 8 14 format_value_node initial("000001010"b), 8 15 list_node initial("000001011"b), 8 16 default_node initial("000001100"b), 8 17 machine_state_node initial("000001101"b), 8 18 source_node initial("000001110"b), 8 19 label_node initial("000001111"b), 8 20 cross_reference_node initial("000010000"b), 8 21 sf_par_node initial("000010001"b), 8 22 temporary_node initial("000010010"b), 8 23 label_array_element_node initial("000010011"b), 8 24 by_name_agg_node initial("000010100"b)) 8 25 bit(9) internal static aligned options(constant); 8 26 8 27 dcl 1 node based aligned, 8 28 2 type unal bit(9), 8 29 2 source_id unal structure, 8 30 3 file_number bit(8), 8 31 3 line_number bit(14), 8 32 3 statement_number bit(5); 8 33 8 34 /* END INCLUDE FILE ... nodes.incl.pl1 */ 31 9 1 /* BEGIN INCLUDE FILE ... pl1_token_hash_table.incl.pl1 */ 9 2 9 3 declare 1 hash_table_structure aligned based (pl1_stat_$hash_table_ptr), 9 4 2 hash_table (0:630) ptr unaligned; 9 5 9 6 declare pl1_stat_$hash_table_ptr ptr external static; 9 7 9 8 /* END INCLUDE FILE ... pl1_token_hash_table.incl.pl1 */ 32 10 1 /* BEGIN INCLUDE FILE ... symbol.incl.pl1 */ 10 2 10 3 dcl 1 symbol based aligned, 10 4 2 node_type bit(9) unal, 10 5 2 source_id structure unal, 10 6 3 file_number bit(8), 10 7 3 line_number bit(14), 10 8 3 statement_number bit(5), 10 9 2 location fixed(18) unal unsigned, 10 10 2 allocated bit(1) unal, 10 11 2 dcl_type bit(3) unal, 10 12 2 reserved bit(6) unal, 10 13 2 pix unal, 10 14 3 pic_fixed bit(1) unal, 10 15 3 pic_float bit(1) unal, 10 16 3 pic_char bit(1) unal, 10 17 3 pic_scale fixed(7) unal, 10 18 3 pic_size fixed(7) unal, 10 19 2 level fixed(8) unal, 10 20 2 boundary fixed(3) unal, 10 21 2 size_units fixed(3) unal, 10 22 2 scale fixed(7) unal, 10 23 2 runtime bit(18) unal, 10 24 2 runtime_offset bit(18) unal, 10 25 2 block_node ptr unal, 10 26 2 token ptr unal, 10 27 2 next ptr unal, 10 28 2 multi_use ptr unal, 10 29 2 cross_references ptr unal, 10 30 2 initial ptr unal, 10 31 2 array ptr unal, 10 32 2 descriptor ptr unal, 10 33 2 equivalence ptr unal, 10 34 2 reference ptr unal, 10 35 2 general ptr unal, 10 36 2 father ptr unal, 10 37 2 brother ptr unal, 10 38 2 son ptr unal, 10 39 2 word_size ptr unal, 10 40 2 bit_size ptr unal, 10 41 2 dcl_size ptr unal, 10 42 2 symtab_size ptr unal, 10 43 2 c_word_size fixed(24), 10 44 2 c_bit_size fixed(24), 10 45 2 c_dcl_size fixed(24), 10 46 10 47 2 attributes structure aligned, 10 48 3 data_type structure unal, 10 49 4 structure bit(1) , 10 50 4 fixed bit(1), 10 51 4 float bit(1), 10 52 4 bit bit(1), 10 53 4 char bit(1), 10 54 4 ptr bit(1), 10 55 4 offset bit(1), 10 56 4 area bit(1), 10 57 4 label bit(1), 10 58 4 entry bit(1), 10 59 4 file bit(1), 10 60 4 arg_descriptor bit(1), 10 61 4 storage_block bit(1), 10 62 4 explicit_packed bit(1), /* options(packed) */ 10 63 4 condition bit(1), 10 64 4 format bit(1), 10 65 4 builtin bit(1), 10 66 4 generic bit(1), 10 67 4 picture bit(1), 10 68 10 69 3 misc_attributes structure unal, 10 70 4 dimensioned bit(1), 10 71 4 initialed bit(1), 10 72 4 aligned bit(1), 10 73 4 unaligned bit(1), 10 74 4 signed bit(1), 10 75 4 unsigned bit(1), 10 76 4 precision bit(1), 10 77 4 varying bit(1), 10 78 4 local bit(1), 10 79 4 decimal bit(1), 10 80 4 binary bit(1), 10 81 4 real bit(1), 10 82 4 complex bit(1), 10 83 4 variable bit(1), 10 84 4 reducible bit(1), 10 85 4 irreducible bit(1), 10 86 4 returns bit(1), 10 87 4 position bit(1), 10 88 4 internal bit(1), 10 89 4 external bit(1), 10 90 4 like bit(1), 10 91 4 member bit(1), 10 92 4 non_varying bit(1), 10 93 4 options bit(1), 10 94 4 variable_arg_list bit(1), /* options(variable) */ 10 95 4 alloc_in_text bit(1), /* options(constant) */ 10 96 10 97 3 storage_class structure unal, 10 98 4 auto bit(1), 10 99 4 based bit(1), 10 100 4 static bit(1), 10 101 4 controlled bit(1), 10 102 4 defined bit(1), 10 103 4 parameter bit(1), 10 104 4 param_desc bit(1), 10 105 4 constant bit(1), 10 106 4 temporary bit(1), 10 107 4 return_value bit(1), 10 108 10 109 3 file_attributes structure unal, 10 110 4 print bit(1), 10 111 4 input bit(1), 10 112 4 output bit(1), 10 113 4 update bit(1), 10 114 4 stream bit(1), 10 115 4 reserved_1 bit(1), 10 116 4 record bit(1), 10 117 4 sequential bit(1), 10 118 4 direct bit(1), 10 119 4 interactive bit(1), /* env(interactive) */ 10 120 4 reserved_2 bit(1), 10 121 4 reserved_3 bit(1), 10 122 4 stringvalue bit(1), /* env(stringvalue) */ 10 123 4 keyed bit(1), 10 124 4 reserved_4 bit(1), 10 125 4 environment bit(1), 10 126 10 127 3 compiler_developed structure unal, 10 128 4 aliasable bit(1), 10 129 4 packed bit(1), 10 130 4 passed_as_arg bit(1), 10 131 4 allocate bit(1), 10 132 4 set bit(1), 10 133 4 exp_extents bit(1), 10 134 4 refer_extents bit(1), 10 135 4 star_extents bit(1), 10 136 4 isub bit(1), 10 137 4 put_in_symtab bit(1), 10 138 4 contiguous bit(1), 10 139 4 put_data bit(1), 10 140 4 overlayed bit(1), 10 141 4 error bit(1), 10 142 4 symtab_processed bit(1), 10 143 4 overlayed_by_builtin bit(1), 10 144 4 defaulted bit(1), 10 145 4 connected bit(1); 10 146 10 147 /* END INCLUDE FILE ... symbol.incl.pl1 */ 33 11 1 /* BEGIN INCLUDE FILE ... token.incl.pl1 */ 11 2 11 3 dcl 1 token based aligned, 11 4 2 node_type bit(9) unaligned, 11 5 2 type bit(9) unaligned, 11 6 2 loc bit(18) unaligned, /* symtab offset for identifiers, "p" flag for constants */ 11 7 2 declaration ptr unaligned, 11 8 2 next ptr unaligned, 11 9 2 size fixed(9), 11 10 2 string char(n refer(token.size)); 11 11 11 12 /* END INCLUDE FILE ... token.incl.pl1 */ 34 35 36 /* program */ 37 38 do i = lbound (hash_table, 1) to hbound (hash_table, 1); 39 40 do p = hash_table (i) repeat (p -> token.next) while (p ^= null); 41 42 do q1 = p->token.declaration repeat q1->symbol.multi_use while(q1^=null); 43 q3 = q1; 44 if q1->symbol.dcl_type = by_compiler then go to loop1; 45 46 do q2 = q1->symbol.multi_use repeat q2->symbol.multi_use while(q2^=null); 47 if q2->symbol.dcl_type = by_compiler then go to loop2; 48 49 if q1->symbol.block_node ^= 50 q2->symbol.block_node then go to loop2; 51 52 if q1->node.type ^= q2->node.type /* label node vs. symbol node */ 53 then do; 54 if q1->node.type = symbol_node 55 then q = q1; 56 else q = q2; 57 q3 = q; 58 if q->symbol.level <= 1 then go to multi_dcl; /* label vs. scalar or level 1 name */ 59 go to loop2; 60 end; 61 62 if q1->symbol.father ^= q2->symbol.father then go to loop2; 63 q3 = q1; 64 65 multi_dcl: 66 if ^q3->symbol.param_desc 67 then call error_$no_text(76, q3 -> symbol.source_id, q3); 68 go to next_token; 69 loop2: 70 end; 71 72 loop1: 73 end; 74 75 next_token: 76 end; 77 78 end; 79 80 return; 81 82 end /* scan_token_table */; SOURCE FILES USED IN THIS COMPILATION. LINE NUMBER DATE MODIFIED NAME PATHNAME 0 07/31/89 1338.2 scan_token_table.pl1 >spec>install>MR12.3-1066>scan_token_table.pl1 29 1 10/25/79 1645.8 declare_type.incl.pl1 >ldd>include>declare_type.incl.pl1 30 2 07/31/89 1332.6 language_utility.incl.pl1 >spec>install>MR12.3-1066>language_utility.incl.pl1 2-307 3 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 2-325 4 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 2-335 5 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 2-374 6 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 2-386 7 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 31 8 07/21/80 1546.3 nodes.incl.pl1 >ldd>include>nodes.incl.pl1 32 9 09/14/77 1705.7 pl1_token_hash_table.incl.pl1 >ldd>include>pl1_token_hash_table.incl.pl1 33 10 12/07/83 1701.7 symbol.incl.pl1 >ldd>include>symbol.incl.pl1 34 11 09/14/77 1705.7 token.incl.pl1 >ldd>include>token.incl.pl1 NAMES DECLARED IN THIS COMPILATION. IDENTIFIER OFFSET LOC STORAGE CLASS DATA TYPE ATTRIBUTES AND REFERENCES (* indicates a set context) NAMES DECLARED BY DECLARE STATEMENT. attributes 31 based structure level 2 dcl 10-3 block_node 4 based pointer level 2 packed packed unaligned dcl 10-3 ref 49 49 by_compiler constant bit(3) initial dcl 1-5 ref 44 47 dcl_type 1(19) based bit(3) level 2 packed packed unaligned dcl 10-3 ref 44 47 declaration 1 based pointer level 2 packed packed unaligned dcl 11-3 ref 42 error_$no_text 000010 constant entry external dcl 2-334 ref 65 father 17 based pointer level 2 packed packed unaligned dcl 10-3 ref 62 62 hash_table based pointer array level 2 packed packed unaligned dcl 9-3 ref 38 38 40 hash_table_structure based structure level 1 dcl 9-3 hbound builtin function dcl 25 ref 38 i 000112 automatic fixed bin(17,0) dcl 21 set ref 38* 40* lbound builtin function dcl 25 ref 38 level 2(11) based fixed bin(8,0) level 2 packed packed unaligned dcl 10-3 ref 58 multi_use 7 based pointer level 2 packed packed unaligned dcl 10-3 ref 46 69 72 next 2 based pointer level 2 packed packed unaligned dcl 11-3 ref 75 node based structure level 1 dcl 8-27 null builtin function dcl 25 ref 40 42 46 p 000100 automatic pointer dcl 20 set ref 40* 40* 42* 75 param_desc 32(15) based bit(1) level 4 packed packed unaligned dcl 10-3 ref 65 pl1_stat_$hash_table_ptr 000012 external static pointer dcl 9-6 ref 38 38 40 q 000102 automatic pointer dcl 20 set ref 54* 56* 57 58 q1 000104 automatic pointer dcl 20 set ref 42* 42* 43 44 46 49 52 54 54 62 63* 72 q2 000106 automatic pointer dcl 20 set ref 46* 46* 47 49 52 56 62* 69 q3 000110 automatic pointer dcl 20 set ref 43* 57* 63* 65 65 65* source_id 0(09) based structure level 2 packed packed unaligned dcl 10-3 set ref 65* storage_class 32(09) based structure level 3 packed packed unaligned dcl 10-3 symbol based structure level 1 dcl 10-3 symbol_node constant bit(9) initial dcl 8-5 ref 54 token based structure level 1 dcl 11-3 type based bit(9) level 2 packed packed unaligned dcl 8-27 ref 52 52 54 NAMES DECLARED BY DECLARE STATEMENT AND NEVER REFERENCED. adjust_count 000000 constant entry external dcl 2-20 array_node internal static bit(9) initial dcl 8-5 binary_to_octal_string 000000 constant entry external dcl 2-38 binary_to_octal_var_string 000000 constant entry external dcl 2-43 bindec 000000 constant entry external dcl 2-23 bindec$vs 000000 constant entry external dcl 2-28 binoct 000000 constant entry external dcl 2-33 block_node internal static bit(9) initial dcl 8-5 bound_node internal static bit(9) initial dcl 8-5 by_context internal static bit(3) initial dcl 1-5 by_declare internal static bit(3) initial dcl 1-5 by_explicit_context internal static bit(3) initial dcl 1-5 by_implication internal static bit(3) initial dcl 1-5 by_name_agg_node internal static bit(9) initial dcl 8-5 compare_expression 000000 constant entry external dcl 2-48 constant_length 000000 constant entry external dcl 2-54 context_node internal static bit(9) initial dcl 8-5 convert 000000 constant entry external dcl 2-60 convert$from_builtin 000000 constant entry external dcl 2-72 convert$to_integer 000000 constant entry external dcl 2-66 convert$to_target 000000 constant entry external dcl 2-88 convert$to_target_fb 000000 constant entry external dcl 2-82 convert$validate 000000 constant entry external dcl 2-78 copy_expression 000000 constant entry external dcl 2-94 copy_expression$copy_sons 000000 constant entry external dcl 2-99 copy_unique_expression 000000 constant entry external dcl 2-103 create_array 000000 constant entry external dcl 2-108 create_block 000000 constant entry external dcl 2-112 create_bound 000000 constant entry external dcl 2-118 create_context 000000 constant entry external dcl 2-122 create_cross_reference 000000 constant entry external dcl 2-128 create_default 000000 constant entry external dcl 2-132 create_identifier 000000 constant entry external dcl 2-136 create_label 000000 constant entry external dcl 2-140 create_list 000000 constant entry external dcl 2-147 create_operator 000000 constant entry external dcl 2-152 create_reference 000000 constant entry external dcl 2-158 create_statement 000000 constant entry external dcl 2-163 create_statement$prologue 000000 constant entry external dcl 2-171 create_storage 000000 constant entry external dcl 2-179 create_symbol 000000 constant entry external dcl 2-184 create_token 000000 constant entry external dcl 2-191 create_token$init_hash_table 000000 constant entry external dcl 2-197 create_token$protected 000000 constant entry external dcl 2-199 cross_reference_node internal static bit(9) initial dcl 8-5 decbin 000000 constant entry external dcl 2-206 declare_constant 000000 constant entry external dcl 2-211 declare_constant$bit 000000 constant entry external dcl 2-219 declare_constant$char 000000 constant entry external dcl 2-224 declare_constant$desc 000000 constant entry external dcl 2-229 declare_constant$integer 000000 constant entry external dcl 2-234 declare_descriptor 000000 constant entry external dcl 2-239 declare_descriptor$ctl 000000 constant entry external dcl 2-249 declare_descriptor$param 000000 constant entry external dcl 2-259 declare_integer 000000 constant entry external dcl 2-269 declare_picture 000000 constant entry external dcl 2-274 declare_picture_temp 000000 constant entry external dcl 2-279 declare_pointer 000000 constant entry external dcl 2-287 declare_temporary 000000 constant entry external dcl 2-292 decode_node_id 000000 constant entry external dcl 2-300 decode_source_id 000000 constant entry external dcl 2-306 default_node internal static bit(9) initial dcl 8-5 error 000000 constant entry external dcl 2-314 error$omit_text 000000 constant entry external dcl 2-319 error_ 000000 constant entry external dcl 2-324 error_$finish 000000 constant entry external dcl 2-343 error_$initialize_error 000000 constant entry external dcl 2-341 format_value_node internal static bit(9) initial dcl 8-5 free_node 000000 constant entry external dcl 2-345 get_array_size 000000 constant entry external dcl 2-348 get_size 000000 constant entry external dcl 2-352 label_array_element_node internal static bit(9) initial dcl 8-5 label_node internal static bit(9) initial dcl 8-5 list_node internal static bit(9) initial dcl 8-5 machine_state_node internal static bit(9) initial dcl 8-5 merge_attributes 000000 constant entry external dcl 2-355 operator_node internal static bit(9) initial dcl 8-5 optimizer 000000 constant entry external dcl 2-361 parse_error 000000 constant entry external dcl 2-364 parse_error$no_text 000000 constant entry external dcl 2-368 pl1_error_print$listing_segment 000000 constant entry external dcl 2-384 pl1_error_print$write_out 000000 constant entry external dcl 2-372 pl1_print$for_lex 000000 constant entry external dcl 2-418 pl1_print$non_varying 000000 constant entry external dcl 2-398 pl1_print$non_varying_nl 000000 constant entry external dcl 2-402 pl1_print$string_pointer 000000 constant entry external dcl 2-406 pl1_print$string_pointer_nl 000000 constant entry external dcl 2-410 pl1_print$unaligned_nl 000000 constant entry external dcl 2-414 pl1_print$varying 000000 constant entry external dcl 2-392 pl1_print$varying_nl 000000 constant entry external dcl 2-395 refer_extent 000000 constant entry external dcl 2-426 reference_node internal static bit(9) initial dcl 8-5 reserve$clear 000000 constant entry external dcl 2-430 reserve$declare_lib 000000 constant entry external dcl 2-434 reserve$read_lib 000000 constant entry external dcl 2-439 semantic_translator 000000 constant entry external dcl 2-444 semantic_translator$abort 000000 constant entry external dcl 2-446 semantic_translator$error 000000 constant entry external dcl 2-450 sf_par_node internal static bit(9) initial dcl 8-5 share_expression 000000 constant entry external dcl 2-454 source_node internal static bit(9) initial dcl 8-5 statement_node internal static bit(9) initial dcl 8-5 temporary_node internal static bit(9) initial dcl 8-5 token_node internal static bit(9) initial dcl 8-5 token_to_binary 000000 constant entry external dcl 2-459 NAMES DECLARED BY EXPLICIT CONTEXT. loop1 000154 constant label dcl 72 ref 44 loop2 000151 constant label dcl 69 ref 47 49 59 62 multi_dcl 000125 constant label dcl 65 ref 58 next_token 000160 constant label dcl 75 ref 68 scan_token_table 000011 constant entry external dcl 15 THERE WERE NO NAMES DECLARED BY CONTEXT OR IMPLICATION. STORAGE REQUIREMENTS FOR THIS PROGRAM. Object Text Link Symbol Defs Static Start 0 0 236 252 167 246 Length 652 167 14 364 47 0 BLOCK NAME STACK SIZE TYPE WHY NONQUICK/WHO SHARES STACK FRAME scan_token_table 84 external procedure is an external procedure. STORAGE FOR AUTOMATIC VARIABLES. STACK FRAME LOC IDENTIFIER BLOCK NAME scan_token_table 000100 p scan_token_table 000102 q scan_token_table 000104 q1 scan_token_table 000106 q2 scan_token_table 000110 q3 scan_token_table 000112 i scan_token_table THE FOLLOWING EXTERNAL OPERATORS ARE USED BY THIS PROGRAM. call_ext_out return_mac ext_entry THE FOLLOWING EXTERNAL ENTRIES ARE CALLED BY THIS PROGRAM. error_$no_text THE FOLLOWING EXTERNAL VARIABLES ARE USED BY THIS PROGRAM. pl1_stat_$hash_table_ptr LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC 15 000010 38 000016 40 000023 42 000034 43 000044 44 000046 46 000053 47 000062 49 000070 52 000074 54 000103 56 000110 57 000111 58 000113 59 000120 62 000121 63 000124 65 000125 68 000150 69 000151 72 000154 75 000160 78 000164 80 000166 ----------------------------------------------------------- Historical Background This edition of the Multics software materials and documentation is provided and donated to Massachusetts Institute of Technology by Group BULL including BULL HN Information Systems Inc. as a contribution to computer science knowledge. This donation is made also to give evidence of the common contributions of Massachusetts Institute of Technology, Bell Laboratories, General Electric, Honeywell Information Systems Inc., Honeywell BULL Inc., Groupe BULL and BULL HN Information Systems Inc. to the development of this operating system. Multics development was initiated by Massachusetts Institute of Technology Project MAC (1963-1970), renamed the MIT Laboratory for Computer Science and Artificial Intelligence in the mid 1970s, under the leadership of Professor Fernando Jose Corbato. Users consider that Multics provided the best software architecture for managing computer hardware properly and for executing programs. Many subsequent operating systems incorporated Multics principles. Multics was distributed in 1975 to 2000 by Group Bull in Europe , and in the U.S. by Bull HN Information Systems Inc., as successor in interest by change in name only to Honeywell Bull Inc. and Honeywell Information Systems Inc. . ----------------------------------------------------------- Permission to use, copy, modify, and distribute these programs and their documentation for any purpose and without fee is hereby granted,provided that the below copyright notice and historical background appear in all copies and that both the copyright notice and historical background and this permission notice appear in supporting documentation, and that the names of MIT, HIS, BULL or BULL HN not be used in advertising or publicity pertaining to distribution of the programs without specific prior written permission. Copyright 1972 by Massachusetts Institute of Technology and Honeywell Information Systems Inc. Copyright 2006 by BULL HN Information Systems Inc. Copyright 2006 by Bull SAS All Rights Reserved