SLAC-151 UC -34 (EXP) (EXPI)
ON THE USE OF A MACRO PROCESSOR WITH SUMX
JOSEPH C. H. PARK
STANFORD LINEAR ACCELERATOR CENTER STANFORD UNIVERSITY Stanford, California 94305
and
MAX-PLANCK-INSTITUT F6R PHYSIK UND ASTROPHYSIK Munich, Germany
PREPARED FOR THE U. S. ATOMIC ENERGY COMMISSION UNDER CONTRACT NO. AT(04-3)-515
June 19’72
Printed in the United States of America. Available from National Technical Information Service, U. S. Department of Commerce, 5295 Port Royal Road, Springfield, Virginia 22151. Price: Printed Copy $3.00; Microfiche $0.95. ACKNOWLEDGEMENTS
I am grateful to Professor R. F. Mozley of the Stanford Linear Acceler- ator Center for encouragement in writing this report and to Professor H. Billing of the Max-Planck-Institut fiir Physik und Astrophysik, where part of the work was done. It was a pleasure to work with Mr. J. Ahern as mem- bers of the experimental group D at SLAC.
- ii _ TABLE OF CONTENTS Page I. Introduction ...... 1 II. AnExample ...... 3 III. Limitations and Errors...... 11 Appendix A ...... 14 AppendixB...... 21 AppendixC ...... 24 References ...... 26
LIST OF TABLES Page I. Input Text...... e ...... 4 II. OutputText...... 5 III. Macro Library . . 0 ...... D . . . . . : . . . , ...... ‘7
. . . - 111 - I. INTRODUCTION
If the SUMX’ control statements are considered as forming a base ~%mguage~~, then the power of equipping it with a macro facility becomes obvious. In the following we describe a simple scheme which consists of making one preprocessing pass through a general purpose (that is, base- language-independent) macro processor called MACROS. 2 The input text is prepared using base language statements (preferably in terms of variable symbols rather than fixed values) interspersed with preprocessor statements, such as macro definitions, macro calls, and value assignments to symbols. Prior to processing, this text is “compiled” by MACROS into a target text consisting entirely of base language statements. For readers who are not familiar with, for example, macro-assemblers we list some of the advantages thus gained: (1) Program parameterization. This is achieved explicitly through the use of symbols for such quantities as number of channels, channel width, etc., the value assignments for which are delayed until the run time so that it is trivial to change them to any desired values. Furthermore names (symbols) are more convenient than numbers (BOUT locations). (2) Shorthand notation and repetitive text generation. This aspect of a macro processor is like SUBROUTINE in FORTRAN, apart from in- vs. out-of-line distinction. Many base language statements can be compressed into one macro call, if necessary, with variable arguments. (3) Library facility. Definitions for general purpose or frequently occurring macros may be collected into an external library to be shared among different jobs. As discussed in Ref. 3 the advantages listed above are common features of macro processors. There are further advantages peculiar to our appli- cation as described below. For experiments with large statistics it is desirable to minimize the f’lengthf’ of the input data set (Data Summary Tape). One solution is to have for each event on a DST only the essential physics information such as the energy-momentum four-vectors and not the derivable quantities like invariant
-l- masses, momentum-transfers, and decay angles. They are then calculated by means of CHARMS during the SUMX run. A peculiar advantage arises in our scheme because one and the same macro call is used to generate names for quantities of interest, prepare the corresponding CHARM calls to calculate them, and assign BOUT locations for storing the named results. The chance for error is thus greatly reduced and since each run is explicitly self- contained it is easy to cross-check. The present scheme was developed by John Ahern and the author as members of experimental group D at the Stanford Linear Accelerator Center and has been in use at SLAC since 1968. As described elsewhere2 MACROS is written in PL/I taking advantage of its list-processing facility with a small part dealing with the operating system such as that for requesting core-space in assembler language. All CHARMS and SUMX related routines are written in FORTRAN IV except those “pots and pans” ones such as vector- and matrix-manipulating routines which are coded in assembler language. These programs are running on the IBM system 360/91 as implemented at SLAC and with some minor differences on a similar system at Max Planck Institut fur Physik und Astrophysik. The capability of the present version of the macro processor, MACROOl, is somewhat limited because it lacks macro-time features such as macro-time variables (to do arithmetic with) and conditional branches (to be able to define macros recursively). In Section II our scheme is described by an actual example with enough variety to illustrate most features of MACROS. Appendix A gives a formal description of the processor for reference purposes. In Appendix B we briefly summarize various CHARMS used in the example. In Section III several examples of errors in using the processor are collected, which also serve to show the limited capability of MACROOl. Appendix C has models for Job Control Language statements required to run.
-2- II. AN EXAMPLE
We illustrate the use of MACROS in SUMX by the example of Table I (referred to as A), which consists mostly of preprocessor statements (PPS) mixed with SLTMX control (base language) statements. After one pass through MACROS this text turns into the target text consisting entirely of the base language statements as shown in Table II (referred to as B), which is then used to control SUMX. The macro library used in this example is shown in Table III (referred to as L). Each PPS is one card long (columns 2-80) and is identified by the warning marker y0 in the first column. The use of the warning marker serves to speed up the processing time, Comments can be added after the marker ; as in line IA. Line 2A calls for a macro TWINKLE. Since it is not defined in the text scanned so far the macro library is searched. MACROS being a one- pass processor macros must be defined and values must be assigned to symbols before they are used. This has the advantage of allowing local redefinitions and reassignments. Lines 96-102L for TWINKLE show how to define a macro. Symbols (escape names) to be substituted are preceded by the escape character &, double escape characters && meaning the value must be placed starting at the specified column (left-justified). In MACROS no distinction is made between global (inter-macro) and local (within macro) symbols; any of &A, &B, or &C in TWINKLE may be left out of the parameter list, in which case values can be assigned by the assignment (=) statement appearing anywhere before use. A macro definition is terminated by MEND, except when it is followed by another macro definition. In such case the missing MEND is assumed by the processor, since the present version does not allow a nested macro definition. Returning to TWINKLE the parameter A can be a character string like 11000,1001 or ‘KEEP 2’. Unsigned integers and fixed point numbers (digits with a decimal point) do not need be surrounded by 1 as in the second argu- ment in TWINKLE. Line 1A expands into lines l-6B. Line 3A calls for a macro LITTLE which, as defined in lines 103-108L, illustrates nested macro calls. Other macro calls up to line 7A are similarly straightforward. As seen in the expansions (lines 7-62B) the main purpose
-3- TABLE I
INPUT TEXT
1 %; BEGIN 3 PRONG SUMX DECK 2 % CALL TWINKLE~‘1o00,200’,1,‘PHOTON+P . . . P + 2 PIONS 4/72’) 3 % CALL LITTLEL.005) 4 % CALL T33 5 % CALL HT3~'ANO'rl,14,12,4,'PION CHANELS’) $ CALL STAR : Z CALL MT4('ANO',1,14,12,4,29,'E>5.5') 0 % CALL C33 9 *SELECT 10 $ CALL BET(40,H45,.62,.86,‘RHO’) 11 *BLOCK 6 12 % CALL SYMBOL 13 % WGT-10 14 % MACRO ANGLE(C,CS,PH) 15 % CALL COS(C,CS) 16 CALL PHI (C,PHl 17 MACRO WONDER LN ) 18 EVA b&N 19 % CALL MASS(‘P PI-‘,1.08.M341 20 CALL MASSL’P PI+‘,l.O8,M35) 21 : CALL HASS('P1 PI',.28,M45) 22 % NPT=40 23 x CALL DELSCl(‘RHO’,D45) 24 % CALL ANGLE(*RHO TN T-CHAN HEL FRAME*,cJ~~,PJ~~T 25 % CALL ANGLEL’RHO IN S-CHAN HEL FRAME’,CH45,PH45) 26 % NPT=” 2-l FINISH 1 26 % MEND 29 % CALL WONDERL26) 30 % CALL WONDERL25) 31 % CALL WONDERL24 I 32 % CALL WONDER (231 33 *ALL DONE
-4- TABLE II
OUTPUT TEXT
1 *NEW PASS 1000,200 2 PHOTON+P . . . P + 2 PIONS 4172 3 *DISCARD I 4 *TAPE 5 10 6 *SELECT 7 TEST 14 WE I GHT 8 10 BIG 0 9 TEST 12 PROB 10 7 BIG .OD5 11 TEST 1 12 14 TRUE 13 AND 12 TRUE 14 TEST 16 RJCT BY ION 15 -14 EQU -1 16 TEST 18 PROTON IDENT BY ION 17 -14 EQU 1 18 TEST 2 P PI+ PI-UNIC’UE 19 -4 EQU 301 20 -4 EPU 302 21 TEST 3 P PI+ PI-AMB 22 -4 EQU -301 23 -4 EQU -302 24 TEST 4 P PI+ PI-ALL 25 2 TRUE 26 3 TRUE 27 TEST 6 P K+ K-UNIQUE 28 -4 EQU 303 29 -4 EQU 304 30 TEST 7 P K+ K-AMB 31 -4 EPU -303 32 -4 EOU -304 33 TEST 8 P K+ K-ALL 34 6 TRUE 35 7 TRUE 36 TfS7 9 P PBAR P 37 -4 EQU 305 33 -4 EQU -305 39 TEST 1 PION CHANELS 40 TRUE 41 AND :: TRUE 42 AND 4 TRUE 43 *CHARM 44 SETUP 8 701 45 *SELECT 46 TEST 22 47 701 BET 4.5 5.5 40 TEST 23 49 701 BET 5.5 7. 50 TEST 24 51 701 BET 7. 9. 52 TEST 25 53 701 BET 9. 12. 54 TEST 26 55 701 BET 12. 30. 56 TEST 29 57 701 BET 5.5 30. 58 TEST 1 E>5.5 59 14 TRUE 60 AND 12 TRUE 61 AND 4 TRUE 62 AND 29 TRUE 63 *CHARM 64 M34 2 721 2 34 701 65 M35 2 722 2 35 701
-5 - Table II (continued)
bb M45 2 723 2 45 701 67 724 1 5 1 701 60 COSP-cosp+ 0 z 727 1 4 1 701 69 cos+- 0 3 730 1 3 2 701 70 A45 4 754 2 45 12 701 71 434 4 734 2 34 21 701 72 A 35 4 744 2 35 21 701 73 *SELECT 74 TEST 40 RHO 75 723 BET .62 .0b 76 *BLOCK6 77 EVA 26 70 INVARIANT MASS OF P PI- 79 100 .04 . 1.08 80 721 10 81 INVARIANT MASS OF P PI+ 82 100 .04 1.08 83 722 10 84 INVARIANT MASS OF PI PI 85 100 .04 .2a 06 723 10 07 DELSQ OF RHO 88 100 .02 40 89 7 31 10 90 COSINE OF RHO IN T-CHAN HEL FRAME 91 40 .05 -1. 40 92 756 10 93 PHI OF RHO IN T-CHAN HEL FRAME 94 24 15. -180. 40 95 757 10 96 COSINE OF RHO IN S-CHAN HEL FRAME 97 40 .05 -1. 40 98 758 10 PHI OF RHO IN S-CHAN HEL FRAME 1:;: 24 15. -180. 40 101 759 10 102 FINISH 1 103 EVA 25 104 INVARIANT MASS OF P PI- 105 100 .04 1.08 106 721 10 107 INVARIANT MASS OF P PI+ 108 100 .D4 1.08 109 722 10 110 INVARIANT MASS OF PI PI 111 100 .04 .28 112 72 3 10 113 OELSP OF RHO 114 100 .02 40 115 731 10 116 COSINE OF RHO IN T-CHAN HEL FRAME 117 40 .05 -1. 40 118 756 10 119 PHI OF RHO IN T-CHAN HEL FRAME 120 24 15. -180. 40 121 757 10 ......
180 FINISH 1 181 *ALL DONE
-6- TABLE III
MACRO LIBRARY
1 % MACRO SYMBOL DEFINE DEFAULT VALUES FOR SYMBOLS 2 % COSL=‘-1.’ LOWER EDGE FOR COS-HIST. 3 % DCos=.o5 : CHANNEL WIDTH FOR COS-HIST. 4 % DDEL=.OZ : CHANNEL WIDTH FOR DELSQ-HIST. 5 % DELL=” LOWER EDGE FOR DELSQ-HIST. 6 % DM=.04 CHANNEL WIDTH FOR MASS-HIST. 7 % DPHI=15. CHANNEL WIDTH FOR PHI-HIST. 8 % FAC=” ; FACTOR TO SCALE HIST. 9 % FOLD=” i ‘FOLD’ OR ANYTHING TO FOLD BLOCK7 PLOT. 10 % NBIT=4 : NBITS FOR BLOCK? PLOT. 11 % NCOS=4D : CHANNEL NUMBER FOR COS-HIST. 12 % NDEL=lOD CHANNEL NUMBER FOR DELSQ HIST. 13 % NM=100 CHANNEL NUMBER FOR MASS HIST. 14 % NPHI=24 : CHANNEL NUMBER FOR PHI HIST. 15 % NPT=” : PRINCIPAL TEST NUMBER 16 % NT=” : TEST ASSOCIATED WITH MULTIPLICITY ELEMENT. 17 % NT2=” : 18 t NT3=” : 19 % NT4=” 20 % LOG=” : ‘LOG’ OR ANYTHING TO GET LOG HIST. 21 % PHIL='-180.' LOWER EDGE FOR PHI HIST. 22 X SGM=” : LOCATION OF ERROR (SIGMA). 23 % SGH2=” 24 % SGM3=” 25 % SGM4=” 26 % WGT=” LOCATION OF WEIGHT 27 % WGTZ=” 28 4: WGT3=” : 29 % WGT4=” ; 30 % XL=” i LOWER EDGES FOR BLOCK7 PLOT 31 % YL=” 32 %; DEFINE RLOCK6 MACROS ------33 % MACRO ONElTITLE,N,DX,XL,X) 34 6ATITLE 35 8&N CLBDX LBXL LdNPT ALFAC A&LOG 36 &6X LAWG T b6N T LLSGH 37 % MACRO MASSlSYS,HL,X) 38 % CALL ONEI’ INVARIANT MASS OF bSYS’.NH,DM,HL,Xl 39 % MACRO COS (SYS,X) 40 % CALL ONE{’ COSINE OF ASYS’,NCOS,DCOS,COSL,XT 41 % MACRO PHI (SYS,X I 42 % CALL ONE (’ PHI OF LSYS’,NPHI,DPHI,PHIL,X) 43 % MACRO DELSQ(SYS,X) 44 % CALL ONE I’DELSO OF 6SYS’,NDEL,ODEL,DELL,XT 45 %; BLOCK7 MACROS ------46 % MACRO TWD(SYSX,SYSY.X,Y) 4-l LdSYSX vs. LBSYSY 48 bLNP T b&NE1 T AdFOLD 49 86NX L&NY ABDX LLDY b&XL LAYL 50 86X b&Y d&NT 51 %; DEFINE SELECT MACROS ------__------52 % MACRO TEST(O,N,M,A,B,C) 53 TEST L&N 86C 54 L&H 660 d&A b&B 55 % MACRO BETlN,M,A,B,C) 56 % CALL TEST(‘BET’,N,M,A,B,C) 57 X MACRO BIG(N,M,A,C) 58 % CALL TES TI 'BIG' , N t M , A r"tC) 59 % MACRO EQU TN ,M ,A ,C 1 60 % CALL TESTl’EQU’,N,M,A,“,t) 61 % MACRO EQUElN,M,Tl,TZ,CT 62 % CALL EQU(N,M,TlrC) 63 dSM EPU A&T2 64 % MACRO TRUE lN,M,C) 65 % CALL TEST(‘TRUE’,N,M,“,“rC)
-7- Table III (continued)
66 % MACRO MT2(0,N,Tl,T2,C) 67 % CALL TRUE(N,Tl,C) 68 Lb0 66 T2 TRUE .. 69 % MACRO MT3(0,N,TlrT2,‘13pC) 70 % CALL HTZ(O,N,Tl~TZvC) 71 b&O b&T3 TRUE 72 % MACRO HT4(0,N,Tl,TZ,T3~T4~C) 73 % CALL MT3lOvN,TlrTZvl3*C) 74 &AD LL 14 TRUE % MACRO SET2lTlrT2) E % NT=Tl 77 % NTZ=T2 70 % MACRO SET4(Tl,TZ,T3~T4) 79 % CALL SET2(Tl,T2) 80 % NT3=T3 81 % NT4=T4 02 % MACRO NULLT 83 % NPT=” 84 X CALL SET4ttt.l 85 %; INCIDENT ENERGY INTEVALS FOR PHOTO-PROD. EXP --__----__------86 % MACRO E(N,A,Bl 87 % CALL BETfN,El,A,B~“) 88 % MACRO EINT 09 % CALL E(22.4.515.5) 90 % CALL Et2315.5.7.) 91 % CALL E(24,?.~9.) 92 % CALL EL25.9.112.1 93 % CALL E(26,12.,3D.) 94 % CALL El29.5.5,30.) 95 %; TWINKLE LITTLE STAR COMMON TO MOST SUMX JOBS ------_--_------96 % MACRO TWINKLELAvB~Cl i PROLOGUE 97 *NEW PASS ALA 90 bC 99 *DISCARD b&B 100 *TAPE 101 10 102 *SELECT 103 X MACRO LITTLE(A) ; SELECT BY WEIGHT AND PROBABILITY 104 % CALL BIGl14,10,D,‘WEIGHT’) 105 % CALL BIG~12,?,A,‘PRO~‘) 106 % CALL MTZI’AND’,1,14r12) 107 % CALL EQU(16,‘-14’,‘-l’,‘RJCT BY ION’) 108 X CALL EQUl18, ‘-14’11,‘PROTON IDENT BY ION’) 109 % MACRO STAR ; SET UP 4-VECTOR BANK 110 % El=?01 111 *CHARM 112 SETUP 8 6&E 1 113 *SELECT 114 4 CALL EINT ; INCI DENT ENERGY INTEVALS 115 %; SYMBOLS AND CHARMS FOR 1 + 2 . . . 3+4+5 --_------116 % MACRO MCHMfIX) 117 Mb&IX 2 A6Mb8IX 6&N d&IX L8El 118 %M;;RO CCHMfIX) 119 3 8ACBbIX d&N BBIX 861 66El 120 % MACRO ACHMIIX, IY 1 121 A&&IX 4 L&A&.41X b8N LBIX b8IY 6LEl 122 % MACRO Ct3 123 % M34=?21 ; INVARIANT MASSES 124 % M35=?22 125 % M45=723 126 % C14=?24 ; PRODUCTION COSINES AND OELSQ’S 127 % D34=?25 128 % C35=?2? 129 % D35=?2R 130 % c45=730
-8- Table III (continued)
131 % D45=?31 132 % A34=?34 ; DECAY ANGLES 133 % A35=?44 134 X A45=?54 135 % CJ45=?56 : J (HI REFERS TO T-CHANNEL (S-CHANNEL) HELICITV FRAMES 136 % PJ45=757 ; C LPI FOR COS (PHI) 137 % CH45=?50 138 % PH45=?59 139 % CW45=?6D 140 % PW45=?61 141 % N=2 i NO OF PARTICLES 142 *CHARM 143 % CALL MCHM(34) 144 % CALL MCHHl35) 145 % CALL HCHM(45) 146 COSP- 0 3 dLC34 5 1 .&&El 147 cosp+ 0 3 A&C35 : 4 AdEl 148 cos+- 0 3 d&C45 1 3 : AgEl 149 % CALL ACHM(45,12) 150 f CALL ACHM(34,21) 151 % CALL ACHM(35.21) 152 %: MACROS TD SELECT CHANNELS --_------__------153 % MACRO H2lNlrN2,N3,11,12,D) 154 % CALL EOU2lN1,'-4',Il,I2,'8D.UNIQUE') 155 % CALL EOU2lN2,‘-4’r’-dIl’r’-AI2’,‘AD.AM5’~ 156 % CALL HT2l”,N3,Nl,N2,‘bD.ALL’) 157 % MACRO T33 158 % CALL H2(2,3,4,301,302,‘P PI+ PI-‘) 159 % CALL H2(6,?,8,303,304,‘P K+ K-‘T 160 % CALL EQU2(9,‘-4’,305,‘-30511’P PEAR P’)
-9- of these is to define the master test (TEST 1) to eliminate unwanted events before CHARM calls are made to calculate various quantities to be SUMXed. The latter is done by a call (line 8A) to C33 (lines 122-151L). As shown C33 in particular assigns BOUT locations to various names for quantities being calculated. MCHM (lines 116-117L) shows how a symbol can be concatenated and then substituted. Note here that the variable N is not included in the param- eter list. Since it is comparatively slowly varying it is set by assignment (line 141L) rather than explicitly as an argument of the macro. C33 expands into lines 63-72B. For completeness explanations for CHARMS used are given in Appendix B . Unassigned escape names, i.e., those which are preceded by & but have not yet appeared in assignment statements are left unchanged in the text. This choice rather than automatic null-assignment is made because of possible use in other language such as in FORTRAN IV in which the character & is used to designate statement labels. The purpose of SYMBOL (lines l-31L) is to assign default values to symbols occurring globally as in the BLOCK6 and 7 macros (lines 33-5OL), any of which may be set and reset before use as in lines 13, 22, and 26A. Macros can, of course, be defined outside the library by the user as in lines 14-28A. The corresponding calls (lines 29-32A) result in SUMX control statements for a set of histograms repeated for different incident energy intervals as shown in lines 77-180B. It was often asked, “in this scheme how many lines can be produced by a single line of typing?“. The answer is obviously, “one-to-all”, because all of the lines say, in this example can be lumped into a single macro. The need for doing so may conceivably arise in on-line applications. It is also said that some of these features are available through additional programming in SUMX. This must be self-evident, because MACROS itself is a piece of program. The idea being propounded is in the use of a general purpose macro processor. In this respect it would have been better, if the “macro part” of the 360 assembler could easily be detached so that it could also be used elsewhere.
- 10 - PAGt 1
5 TM1 CFVEL REPLC SflURCE S TATFMENT MAC01 fJSEPbY
1 0 2 0 3 0 4 0 5 0 Trivial syntax errors are evident from diagnostic messages from MACROS. 6 0 7 0 In the following we describe examples of errors which require some explanation. R 0 done 9 0 (1) Scanning for escape names is from left to right. A peculiar 10 0 effect can arise from concatenating names. For example in the use of the 11 0 12 0 MACRO ACHM defined in lines 120-121 of Table III: 13 0 14 0 A12=1234 205 0 CALL ACHkll7.34) 206 1 4 1234 RAN 12 34 LiEl 208 0 209 0 which is as expected. Ilowever, 210 0 211 0 A=‘I 217 0 CALL ACHHl12,34) 213 1 4 12 aaN 12 34 L&El 215 0 216 0 217 0 (2) When a substitution for an escape name is done, the line of texl is 21R 0 rescanned (because the value itself may be an escape name) until all possible 219 0 220 0 substitutions are carried out. This can cause a loop as in the following example: 221 0 %l 222 % MACRO FnlI41 223 E .?.A STAR 224 E XMENO lGENFR.ATEDl 275 % MACRO M2l4) 22b E ‘L CALL Mll’84 LITTLE’1 221 E % MENO 228 0 %: 229 0 x CALL MZ(‘Th’IN&LE’I ***ERROR IN STMT 2 31 rLEVEL= Z,MACRfl=Ml ,llClDEL STMT= 223vLA’iT TflKEFI=‘A’ SEV= fi SIG PART OF STYl/CFPL VALUE LOST IN PACKED REPL ***ERROR IN (TMT 231 rLEVFL= Z,MACRfl=Ml .MODtL STMT= 723,LAST TCKt’d=‘A’ SEV= 8 SIG PART OF STMl/REPL VALUE LOS1 IN PACKED REPL ***ERROR IN STMT 231 ,LEVEL= Z,Mb.CRO=ul ,M@DEI. 51 MT= 223,LAST TIIKEU=‘A’ SE”= e SIG PART OF SlMl/REPL VALUE LljST Iii FACKkD REPL ***ERROR IN STMT 231 ,LEVEL= Z,MACPfl=Ml ,MO@EL STMT= 223,LAYT TvKEN=‘A’ SEV= X SIG PA STMT LFVEL REPLC SOURCE STATEMENT MAC01 BSEP69 ***ERROR IN STMT 23l,LEVEL= ZrMACRO=Ml ,MOOEL STMT= 223rLAST TOKEN=‘A’ SEV= u SIG PART OF STMT/REPL VALUE LOST IN PACKED REPL ***ERROK IN STMT 23l,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SEV= 8 SIG PART OF STMT/REPL VALUE LOST IN PACKEU RFPL ***ERROR IN STMT 231 ,LEVEL= Z,MACRfl=Ml ,MOOEC STMT= 223,LAST TDKEN=‘A’ SEV= 8 SIG PART OF STYT/REPL VALUE LOST IN PACKED RFPL ***ERROR IN STMT 231,LEVEL= 2rMACRO=Ml .MODEL STMT= 223,LAST TOKEN=‘A’ SEV: R SIG PART OF STMT/REPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVEC= Z,NACRO=MI ,MODEL STMT= 223rLAST TOKEN=‘A’ SEV= 8 SIG PART OF STMTIREPL VALlJE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVEL= Z,MACRO=Ml ,MOOEL STMT= 223,LAST. TOKEN=‘A’ SEV= 8 SIG PART OF STMTIRFPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SEV= 8 SIG PART OF STMlIREPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231rLEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SFV= 8 SIG PART OF STMTlRFPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVFL= Z,MACRO=Ml ,MODEL STNT= 223,LAST TOKFN=‘A’ SFV= 8 SIG PART OF STMT/RFPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231 ,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKFN=‘A’ SEV= B SIG PART OF STMT/RFPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231 ,LEVFL= Z,MACRO=Ml ,MODEL STMT= 223rLAST TOKEN=‘A’ SEV’ 8 SlG PART OF STHTlREPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKFN=‘A’ SFV= 8 StG PART OF STMT/REPL VALUE LOST IN PACKED REPL I”. ***ERROR IN STMT ~>I,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SFV= 8 SIG PART OF STMT/REPL VALUE LOST IN PACKED REPL ***ERROR IN STMT 231,LEVEL= Z,MACRO=Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SEV= R SIG PART OF STNT/REPL VALVE LOST IN PACKED REPL ***ERROR IN STMT 231 ,LEVEL= 2,MACRO:Ml ,MODEL STMT= 223,LAST TOKEN=‘A’ SEV=lZ TOO MANY REPLACEMENTS 2 31 2 31 &A LITTLE LITTLE LITTLE LITTLE LITTLE LITTLE LITTLE LITTLE LITTLE LITT 234 0 %: which also serves to indicate that the maximum number of replacements per 2 35 0 “d: 2 36 0 %; line is 32. 2 37 0 %; The solution is, of course, to redefine the MACRO as 2 38 0 %; 2 39 % MACRO M3lB) 240 E % ;,*i; Mll’6B LITTLE’) 241 E % 242 0 x: 243 0 % CALL M3t’TWINKLE’) 245 2 2 TWINKLE LITTLE STAR 240 0 ‘g: 249 0 %: 250 I: (3) Processor statements are not subject to replacements as in 251 0” x: 252 x MACRO Ml1.C) 253 E % CALL M&I CC) 254 F % MEND 255 0 %: 256 % CALL MI3,‘TWINKLE’J +*:ERROR IN STMT 266,LEVEL=lO.NACRO=M , MODEL STrT= 253rLAST TOKEN=‘M’ SEV=lb MACRO DEPTH EXCEEDS MAXIMUM CONDI TION ERR OCCURRED IN STATEMENT 00322 AT OFFSET +00266 FROM ENTRY POINT MACROCALL 2,05*17 PAGE 3 STMT LEVEL REPLC SOIJRCE STATFMENT MAC01 aSEP69 CALLED, IN STATEMFNT 007a9, FROM PROCEOURE WITH ENTRY POINT MACROS 267 0 x: 26R 0 7; (4) Because of the lack of MACRO-time arithmetic and conditional GOT0 269 0 z; statement, it is obvious that a MACRO cannot be defined recursively. 270 0 %: This is 271 0 X: what happens: 272 0 X: 273 f MACRO RlArR,Cl 274 E I AM AT LFVEL LA 275 E x CALL R(R,C,. I 276 E % MEND 277 0 X: 278 0 % CALL R(1,2,31 279 1 1 I AM AT LEVEL 1 281 2 I AM AT LEVEL 2 28 3 3 : I AM AT LFVFL 3 285 4 1 I AM AT LEVEL 287 5 1 I AM AT LEVEL 289 6 1 I AM AT LEVEL 291 7 1 I AM AT LEVEL 293 a 1 I AM AT LEVEL 295 9 1 I AM AT LFVEL 297 10 1 i AM AT LEVEL ***ERROR IN STMT 29arLEVEL=lO,MACRO=R ,MOOEL STMT= 275,LAS.T TOKEN=‘R’ SEV116 MACRO DFPTH EXCEEDS MAXIMUM CONDITION ERR OCClJRRED TN STATEMENT 00322 AT OFFSET +00266 FROM ENTRY POINT MACROCALL CALLFD, IN STATEMFNT 00789, FROM PROCEDURE WITH ENTRY POINT MACROS 299 0 x; 300 0 2: which also serves to show that the maximum level of nested MACRO call is 10. 301 0 X: 302 0 X; 303 0 %; ---M A C R 0 S PROCESSING COHPLETED,HIGHEST SEVERITY=16 APPENDIX A The following is reproduced from Ref. 2. III. "NXOS Language Description PICE 22 STIIl LEVEL BEPLC SOOPCB STITERENT RACOl BSEP69 365 This section will describe the elements of the IUXDS 366 langtlage in detail. The exaeples of preceding SectioDs rsre 367 of an introductory nature, while this section is designed for 368 reference purposes. 369 The syntax notation PSOS names of items enclosed in < > 370 symbols to denote syntactic entities. Definitions of then are 371 either given in words or in terms of other entities. This is 372 indicated by an - 14 - III. IACNOS Larlgaage Description PAGE 23 ST"T LEVEL RKPLC SOOBCE STATESENT n~co i 6~~~69 P19 0 and its value is taken to be the am11 string. 4 20 0 421 0 Examples: u22 0 -15 - III. RACEGS tangoage Description PAGE 24 STIlT LEVEL EEPLC SGGSCE STAZERENT n~col 85~~69 474 'x; 1 “ACNO FWNCTION ( TTP,ARG ) 475 . . 476 ItEND statement 417 FOP.: X "END 478 The ilEND statement terminates a macro definition that 479 has not been otherwise ended. 480 481 CALL Statement 482 For.: X CALL -16 - III. “lCAO.5 Language Description PICK 25 5111-r LEVEL REPLC SOUBCE S?ATcntBT IlACOl 851P69 529 0 ashdora stack. 530 0 (2) Phe raloes of the actoal para.eters supplied in the 531 0 CXLL stateeeat are assigned to the formal parameter 532 identifiers. If a.y or all of the actual parmeters are 533 omitted, then the corresponding formal parameters are 534 0 set to the DQll string. Excess actual para.eters *Ire 535 0 ignored. ThllS o cell statement Of the for* 536 0 X ClLL PUXCTIOX(.3) 537 0 for the macro PUIICTIOII above, will set TIP=" and ABG=‘3’. 538 0 (3) MCBOS begins fetching inpot fro* the body of the mcro 539 0 definition. The processor variables thet are correntl~ 590 0 active will be used during processing--this includes 591 0 any variables 8et by macros that called this one. 5 u2 0 14) When the end of the .acro definition is reached, the 543 0 raloes previously associated with the for-1 parmeter 59u 0 identifiers are restored with the values seved oo the 545 0 pushdown stack, if any. ll).CBOS than resumes fetching 546 0 statements in the environment of the invoking CALL 507 0 statement: but chaages made to variables global to the 548 0 called macro are retained. 599 0 Tbe maximum depth of macro calls is 10 levels. 550 0 551 0 552 0 IV. BLPL*cE”K”r Ill BAS1 L,IcDIc* STITElIllTS 553 0 55u Xrer, base languaqe statement (i.e. no 'X' in co1 1) 555 ootside of a macro definition is scanned by IACBOS for the 556 escape character 'b', which signals a potential replacement. 557 If the *t' is followed by aa identifier or by another '6' and 558 an identifier, and if the identifier is that of a processor 559 0 variable that is currently active, then a replacement is per- 560 0 formed. The single ampersand is osed to denote "packed" 561 0 replacement, for free format applications: and the double 562 0 ampersand for -non-packed" replacement, for ose where colom 563 0 positions are critical. 564 0 The ter. "escape name" is used to refer to the escape 565 character(s) and the immediately following identifier. rot one 566 0” case of packed replacement, a period delimiter is included in 567 0 the escape na.e. 568 0 scanning for am escspe character proceeds fro* left to 569 0 right. The scanning field is the entire PoEtran state.ent, 570 including continuation lines, if the POET=1 option is used: 571 i else it is the columns between the begin and end columns (inclu- 572 0 sive) of the 80 character record. The default scanning Columns 573 0 are 1 thru 80: they may be changed by the user if needed. 574 0 when an escape ns.e if found, and replacement is done (the 575 0 identifier has a Value), then the scm is restarted from the begin 576 0 co1nmn. If the identifier does not hare a value, then the sea?, 577 0 proceeds to the right. Bescanning co!Itinues until 110 578 0 .ore escape characters remain, or no .ore replaceeents can be 579 0 done. The rescanning mechanism allows construction of escape 580 0 rm.es by replacement. The eaximum number of replaceeeats allowed 581 0 in a base languege statement iS 30. 582 0 specific rules for the replacement modes are as follows: 583 0 - 17 - III. IACEOS Language Description PmiE 26 z STRT L!dVEL REPLC SOUBCC STITEHENT UK0 1 RSEP69 584 (1) Packed re laceeent--This is indicated by a single '6' 585 i ;I followed t y an identifier, delimited by any special 586 0 x; character. If it is delimited by '.', then the period 587 0 I: will also be removed from the text--this allows concat- 588 0 x; enation of a replacement raloe with a letter or digit. 589 0 X: Replacement is done by removing the escape character 590 0 I: and the identifier (and period, if necessary) from the 591 0 X: text, and inserting the value associated with the iden- 592 0 X: tifier in its place. The remainder of the statement to 593 0 x; the right of the escape name , extending to the and of the 594 0 x: scanning field, is shifted right or left as needed to 595 0 X; accommodate the replaceeent value. Blanks will be added 0 X: at the end of the statement if the value is shorter than 597 0 x: the escape name, or truncation will be preformed if the 59R 0 X: value is longer. In the latter case, loss of non-blank 599 0 X: characters nil1 be noted br RACBOS. 0 X: __.LO, D 'I: (2) Non-packed replacement--This is denoted by a double 602 0 X: escape character 'bE* followed by an identifier. The 603 0 I; identifier is delimited br say special character (880 60’4 0 x; special rule for period applies). The replacement 605 0 I: of the escape name is done without any shifting of the 606 0 X: part of the statement to the right of the escape name. 607 0 X; If the replacement raloe is shorter than the escape 608 0 x; name, then blanks are added to it. If the value is longer, 609 0 x; then blank positions folloring the escape name are used 6 10 0 to hold the trailing non-blank characters of the valo4. .5 1 1 " :i If there is still not enough room, even using the blank 612 0 x: positions, and discounting trailing blanks of the value, 613 0 x; then OICBOS notes the truncation of the raloe. -18 - IV. using arcaos-options and JCL requirements PAGE 27 STRT LEVE L REPLC SOURCE ST1TE1ENT RKOl aSCP69 615 X: IIKBOS is a load module named IACaOOl which can be used 6 16 Xi from the library PDa.JaI.LOlDaODS. It uses the folloriag 6 17 1: ddnames: 618 5; 619 a: STSPaINT -- Outpot listing. DCB information is supplied by the 620 x: progrss--EaC?a=V6,LRaCL=l25,aLKSIZE=3P25. The P6LN option 621 X; may be set to suppress the aotput listing in whole or part. 622 x: SVSIS -- primary input file. Say be any segoeotial dataset 623 x: or partitioned dataset member (or corvzatenatioa) with 6211 0 x: logical record length 80 bytes. 625 0 x: SVSOIJT -- IACBOS processed outpllt. DCBs must be sopplied by 626 0 XI user such that LBSCL=dO is wed. Generally, this file 627 0 X; is associated with a temporary dataset that is used later 62R 0 x: in the job. An option may be giten to II*CBoS to soppress 629 0 s: writing 01 STSOUT. 630 0 s: SVSLIB -- secondary input file for macro definitions. This 631 x: is used to make a library of awxo defioitions available 632 3; to "Kaos. If sot required, them the DD statement can be 633 x: omitted. If used, the DD statesent aoat define a sequential 6 34 x: dstseet or partitfooed dataset member. Coacatenstioas of 635 Xi these two items are acceptable if the DCas me the s(Lme. 63b I: The logical record length must be 80 bytes. 637 x: 638 X: Options are passed to BACPOS using the PASS field on the 639 x: KICC statement. The format is a list of keyrordo followed by 6UO 0 x: an egoal sign and an integer, separated by COYPU%. The options 641 0 3; and their default valoes are: 642 X; 613 Ii a; BKGC (1) Begin column for scanning of b&se language St*tt 649 0 x: merits. This is ignored if the IOBT-1 option is 695 0 XI axed. 646 0 x: NNDC---- leoI.--. End colrren for scanning of base lanogaqe state- 647 0 x; merits. Also ignored if YORT-1. 698 0 ROUT (0 If oat zero, then the I(ACROS ootput is written 6’49 0 on STSOUT. 650 0 PGEl (2) If zero, t&n no otltput listing is produced. 651 0 If one. then top lore1 statements only are listed. 652 0 If t.0; then baie langoage statements~froa macro 653 0 expansions are listed in addition to top level 654 0 statements. 655 0 X; PLIB 101. . If not zero, then the macro definitions edited 656 0 x: from SVSLIB are listed when it is opened. 657 0 x; FORT (0) If not zero, then the PORTRIB statement conVen- 678 0 x: tions are used--columns 1-72 of the first card of 659 0 X; a statement and columns 7-12 of any continuation 660 0 x: cards are treated as a single base language 661 0 x: statement for replacement scanniog. If there *re 662 0 Xi no Rollerith literale in quotes in the statement. 663 0 x: then trailing blanks at the end of each (inn We 664 0 x: removed. There is a limit of 270 characters that 665 0 S: may be retained, discounting trailing blanks. 666 0 x: Thus, in the worst case, 3 continuation cards ale 667 0 x: allowed. 668 0 X; pa85 (0) If not zero, then *Paint Before Sabstitution', - 19 - Iv. Using nACROS-options and JCL requirements PACE 28 SOURCE STATElENT IACOI RSEP69 x; rbich causes base las ua e statements containing x: ;~~~~ecba!z~~z;;to 8, %.sted before replacement 611 0 X: , they are listed after replace- 672 0 %; nent only. 673 0 x: SIZS (10000) The amount of space (in bytes) to be allocated to 67Y 0 x; storage of the values of variables. Should one 675 0 x: find that he has run out (error nessagej, he can 676 0 xz~, rerun vith a lacaer value (UP to 32767). Space 677 0 x: could run oat if-a large n&ber of variable; are 678 0 'I; all active at the same time. 679 0 5: 680 0 X: when iucaos is run, the first page of the listing gives the 681 0 x: options used, and a number 'SIZY', which is tbe amonnt of free 682 0 %; space in bytes that IIACBOS thinks it has for storage of strings, hA3 0 X: macro definitions and control iofornation. n*cNos will use all 684 0 X: the free space in the region in which it is run. Sinimsn region 685 0 I; size is about IOOk bytes. 686 0 X; ii87 0 X; Errors in IIACROS input are flagged with a text message 688 0 x: indicating the type of error.disposition, and location. 689 0 X: Severities are associated with the errors ranging from U-16. 690 0 x: The highest severity is passed back to OS as a return code 691 0 X; that can be tested in JCL to suppress subsequent job steps. - 20 - APPENDIX B CHARMS An event in our SUMX is represented by a FORTRAN array P(4, N) con- sisting of four-vectors, one for each participant of an N-particle reaction, 1+2 -3+4+ a.. where numbers correspond to the second index of the array P. As discussed in the text the purpose of the CHARMS to be described here is to calculate from P various quantities of interest, which are to be specified at the SUMX run time. As described in the SUMX manual’ a CHARM control-card allows five parameters, Ll, L2,. . D, L5, by means of which user can communicate with the requested CHARM subroutine. In the descriptions below t’pointertl means BOUT location, a group of particles is denoted by ij. , . , the total number in this group by N. The CHARM parameter L5 is always the base pointer for the array P. (1) CHARM2 Invariant mass and four-momentum transfer for a group of particles. Ll : pointer for answer L2 : N L3 : ij. -. L4 : 0 to get M = SQRT (Pi f Pj + ..d23’ [ -n to get A2= -(Pi + Pj + . . . -Pn)2 . (2) CHARM3 Four-momentum transfer (A2), production cosine (COS) and momentum (Q) for a group of particles in the overaH center-of-mass. Ll : base pointer for answer vector A A(l)=COS , A(2)=A2 - dn (kinematic minimum), A(3)=Q (calculated only if Ll is negative) . L2 :N L3 : ij.. . L4 : 1 or 2 to specify with respect to beam or target. - 21 - (3) CHARM4 Two or three body decay angles. Ll : base pointer to answer vector A L2 : N (2 or 3) L3 : ij.. . L4 : ab (12 or 21 depending on where 1 or 2 is to be incident) The calculated decay angles have the following meaning. Let R = Pi f Pj + . . . and T be such that a+b=R+T . Let i be the normal to the production plane, . y // ??xz in the R-rest frame, or // zxg in the laboratory frame . Then in the rest frame of R define the t-channel helicity (Gottfried-Jackson) axes as A . z=a and ,. A * x=yxz. The s-channel helicity axes are related to the above by a rotation about the common y-axis. Let 4 ,. ZH = R in the overall center-of-mass, or = -T in the R-rest frame , and A ,. YH=Y 3 Then using i as the analyzer CHARM4 calculates the following A(1) = lH . ; A(2) = tan-’ (lH . ;//ZH * ;) , - 22- A(3)=;. ,^ , A(4) = tan-’ (2 . i/i - j) , A(5) = i . iH , LI A A A(6) = tan-l (I . x# - y,), where the angles are in degrees. It appears in this scheme that because STJMX treats L3, L4 as integers particle index greater than 9 cannot be accommodated. One solution, as long as they need not be addressed at once, is to move base pointer L5 within P or to rearrange members of P before use. Far better solution is to TTask11 SUMX to regard these parameters as character strings, so that a number system of arbitrary base can be employed. - 23 - APPENDIX C JCL EXAMPLES We give examples of JCL statements necessary for runs on the System 360/91 as implemented at SLAC and at MPI. Catalogued procedures used are current ones in May 1972. (1) At SLAC // JOB card //J~BLIB DD DSN=WYL. ED. PUB. Ln39, DISP=(SHR, PASS) //MACRO ExEc PGM=MAcROO 1 //SYSPRINT DD SYSOUT=A //SYSOUT DD DSN=&MOUT, DISP=(NEW, PASS), UNIT=SYSDA, // SPACE=(TRK, (ZOO,lo)), DCB=(RECFM=FB, LRECG-80, BLKSIZE=3200) ,‘/SYSLIB DD DSN=WYL. ED. JAP. SRCS(SMCRl), DISP=SHR // DD user macro library //SYSIN DD * input text i 1 //SUMX EXEC FORTHCLG, PARM. FORT=‘OPT=2’ //FORT. s~smDD * user FORTRAN source, if any I //LKED. SYSLIB DD DSN=WYL. ED. PUB. LIBS, DISP=SHR // DD DSN=SYSl. FORTLIB, DISP=SHR // DD DSN=SYSS. FORTLIB, DISP=SHR // DD DSN=SYS4. FORTLIB, DISP=SHR //LKED. SYSINDD * INC LUDE SYSLIB (SUMX) ENTRY MAIN //GO. FTlOFOOl DD user DST description //GO. SYSIN DD DSN=&MOUT, DISP=(OLD, DELETE) - 24 - (2) At MPI // JOB card //D EXEC PGM=MACROO 1, REGION=300K //STEPLIB DD DSN=LOAD. JHP, DISP=SHR //SYSLIB DD DSN=SOR. JHP(MACLIB), DISP=SHR // DD user macro library //SY SPRINT DD SYSOUT=A //SYSOUT DD DSN=MOUT, DISP=(NEW, PASS), UNIT=DISK, // SPACE=(TRK, (200, lo)), DCB=SOR. JHP //SYSIN DD * input text //S EXEC SUMX //C . SY SIN DD * I user FORTRAN source, if any /I //L. SYSLIB DD DSN=LOAD. JHP, DISP=SHR DD DSN=SYSl. FORTLIB, DISP=SHR //G. FTlOFOOl DD user DST description //G. SYSIN DD DSN=MOUT, DISP=(OLD, DELETE) - 25 - REFERENCES 1. Although the technique is evidently general, we discuss a particular application to the CERN version of the SUMX described in J. Zoll, CERN Track Chamber Program Library Manual (1970). 2. John Ahern, MACROS-Statement Oriented Macro Processor, SLAC Computation Group User Note 29 (1969). 3. P. J. Borwn, A Survey of Macro Processors, Annual Review in Auto- matic Programming, Vol. 6, Part 2 (Pergamon Press, New York, 1969). - 26 -