lars/geant4
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Import Geant4 10.3.0 source tree

Browse Source
This commit is contained in:
Gabriele Cosmo
2016-12-09 12:35:28 +01:00
parent 4ec577e5c4
commit a3452e42ac
3514 changed files with 210500 additions and 89628 deletions
Download Patch File Download Diff File Expand all files Collapse all files
source/analysis/g4tools/include/tools/wroot/basket
+122 -101
View File
@@ -12,7 +12,7 @@ namespace tools {
namespace wroot {
class basket : public virtual ibo, public key {
static uint32 START_BIG_FILE() {return 2000000000;}
typedef key parent;
public:
static const std::string& s_class() {
static const std::string s_v("tools::wroot::basket");
@@ -38,33 +38,33 @@ public: //ibo
//if(!m_data.length()) {
// // to be sure to not work on a basket already written
// // with write_on_file()
// m_file.out() << "tools::wroot::basket::stream :"
// << " m_data.length() is null."
// << std::endl;
// m_out << "tools::wroot::basket::stream :"
// << " m_data.length() is null."
// << std::endl;
// return false;
//}
if(m_seek_key) {
m_file.out() << "tools::wroot::basket::stream :"
<< " m_seek_key is not null."
<< std::endl;
m_out << "tools::wroot::basket::stream :"
<< " m_seek_key is not null."
<< std::endl;
return false;
}
if(m_last) {
m_file.out() << "tools::wroot::basket::stream :"
<< " m_last is not null."
<< std::endl;
m_out << "tools::wroot::basket::stream :"
<< " m_last is not null."
<< std::endl;
return false;
}
if(!m_entry_offset) {
m_file.out() << "tools::wroot::basket::stream :"
<< " m_entry_offset is null."
<< std::endl;
m_out << "tools::wroot::basket::stream :"
<< " m_entry_offset is null."
<< std::endl;
return false;
}
{uint32 last = m_data.length()+m_key_length;
if(last>m_last) {
const_cast<basket&>(*this).m_last = last;
{uint32 _last = m_data.length()+m_key_length;
if(_last>m_last) {
const_cast<basket&>(*this).m_last = _last;
}}
if(m_last>m_buf_size) {
const_cast<basket&>(*this).m_buf_size = m_last;
@@ -72,7 +72,7 @@ public: //ibo
char flag = 11;
if(m_displacement) flag += 40;
if(!_stream_header(a_buffer,flag)) return false;
if(!_stream_header(a_buffer,m_verbose,flag)) return false;
if(m_entry_offset && m_nev) {
if(!a_buffer.write_array(m_entry_offset,m_nev)) return false;
@@ -83,15 +83,15 @@ public: //ibo
if(m_data.to_displace()) {
//NOTE : how / when handle the displacements ?
m_file.out() << "tools::wroot::basket::stream :"
<< " WARNING : m_data buffer has offsets to displace."
<< std::endl;
m_out << "tools::wroot::basket::stream :"
<< " WARNING : m_data buffer has offsets to displace."
<< std::endl;
//if(!const_cast<basket&>(*this).m_data.displace_mapped(m_key_length))
// return false; //???
}
buffer bref(m_file.out(),m_file.byte_swap(),256);
if(!_stream_header(bref)) return false; //then header stored twice !
buffer bref(m_out,a_buffer.byte_swap(),256);
if(!_stream_header(bref,m_verbose)) return false; //then header stored twice !
//if(bref.length()!=m_key_length) {}
if(!bref.write_fast_array(m_data.buf(),m_data.length())) return false;
if(!a_buffer.write_fast_array(bref.buf(),bref.length())) return false;
@@ -99,15 +99,16 @@ public: //ibo
return true;
}
public:
basket(ifile& a_file,
seek a_seek_parent_dir,
const std::string& a_object_name,
const std::string& a_object_title,
const std::string& a_object_class,
uint32 a_basket_size)
:key(a_file,a_seek_parent_dir,
a_object_name,a_object_title,a_object_class,0)
,m_data(a_file.out(),a_file.byte_swap(),a_basket_size)
basket(std::ostream& a_out,
bool a_byte_swap,
seek a_seek_directory,
const std::string& a_object_name,
const std::string& a_object_title,
const std::string& a_object_class,
uint32 a_basket_size,bool a_verbose)
:parent(a_out,a_seek_directory,a_object_name,a_object_title,a_object_class)
,m_verbose(a_verbose)
,m_data(a_out,a_byte_swap,a_basket_size)
,m_nev_buf_size(1000)
,m_nev(0)
,m_last(0)
@@ -118,17 +119,20 @@ public:
mem::increment(s_class().c_str());
#endif
if(m_version>1000) {
if(m_version>big_file_version_tag()) {
} else {
// G.Barrand : April 2016 : WARNING : this is a change in the ROOT/IO format compared to CERN-ROOT/4.x :
// We follow the logic found on CERN-ROOT/5.x that enforces "+1000" on all baskets.
m_version += 1000;
m_version += big_file_version_tag();
}
m_key_length = header_record_size(m_version);
initialize(0);
initialize_zero();
if(m_nev_buf_size) m_entry_offset = new uint32[m_nev_buf_size];
if(m_nev_buf_size) {
m_entry_offset = new int[m_nev_buf_size];
{for(uint32 i=0;i<m_nev_buf_size;i++) m_entry_offset[i] = 0;}
}
}
virtual ~basket(){
delete [] m_entry_offset;
@@ -142,8 +146,9 @@ public:
protected:
basket(const basket& a_from)
:ibo(a_from)
,key(a_from)
,m_data(m_file.out(),m_file.byte_swap(),256)
,parent(a_from)
,m_verbose(a_from.m_verbose)
,m_data(m_out,a_from.m_data.byte_swap(),256)
,m_nev_buf_size(a_from.m_nev_buf_size)
,m_nev(a_from.m_nev)
,m_last(a_from.m_last)
@@ -155,7 +160,7 @@ protected:
#endif
}
basket& operator=(const basket& a_from){
key::operator=(a_from);
parent::operator=(a_from);
m_nev_buf_size = a_from.m_nev_buf_size;
m_nev = a_from.m_nev;
m_last = a_from.m_last;
@@ -164,47 +169,56 @@ protected:
public:
buffer& datbuf() {return m_data;}
int* entry_offset() {return m_entry_offset;}
int* displacement() {return m_displacement;}
uint32 nev_buf_size() const {return m_nev_buf_size;}
uint32 nev() const {return m_nev;}
uint32 last() const {return m_last;}
void set_nev(uint32 a_last,uint32 a_nev_buf_size,uint32 a_nev,const int* a_entry_offset,const int* a_displacement) {
m_last = a_last;
m_nev_buf_size = a_nev_buf_size;
m_nev = a_nev;
delete [] m_entry_offset;
m_entry_offset = 0;
delete [] m_displacement;
m_displacement = 0;
if(a_entry_offset && m_nev_buf_size) {
m_entry_offset = new int[m_nev_buf_size];
for(uint32 i=0;i<m_nev;i++) m_entry_offset[i] = a_entry_offset[i];
}
if(a_displacement && m_nev_buf_size) {
m_displacement = new int[m_nev_buf_size];
for(uint32 i=0;i<m_nev;i++) m_displacement[i] = a_displacement[i];
}
}
bool update(uint32 a_offset) {
if(m_entry_offset) {
if((m_nev+1)>=m_nev_buf_size) { //why +1 ?
if((m_nev+1)>=m_nev_buf_size) { // for the +1, we follow CERN-ROOT/TBasket logic that wants to store
// nev+1 elements for m_entry_offset in the write_on_file() method.
uint32 newsize = mx<uint32>(10,2*m_nev_buf_size);
if(!realloc<uint32>(m_entry_offset,newsize,m_nev_buf_size,true)){
m_file.out() << "tools::wroot::basket::update : realloc failed."
<< std::endl;
if(!realloc<int>(m_entry_offset,newsize,m_nev_buf_size,true)){
m_out << "tools::wroot::basket::update : realloc failed." << std::endl;
return false;
}
if(m_displacement) {
if(!realloc<int>(m_displacement,newsize,m_nev_buf_size,true)){
m_file.out() << "tools::wroot::basket::update : realloc failed."
<< std::endl;
m_out << "tools::wroot::basket::update : realloc failed." << std::endl;
return false;
}
}
m_nev_buf_size = newsize;
// Update branch only for the first 10 baskets
//if (fBranch.writeBasket() < 10)
// fBranch.setEntryOffsetLength(newsize);
}
m_entry_offset[m_nev] = a_offset;
//if (skipped!=offset && !m_displacement){
// m_displacement = new int[m_nevSize];
// for(int i=0;i<m_nev_buf_size;i++)
// m_displacement[i] = m_entry_offset[i];
//}
//if (m_displacement) {
// m_displacement[m_nev] = skipped;
// fBufferRef->setDisplacement(skipped);
//}
m_entry_offset[m_nev] = (int)a_offset;
}
m_nev++;
return true;
}
bool write_on_file(uint16 a_cycle,uint32& a_nbytes) {
bool write_on_file(ifile& a_file,uint16 a_cycle,uint32& a_nbytes) {
// write m_data buffer into file.
//NOTE : m_data does not contain the key at its head.
// At this point m_seek_key should be 0.
@@ -212,45 +226,51 @@ public:
a_nbytes = 0;
if(m_seek_key) {
m_file.out() << "tools::wroot::basket::write_on_file :"
<< " m_seek_key should be 0."
<< std::endl;
m_out << "tools::wroot::basket::write_on_file :"
<< " m_seek_key should be 0."
<< std::endl;
return false;
}
if(m_version>1000) {
if(m_version>big_file_version_tag()) {
} else {
if(m_file.END()>START_BIG_FILE()) {
//GB : enforce m_version>1000 if m_version is still 2 but
m_out << "tools::wroot::basket::write_on_file : "
<< " we should not pass here (1)."
<< std::endl;
return false;
/*
if(a_file.END()>START_BIG_FILE()) {
//GB : enforce m_version>big_file_version_tag() if m_version is still 2 but
// seek_key>START_BIG_FILE. If not doing that we shall
// write a big m_seek_key on a seek32 and then have
// a problem when reading.
//m_file.out() << "tools::wroot::basket::write_on_file : "
// << " WARNING : pos>START_BIG_FILE."
// << std::endl;
//m_out << "tools::wroot::basket::write_on_file : "
// << " WARNING : pos>START_BIG_FILE."
// << std::endl;
m_version += 1000;
m_version += big_file_version_tag();
m_key_length += 8;
if(m_entry_offset) {
for(uint32 i=0;i<m_nev;i++) m_entry_offset[i] += 8;
if(m_displacement) {
//??? Do we have to shift them ?
m_file.out() << "tools::wroot::basket::write_on_file : "
<< " displace logic : m_displacement not null."
<< std::endl;
m_out << "tools::wroot::basket::write_on_file : "
<< " displace logic : m_displacement not null."
<< std::endl;
}
}
}
*/
}
// Transfer m_entry_offset table at the end of fBuffer. Offsets to fBuffer
// are transformed in entry length to optimize compression algorithm.
m_last = m_key_length+m_data.length();
if(m_entry_offset) {
if(!m_data.write_array<uint32>(m_entry_offset,m_nev+1)) { //GB : why +1 ?
if(!m_data.write_array<int>(m_entry_offset,m_nev+1)) { // for the +1 we follow CERN-ROOT/TBasket logic.
delete [] m_entry_offset;
m_entry_offset = 0;
return false;
@@ -267,7 +287,7 @@ public:
m_displacement = 0;
}
}
m_object_size = m_data.length(); //uncompressed size.
m_cycle = a_cycle;
@@ -277,34 +297,34 @@ public:
char* kbuf = 0;
uint32 klen = 0;
bool kdelete = false;
m_file.compress_buffer(m_data,kbuf,klen,kdelete);
a_file.compress_buffer(m_data,kbuf,klen,kdelete);
if(klen>m_object_size) {
m_file.out() << "tools::wroot::basket::write_on_file :"
<< " compression anomaly "
<< " m_object_size " << m_object_size
<< " klen " << klen
<< std::endl;
m_out << "tools::wroot::basket::write_on_file :"
<< " compression anomaly "
<< " m_object_size " << m_object_size
<< " klen " << klen
<< std::endl;
if(kdelete) delete [] kbuf;
return false;
}
if(!initialize(klen)) { //it will do a file.set_END()
m_file.out() << "tools::wroot::basket::write_on_file :"
<< " initialize() failed."
<< std::endl;
if(!initialize(a_file,klen)) { //it will do a m_seek_key = a_file.END() and then a_file.set_END(...)
m_out << "tools::wroot::basket::write_on_file :"
<< " initialize() failed."
<< std::endl;
if(kdelete) delete [] kbuf;
return false;
}
//write header of the key :
{buffer bref(m_file.out(),m_file.byte_swap(),256);
if(!_stream_header(bref)) return false;
{buffer bref(m_out,a_file.byte_swap(),256);
if(!_stream_header(bref,a_file.verbose())) return false;
if(bref.length()!=m_key_length) {
m_file.out() << "tools::wroot::basket::write_on_file :"
<< " key len anomaly " << bref.length()
<< " m_key_length " << m_key_length
<< std::endl;
m_out << "tools::wroot::basket::write_on_file :"
<< " key len anomaly " << bref.length()
<< " m_key_length " << m_key_length
<< std::endl;
if(kdelete) delete [] kbuf;
return false;
}
@@ -314,7 +334,7 @@ public:
if(kdelete) delete [] kbuf;
uint32 nbytes;
if(!key::write_file(nbytes)) return false;
if(!parent::write_file(a_file,nbytes)) return false;
m_data.pos() = m_data.buf(); //empty m_data.
@@ -324,7 +344,7 @@ public:
protected:
uint32 header_record_size(uint32 a_version) const {
// header only.
uint32 nbytes = key::record_size(a_version);
uint32 nbytes = parent::record_size(a_version);
nbytes += sizeof(short); //version
nbytes += sizeof(uint32); //m_buf_size
@@ -335,13 +355,13 @@ protected:
return nbytes;
}
bool _stream_header(buffer& a_buffer,char a_flag = 0) const {
{uint32 l = key::record_size(m_version);
bool _stream_header(buffer& a_buffer,bool a_verbose,char a_flag = 0) const {
{uint32 l = parent::record_size(m_version);
if((a_buffer.length()+l)>a_buffer.size()) {
if(!a_buffer.expand(a_buffer.size()+l)) return false;
}
wbuf wb(m_file.out(),m_file.byte_swap(),a_buffer.max_pos(),a_buffer.pos());
if(!key::to_buffer(wb)) return false;}
wbuf wb(m_out,a_buffer.byte_swap(),a_buffer.max_pos(),a_buffer.pos());
if(!parent::to_buffer(wb,a_verbose)) return false;}
if(!a_buffer.write_version(2)) return false;
if(!a_buffer.write(m_buf_size)) return false;
@@ -352,13 +372,14 @@ protected:
return true;
}
protected:
bool m_verbose;
buffer m_data;
protected:
uint32 m_nev_buf_size; //Length in Int_t of m_entry_offset
uint32 m_nev; //Number of entries in basket
uint32 m_last; //Pointer to last used byte in basket
uint32* m_entry_offset; //[m_nev] Offset of entries in fBuffer(TKey)
int* m_displacement; //![m_nev] Displacement of entries in fBuffer(TKey)
int* m_entry_offset; //[m_nev] Offset of entries in fBuffer(TKey)
int* m_displacement; //![m_nev] Displacement of entries in fBuffer(TKey)
};
}}