bool operator==(const irept &i1, const irept &i2)
{
#ifdef SHARING
if(i1.data==i2.data) return true;
#endif
if(i1.id()!=i2.id()) return false;
if(i1.get_sub()!=i2.get_sub()) return false; // recursive call
if(i1.get_named_sub()!=i2.get_named_sub()) return false; // recursive call
// comments are NOT checked
return true;
}
bool full_eq(const irept &i1, const irept &i2)
{
#ifdef SHARING
if(i1.data==i2.data) return true;
#endif
if(i1.id()!=i2.id()) return false;
const irept::subt &i1_sub=i1.get_sub();
const irept::subt &i2_sub=i2.get_sub();
const irept::named_subt &i1_named_sub=i1.get_named_sub();
const irept::named_subt &i2_named_sub=i2.get_named_sub();
const irept::named_subt &i1_comments=i1.get_comments();
const irept::named_subt &i2_comments=i2.get_comments();
if(i1_sub.size() !=i2_sub.size()) return false;
if(i1_named_sub.size()!=i2_named_sub.size()) return false;
if(i1_comments.size() !=i2_comments.size()) return false;
for(unsigned i=0; i<i1_sub.size(); i++)
if(!full_eq(i1_sub[i], i2_sub[i]))
return false;
{
irept::named_subt::const_iterator i1_it=i1_named_sub.begin();
irept::named_subt::const_iterator i2_it=i2_named_sub.begin();
for(; i1_it!=i1_named_sub.end(); i1_it++, i2_it++)
if(i1_it->first!=i2_it->first ||
!full_eq(i1_it->second, i2_it->second))
return false;
}
{
irept::named_subt::const_iterator i1_it=i1_comments.begin();
irept::named_subt::const_iterator i2_it=i2_comments.begin();
for(; i1_it!=i1_comments.end(); i1_it++, i2_it++)
if(i1_it->first!=i2_it->first ||
!full_eq(i1_it->second, i2_it->second))
return false;
}
return true;
}
int irept::compare(const irept &i) const
{
int r;
r=id().compare(i.id());
if(r!=0) return r;
const subt::size_type size=get_sub().size(),
i_size=i.get_sub().size();
if(size<i_size) return -1;
if(size>i_size) return 1;
{
irept::subt::const_iterator it1, it2;
for(it1=get_sub().begin(),
it2=i.get_sub().begin();
it1!=get_sub().end() && it2!=i.get_sub().end();
it1++,
it2++)
{
r=it1->compare(*it2);
if(r!=0) return r;
}
assert(it1==get_sub().end() && it2==i.get_sub().end());
}
const named_subt::size_type n_size=get_named_sub().size(),
i_n_size=i.get_named_sub().size();
if(n_size<i_n_size) return -1;
if(n_size>i_n_size) return 1;
{
irept::named_subt::const_iterator it1, it2;
for(it1=get_named_sub().begin(),
it2=i.get_named_sub().begin();
it1!=get_named_sub().end() && it2!=i.get_named_sub().end();
it1++,
it2++)
{
r=it1->first.compare(it2->first);
if(r!=0) return r;
r=it1->second.compare(it2->second);
if(r!=0) return r;
}
assert(it1==get_named_sub().end() &&
it2==i.get_named_sub().end());
}
// equal
return 0;
}
void convert( const goto_programt &program, irept &irep )
{
irep.id("goto-program");
irep.get_sub().reserve(program.instructions.size());
for (goto_programt::instructionst::const_iterator it=
program.instructions.begin();
it!=program.instructions.end();
it++)
{
irep.get_sub().push_back(irept());
convert(*it, irep.get_sub().back());
}
}
/// To convert to JSON from an irep structure by recurssively generating JSON
/// for the different sub trees.
/// \param irep: The irep structure to turn into json
/// \param json: The json object to be filled up.
void json_irept::convert_from_irep(const irept &irep, jsont &json) const
{
json_objectt &irep_object=json.make_object();
if(irep.id()!=ID_nil)
irep_object["id"]=json_stringt(irep.id_string());
convert_sub_tree("sub", irep.get_sub(), irep_object);
convert_named_sub_tree("namedSub", irep.get_named_sub(), irep_object);
if(include_comments)
{
convert_named_sub_tree("comment", irep.get_comments(), irep_object);
}
}
bool operator==(const irept &i1, const irept &i2)
{
#ifdef IREP_HASH_STATS
++irep_cmp_cnt;
#endif
#ifdef SHARING
if(i1.data==i2.data) return true;
#endif
if(i1.id()!=i2.id() ||
i1.get_sub()!=i2.get_sub() || // recursive call
i1.get_named_sub()!=i2.get_named_sub()) // recursive call
{
#ifdef IREP_HASH_STATS
++irep_cmp_ne_cnt;
#endif
return false;
}
// comments are NOT checked
return true;
}
void namespace_baset::follow_symbol(irept &irep) const
{
while(irep.id()==ID_symbol)
{
const symbolt &symbol=lookup(irep);
if(symbol.is_type)
{
if(symbol.type.is_nil())
return;
else
irep=symbol.type;
}
else
{
if(symbol.value.is_nil())
return;
else
irep=symbol.value;
}
}
}
void irep_hash_container_baset::pack(
const irept &irep,
packedt &packed)
{
const irept::subt &sub=irep.get_sub();
const irept::named_subt &named_sub=irep.get_named_sub();
const irept::named_subt &comments=irep.get_comments();
packed.reserve(
1+1+sub.size()+named_sub.size()*2+
(full?comments.size()*2:0));
packed.push_back(irep_id_hash()(irep.id()));
packed.push_back(sub.size());
forall_irep(it, sub)
packed.push_back(number(*it));
packed.push_back(named_sub.size());
forall_named_irep(it, named_sub)
{
packed.push_back(irep_id_hash()(it->first)); // id
packed.push_back(number(it->second)); // sub-irep
}
/// Deserialize a JSON irep representation.
/// \param input: json object to convert
/// \return result - irep equivalent of input
void json_irept::convert_from_json(const jsont &in, irept &out) const
{
std::vector<std::string> have_keys;
for(const auto &keyval : in.object)
have_keys.push_back(keyval.first);
std::sort(have_keys.begin(), have_keys.end());
if(have_keys!=std::vector<std::string>{"comment", "id", "namedSub", "sub"})
throw "irep JSON representation is missing one of needed keys: "
"'id', 'sub', 'namedSub', 'comment'";
out.id(in["id"].value);
for(const auto &sub : in["sub"].array)
{
out.get_sub().push_back(irept());
convert_from_json(sub, out.get_sub().back());
}
for(const auto &named_sub : in["namedSub"].object)
convert_from_json(named_sub.second, out.add(named_sub.first));
for(const auto &comment : in["comment"].object)
convert_from_json(comment.second, out.add(comment.first));
}
void convert( const irept &irep, goto_programt &program )
{
assert(irep.id()=="goto-program");
program.instructions.clear();
std::list< std::list<unsigned> > number_targets_list;
// convert instructions back
const irept::subt &subs = irep.get_sub();
for (irept::subt::const_iterator it=subs.begin();
it!=subs.end();
it++)
{
program.instructions.push_back(goto_programt::instructiont());
convert(*it, program.instructions.back());
number_targets_list.push_back(std::list<unsigned>());
const irept &targets=it->find(ID_targets);
const irept::subt &tsubs=targets.get_sub();
for (irept::subt::const_iterator tit=tsubs.begin();
tit!=tsubs.end();
tit++)
{
number_targets_list.back().push_back(
unsafe_string2unsigned(tit->id_string()));
}
}
program.compute_location_numbers();
// resolve targets
std::list< std::list<unsigned> >::iterator nit=
number_targets_list.begin();
for(goto_programt::instructionst::iterator lit=
program.instructions.begin();
lit!=program.instructions.end() && nit!=number_targets_list.end();
lit++, nit++)
{
for (std::list<unsigned>::iterator tit=nit->begin();
tit!=nit->end();
tit++)
{
goto_programt::targett fit=program.instructions.begin();
for(;fit!=program.instructions.end();fit++)
{
if (fit->location_number==*tit)
{
lit->targets.push_back(fit);
break;
}
}
if (fit==program.instructions.end())
{
std::cout << "Warning: could not resolve target link "
<< "during irep->goto_program translation." << std::endl;
throw 0;
}
}
}
program.update();
}
const irept &get_nil_irep()
{
if(nil_rep_storage.id().empty()) // initialized?
nil_rep_storage.id("nil");
return nil_rep_storage;
}