mirror of
https://github.com/nasa/trick.git
synced 2025-02-06 19:09:20 +00:00
* update checkpoint_map.hh #1093 * #1093 update checkpoint_pair.hh * #1093 update checkpoint_queue.hh * #1093 update MM_write_checkpoint.cc * #1093 update units_attach.i * #1093 update checkpoint_sequence_stl.hh * #1093 update checkpoint_stack.hh * #1093 update swig_extend_str.i * #1093 update swig_int_templates.hh * #1093 update checkpoint_stack.hh and swig_int_typemap.i * #1093 fix c_str issue without adding memory leaks * #1093 fix c_str issue without adding memory leaks * #1093 remove dangling pointers in injector sim object (without causing memory leaks) * #1093 remove dangling pointers in injector sim object (without causing memory leaks) * #1093 remove dangling pointers in Event Manaager sim object (without causing memory leaks) * #1093 fix MonteCarlo_c_intf dangling pointers Co-authored-by: Fennell, Scott P 263712616 <scott.p.fennell@nasa.gov> closes #1093
374 lines
13 KiB
C++
374 lines
13 KiB
C++
|
|
/*
|
|
PURPOSE: (Helpers to checkpoint STLs)
|
|
*/
|
|
|
|
#ifndef CHECKPOINT_QUEUE_HH
|
|
#define CHECKPOINT_QUEUE_HH
|
|
|
|
#include <queue>
|
|
#include <algorithm>
|
|
#include <typeinfo>
|
|
#include <sstream>
|
|
#include <type_traits>
|
|
|
|
#ifdef __GNUC__
|
|
#include <cxxabi.h>
|
|
#endif
|
|
|
|
#include "checkpoint_is_stl_container.hh"
|
|
#include "checkpoint_stl_protos.hh"
|
|
#include "checkpoint_fwd_declare.hh"
|
|
#include "checkpoint_sequence_stl.hh"
|
|
#include "trick/memorymanager_c_intf.h"
|
|
#include "trick/message_proto.h"
|
|
|
|
/* =================================================================================================*/
|
|
|
|
|
|
// queue: intrinsic
|
|
template <typename ITEM_TYPE, typename _Sequence,
|
|
typename std::enable_if<!is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int checkpoint_stl(std::queue<ITEM_TYPE,_Sequence> & in_stl , std::string object_name , std::string var_name ) {
|
|
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
std::ostringstream var_declare ;
|
|
int status ;
|
|
std::string temp_str ;
|
|
|
|
ITEM_TYPE * items = nullptr ;
|
|
std::queue<ITEM_TYPE,_Sequence> temp_queue(in_stl) ;
|
|
|
|
cont_size = temp_queue.size() ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
if ( cont_size > 0 ) {
|
|
std::string type_string;
|
|
try {
|
|
type_string = stl_type_name_convert(abi::__cxa_demangle(typeid(*items).name(), 0, 0, &status )) ;
|
|
} catch (const std::bad_typeid& e) {
|
|
message_publish(1, "Error, having difficulty checkpointing %s.%s\n", object_name.c_str(), var_name.c_str()) ;
|
|
return 0 ;
|
|
}
|
|
var_declare << type_string << " "
|
|
<< object_name << "_" << var_name << "[" << cont_size << "]" ;
|
|
temp_str = var_declare.str() ;
|
|
items = (ITEM_TYPE *)TMM_declare_var_s(temp_str.c_str()) ;
|
|
if ( items ) {
|
|
temp_str = std::string(object_name + "_" + var_name) ;
|
|
TMM_add_checkpoint_alloc_dependency(temp_str.c_str()) ;
|
|
//message_publish(1, "CHECKPOINT_STL_STACK with %s\n", var_declare) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
items[ii] = temp_queue.front() ;
|
|
temp_queue.pop() ;
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0 ;
|
|
}
|
|
|
|
// queue: STL
|
|
template <typename ITEM_TYPE, typename _Sequence,
|
|
typename std::enable_if< is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int checkpoint_stl(std::queue<ITEM_TYPE,_Sequence> & in_stl , std::string object_name , std::string var_name ) {
|
|
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
std::ostringstream var_declare ;
|
|
|
|
std::string temp_str;
|
|
|
|
std::string * items = nullptr ;
|
|
std::queue<ITEM_TYPE,_Sequence> temp_queue(in_stl) ;
|
|
|
|
cont_size = temp_queue.size() ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
if ( cont_size > 0 ) {
|
|
var_declare << "std::string "
|
|
<< object_name << "_" << var_name << "[" << cont_size << "]" ;
|
|
temp_str = var_declare.str() ;
|
|
items = (std::string *)TMM_declare_var_s(temp_str.c_str()) ;
|
|
if ( items ) {
|
|
temp_str = std::string(object_name + "_" + var_name) ;
|
|
TMM_add_checkpoint_alloc_dependency(temp_str.c_str()) ;
|
|
//message_publish(1, "CHECKPOINT_STL_STACK with %s\n", var_declare) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
std::ostringstream sub_elements ;
|
|
sub_elements << object_name << "_" << var_name << "_" << ii ;
|
|
items[ii] = sub_elements.str() ;
|
|
|
|
std::ostringstream index_string ;
|
|
index_string << ii ;
|
|
checkpoint_stl (temp_queue.front(), object_name + "_" + var_name, index_string.str()) ;
|
|
temp_queue.pop() ;
|
|
}
|
|
}
|
|
}
|
|
return 0 ;
|
|
}
|
|
|
|
// priority queue: intrinsic
|
|
template <typename ITEM_TYPE, typename _Container, typename _Compare,
|
|
typename std::enable_if<!is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int checkpoint_stl(std::priority_queue<ITEM_TYPE, _Container, _Compare> & in_stl ,
|
|
std::string object_name , std::string var_name ) {
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
std::ostringstream var_declare ;
|
|
int status ;
|
|
|
|
std::string temp_str ;
|
|
|
|
ITEM_TYPE * items = nullptr ;
|
|
std::priority_queue<ITEM_TYPE,_Container,_Compare> temp_queue(in_stl) ;
|
|
|
|
cont_size = temp_queue.size() ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
if ( cont_size > 0 ) {
|
|
std::string type_string;
|
|
try {
|
|
type_string = stl_type_name_convert(abi::__cxa_demangle(typeid(*items).name(), 0, 0, &status )) ;
|
|
} catch (const std::bad_typeid& e) {
|
|
message_publish(1, "Error, having difficulty checkpointing %s.%s\n", object_name.c_str(), var_name.c_str()) ;
|
|
return 0 ;
|
|
}
|
|
var_declare << type_string << " "
|
|
<< object_name << "_" << var_name << "[" << cont_size << "]" ;
|
|
temp_str = var_declare.str() ;
|
|
items = (ITEM_TYPE *)TMM_declare_var_s(temp_str.c_str()) ;
|
|
if ( items ) {
|
|
temp_str = std::string(object_name + "_" + var_name) ;
|
|
TMM_add_checkpoint_alloc_dependency(temp_str.c_str()) ;
|
|
//message_publish(1, "CHECKPOINT_STL_STACK with %s\n", var_declare) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
items[ii] = temp_queue.top() ;
|
|
temp_queue.pop() ;
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0 ;
|
|
}
|
|
|
|
// priority queue: STL
|
|
template <typename ITEM_TYPE, typename _Container, typename _Compare,
|
|
typename std::enable_if< is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int checkpoint_stl(std::priority_queue<ITEM_TYPE, _Container, _Compare> & in_stl ,
|
|
std::string object_name , std::string var_name ) {
|
|
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
std::ostringstream var_declare ;
|
|
|
|
std::string temp_str ;
|
|
|
|
std::string * items = nullptr ;
|
|
std::priority_queue<ITEM_TYPE,_Container,_Compare> temp_queue(in_stl) ;
|
|
|
|
cont_size = temp_queue.size() ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
if ( cont_size > 0 ) {
|
|
var_declare << "std::string "
|
|
<< object_name << "_" << var_name << "[" << cont_size << "]" ;
|
|
temp_str = var_declare.str() ;
|
|
items = (std::string *)TMM_declare_var_s(temp_str.c_str()) ;
|
|
if ( items ) {
|
|
temp_str = std::string(object_name + "_" + var_name) ;
|
|
TMM_add_checkpoint_alloc_dependency(temp_str.c_str()) ;
|
|
//message_publish(1, "CHECKPOINT_STL_STACK with %s\n", var_declare) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
std::ostringstream sub_elements ;
|
|
sub_elements << object_name << "_" << var_name << "_" << ii ;
|
|
items[ii] = sub_elements.str() ;
|
|
|
|
std::ostringstream index_string ;
|
|
index_string << ii ;
|
|
checkpoint_stl (const_cast< ITEM_TYPE &>(temp_queue.top()), object_name + "_" + var_name, index_string.str()) ;
|
|
temp_queue.pop() ;
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0 ;
|
|
}
|
|
|
|
/* =================================================================================================*/
|
|
|
|
// The delete routines use the same method as the sequence types
|
|
|
|
template <typename ITEM_TYPE, typename _Sequence>
|
|
int delete_stl(std::queue<ITEM_TYPE,_Sequence> & in_stl , std::string object_name , std::string var_name ) {
|
|
return delete_sequence_alloc( in_stl , object_name , var_name ) ;
|
|
}
|
|
|
|
template <typename ITEM_TYPE, typename _Container, typename _Compare>
|
|
int delete_stl(std::priority_queue<ITEM_TYPE,_Container,_Compare> & in_stl ,
|
|
std::string object_name , std::string var_name ) {
|
|
return delete_sequence_alloc( in_stl , object_name , var_name ) ;
|
|
}
|
|
|
|
/* =================================================================================================*/
|
|
|
|
/* Find the arrays the map data was stored in the checkpoint using ref_attributes
|
|
From the address of the resulting ref_attributes, we can figure out the number of
|
|
items that were stored in the checkpoint. Knowing the size, we can restore
|
|
the map from the 2 arrays.
|
|
*/
|
|
|
|
// queue: intrinsic
|
|
template <typename ITEM_TYPE, typename _Sequence,
|
|
typename std::enable_if<!is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int restore_stl(std::queue<ITEM_TYPE,_Sequence> & in_stl , std::string object_name , std::string var_name ) {
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
|
|
std::string temp_str ;
|
|
|
|
REF2 * items_ref ;
|
|
ITEM_TYPE * items ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
//message_publish(1, "RESTORE_STL_queue %s_%s\n", object_name.c_str() , var_name.c_str()) ;
|
|
temp_str = object_name + std::string("_") + var_name ;
|
|
items_ref = ref_attributes((char *)temp_str.c_str()) ;
|
|
|
|
if ( items_ref != NULL ) {
|
|
cont_size = in_stl.size() ;
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.pop() ;
|
|
}
|
|
|
|
items = (ITEM_TYPE *)items_ref->address ;
|
|
cont_size = get_size((char *)items) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.push( items[ii] ) ;
|
|
}
|
|
delete_stl( in_stl , object_name , var_name ) ;
|
|
}
|
|
return 0 ;
|
|
}
|
|
|
|
// queue: STL
|
|
template <typename ITEM_TYPE, typename _Sequence,
|
|
typename std::enable_if< is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int restore_stl(std::queue<ITEM_TYPE,_Sequence> & in_stl , std::string object_name , std::string var_name ) {
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
|
|
std::string temp_str ;
|
|
|
|
REF2 * items_ref ;
|
|
std::string * items ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
//message_publish(1, "RESTORE_STL_queue %s_%s\n", object_name.c_str() , var_name.c_str()) ;
|
|
temp_str = object_name + "_" + var_name ;
|
|
items_ref = ref_attributes((char *)temp_str.c_str()) ;
|
|
|
|
if ( items_ref != NULL ) {
|
|
cont_size = in_stl.size() ;
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.pop() ;
|
|
}
|
|
|
|
items = (std::string *)items_ref->address ;
|
|
cont_size = get_size((char *)items) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
ITEM_TYPE vt ;
|
|
std::ostringstream index_string ;
|
|
index_string << ii ;
|
|
restore_stl( vt , object_name + "_" + var_name , index_string.str()) ;
|
|
in_stl.push( vt ) ;
|
|
}
|
|
delete_stl( in_stl , object_name , var_name ) ;
|
|
}
|
|
return 0 ;
|
|
}
|
|
|
|
// priority_queue: intrinsic
|
|
template <typename ITEM_TYPE, typename _Container, typename _Compare,
|
|
typename std::enable_if<!is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int restore_stl(std::priority_queue<ITEM_TYPE,_Container,_Compare> & in_stl ,
|
|
std::string object_name , std::string var_name ) {
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
|
|
std::string temp_str ;
|
|
|
|
REF2 * items_ref ;
|
|
ITEM_TYPE * items ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
//message_publish(1, "RESTORE_STL_queue %s_%s\n", object_name.c_str() , var_name.c_str()) ;
|
|
temp_str = object_name + std::string("_") + var_name ;
|
|
items_ref = ref_attributes((char *)temp_str.c_str()) ;
|
|
|
|
if ( items_ref != NULL ) {
|
|
cont_size = in_stl.size() ;
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.pop() ;
|
|
}
|
|
|
|
items = (ITEM_TYPE *)items_ref->address ;
|
|
cont_size = get_size((char *)items) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.push( items[ii] ) ;
|
|
}
|
|
delete_stl( in_stl , object_name , var_name ) ;
|
|
}
|
|
return 0 ;
|
|
}
|
|
|
|
// priority_queue: STL
|
|
template <typename ITEM_TYPE, typename _Container, typename _Compare,
|
|
typename std::enable_if< is_stl_container<ITEM_TYPE>::value>::type* >
|
|
int restore_stl(std::priority_queue<ITEM_TYPE,_Container,_Compare> & in_stl ,
|
|
std::string object_name , std::string var_name ) {
|
|
unsigned int ii ;
|
|
unsigned int cont_size ;
|
|
|
|
std::string temp_str ;
|
|
|
|
REF2 * items_ref ;
|
|
std::string * items ;
|
|
std::replace_if(object_name.begin(), object_name.end(), static_cast<int (*)(int)>(std::ispunct), '_');
|
|
|
|
//message_publish(1, "RESTORE_STL_queue %s_%s\n", object_name.c_str() , var_name.c_str()) ;
|
|
temp_str = object_name + "_" + var_name ;
|
|
items_ref = ref_attributes((char *)temp_str.c_str()) ;
|
|
|
|
if ( items_ref != NULL ) {
|
|
cont_size = in_stl.size() ;
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
in_stl.pop() ;
|
|
}
|
|
|
|
items = (std::string *)items_ref->address ;
|
|
cont_size = get_size((char *)items) ;
|
|
|
|
for ( ii = 0 ; ii < cont_size ; ii++ ) {
|
|
ITEM_TYPE vt ;
|
|
std::ostringstream index_string ;
|
|
index_string << ii ;
|
|
restore_stl( vt , object_name + "_" + var_name , index_string.str()) ;
|
|
in_stl.push( vt ) ;
|
|
}
|
|
delete_stl( in_stl , object_name , var_name ) ;
|
|
}
|
|
return 0 ;
|
|
}
|
|
|
|
#endif
|