COMPILATION LISTING OF SEGMENT kst_info Compiled by: Multics PL/I Compiler, Release 32f, of October 9, 1989 Compiled at: Bull HN, Phoenix AZ, System-M Compiled on: 11/11/89 1045.8 mst Sat Options: optimize map 1 /****^ *********************************************************** 2* * * 3* * Copyright, (C) Honeywell Bull Inc., 1987 * 4* * * 5* * Copyright, (C) Honeywell Information Systems Inc., 1982 * 6* * * 7* * Copyright (c) 1972 by Massachusetts Institute of * 8* * Technology and Honeywell Information Systems, Inc. * 9* * * 10* *********************************************************** */ 11 12 /* format: style4,indattr,ifthenstmt,ifthen,idind35,^indcomtxt */ 13 14 kst_info: proc; 15 16 /* 17* 18* Written July 7, 1976 by Richard Bratt 19* 20* Last Modified: 21* 8/26/76 by M. Weaver to add high_low_seg_count entry 22* 11/1/84 by K. Loepere to remove hdr. 23* 24* This module contains entries to extract information from a process' KST. 25* These entries may be called by hardcore gates 26* 27* ---> get_uid (segptr, uid, code) 28* 29* This entry translates a segment number (represented as a segptr) into the unique identifier 30* of the object to which the segment number is bound. 31* 32**/ 33 34 35 get_uid: entry (a_segptr, a_uid, a_code); 36 37 /* Parameters */ 38 39 dcl a_code fixed bin (35, 0) parameter; 40 dcl a_hcsc fixed bin (17) parameter; 41 dcl a_high_seg fixed bin (17) parameter; 42 dcl a_segptr ptr parameter; 43 dcl a_uid bit (36) aligned parameter; 44 45 /* Variables */ 46 47 dcl code fixed bin (35, 0); 48 dcl segptr ptr; 49 50 /* Entries */ 51 52 dcl get_kstep entry (fixed bin (17), ptr, fixed bin (35)); 53 54 /* Misc */ 55 56 dcl segno builtin; 57 58 segptr = a_segptr; 59 a_uid = "0"b; 60 call get_kstep (segno (segptr), kstep, code); 61 if code ^= 0 then do; 62 a_code = code; 63 return; 64 end; 65 66 a_uid = kste.uid; 67 a_code = 0; 68 return; 69 70 high_low_seg_count: entry (a_high_seg, a_hcsc); 71 72 73 /* 1) high_seg the number to add to hcsc to get the highest segment number being used. 74* 75* 2) hcsc is the lowest non-hardcore segment number. 76**/ 77 78 kstp = pds$kstp; 79 80 a_hcsc = kstp -> kst.lowseg; 81 82 a_high_seg = kstp -> kst.highest_used_segno - kstp -> kst.lowseg; 83 84 return; 85 /* START OF: kst.incl.pl1 * * * * * */ 1 2 1 3 /* 1 4*Modified March 1976 by R. Bratt 1 5*Modified November 1984 to remove hdr, Keith Loepere. */ 1 6 1 7 1 8 /****^ HISTORY COMMENTS: 1 9* 1) change(86-08-08,GDixon), approve(86-08-08,MCR7388), 1 10* audit(86-09-02,Farley), install(86-09-08,MR12.0-1150): 1 11* Add warning on use of kste.entryp. 1 12* END HISTORY COMMENTS */ 1 13 1 14 1 15 dcl pds$kstp ext ptr, 1 16 (kstp, kstep) ptr; 1 17 1 18 dcl 1 kst aligned based (kstp), /* KST header declaration */ 1 19 2 lowseg fixed bin (17), /* lowest segment number described by kst */ 1 20 2 highseg fixed bin (17), /* highest segment number described by kst */ 1 21 2 highest_used_segno fixed bin (17), /* highest segment number yet used */ 1 22 2 lvs fixed bin (8), /* number of private LVs this process is connected to */ 1 23 2 time_of_bootload fixed bin (71), /* bootload time during prelinking */ 1 24 2 garbage_collections fixed bin (17) unaligned, /* KST garbage collections */ 1 25 2 entries_collected fixed bin (17) unaligned, /* KST entries recovered by garbage collection */ 1 26 2 free_list bit (18) unaligned, /* relative pointer to first free kste */ 1 27 2 prelinked_ring (7) bit (1) unaligned, /* rings prelinked in process */ 1 28 2 template bit (1) unaligned, /* this is a template kst if set */ 1 29 2 allow_256K_connect bit (1) unaligned, /* can use 256K segments */ 1 30 2 unused_2 bit (9) unaligned, 1 31 2 uid_hash_bucket (0 : 127) bit (18) unaligned, /* hash buckets */ 1 32 2 kst_entry (0 refer (kst.lowseg):0 refer (kst.highseg)) aligned like kste, /* kst entries */ 1 33 2 lv (1:256) bit (36), /* private logical volume connection list */ 1 34 2 end_of_kst bit (36); 1 35 1 36 dcl 1 kste based (kstep) aligned, /* KST entry declaration */ 1 37 2 fp bit (18) unaligned, /* forward rel pointer */ 1 38 2 segno fixed bin (17) unaligned, /* segment number of this kste */ 1 39 2 usage_count (0:7) fixed bin (8) unaligned, /* outstanding initiates/ring */ 1 40 2 entryp ptr unaligned, /* branch pointer */ 1 41 /* See WARNING below for requirements to use entryp. */ 1 42 2 uid bit (36) aligned, /* unique identifier */ 1 43 2 access_information unaligned, 1 44 3 dtbm bit (36), /* date time branch modified */ 1 45 3 extended_access bit (33), /* extended access from the branch */ 1 46 3 access bit (3), /* rew */ 1 47 3 ex_rb (3) bit (3), /* ring brackets from branch */ 1 48 2 pad1 bit (3) unaligned, 1 49 2 flags unaligned, 1 50 3 dirsw bit (1), /* directory switch */ 1 51 3 allow_write bit (1), /* set if initiated with write permission */ 1 52 3 priv_init bit (1), /* privileged initiation */ 1 53 3 tms bit (1), /* transparent modification switch */ 1 54 3 tus bit (1), /* transparent usage switch */ 1 55 3 tpd bit (1), /* transparent paging device switch */ 1 56 3 audit bit (1), /* audit switch */ 1 57 3 explicit_deact_ok bit (1), /* set if I am willing to have a user force deactivate */ 1 58 3 pad bit (3), 1 59 2 infcount fixed bin (12) unaligned; /* _i_f dirsw _t_h_e_n inferior count _e_l_s_e lv index */ 1 60 1 61 1 62 /* * * * * * * * * * * * * * * * * * * * * * * * * * */ 1 63 /* */ 1 64 /* WARNING: Before using kste.entryp to get a pointer to the directory */ 1 65 /* entry associated with the kst entry, you must first validate its value */ 1 66 /* by calling sum$getbranch or sum$getbranch_root_my. This call also locks */ 1 67 /* the containing directory. The containing directory must remain locked */ 1 68 /* during the entire period when kste.entryp and the directory entry are */ 1 69 /* being referenced. Once the directory is unlocked, kste.entryp can no */ 1 70 /* longer be used to get a pointer to the entry within the unlocked */ 1 71 /* directory since the dir entry could have been moved within the directory */ 1 72 /* by another processor. */ 1 73 /* */ 1 74 /* If you only need a pointer to the directory containing the associated */ 1 75 /* dir entry (but not to the dir entry itself), you can use: */ 1 76 /* pointer (kste.entryp, 0) */ 1 77 /* without calling sum to lock the directory and validate entryp. GDixon */ 1 78 /* */ 1 79 /* * * * * * * * * * * * * * * * * * * * * * * * * * */ 1 80 1 81 /* END OF: kst.incl.pl1 * * * * * */ 85 86 end kst_info; SOURCE FILES USED IN THIS COMPILATION. LINE NUMBER DATE MODIFIED NAME PATHNAME 0 11/11/89 0800.5 kst_info.pl1 >spec>install>1110>kst_info.pl1 85 1 09/18/86 1308.1 kst.incl.pl1 >ldd>include>kst.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. a_code parameter fixed bin(35,0) dcl 39 set ref 35 62* 67* a_hcsc parameter fixed bin(17,0) dcl 40 set ref 70 80* a_high_seg parameter fixed bin(17,0) dcl 41 set ref 70 82* a_segptr parameter pointer dcl 42 ref 35 58 a_uid parameter bit(36) dcl 43 set ref 35 59* 66* code 000100 automatic fixed bin(35,0) dcl 47 set ref 60* 61 62 get_kstep 000010 constant entry external dcl 52 ref 60 highest_used_segno 2 based fixed bin(17,0) level 2 dcl 1-18 ref 82 kst based structure level 1 dcl 1-18 kste based structure level 1 dcl 1-36 kstep 000106 automatic pointer dcl 1-15 set ref 60* 66 kstp 000104 automatic pointer dcl 1-15 set ref 78* 80 82 82 lowseg based fixed bin(17,0) level 2 dcl 1-18 ref 80 82 pds$kstp 000012 external static pointer dcl 1-15 ref 78 segno builtin function dcl 56 ref 60 60 segptr 000102 automatic pointer dcl 48 set ref 58* 60 60 uid 4 based bit(36) level 2 dcl 1-36 ref 66 NAMES DECLARED BY EXPLICIT CONTEXT. get_uid 000017 constant entry external dcl 35 high_low_seg_count 000066 constant entry external dcl 70 kst_info 000005 constant entry external dcl 14 THERE WERE NO NAMES DECLARED BY CONTEXT OR IMPLICATION. STORAGE REQUIREMENTS FOR THIS PROGRAM. Object Text Link Symbol Defs Static Start 0 0 164 200 107 174 Length 360 107 14 143 55 0 BLOCK NAME STACK SIZE TYPE WHY NONQUICK/WHO SHARES STACK FRAME kst_info 82 external procedure is an external procedure. STORAGE FOR AUTOMATIC VARIABLES. STACK FRAME LOC IDENTIFIER BLOCK NAME kst_info 000100 code kst_info 000102 segptr kst_info 000104 kstp kst_info 000106 kstep kst_info 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. get_kstep THE FOLLOWING EXTERNAL VARIABLES ARE USED BY THIS PROGRAM. pds$kstp LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC LINE LOC 14 000004 35 000012 58 000024 59 000030 60 000031 61 000047 62 000051 63 000053 66 000054 67 000060 68 000061 70 000062 78 000073 80 000077 82 000102 84 000106 ----------------------------------------------------------- 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