COMPILATION LISTING OF SEGMENT adjust_count 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 1406.5 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 /* this routine is called to adjust the reference counts in a subtree. 12* If a given node in the tree has no reference count, no further 13* processing is necessary. If it has a count, the count is reduced by one. 14* If that reduces it to zero, the node is freed and the routine is called to 15* process the subexpressions. */ 16 17 adjust_count: proc(pt); 18 19 dcl (pt,t,s) ptr; 20 dcl shared bit(1) aligned; 21 dcl i fixed bin(15); 22 dcl null builtin; 23 1 1 /* BEGIN INCLUDE FILE ... nodes.incl.pl1 */ 1 2 1 3 /* Modified: 26 Dec 1979 by PCK to implement by name assignment */ 1 4 1 5 dcl ( block_node initial("000000001"b), 1 6 statement_node initial("000000010"b), 1 7 operator_node initial("000000011"b), 1 8 reference_node initial("000000100"b), 1 9 token_node initial("000000101"b), 1 10 symbol_node initial("000000110"b), 1 11 context_node initial("000000111"b), 1 12 array_node initial("000001000"b), 1 13 bound_node initial("000001001"b), 1 14 format_value_node initial("000001010"b), 1 15 list_node initial("000001011"b), 1 16 default_node initial("000001100"b), 1 17 machine_state_node initial("000001101"b), 1 18 source_node initial("000001110"b), 1 19 label_node initial("000001111"b), 1 20 cross_reference_node initial("000010000"b), 1 21 sf_par_node initial("000010001"b), 1 22 temporary_node initial("000010010"b), 1 23 label_array_element_node initial("000010011"b), 1 24 by_name_agg_node initial("000010100"b)) 1 25 bit(9) internal static aligned options(constant); 1 26 1 27 dcl 1 node based aligned, 1 28 2 type unal bit(9), 1 29 2 source_id unal structure, 1 30 3 file_number bit(8), 1 31 3 line_number bit(14), 1 32 3 statement_number bit(5); 1 33 1 34 /* END INCLUDE FILE ... nodes.incl.pl1 */ 24 2 1 /* BEGIN INCLUDE FILE ... reference.incl.pl1 */ 2 2 2 3 dcl 1 reference based aligned, 2 4 2 node_type bit(9) unaligned, 2 5 2 array_ref bit(1) unaligned, 2 6 2 varying_ref bit(1) unaligned, 2 7 2 shared bit(1) unaligned, 2 8 2 put_data_sw bit(1) unaligned, 2 9 2 processed bit(1) unaligned, 2 10 2 units fixed(3) unaligned, 2 11 2 ref_count fixed(17) unaligned, 2 12 2 c_offset fixed(24), 2 13 2 c_length fixed(24), 2 14 2 symbol ptr unaligned, 2 15 2 qualifier ptr unaligned, 2 16 2 offset ptr unaligned, 2 17 2 length ptr unaligned, 2 18 2 subscript_list ptr unaligned, 2 19 /* these fields are used by the 645 code generator */ 2 20 2 address structure unaligned, 2 21 3 base bit(3), 2 22 3 offset bit(15), 2 23 3 op bit(9), 2 24 3 no_address bit(1), 2 25 3 inhibit bit(1), 2 26 3 ext_base bit(1), 2 27 3 tag bit(6), 2 28 2 info structure unaligned, 2 29 3 address_in structure, 2 30 4 b dimension(0:7) bit(1), 2 31 4 storage bit(1), 2 32 3 value_in structure, 2 33 4 a bit(1), 2 34 4 q bit(1), 2 35 4 aq bit(1), 2 36 4 string_aq bit(1), 2 37 4 complex_aq bit(1), 2 38 4 decimal_aq bit(1), 2 39 4 b dimension(0:7) bit(1), 2 40 4 storage bit(1), 2 41 4 indicators bit(1), 2 42 4 x dimension(0:7) bit(1), 2 43 3 other structure, 2 44 4 big_offset bit(1), 2 45 4 big_length bit(1), 2 46 4 modword_in_offset bit(1), 2 47 2 data_type fixed(5) unaligned, 2 48 2 bits structure unaligned, 2 49 3 padded_ref bit(1), 2 50 3 aligned_ref bit(1), 2 51 3 long_ref bit(1), 2 52 3 forward_ref bit(1), 2 53 3 ic_ref bit(1), 2 54 3 temp_ref bit(1), 2 55 3 defined_ref bit(1), 2 56 3 evaluated bit(1), 2 57 3 allocate bit(1), 2 58 3 allocated bit(1), 2 59 3 aliasable bit(1), 2 60 3 even bit(1), 2 61 3 perm_address bit(1), 2 62 3 aggregate bit(1), 2 63 3 hit_zero bit(1), 2 64 3 dont_save bit(1), 2 65 3 fo_in_qual bit(1), 2 66 3 hard_to_load bit(1), 2 67 2 relocation bit(12) unaligned, 2 68 2 more_bits structure unaligned, 2 69 3 substr bit(1), 2 70 3 padded_for_store_ref bit(1), 2 71 3 aligned_for_store_ref bit(1), 2 72 3 mbz bit(15), 2 73 2 store_ins bit(18) unaligned; 2 74 2 75 /* END INCLUDE FILE ... reference.incl.pl1 */ 25 3 1 /* BEGIN INCLUDE FILE ... operator.incl.pl1 */ 3 2 3 3 /* Modified: 2 Apr 1980 by PCK to add max_number_of_operands */ 3 4 3 5 /* format: style3 */ 3 6 dcl 1 operator based aligned, 3 7 2 node_type bit (9) unaligned, 3 8 2 op_code bit (9) unaligned, 3 9 2 shared bit (1) unaligned, 3 10 2 processed bit (1) unaligned, 3 11 2 optimized bit (1) unaligned, 3 12 2 number fixed (14) unaligned, 3 13 2 operand dimension (n refer (operator.number)) ptr unaligned; 3 14 3 15 dcl max_number_of_operands 3 16 fixed bin (15) int static options (constant) initial (32767); 3 17 3 18 /* END INCLUDE FILE ... operator.incl.pl1 */ 26 4 1 /* BEGIN INCLUDE FILE ... op_codes.incl.pl1 */ 4 2 4 3 /* Modified: 25 Apr 1979 by PCK 4-bit decimal */ 4 4 /* Modified: 6 Jun 1979 by PG to add rank and byte */ 4 5 /* Modified: 26 Dec 1979 by PCK to add assign_by_name */ 4 6 /* Modified: 26 July 82 BIM wordno, segno */ 4 7 4 8 dcl ( add initial("000010001"b), /* opnd(1) <- opnd(2)+opnd(3) */ 4 9 sub initial("000010010"b), /* opnd(1) <- opnd(2)-opnd(3) */ 4 10 mult initial("000010011"b), /* opnd(1) <- opnd(2)*opnd(3) */ 4 11 div initial("000010100"b), /* opnd(1) <- opnd(2)/opnd(3) */ 4 12 negate initial("000010101"b), /* opnd(1) <- -opnd(2) */ 4 13 exp initial("000010110"b), /* opnd(1) <- opnd(2) ** opnd(3) */ 4 14 4 15 and_bits initial("000100001"b), /* opnd(1) <- opnd(2) & opnd(3) */ 4 16 or_bits initial("000100010"b), /* opnd(1) <- opnd(2)|opnd(3) */ 4 17 xor_bits initial("000100011"b), /* opnd(1) <- opnd(2) xor opnd(3) */ 4 18 not_bits initial("000100100"b), /* opnd(1) <- ^opnd(2) */ 4 19 cat_string initial("000100101"b), /* opnd(1) <- opnd(2)||opnd(3) */ 4 20 bool_fun initial("000100110"b), /* opnd(1) <- bool(opnd(2),opnd(3),opnd(4)) */ 4 21 4 22 assign initial("000110001"b), /* opnd(1) <- opnd(2) */ 4 23 assign_size_ck initial("000110010"b), /* opnd(1) <- opnd(2) */ 4 24 assign_zero initial("000110011"b), /* opnd(1) <- 0 */ 4 25 copy_words initial("000110100"b), /* move opnd(2) to opnd(1) by opnd(3) words */ 4 26 copy_string initial("000110101"b), /* move opnd(2) to opnd(1) by opnd(3) units */ 4 27 make_desc initial("000110110"b), /* opnd(1) <- descriptor(opnd(2),opnd(3)) */ 4 28 assign_round initial("000110111"b), /* opnd(1) <- opnd(2) rounded */ 4 29 pack initial("000111000"b), /* opnd(1) <- encode to picture opnd(2) */ 4 30 unpack initial("000111001"b), /* opnd(1) <- decode from picture opnd(2) */ 4 31 4 32 less_than initial("001000100"b), /* opnd(1) <- opnd(2) < opnd(3) */ 4 33 greater_than initial("001000101"b), /* opnd(1) <- opnd(2) > opnd(3) */ 4 34 equal initial("001000110"b), /* opnd(1) <- opnd(2) = opnd(3) */ 4 35 not_equal initial("001000111"b), /* opnd(1) <- opnd(2) ^= opnd(3) */ 4 36 less_or_equal initial("001001000"b), /* opnd(1) <- opnd(2) <= opnd(3) */ 4 37 greater_or_equal initial("001001001"b), /* opnd(1) <- opnd(2) >= opnd(3) */ 4 38 4 39 jump initial("001010001"b), /* go to opnd(1) unconditionally */ 4 40 jump_true initial("001010010"b), /* go to opnd(1) if opnd(2) is not 0 */ 4 41 jump_false initial("001010011"b), /* go to opnd(1) if opnd(2) is all 0 */ 4 42 jump_if_lt initial("001010100"b), /* go to opnd(1) if opnd(2) < opnd(3) */ 4 43 jump_if_gt initial("001010101"b), /* go to opnd(1) if opnd(2) > opnd(3) */ 4 44 jump_if_eq initial("001010110"b), /* go to opnd(1) if opnd(2) = opnd(3) */ 4 45 jump_if_ne initial("001010111"b), /* go to opnd(1) if opnd(2) ^= opnd(3) */ 4 46 jump_if_le initial("001011000"b), /* go to opnd(1) if opnd(2) <= opnd(3) */ 4 47 jump_if_ge initial("001011001"b), /* go to opnd(1) if opnd(2) >= opnd(3) */ 4 48 4 49 std_arg_list initial("001100001"b), /* opnd(1) <- arglist(opnd(2) desclist(opnd(3))) */ 4 50 return_words initial("001100010"b), /* return aggregate opnd(1), opnd(2) is length in words */ 4 51 std_call initial("001100011"b), /* opnd(1) <- call opnd(2) with opnd(3) */ 4 52 return_bits initial("001100100"b), /* return aggregate opnd(1), opnd(2) is length in bits */ 4 53 std_entry initial("001100101"b), /* entry(opnd(1)... opnd(n)) */ 4 54 return_string initial("001100110"b), /* return string opnd(1) */ 4 55 ex_prologue initial("001100111"b), /* execute the prologue -no operands- */ 4 56 allot_auto initial("001101000"b), /* opnd(1) <- addrel(stack,opnd(2)) */ 4 57 param_ptr initial("001101001"b), /* opnd(1) <- ptr to opnd(2) in block opnd(3) */ 4 58 param_desc_ptr initial("001101010"b), /* opnd(1) <- ptr to opnd(2) in block opnd(3) */ 4 59 std_return initial("001101011"b), /* return -no arguments- */ 4 60 allot_ctl initial("001101100"b), /* allocate opnd(1) , length in words is opnd(2) */ 4 61 free_ctl initial("001101101"b), /* free opnd(1) */ 4 62 stop initial("001101110"b), /* stop - terminate run unit */ 4 63 4 64 mod_bit initial("001110000"b), /* opnd(1) <- mod(opnd(3),36), 4 65* opnd(2) <- opnd(3) / 36 */ 4 66 mod_byte initial("001110001"b), /* opnd(1) <- mod(opnd(3),4), 4 67* opnd(2) <- opnd(3) / 4 */ 4 68 mod_half initial("001110010"b), /* opnd(1) <- mod(opnd(3),2), 4 69* opnd(2) <- opnd(3) / 2 */ 4 70 mod_word initial("001110011"b), /* TO BE DEFINED BY BLW */ 4 71 4 72 bit_to_char initial("010000000"b), /* opnd(1) <- (opnd(2)+8)/9 */ 4 73 bit_to_word initial("010000001"b), /* opnd(1) <- (opnd(2)+35)/36 */ 4 74 char_to_word initial("010000010"b), /* opnd(1) <- (opnd(2)+3)/4 */ 4 75 half_to_word initial("010000011"b), /* opnd(1) <- (opnd(2)+1)/2 */ 4 76 word_to_mod2 initial("010000100"b), /* opnd(1) <- (opnd(2)+1)/2*2 */ 4 77 word_to_mod4 initial("010000101"b), /* opnd(1) <- (opnd(2)+3)/4*4 */ 4 78 word_to_mod8 initial("010000110"b), /* opnd(1) <- (opnd(2)+7)/8*8 */ 4 79 rel_fun initial("010000111"b), /* opnd(1) <- rel(opnd(2)) */ 4 80 baseno_fun initial("010001000"b), /* opnd(1) <- baseno(opnd(2)) */ 4 81 desc_size initial("010001001"b), /* opnd(1) <- substr(opnd(2),13,24) */ 4 82 bit_pointer initial("010001010"b), /* opnd(1) <- bit offset of opnd(2) */ 4 83 index_before_fun initial("010001011"b), /* opnd(1) <- length of before(opnd(2),opnd(3)) */ 4 84 index_after_fun initial("010001100"b), /* opnd(1) <- offset of after(opnd(2),opnd(3)) in opnd(2) */ 4 85 verify_ltrim_fun initial("010001101"b), /* opnd(1) <- offset of ltrim(opnd(2),opnd(3)) in opnd(2) */ 4 86 verify_rtrim_fun initial("010001110"b), /* opnd(1) <- length(opnd(2))-length(rtrim(opnd(2),opnd(3))) */ 4 87 digit_to_bit initial("010001111"b), /* opnd(1) <- 9*opnd(2)/2 */ 4 88 4 89 ceil_fun initial("010010000"b), /* opnd(1) <- ceil(opnd(2)) */ 4 90 floor_fun initial("010010001"b), /* opnd(1) <- floor(opnd(2)) */ 4 91 round_fun initial("010010010"b), /* opnd(1) <- round(opnd(2)) */ 4 92 sign_fun initial("010010011"b), /* opnd(1) <- sign(opnd(2)) */ 4 93 abs_fun initial("010010100"b), /* opnd(1) <- abs(opnd(2)) */ 4 94 trunc_fun initial("010010101"b), /* opnd(1) <- trunc(opnd(2)) */ 4 95 byte_fun initial("010010110"b), /* opnd(1) <- byte(opnd(2)) */ 4 96 rank_fun initial("010010111"b), /* opnd(1) <- rank(opnd(2)) */ 4 97 index_rev_fun initial("010011000"b), /* opnd(1) <- index(reverse(opnd(2)),reverse(opnd(3))) */ 4 98 search_rev_fun initial("010011001"b), /* opnd(1) <- search(reverse(opnd(2)),opnd(3)) */ 4 99 verify_rev_fun initial("010011010"b), /* opnd(1) <- verify(reverse(opnd(2)),opnd(3)) */ 4 100 wordno_fun initial("010011011"b), /* opnd(1) <- wordno (opnd(2)) */ 4 101 segno_fun initial("010011100"b), /* opnd(1) <- segno (opnd(2)) */ 4 102 bitno_fun initial("010011101"b), /* opnd(1) <- bitno (opnd(2)) */ 4 103 charno_fun initial("010011110"b), /* opnd(1) <- charno (opnd(2)) */ 4 104 4 105 index_fun initial("010100000"b), /* opnd(1) <- index(opnd(2),opnd(3)) */ 4 106 off_fun initial("010100001"b), /* opnd(1) <- offset(opnd(2),opnd(3)) */ 4 107 complex_fun initial("010100010"b), /* opnd(1) <- complex(opnd(2),opnd(3)) */ 4 108 conjg_fun initial("010100011"b), /* opnd(1) <- conjg(opnd(2),opnd(3)) */ 4 109 mod_fun initial("010100100"b), /* opnd(1) <- mod(opnd(2),opnd(3)) */ 4 110 repeat_fun initial("010100101"b), /* opnd(1) <- repeat(opnd(2),opnd(3)) */ 4 111 verify_fun initial("010100110"b), /* opnd(1) <- verify(opnd(2),opnd(3)) */ 4 112 translate_fun initial("010100111"b), /* opnd(1) <- translate(opnd(2),opnd(3))*/ 4 113 real_fun initial("010101001"b), /* opnd(1) <- real(opnd(2)) */ 4 114 imag_fun initial("010101010"b), /* opnd(1) <- imag(opnd(2)) */ 4 115 length_fun initial("010101011"b), /* opnd(1) <- length(opnd(2)) */ 4 116 pl1_mod_fun initial("010101100"b), /* opnd(1) <- mod(opnd(2)) */ 4 117 search_fun initial("010101101"b), /* opnd(1) <- search(opnd(2),opnd(3)) */ 4 118 allocation_fun initial("010101110"b), /* opnd(1) <- allocation(opnd(2)) */ 4 119 reverse_fun initial("010101111"b), /* opnd(1) <- reverse(opnd(2)) */ 4 120 4 121 addr_fun initial("010110000"b), /* opnd(1) <- addr(opnd(2)) */ 4 122 addr_fun_bits initial("010110001"b), /* opnd(1) <- addr(opnd(2)) */ 4 123 ptr_fun initial("010110010"b), /* opnd(1) <- ptr(opnd(2),opnd(3)) */ 4 124 baseptr_fun initial("010110011"b), /* opnd(1) <- baseptr(opnd(2)) */ 4 125 addrel_fun initial("010110100"b), /* opnd(1) <- addrel(opnd(2),opnd(3)) */ 4 126 codeptr_fun initial("010110101"b), /* opnd(1) <- codeptr(opnd(2)) */ 4 127 environmentptr_fun initial("010110110"b), /* opnd(1) <- environmentptr(opnd(2)) */ 4 128 stackbaseptr_fun initial("010110111"b), /* opnd(1) is ptr to base of current stack */ 4 129 stackframeptr_fun initial("010111000"b), /* opnd(1) is ptr to current block's stack frame */ 4 130 setcharno_fun initial("010111001"b), /* opnd(1) <- opnd(2) with charno opnd(3) */ 4 131 addcharno_fun initial("010111010"b), /* opnd(1) <- opnd(2) with charno = charno + opnd(3) */ 4 132 setbitno_fun initial("010111011"b), /* setcharno for bitsno */ 4 133 addbitno_fun initial("010111100"b), /* addcharno for bitno */ 4 134 4 135 min_fun initial("011000000"b), /* opnd(1) <- min(opnd(1),opnd(2),...) */ 4 136 max_fun initial("011000001"b), /* opnd(1) <- max(opnd(1),opnd(2),...) */ 4 137 4 138 stack_ptr initial("011010001"b), /* opnd(1) <- stack frame ptr */ 4 139 empty_area initial("011010010"b), /* empty opnd(1), length in words is opnd(2) */ 4 140 enable_on initial("011010100"b), /* opnd(1) is the cond name 4 141* opnd(2) is the file name 4 142* opnd(3) is the block */ 4 143 revert_on initial("011010101"b), /* opnd(1) is the cond name, 4 144* opnd(2) is the file name */ 4 145 signal_on initial("011010110"b), /* opnd(1) is the cond name 4 146* opnd(2) is the file name */ 4 147 4 148 lock_fun initial("011010111"b), /* opnd(1) <- stac(opnd(2),opnd(3)) */ 4 149 stacq_fun initial("011011000"b), /* opnd(1) is result, opnd(2) is ptr to lock word, 4 150* opnd(3) is old value, (4) is new value. */ 4 151 clock_fun initial("011011001"b), /* opnd(1) is the clock time */ 4 152 vclock_fun initial("011011010"b), /* opnd(1) is the virtual clock time */ 4 153 4 154 bound_ck initial("011100000"b), /* opnd(1) <- opnd(2) if opnd(3) <= opnd(2) <= opnd(4) */ 4 155 range_ck initial("011100001"b), /* opnd(1) <- opnd(2) if opnd(3) <= opnd(2) <= opnd(4) */ 4 156 loop initial("011100010"b), /* do opnd(1) for opnd(2) from opnd(3) to opnd(4) by 1, 4 157* opnd(5) is the list */ 4 158 join initial("011100011"b), /* do opnd(1), opnd(2) ... opnd(n) */ 4 159 allot_based initial("011100100"b), /* allocate opnd(2) words in opnd(3), set opnd(1) */ 4 160 free_based initial("011100101"b), /* free opnd(1) in opnd(3), length is opnd(2) words */ 4 161 4 162 r_parn initial("011110001"b), /* format op code */ 4 163 l_parn initial("011110010"b), 4 164 r_format initial("011110011"b), 4 165 c_format initial("011110100"b), 4 166 f_format initial("011110101"b), 4 167 e_format initial("011110110"b), 4 168 b_format initial("011110111"b), 4 169 a_format initial("011111000"b), 4 170 x_format initial("011111001"b), 4 171 skip_format initial("011111010"b), 4 172 column_format initial("011111011"b), 4 173 page_format initial("011111100"b), 4 174 line_format initial("011111101"b), 4 175 picture_format initial("011111110"b), 4 176 bn_format initial("011111111"b), /* bit format, length(opnd(2)), radix factor(opnd(3)) */ 4 177 4 178 get_list_trans initial("100000000"b), /* getlist(opnd(2) with desc(opnd(1))) */ 4 179 get_edit_trans initial("100000001"b), /* getedit(opnd(2) with desc(opnd(1))) */ 4 180 get_data_trans initial("100000010"b), /* getdata(opnd(1) to opnd(n)) */ 4 181 put_list_trans initial("100000011"b), /* putlist(opnd(2) with desc(opnd(1))) */ 4 182 put_edit_trans initial("100000100"b), /* putedit(opnd(2) with desc(opnd(1))) */ 4 183 put_data_trans initial("100000101"b), /* putdata(opnd(2)) with subscript-list opnd(1) */ 4 184 terminate_trans initial("100000110"b), /* terminate stream transmission */ 4 185 stream_prep initial("100000111"b), /* initiate stream transmission */ 4 186 record_io initial("100001000"b), /* perform record io operation */ 4 187 fortran_read initial("100001001"b), /* A complete read statement */ 4 188 fortran_write initial("100001010"b), /* A complete write statement */ 4 189 ftn_file_manip initial("100001011"b), /* endfile,backspace,rewind,etc. */ 4 190 ftn_trans_loop initial("100001100"b), /* An implied do in i/o list */ 4 191 put_control initial("100001101"b), /* put control opnd(1) opnd(2) times */ 4 192 put_field initial("100001110"b), /* putlist(opnd(2)) of length(opnd(1)) */ 4 193 put_field_chk initial("100001111"b), /* putlist(op(2)) of len(op(1)) check char index(op(3)) */ 4 194 4 195 /* These operators are produced by the parse but are not used as input to the code generator. */ 4 196 /* They are processed by the semantic translator. */ 4 197 4 198 return_value initial("100010010"b), /* return(opnd(1)) */ 4 199 allot_var initial("100010011"b), /* allot opnd(1) in opnd(2) */ 4 200 free_var initial("100010100"b), /* free opnd(1) out of opnd(2) */ 4 201 get_file initial("100010101"b), /* opnd(1) is filename,opnd(2) is copy */ 4 202 /* opnd(3) is skip, opnd(4) is list */ 4 203 get_string initial("100010110"b), /* opnd(1) is string,opnd(2) is list */ 4 204 put_file initial("100010111"b), /* opnd(1) is filename,opnd(2) is page */ 4 205 /* opnd(3) is skip,opnd(4) is line */ 4 206 put_string initial("100011000"b), /* opnd(1) is string,opnd(2) is list */ 4 207 open_file initial("100011001"b), 4 208 close_file initial("100011010"b), 4 209 read_file initial("100011011"b), 4 210 write_file initial("100011100"b), 4 211 locate_file initial("100011101"b), 4 212 do_fun initial("100011110"b), /* opnd(1) is join of a list */ 4 213 /* opnd(2) is control variable ref */ 4 214 /* opnd(3) is specification operator */ 4 215 do_spec initial("100011111"b), /* opnd(1) to opnd(2) by opnd(3) */ 4 216 /* repeat opnd(4) while opnd(5) */ 4 217 /* opnd(6) is next specification */ 4 218 4 219 rewrite_file initial("100100000"b), 4 220 delete_file initial("100100001"b), 4 221 unlock_file initial("100100010"b), 4 222 lock_file initial("100100011"b), 4 223 refer initial("100100101"b), /* opnd(1) refer(opnd(2)) */ 4 224 prefix_plus initial("100100110"b), /* opnd(1) <- +opnd(2) */ 4 225 nop initial("100100111"b), /* no-op */ 4 226 assign_by_name initial("100101000"b), /* opnd(1) <- opnd(2),by name */ 4 227 4 228 /* These operators are produced by the semantic translator in processing the math 4 229* builtin functions and are used as input to the code generator */ 4 230 4 231 sqrt_fun initial("100110000"b), /* opnd(1) <- sqrt(opnd(2)) */ 4 232 sin_fun initial("100110001"b), /* opnd(1) <- sin(opnd(2)) */ 4 233 sind_fun initial("100110010"b), /* opnd(1) <- sind(opnd(2)) */ 4 234 cos_fun initial("100110011"b), /* opnd(1) <- cos(opnd(2)) */ 4 235 cosd_fun initial("100110100"b), /* opnd(1) <- cosd(opnd(2)) */ 4 236 tan_fun initial("100110101"b), /* opnd(1) <- tan(opnd(2)) */ 4 237 tand_fun initial("100110110"b), /* opnd(1) <- tand(opnd(2)) */ 4 238 asin_fun initial("100110111"b), /* opnd(1) <- asin(opnd(2)) */ 4 239 asind_fun initial("100111000"b), /* opnd(1) <- asind(opnd(2)) */ 4 240 acos_fun initial("100111001"b), /* opnd(1) <- acos(opnd(2)) */ 4 241 acosd_fun initial("100111010"b), /* opnd(1) <- acosd(opnd(2)) */ 4 242 atan_fun initial("100111011"b), /* opnd(1) <- atan(opnd(2)[,opnd(3)]) */ 4 243 atand_fun initial("100111100"b), /* opnd(1) <- atand(opnd(2)[,opnd(3)]) */ 4 244 log2_fun initial("100111101"b), /* opnd(1) <- log2(opnd(2)) */ 4 245 log_fun initial("100111110"b), /* opnd(1) <- log(opnd(2)) */ 4 246 log10_fun initial("100111111"b), /* opnd(1) <- log10(opnd(2)) */ 4 247 4 248 exp_fun initial("101000000"b)) /* opnd(1) <- exp(opnd(2)) */ 4 249 4 250 bit(9) aligned internal static options(constant); 4 251 4 252 /* END INCLUDE FILE ... op_codes.incl.pl1 */ 27 5 1 /* BEGIN INCLUDE FILE ... list.incl.pl1 */ 5 2 5 3 /* Modified 26 June 81 by EBush to add max_list_elements */ 5 4 5 5 5 6 dcl 1 list based aligned, 5 7 2 node_type bit(9) unaligned, 5 8 2 reserved bit(12) unaligned, 5 9 2 number fixed(14) unaligned, 5 10 2 element dimension(n refer(list.number)) ptr unaligned; 5 11 5 12 dcl max_list_elements fixed bin(17) internal static options (constant) 5 13 init(16383); 5 14 5 15 /* END INCLUDE FILE ... list.incl.pl1 */ 28 6 1 /****^ ********************************************************* 6 2* * * 6 3* * Copyright, (C) BULL HN Information Systems Inc., 1989 * 6 4* * * 6 5* ********************************************************* */ 6 6 6 7 /* BEGIN INCLUDE FILE ... language_utility.incl.pl1 */ 6 8 6 9 6 10 /****^ HISTORY COMMENTS: 6 11* 1) change(89-07-10,RWaters), approve(89-07-10,MCR8118), audit(89-07-19,Vu), 6 12* install(89-07-31,MR12.3-1066): 6 13* Removed the obsolete parameter source_line from the dcl of error_(). 6 14* END HISTORY COMMENTS */ 6 15 6 16 /* Modified: 6 Jun 1979 by PG to add rank and byte 6 17* * Modified: 9 Jul 1989 by RW updated the declaration of error_ 6 18* */ 6 19 6 20 declare adjust_count entry(pointer); 6 21 /* parameter 1: (input) any node pointer */ 6 22 6 23 declare bindec entry(fixed bin(31)) reducible 6 24 returns(character(12) aligned); 6 25 /* parameter 1: (input) bin value */ 6 26 /* return: (output) character value with blanks */ 6 27 6 28 declare bindec$vs entry(fixed bin(31)) reducible 6 29 returns(character(12) aligned varying); 6 30 /* parameter 1: (input) binary value */ 6 31 /* return: (output) char value without blanks */ 6 32 6 33 declare binoct entry(fixed bin(31)) reducible 6 34 returns(char(12) aligned); 6 35 /* parameter 1: (input) binary value */ 6 36 /* return: (output) char value with blanks */ 6 37 6 38 declare binary_to_octal_string entry(fixed bin(31)) reducible 6 39 returns(char(12) aligned); 6 40 /* parameter 1: (input) binary value */ 6 41 /* return: (output) right-aligned char value */ 6 42 6 43 declare binary_to_octal_var_string entry(fixed bin(31)) reducible 6 44 returns(char(12) varying aligned); 6 45 /* parameter 1: (input) binary value */ 6 46 /* returns: (output) char value without blanks */ 6 47 6 48 declare compare_expression entry(pointer,pointer) reducible 6 49 returns(bit(1) aligned); 6 50 /* parameter 1: (input) any node pointer */ 6 51 /* parameter 2: (input) any node pointer */ 6 52 /* return: (output) compare bit */ 6 53 6 54 declare constant_length entry (pointer, fixed bin (71)) 6 55 returns (bit (1) aligned); 6 56 /* parameter 1: (input) reference node pointer */ 6 57 /* parameter 2: (input) value of constant length */ 6 58 /* return: (output) "1"b if constant length */ 6 59 6 60 declare convert entry(pointer,bit(36) aligned) 6 61 returns(pointer); 6 62 /* parameter 1: (input) any node pointer */ 6 63 /* parameter 2: (input) target type */ 6 64 /* return: (output) target value tree pointer */ 6 65 6 66 declare convert$to_integer entry(pointer,bit(36)aligned) 6 67 returns(pointer); 6 68 /* parameter 1: (input) any node pointer */ 6 69 /* parameter 2: (input) target type */ 6 70 /* return: (output) target value tree pointer */ 6 71 6 72 declare convert$from_builtin entry(pointer,bit(36) aligned) 6 73 returns(pointer); 6 74 /* parameter 1: (input) any node pointer */ 6 75 /* parameter 2: (input) target type */ 6 76 /* return: (output) target value tree pointer */ 6 77 6 78 declare convert$validate entry(pointer,pointer); 6 79 /* parameter 1: (input) source value tree pointer */ 6 80 /* parameter 2: (input) target reference node pointer */ 6 81 6 82 declare convert$to_target_fb entry(pointer,pointer) 6 83 returns(pointer); 6 84 /* parameter 1: (input) source value tree pointer */ 6 85 /* parameter 2: (input) target reference node pointer */ 6 86 /* return: (output) target value tree pointer */ 6 87 6 88 declare convert$to_target entry(pointer,pointer) 6 89 returns(pointer); 6 90 /* parameter 1: (input) source value tree pointer */ 6 91 /* parameter 2: (input) target reference node pointer */ 6 92 /* return: (output) target value tree pointer */ 6 93 6 94 declare copy_expression entry(pointer unaligned) 6 95 returns(pointer); 6 96 /* parameter 1: (input) any node pointer */ 6 97 /* return: (output) any node pointer */ 6 98 6 99 declare copy_expression$copy_sons entry(pointer,pointer); 6 100 /* parameter 1: (input) father symbol node pointer */ 6 101 /* parameter 2: (input) stepfather symbol node ptr */ 6 102 6 103 declare copy_unique_expression entry(pointer) 6 104 returns(pointer); 6 105 /* parameter 1: (input) any node pointer */ 6 106 /* return: (output) any node pointer */ 6 107 6 108 declare create_array entry() 6 109 returns(pointer); 6 110 /* return: (output) array node pointer */ 6 111 6 112 declare create_block entry(bit(9) aligned,pointer) 6 113 returns(pointer); 6 114 /* parameter 1: (input) block type */ 6 115 /* parameter 2: (input) father block node pointer */ 6 116 /* return: (output) block node pointer */ 6 117 6 118 declare create_bound entry() 6 119 returns(pointer); 6 120 /* return: (output) bound node pointer */ 6 121 6 122 declare create_context entry(pointer,pointer) 6 123 returns(pointer); 6 124 /* parameter 1: (input) block node pointer */ 6 125 /* parameter 2: (input) token pointer */ 6 126 /* return: (output) context node pointer */ 6 127 6 128 declare create_cross_reference entry() 6 129 returns(pointer); 6 130 /* return: (output) cross reference node pointer */ 6 131 6 132 declare create_default entry 6 133 returns(pointer); 6 134 /* return: (output) default node pointer */ 6 135 6 136 declare create_identifier entry() 6 137 returns(pointer); 6 138 /* return: (output) token node pointer */ 6 139 6 140 declare create_label entry(pointer,pointer,bit(3) aligned) 6 141 returns(pointer); 6 142 /* parameter 1: (input) block node pointer */ 6 143 /* parameter 2: (input) token node pointer */ 6 144 /* parameter 3: (input) declare type */ 6 145 /* return: (output) label node pointer */ 6 146 6 147 declare create_list entry(fixed bin(15)) 6 148 returns(pointer); 6 149 /* parameter 1: (input) number of list elements */ 6 150 /* return: (output) list node pointer */ 6 151 6 152 declare create_operator entry(bit(9) aligned,fixed bin(15)) 6 153 returns(pointer); 6 154 /* parameter 1: (input) operator type */ 6 155 /* parameter 2: (input) number of operands */ 6 156 /* return: (output) operator node pointer */ 6 157 6 158 declare create_reference entry(pointer) 6 159 returns(pointer); 6 160 /* parameter 1: (input) symbol node pointer */ 6 161 /* return: (output) reference node pointer */ 6 162 6 163 declare create_statement entry(bit(9) aligned,pointer,pointer,bit(12) aligned) 6 164 returns(pointer); 6 165 /* parameter 1: (input) statement type */ 6 166 /* parameter 2: (input) block node pointer */ 6 167 /* parameter 3: (input) label node pointer */ 6 168 /* parameter 4: (input) conditions */ 6 169 /* return: (output) statement node pointer */ 6 170 6 171 declare create_statement$prologue entry(bit(9) aligned,pointer,pointer,bit(12) aligned) 6 172 returns(pointer); 6 173 /* parameter 1: (input) statement type */ 6 174 /* parameter 2: (input) block node pointer */ 6 175 /* parameter 3: (input) label node pointer */ 6 176 /* parameter 4: (input) conditions */ 6 177 /* return: (output) statement node pointer */ 6 178 6 179 declare create_storage entry(fixed bin(15)) 6 180 returns(pointer); 6 181 /* parameter 1: (input) number of words */ 6 182 /* return: (output) storage block pointer */ 6 183 6 184 declare create_symbol entry(pointer,pointer,bit(3) aligned) 6 185 returns(pointer); 6 186 /* parameter 1: (input) block node pointer */ 6 187 /* parameter 2: (input) token node pointer */ 6 188 /* parameter 3: (input) declare type */ 6 189 /* return: (output) symbol node pointer */ 6 190 6 191 declare create_token entry (character (*), bit (9) aligned) 6 192 returns (ptr); 6 193 /* parameter 1: (input) token string */ 6 194 /* parameter 2: (input) token type */ 6 195 /* return: (output) token node ptr */ 6 196 6 197 declare create_token$init_hash_table entry (); 6 198 6 199 declare create_token$protected entry (char (*), bit (9) aligned, bit (18) aligned) 6 200 returns (ptr); 6 201 /* parameter 1: (input) token string */ 6 202 /* parameter 2: (input) token type */ 6 203 /* parameter 3: (input) protected flag */ 6 204 /* return: (output) token node ptr */ 6 205 6 206 declare decbin entry(character(*) aligned) reducible 6 207 returns(fixed bin(31)); 6 208 /* parameter 1: (input) decimal character string */ 6 209 /* return: (output) binary value */ 6 210 6 211 declare declare_constant entry(bit(*) aligned,bit(36) aligned,fixed bin(31),fixed bin(15)) 6 212 returns(pointer); 6 213 /* parameter 1: (input) value */ 6 214 /* parameter 2: (input) type */ 6 215 /* parameter 3: (input) size */ 6 216 /* parameter 4: (input) scale */ 6 217 /* return: (output) reference node pointer */ 6 218 6 219 declare declare_constant$bit entry(bit(*) aligned) 6 220 returns(pointer); 6 221 /* parameter 1: (input) bit */ 6 222 /* return: (output) reference node pointer */ 6 223 6 224 declare declare_constant$char entry(character(*) aligned) 6 225 returns(pointer); 6 226 /* parameter 1: (input) character */ 6 227 /* return: (output) reference node pointer */ 6 228 6 229 declare declare_constant$desc entry(bit(*) aligned) 6 230 returns(pointer); 6 231 /* parameter 1: (input) descriptor bit value */ 6 232 /* return: (output) reference node pointer */ 6 233 6 234 declare declare_constant$integer entry(fixed bin(31)) /* note...should really be fixed bin(24) */ 6 235 returns(pointer); 6 236 /* parameter 1: (input) integer */ 6 237 /* return: (output) reference node pointer */ 6 238 6 239 declare declare_descriptor entry(pointer,pointer,pointer,pointer,bit(2) aligned) 6 240 returns(pointer); 6 241 /* parameter 1: (input) block node pointer */ 6 242 /* parameter 2: (input) statement node pointer */ 6 243 /* parameter 3: (input) symbol node pointer */ 6 244 /* parameter 4: (input) loc pointer */ 6 245 /* parameter 5: (input) array descriptor bit 6 246* cross_section bit */ 6 247 /* return: (output) reference node pointer */ 6 248 6 249 declare declare_descriptor$ctl entry(pointer,pointer,pointer,pointer,bit(2) aligned) 6 250 returns(pointer); 6 251 /* parameter 1: (input) block node pointer */ 6 252 /* parameter 2: (input) statement node pointer */ 6 253 /* parameter 3: (input) symbol node pointer */ 6 254 /* parameter 4: (input) loc pointer */ 6 255 /* parameter 5: (input) array descriptor bit 6 256* cross_section bit */ 6 257 /* return: (output) reference node pointer */ 6 258 6 259 declare declare_descriptor$param entry(pointer,pointer,pointer,pointer,bit(2) aligned) 6 260 returns(pointer); 6 261 /* parameter 1: (input) block node pointer */ 6 262 /* parameter 2: (input) statement node pointer */ 6 263 /* parameter 3: (input) symbol node pointer */ 6 264 /* parameter 4: (input) loc pointer */ 6 265 /* parameter 5: (input) array descriptor bit 6 266* cross_section bit */ 6 267 /* return: (output) reference node pointer */ 6 268 6 269 declare declare_integer entry(pointer) 6 270 returns(pointer); 6 271 /* parameter 1: (input) block node pointer */ 6 272 /* return: (output) reference node pointer */ 6 273 6 274 declare declare_picture entry(char(*)aligned,pointer,fixed bin(15)); 6 275 /* parameter 1: (input) picture string */ 6 276 /* parameter 2: (input) symbol node pointer */ 6 277 /* parameter 3: (output) error code, if any */ 6 278 6 279 declare declare_picture_temp entry(char(*) aligned,fixed bin(31),bit(1) aligned,bit(1) aligned) 6 280 returns(pointer); 6 281 /* parameter 1: (input) picture string */ 6 282 /* parameter 2: (input) scalefactor of picture */ 6 283 /* parameter 3: (input) ="1"b => complex picture */ 6 284 /* parameter 4: (input) ="1"b => unaligned temp */ 6 285 /* return: (output) reference node pointer */ 6 286 6 287 declare declare_pointer entry(pointer) 6 288 returns(pointer); 6 289 /* parameter 1: (input) block node pointer */ 6 290 /* return: (output) reference node pointer */ 6 291 6 292 declare declare_temporary entry(bit(36) aligned,fixed bin(31),fixed bin(15),pointer) 6 293 returns(pointer); 6 294 /* parameter 1: (input) type */ 6 295 /* parameter 2: (input) precision */ 6 296 /* parameter 3: (input) scale */ 6 297 /* parameter 4: (input) length */ 6 298 /* return: (output) reference node pointer */ 6 299 6 300 declare decode_node_id entry(pointer,bit(1) aligned) 6 301 returns(char(120) varying); 6 302 /* parameter 1: (input) node pointer */ 6 303 /* parameter 2: (input) ="1"b => capitals */ 6 304 /* return: (output) source line id */ 6 305 6 306 declare decode_source_id entry( 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), 6 307 6 308 bit(1) aligned) 6 309 returns(char(120) varying); 6 310 /* parameter 1: (input) source id */ 6 311 /* parameter 2: (input) ="1"b => capitals */ 6 312 /* return: (output) source line id */ 6 313 6 314 declare error entry(fixed bin(15),pointer,pointer); 6 315 /* parameter 1: (input) error number */ 6 316 /* parameter 2: (input) statement node pointer or null*/ 6 317 /* parameter 3: (input) token node pointer */ 6 318 6 319 declare error$omit_text entry(fixed bin(15),pointer,pointer); 6 320 /* parameter 1: (input) error number */ 6 321 /* parameter 2: (input) statement node pointer or null*/ 6 322 /* parameter 3: (input) token node pointer */ 6 323 6 324 declare error_ entry(fixed bin(15), 8 1 1 structure unaligned, 8 2 2 /* file_number */ bit(8), 8 3 2 /* line_number */ bit(14), 8 4 2 /* stmt_number */ bit(5), 6 325 6 326 pointer,fixed bin(8),fixed bin(23),fixed bin(11)); 6 327 /* parameter 1: (input) error number */ 6 328 /* parameter 2: (input) statement id */ 6 329 /* parameter 3: (input) any node pointer */ 6 330 /* parameter 4: (input) source segment */ 6 331 /* parameter 5: (input) source starting character */ 6 332 /* parameter 6: (input) source length */ 6 333 6 334 declare error_$no_text entry(fixed bin(15), 9 1 1 structure unaligned, 9 2 2 /* file_number */ bit(8), 9 3 2 /* line_number */ bit(14), 9 4 2 /* stmt_number */ bit(5), 6 335 6 336 pointer); 6 337 /* parameter 1: (input) error number */ 6 338 /* parameter 2: (input) statement id */ 6 339 /* parameter 3: (input) any node pointer */ 6 340 6 341 declare error_$initialize_error entry(); 6 342 6 343 declare error_$finish entry(); 6 344 6 345 declare free_node entry(pointer); 6 346 /* parameter 1: any node pointer */ 6 347 6 348 declare get_array_size entry(pointer,fixed bin(3)); 6 349 /* parameter 1: (input) symbol node pointer */ 6 350 /* parameter 2: (input) units */ 6 351 6 352 declare get_size entry(pointer); 6 353 /* parameter 1: (input) symbol node pointer */ 6 354 6 355 declare merge_attributes external entry(pointer,pointer) 6 356 returns(bit(1) aligned); 6 357 /* parameter 1: (input) target symbol node pointer */ 6 358 /* parameter 2: (input) source symbol node pointer */ 6 359 /* return: (output) "1"b if merge was unsuccessful */ 6 360 6 361 declare optimizer entry(pointer); 6 362 /* parameter 1: (input) root pointer */ 6 363 6 364 declare parse_error entry(fixed bin(15),pointer); 6 365 /* parameter 1: (input) error number */ 6 366 /* parameter 2: (input) any node pointer */ 6 367 6 368 declare parse_error$no_text entry(fixed bin(15),pointer); 6 369 /* parameter 1: (input) error number */ 6 370 /* parameter 2: (input) any node pointer */ 6 371 6 372 declare pl1_error_print$write_out 6 373 entry(fixed bin(15), 10 1 1 structure unaligned, 10 2 2 /* file_number */ bit(8), 10 3 2 /* line_number */ bit(14), 10 4 2 /* stmt_number */ bit(5), 6 374 6 375 pointer,fixed bin(11),fixed bin(31),fixed bin(31),fixed bin(15)); 6 376 /* parameter 1: (input) error number */ 6 377 /* parameter 2: (input) statement identification */ 6 378 /* parameter 3: (input) any node pointer */ 6 379 /* parameter 4: (input) source segment */ 6 380 /* parameter 5: (input) source character index */ 6 381 /* parameter 6: (input) source length */ 6 382 /* parameter 7: (input) source line */ 6 383 6 384 declare pl1_error_print$listing_segment 6 385 entry(fixed bin(15), 11 1 1 structure unaligned, 11 2 2 /* file_number */ bit(8), 11 3 2 /* line_number */ bit(14), 11 4 2 /* stmt_number */ bit(5), 6 386 6 387 pointer); 6 388 /* parameter 1: (input) error number */ 6 389 /* parameter 2: (input) statement identification */ 6 390 /* parameter 3: (input) token node pointer */ 6 391 6 392 declare pl1_print$varying entry(character(*) aligned varying); 6 393 /* parameter 1: (input) string */ 6 394 6 395 declare pl1_print$varying_nl entry(character(*) aligned varying); 6 396 /* parameter 1: (input) string */ 6 397 6 398 declare pl1_print$non_varying entry(character(*) aligned,fixed bin(31)); 6 399 /* parameter 1: (input) string */ 6 400 /* parameter 2: (input) string length or 0 */ 6 401 6 402 declare pl1_print$non_varying_nl entry(character(*) aligned,fixed bin(31)); 6 403 /* parameter 1: (input) string */ 6 404 /* parameter 2: (input) string length or 0 */ 6 405 6 406 declare pl1_print$string_pointer entry(pointer,fixed bin(31)); 6 407 /* parameter 1: (input) string pointer */ 6 408 /* parameter 2: (input) string size */ 6 409 6 410 declare pl1_print$string_pointer_nl entry(pointer,fixed bin(31)); 6 411 /* parameter 1: (input) string pointer */ 6 412 /* parameter 2: (input) string length or 0 */ 6 413 6 414 declare pl1_print$unaligned_nl entry(character(*) unaligned,fixed bin(31)); 6 415 /* parameter 1: (input) string */ 6 416 /* parameter 2: (input) length */ 6 417 6 418 declare pl1_print$for_lex entry (ptr, fixed bin (14), fixed bin (21), fixed bin (21), bit (1) aligned, bit (1) aligned); 6 419 /* parameter 1: (input) ptr to base of source segment */ 6 420 /* parameter 2: (input) line number */ 6 421 /* parameter 3: (input) starting offset in source seg */ 6 422 /* parameter 4: (input) number of chars to copy */ 6 423 /* parameter 5: (input) ON iff shd print line number */ 6 424 /* parameter 6: (input) ON iff line begins in comment */ 6 425 6 426 declare refer_extent entry(pointer,pointer); 6 427 /* parameter 1: (input/output) null,ref node,op node pointer */ 6 428 /* parameter 2: (input) null,ref node,op node pointer */ 6 429 6 430 declare reserve$clear entry() 6 431 returns(pointer); 6 432 /* return: (output) pointer */ 6 433 6 434 declare reserve$declare_lib entry(fixed bin(15)) 6 435 returns(pointer); 6 436 /* parameter 1: (input) builtin function number */ 6 437 /* return: (output) pointer */ 6 438 6 439 declare reserve$read_lib entry(fixed bin(15)) 6 440 returns(pointer); 6 441 /* parameter 1: (input) builtin function number */ 6 442 /* return: (output) pointer */ 6 443 6 444 declare semantic_translator entry(); 6 445 6 446 declare semantic_translator$abort entry(fixed bin(15),pointer); 6 447 /* parameter 1: (input) error number */ 6 448 /* parameter 2: (input) any node pointer */ 6 449 6 450 declare semantic_translator$error entry(fixed bin(15),pointer); 6 451 /* parameter 1: (input) error number */ 6 452 /* parameter 2: (input) any node pointer */ 6 453 6 454 declare share_expression entry(ptr) 6 455 returns(ptr); 6 456 /* parameter 1: (input) usually operator node pointer */ 6 457 /* return: (output) tree pointer or null */ 6 458 6 459 declare token_to_binary entry(ptr) reducible 6 460 returns(fixed bin(31)); 6 461 /* parameter 1: (input) token node pointer */ 6 462 /* return: (output) converted binary value */ 6 463 6 464 /* END INCLUDE FILE ... language_utility.incl.pl1 */ 29 30 31 begin: 32 t = pt; 33 if t = null then return; 34 if t->node.type = reference_node 35 then do; 36 if t->reference.shared then return; 37 t->reference.ref_count = t->reference.ref_count-1; 38 if t->reference.ref_count = 0 39 then do; 40 if t->reference.offset ^= null then call adjust_count((t->reference.offset)); 41 if t->reference.length ^= null then call adjust_count((t->reference.length)); 42 if t->reference.qualifier ^= null then call adjust_count((t->reference.qualifier)); 43 call free_node(t); 44 end; 45 return; 46 end; 47 if t->node.type = operator_node 48 then if t->operator.number > 0 49 then if t->operator.operand(1) ^= null 50 then do; 51 s = t->operator.operand(1); 52 53 shared = s->reference.shared; 54 55 if ^shared 56 then do; 57 if t->operator.op_code = std_call 58 then i = 2; 59 else i = 1; 60 if s->reference.ref_count - i ^= 0 61 then do; 62 s->reference.ref_count = s->reference.ref_count - 1; 63 return; 64 end; 65 end; 66 67 if ^t->operator.optimized 68 then do i = 1 to t->operator.number; 69 call adjust_count((t->operator.operand(i))); 70 end; 71 72 if ^shared 73 then call free_node(t); 74 else t -> operator.optimized = "1"b; 75 return; 76 end; 77 if t->node.type = list_node 78 then do i = 1 to t->list.number; 79 call adjust_count((t->list.element(i))); 80 end; 81 end; /* adjust_count */ 82 SOURCE FILES USED IN THIS COMPILATION. LINE NUMBER DATE MODIFIED NAME PATHNAME 0 07/31/89 1338.2 adjust_count.pl1 >spec>install>MR12.3-1066>adjust_count.pl1 24 1 07/21/80 1546.3 nodes.incl.pl1 >ldd>include>nodes.incl.pl1 25 2 07/21/80 1546.3 reference.incl.pl1 >ldd>include>reference.incl.pl1 26 3 07/21/80 1546.3 operator.incl.pl1 >ldd>include>operator.incl.pl1 27 4 04/07/83 1635.0 op_codes.incl.pl1 >ldd>include>op_codes.incl.pl1 28 5 08/13/81 2211.5 list.incl.pl1 >ldd>include>list.incl.pl1 29 6 07/31/89 1332.6 language_utility.incl.pl1 >spec>install>MR12.3-1066>language_utility.incl.pl1 6-307 7 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 6-325 8 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 6-335 9 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 6-374 10 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.incl.pl1 6-386 11 05/06/74 1746.9 source_id_descriptor.incl.pl1 >ldd>include>source_id_descriptor.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. adjust_count 000010 constant entry external dcl 6-20 ref 40 41 42 69 79 element 1 based pointer array level 2 packed packed unaligned dcl 5-6 ref 79 free_node 000012 constant entry external dcl 6-345 ref 43 72 i 000105 automatic fixed bin(15,0) dcl 21 set ref 57* 59* 60 67* 69* 77* 79* length 6 based pointer level 2 packed packed unaligned dcl 2-3 ref 41 41 list based structure level 1 dcl 5-6 list_node constant bit(9) initial dcl 1-5 ref 77 node based structure level 1 dcl 1-27 null builtin function dcl 22 ref 33 40 41 42 47 number 0(21) based fixed bin(14,0) level 2 in structure "list" packed packed unaligned dcl 5-6 in procedure "adjust_count" ref 77 number 0(21) based fixed bin(14,0) level 2 in structure "operator" packed packed unaligned dcl 3-6 in procedure "adjust_count" ref 47 67 offset 5 based pointer level 2 packed packed unaligned dcl 2-3 ref 40 40 op_code 0(09) based bit(9) level 2 packed packed unaligned dcl 3-6 ref 57 operand 1 based pointer array level 2 packed packed unaligned dcl 3-6 ref 47 51 69 operator based structure level 1 dcl 3-6 operator_node constant bit(9) initial dcl 1-5 ref 47 optimized 0(20) based bit(1) level 2 packed packed unaligned dcl 3-6 set ref 67 74* pt parameter pointer dcl 19 ref 17 31 qualifier 4 based pointer level 2 packed packed unaligned dcl 2-3 ref 42 42 ref_count 0(18) based fixed bin(17,0) level 2 packed packed unaligned dcl 2-3 set ref 37* 37 38 60 62* 62 reference based structure level 1 dcl 2-3 reference_node constant bit(9) initial dcl 1-5 ref 34 s 000102 automatic pointer dcl 19 set ref 51* 53 60 62 62 shared 0(11) based bit(1) level 2 in structure "reference" packed packed unaligned dcl 2-3 in procedure "adjust_count" ref 36 53 shared 000104 automatic bit(1) dcl 20 in procedure "adjust_count" set ref 53* 55 72 std_call constant bit(9) initial dcl 4-8 ref 57 t 000100 automatic pointer dcl 19 set ref 31* 33 34 36 37 37 38 40 40 41 41 42 42 43* 47 47 47 51 57 67 67 69 72* 74 77 77 79 type based bit(9) level 2 packed packed unaligned dcl 1-27 ref 34 47 77 NAMES DECLARED BY DECLARE STATEMENT AND NEVER REFERENCED. a_format internal static bit(9) initial dcl 4-8 abs_fun internal static bit(9) initial dcl 4-8 acos_fun internal static bit(9) initial dcl 4-8 acosd_fun internal static bit(9) initial dcl 4-8 add internal static bit(9) initial dcl 4-8 addbitno_fun internal static bit(9) initial dcl 4-8 addcharno_fun internal static bit(9) initial dcl 4-8 addr_fun internal static bit(9) initial dcl 4-8 addr_fun_bits internal static bit(9) initial dcl 4-8 addrel_fun internal static bit(9) initial dcl 4-8 allocation_fun internal static bit(9) initial dcl 4-8 allot_auto internal static bit(9) initial dcl 4-8 allot_based internal static bit(9) initial dcl 4-8 allot_ctl internal static bit(9) initial dcl 4-8 allot_var internal static bit(9) initial dcl 4-8 and_bits internal static bit(9) initial dcl 4-8 array_node internal static bit(9) initial dcl 1-5 asin_fun internal static bit(9) initial dcl 4-8 asind_fun internal static bit(9) initial dcl 4-8 assign internal static bit(9) initial dcl 4-8 assign_by_name internal static bit(9) initial dcl 4-8 assign_round internal static bit(9) initial dcl 4-8 assign_size_ck internal static bit(9) initial dcl 4-8 assign_zero internal static bit(9) initial dcl 4-8 atan_fun internal static bit(9) initial dcl 4-8 atand_fun internal static bit(9) initial dcl 4-8 b_format internal static bit(9) initial dcl 4-8 baseno_fun internal static bit(9) initial dcl 4-8 baseptr_fun internal static bit(9) initial dcl 4-8 binary_to_octal_string 000000 constant entry external dcl 6-38 binary_to_octal_var_string 000000 constant entry external dcl 6-43 bindec 000000 constant entry external dcl 6-23 bindec$vs 000000 constant entry external dcl 6-28 binoct 000000 constant entry external dcl 6-33 bit_pointer internal static bit(9) initial dcl 4-8 bit_to_char internal static bit(9) initial dcl 4-8 bit_to_word internal static bit(9) initial dcl 4-8 bitno_fun internal static bit(9) initial dcl 4-8 block_node internal static bit(9) initial dcl 1-5 bn_format internal static bit(9) initial dcl 4-8 bool_fun internal static bit(9) initial dcl 4-8 bound_ck internal static bit(9) initial dcl 4-8 bound_node internal static bit(9) initial dcl 1-5 by_name_agg_node internal static bit(9) initial dcl 1-5 byte_fun internal static bit(9) initial dcl 4-8 c_format internal static bit(9) initial dcl 4-8 cat_string internal static bit(9) initial dcl 4-8 ceil_fun internal static bit(9) initial dcl 4-8 char_to_word internal static bit(9) initial dcl 4-8 charno_fun internal static bit(9) initial dcl 4-8 clock_fun internal static bit(9) initial dcl 4-8 close_file internal static bit(9) initial dcl 4-8 codeptr_fun internal static bit(9) initial dcl 4-8 column_format internal static bit(9) initial dcl 4-8 compare_expression 000000 constant entry external dcl 6-48 complex_fun internal static bit(9) initial dcl 4-8 conjg_fun internal static bit(9) initial dcl 4-8 constant_length 000000 constant entry external dcl 6-54 context_node internal static bit(9) initial dcl 1-5 convert 000000 constant entry external dcl 6-60 convert$from_builtin 000000 constant entry external dcl 6-72 convert$to_integer 000000 constant entry external dcl 6-66 convert$to_target 000000 constant entry external dcl 6-88 convert$to_target_fb 000000 constant entry external dcl 6-82 convert$validate 000000 constant entry external dcl 6-78 copy_expression 000000 constant entry external dcl 6-94 copy_expression$copy_sons 000000 constant entry external dcl 6-99 copy_string internal static bit(9) initial dcl 4-8 copy_unique_expression 000000 constant entry external dcl 6-103 copy_words internal static bit(9) initial dcl 4-8 cos_fun internal static bit(9) initial dcl 4-8 cosd_fun internal static bit(9) initial dcl 4-8 create_array 000000 constant entry external dcl 6-108 create_block 000000 constant entry external dcl 6-112 create_bound 000000 constant entry external dcl 6-118 create_context 000000 constant entry external dcl 6-122 create_cross_reference 000000 constant entry external dcl 6-128 create_default 000000 constant entry external dcl 6-132 create_identifier 000000 constant entry external dcl 6-136 create_label 000000 constant entry external dcl 6-140 create_list 000000 constant entry external dcl 6-147 create_operator 000000 constant entry external dcl 6-152 create_reference 000000 constant entry external dcl 6-158 create_statement 000000 constant entry external dcl 6-163 create_statement$prologue 000000 constant entry external dcl 6-171 create_storage 000000 constant entry external dcl 6-179 create_symbol 000000 constant entry external dcl 6-184 create_token 000000 constant entry external dcl 6-191 create_token$init_hash_table 000000 constant entry external dcl 6-197 create_token$protected 000000 constant entry external dcl 6-199 cross_reference_node internal static bit(9) initial dcl 1-5 decbin 000000 constant entry external dcl 6-206 declare_constant 000000 constant entry external dcl 6-211 declare_constant$bit 000000 constant entry external dcl 6-219 declare_constant$char 000000 constant entry external dcl 6-224 declare_constant$desc 000000 constant entry external dcl 6-229 declare_constant$integer 000000 constant entry external dcl 6-234 declare_descriptor 000000 constant entry external dcl 6-239 declare_descriptor$ctl 000000 constant entry external dcl 6-249 declare_descriptor$param 000000 constant entry external dcl 6-259 declare_integer 000000 constant entry external dcl 6-269 declare_picture 000000 constant entry external dcl 6-274 declare_picture_temp 000000 constant entry external dcl 6-279 declare_pointer 000000 constant entry external dcl 6-287 declare_temporary 000000 constant entry external dcl 6-292 decode_node_id 000000 constant entry external dcl 6-300 decode_source_id 000000 constant entry external dcl 6-306 default_node internal static bit(9) initial dcl 1-5 delete_file internal static bit(9) initial dcl 4-8 desc_size internal static bit(9) initial dcl 4-8 digit_to_bit internal static bit(9) initial dcl 4-8 div internal static bit(9) initial dcl 4-8 do_fun internal static bit(9) initial dcl 4-8 do_spec internal static bit(9) initial dcl 4-8 e_format internal static bit(9) initial dcl 4-8 empty_area internal static bit(9) initial dcl 4-8 enable_on internal static bit(9) initial dcl 4-8 environmentptr_fun internal static bit(9) initial dcl 4-8 equal internal static bit(9) initial dcl 4-8 error 000000 constant entry external dcl 6-314 error$omit_text 000000 constant entry external dcl 6-319 error_ 000000 constant entry external dcl 6-324 error_$finish 000000 constant entry external dcl 6-343 error_$initialize_error 000000 constant entry external dcl 6-341 error_$no_text 000000 constant entry external dcl 6-334 ex_prologue internal static bit(9) initial dcl 4-8 exp internal static bit(9) initial dcl 4-8 exp_fun internal static bit(9) initial dcl 4-8 f_format internal static bit(9) initial dcl 4-8 floor_fun internal static bit(9) initial dcl 4-8 format_value_node internal static bit(9) initial dcl 1-5 fortran_read internal static bit(9) initial dcl 4-8 fortran_write internal static bit(9) initial dcl 4-8 free_based internal static bit(9) initial dcl 4-8 free_ctl internal static bit(9) initial dcl 4-8 free_var internal static bit(9) initial dcl 4-8 ftn_file_manip internal static bit(9) initial dcl 4-8 ftn_trans_loop internal static bit(9) initial dcl 4-8 get_array_size 000000 constant entry external dcl 6-348 get_data_trans internal static bit(9) initial dcl 4-8 get_edit_trans internal static bit(9) initial dcl 4-8 get_file internal static bit(9) initial dcl 4-8 get_list_trans internal static bit(9) initial dcl 4-8 get_size 000000 constant entry external dcl 6-352 get_string internal static bit(9) initial dcl 4-8 greater_or_equal internal static bit(9) initial dcl 4-8 greater_than internal static bit(9) initial dcl 4-8 half_to_word internal static bit(9) initial dcl 4-8 imag_fun internal static bit(9) initial dcl 4-8 index_after_fun internal static bit(9) initial dcl 4-8 index_before_fun internal static bit(9) initial dcl 4-8 index_fun internal static bit(9) initial dcl 4-8 index_rev_fun internal static bit(9) initial dcl 4-8 join internal static bit(9) initial dcl 4-8 jump internal static bit(9) initial dcl 4-8 jump_false internal static bit(9) initial dcl 4-8 jump_if_eq internal static bit(9) initial dcl 4-8 jump_if_ge internal static bit(9) initial dcl 4-8 jump_if_gt internal static bit(9) initial dcl 4-8 jump_if_le internal static bit(9) initial dcl 4-8 jump_if_lt internal static bit(9) initial dcl 4-8 jump_if_ne internal static bit(9) initial dcl 4-8 jump_true internal static bit(9) initial dcl 4-8 l_parn internal static bit(9) initial dcl 4-8 label_array_element_node internal static bit(9) initial dcl 1-5 label_node internal static bit(9) initial dcl 1-5 length_fun internal static bit(9) initial dcl 4-8 less_or_equal internal static bit(9) initial dcl 4-8 less_than internal static bit(9) initial dcl 4-8 line_format internal static bit(9) initial dcl 4-8 locate_file internal static bit(9) initial dcl 4-8 lock_file internal static bit(9) initial dcl 4-8 lock_fun internal static bit(9) initial dcl 4-8 log10_fun internal static bit(9) initial dcl 4-8 log2_fun internal static bit(9) initial dcl 4-8 log_fun internal static bit(9) initial dcl 4-8 loop internal static bit(9) initial dcl 4-8 machine_state_node internal static bit(9) initial dcl 1-5 make_desc internal static bit(9) initial dcl 4-8 max_fun internal static bit(9) initial dcl 4-8 max_list_elements internal static fixed bin(17,0) initial dcl 5-12 max_number_of_operands internal static fixed bin(15,0) initial dcl 3-15 merge_attributes 000000 constant entry external dcl 6-355 min_fun internal static bit(9) initial dcl 4-8 mod_bit internal static bit(9) initial dcl 4-8 mod_byte internal static bit(9) initial dcl 4-8 mod_fun internal static bit(9) initial dcl 4-8 mod_half internal static bit(9) initial dcl 4-8 mod_word internal static bit(9) initial dcl 4-8 mult internal static bit(9) initial dcl 4-8 negate internal static bit(9) initial dcl 4-8 nop internal static bit(9) initial dcl 4-8 not_bits internal static bit(9) initial dcl 4-8 not_equal internal static bit(9) initial dcl 4-8 off_fun internal static bit(9) initial dcl 4-8 open_file internal static bit(9) initial dcl 4-8 optimizer 000000 constant entry external dcl 6-361 or_bits internal static bit(9) initial dcl 4-8 pack internal static bit(9) initial dcl 4-8 page_format internal static bit(9) initial dcl 4-8 param_desc_ptr internal static bit(9) initial dcl 4-8 param_ptr internal static bit(9) initial dcl 4-8 parse_error 000000 constant entry external dcl 6-364 parse_error$no_text 000000 constant entry external dcl 6-368 picture_format internal static bit(9) initial dcl 4-8 pl1_error_print$listing_segment 000000 constant entry external dcl 6-384 pl1_error_print$write_out 000000 constant entry external dcl 6-372 pl1_mod_fun internal static bit(9) initial dcl 4-8 pl1_print$for_lex 000000 constant entry external dcl 6-418 pl1_print$non_varying 000000 constant entry external dcl 6-398 pl1_print$non_varying_nl 000000 constant entry external dcl 6-402 pl1_print$string_pointer 000000 constant entry external dcl 6-406 pl1_print$string_pointer_nl 000000 constant entry external dcl 6-410 pl1_print$unaligned_nl 000000 constant entry external dcl 6-414 pl1_print$varying 000000 constant entry external dcl 6-392 pl1_print$varying_nl 000000 constant entry external dcl 6-395 prefix_plus internal static bit(9) initial dcl 4-8 ptr_fun internal static bit(9) initial dcl 4-8 put_control internal static bit(9) initial dcl 4-8 put_data_trans internal static bit(9) initial dcl 4-8 put_edit_trans internal static bit(9) initial dcl 4-8 put_field internal static bit(9) initial dcl 4-8 put_field_chk internal static bit(9) initial dcl 4-8 put_file internal static bit(9) initial dcl 4-8 put_list_trans internal static bit(9) initial dcl 4-8 put_string internal static bit(9) initial dcl 4-8 r_format internal static bit(9) initial dcl 4-8 r_parn internal static bit(9) initial dcl 4-8 range_ck internal static bit(9) initial dcl 4-8 rank_fun internal static bit(9) initial dcl 4-8 read_file internal static bit(9) initial dcl 4-8 real_fun internal static bit(9) initial dcl 4-8 record_io internal static bit(9) initial dcl 4-8 refer internal static bit(9) initial dcl 4-8 refer_extent 000000 constant entry external dcl 6-426 rel_fun internal static bit(9) initial dcl 4-8 repeat_fun internal static bit(9) initial dcl 4-8 reserve$clear 000000 constant entry external dcl 6-430 reserve$declare_lib 000000 constant entry external dcl 6-434 reserve$read_lib 000000 constant entry external dcl 6-439 return_bits internal static bit(9) initial dcl 4-8 return_string internal static bit(9) initial dcl 4-8 return_value internal static bit(9) initial dcl 4-8 return_words internal static bit(9) initial dcl 4-8 reverse_fun internal static bit(9) initial dcl 4-8 revert_on internal static bit(9) initial dcl 4-8 rewrite_file internal static bit(9) initial dcl 4-8 round_fun internal static bit(9) initial dcl 4-8 search_fun internal static bit(9) initial dcl 4-8 search_rev_fun internal static bit(9) initial dcl 4-8 segno_fun internal static bit(9) initial dcl 4-8 semantic_translator 000000 constant entry external dcl 6-444 semantic_translator$abort 000000 constant entry external dcl 6-446 semantic_translator$error 000000 constant entry external dcl 6-450 setbitno_fun internal static bit(9) initial dcl 4-8 setcharno_fun internal static bit(9) initial dcl 4-8 sf_par_node internal static bit(9) initial dcl 1-5 share_expression 000000 constant entry external dcl 6-454 sign_fun internal static bit(9) initial dcl 4-8 signal_on internal static bit(9) initial dcl 4-8 sin_fun internal static bit(9) initial dcl 4-8 sind_fun internal static bit(9) initial dcl 4-8 skip_format internal static bit(9) initial dcl 4-8 source_node internal static bit(9) initial dcl 1-5 sqrt_fun internal static bit(9) initial dcl 4-8 stack_ptr internal static bit(9) initial dcl 4-8 stackbaseptr_fun internal static bit(9) initial dcl 4-8 stackframeptr_fun internal static bit(9) initial dcl 4-8 stacq_fun internal static bit(9) initial dcl 4-8 statement_node internal static bit(9) initial dcl 1-5 std_arg_list internal static bit(9) initial dcl 4-8 std_entry internal static bit(9) initial dcl 4-8 std_return internal static bit(9) initial dcl 4-8 stop internal static bit(9) initial dcl 4-8 stream_prep internal static bit(9) initial dcl 4-8 sub internal static bit(9) initial dcl 4-8 symbol_node internal static bit(9) initial dcl 1-5 tan_fun internal static bit(9) initial dcl 4-8 tand_fun internal static bit(9) initial dcl 4-8 temporary_node internal static bit(9) initial dcl 1-5 terminate_trans internal static bit(9) initial dcl 4-8 token_node internal static bit(9) initial dcl 1-5 token_to_binary 000000 constant entry external dcl 6-459 translate_fun internal static bit(9) initial dcl 4-8 trunc_fun internal static bit(9) initial dcl 4-8 unlock_file internal static bit(9) initial dcl 4-8 unpack internal static bit(9) initial dcl 4-8 vclock_fun internal static bit(9) initial dcl 4-8 verify_fun internal static bit(9) initial dcl 4-8 verify_ltrim_fun internal static bit(9) initial dcl 4-8 verify_rev_fun internal static bit(9) initial dcl 4-8 verify_rtrim_fun internal static bit(9) initial dcl 4-8 word_to_mod2 internal static bit(9) initial dcl 4-8 word_to_mod4 internal static bit(9) initial dcl 4-8 word_to_mod8 internal static bit(9) initial dcl 4-8 wordno_fun internal static bit(9) initial dcl 4-8 write_file internal static bit(9) initial dcl 4-8 x_format internal static bit(9) initial dcl 4-8 xor_bits internal static bit(9) initial dcl 4-8 NAMES DECLARED BY EXPLICIT CONTEXT. adjust_count 000013 constant entry external dcl 17 begin 000020 constant label dcl 31 THERE WERE NO NAMES DECLARED BY CONTEXT OR IMPLICATION. STORAGE REQUIREMENTS FOR THIS PROGRAM. Object Text Link Symbol Defs Static Start 0 0 322 336 264 332 Length 734 264 14 361 36 0 BLOCK NAME STACK SIZE TYPE WHY NONQUICK/WHO SHARES STACK FRAME adjust_count 109 external procedure is an external procedure. STORAGE FOR AUTOMATIC VARIABLES. STACK FRAME LOC IDENTIFIER BLOCK NAME adjust_count 000100 t adjust_count 000102 s adjust_count 000104 shared adjust_count 000105 i adjust_count 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. adjust_count free_node NO EXTERNAL VARIABLES ARE USED BY THIS PROGRAM. LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC 17 000010 31 000020 33 000024 34 000030 36 000035 37 000040 38 000045 40 000046 41 000061 42 000076 43 000113 45 000122 47 000123 51 000135 53 000137 55 000143 57 000144 59 000154 60 000156 62 000164 63 000167 67 000170 69 000203 70 000214 72 000216 74 000230 75 000232 77 000233 79 000247 80 000260 81 000262 ----------------------------------------------------------- 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