| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 /// \file eventgenerator/HepMC/HepMCEx02/src/H << 23 //$Id: HEPEvtcom.cc,v 1.2 2003/12/09 15:31:29 gunter Exp $
27 /// \brief Implementation of the HEPEvtcom cla <<
28 // <<
29 // =========================================== 24 // ======================================================================
30 // PARAMETER (NMXHEP=4000) << 25 // PARAMETER (NMXHEP=4000)
31 // COMMON/HEPEVT/NEVHEP,NHEP,ISTHEP(NMXHE << 26 // COMMON/HEPEVT/NEVHEP,NHEP,ISTHEP(NMXHEP),IDHEP(NMXHEP),
32 // & JMOHEP(2,NMXHEP),JDAHEP(2,NMXH 27 // & JMOHEP(2,NMXHEP),JDAHEP(2,NMXHEP),PHEP(5,NMXHEP),VHEP(4,NMXHEP)
33 // =========================================== 28 // ======================================================================
34 ///******************************************* 29 ///**********************************************************/
35 ///* D E S C R I P T I O N : 30 ///* D E S C R I P T I O N : */
36 ///*------------------------------------------ 31 ///*--------------------------------------------------------*/
37 ///* NEVHEP - event number (or some s 32 ///* NEVHEP - event number (or some special meaning*/
38 ///* (see documentation for 33 ///* (see documentation for details) */
39 ///* NHEP - actual number of entrie 34 ///* NHEP - actual number of entries in current */
40 ///* event. 35 ///* event. */
41 ///* ISTHEP[IHEP] - status code for IHEP'th 36 ///* ISTHEP[IHEP] - status code for IHEP'th entry - see */
42 ///* documentation for deta 37 ///* documentation for details */
43 ///* IDHEP [IHEP] - IHEP'th particle identi 38 ///* IDHEP [IHEP] - IHEP'th particle identifier according*/
44 ///* to PDG. 39 ///* to PDG. */
45 ///* JMOHEP[IHEP][0] - pointer to position of 40 ///* JMOHEP[IHEP][0] - pointer to position of 1st mother */
46 ///* JMOHEP[IHEP][1] - pointer to position of 41 ///* JMOHEP[IHEP][1] - pointer to position of 2nd mother */
47 ///* JDAHEP[IHEP][0] - pointer to position of 42 ///* JDAHEP[IHEP][0] - pointer to position of 1st daughter */
48 ///* JDAHEP[IHEP][1] - pointer to position of 43 ///* JDAHEP[IHEP][1] - pointer to position of 2nd daughter */
49 ///* PHEP [IHEP][0] - X momentum [Gev/c] 44 ///* PHEP [IHEP][0] - X momentum [Gev/c] */
50 ///* PHEP [IHEP][1] - Y momentum [Gev/c] 45 ///* PHEP [IHEP][1] - Y momentum [Gev/c] */
51 ///* PHEP [IHEP][2] - Z momentum [Gev/c] 46 ///* PHEP [IHEP][2] - Z momentum [Gev/c] */
52 ///* PHEP [IHEP][3] - Energy [Gev] 47 ///* PHEP [IHEP][3] - Energy [Gev] */
53 ///* PHEP [IHEP][4] - Mass[Gev/c^2] 48 ///* PHEP [IHEP][4] - Mass[Gev/c^2] */
54 ///* VHEP [IHEP][0] - X vertex [mm] 49 ///* VHEP [IHEP][0] - X vertex [mm] */
55 ///* VHEP [IHEP][1] - Y vertex [mm] 50 ///* VHEP [IHEP][1] - Y vertex [mm] */
56 ///* VHEP [IHEP][2] - Z vertex [mm] 51 ///* VHEP [IHEP][2] - Z vertex [mm] */
57 ///* VHEP [IHEP][3] - production time [mm/c] 52 ///* VHEP [IHEP][3] - production time [mm/c] */
58 ///*========================================== 53 ///*========================================================*/
59 // 54 //
60 // This interface to HEPEVT common block treat 55 // This interface to HEPEVT common block treats the block as
61 // an array of bytes --- the precision and num << 56 // an array of bytes --- the precision and number of entries
62 // is determined "on the fly" by the wrapper a 57 // is determined "on the fly" by the wrapper and used to decode
63 // each entry. 58 // each entry.
64 // 59 //
65 // HEPEVT_EntriesAllocation is the maximum siz << 60 // HEPEVT_EntriesAllocation is the maximum size of the HEPEVT common block
66 // that can be interfaced. It is NOT the actua << 61 // that can be interfaced. It is NOT the actual size of the HEPEVT common
67 // used in each individual application. The ac 62 // used in each individual application. The actual size can be changed on
68 // the fly using HepMC::HEPEVT_Wrapper::set_ma 63 // the fly using HepMC::HEPEVT_Wrapper::set_max_number_entries().
69 // Thus HEPEVT_EntriesAllocation should typica 64 // Thus HEPEVT_EntriesAllocation should typically be set
70 // to the maximum possible number of entries - 65 // to the maximum possible number of entries --- 10000 is a good choice
71 // (and is the number used by ATLAS versions o 66 // (and is the number used by ATLAS versions of Pythia).
72 67
73 #include <ctype.h> 68 #include <ctype.h>
74 69
75 //....oooOO0OOooo........oooOO0OOooo........oo << 70 enum {HEPEVT_EntriesAllocation=4000};
76 <<
77 enum <<
78 { <<
79 HEPEVT_EntriesAllocation = 4000 <<
80 }; <<
81 71
82 const unsigned int hepevt_bytes_allocation = s << 72 const unsigned int hepevt_bytes_allocation =
83 + << 73 sizeof(long int) * ( 2 + 4 * HEPEVT_EntriesAllocation )
>> 74 + sizeof(double) * ( 9 * HEPEVT_EntriesAllocation );
84 75
85 //....oooOO0OOooo........oooOO0OOooo........oo << 76 extern "C" struct hepevt{
86 << 77 char data[hepevt_bytes_allocation];
87 extern "C" struct hepevt <<
88 { <<
89 char data[hepevt_bytes_allocation]; <<
90 }; 78 };
91 79
92 hepevt hepevt_; 80 hepevt hepevt_;
>> 81
93 82