* src/sanity/style.test: Add a test. * iface/dve2/dve2.cc, iface/dve2/dve2check.cc, src/bin/common_output.cc, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltlcross.cc, src/dstarparse/dra2ba.cc, src/dstarparse/fmterror.cc, src/dstarparse/nsa2tgba.cc, src/kripke/kripkeprint.cc, src/kripkeparse/fmterror.cc, src/ltlast/atomic_prop.cc, src/ltlast/bunop.cc, src/ltltest/ltlrel.cc, src/ltltest/reduc.cc, src/ltltest/syntimpl.cc, src/ltlvisit/dotty.cc, src/ltlvisit/lbt.cc, src/ltlvisit/randomltl.cc, src/ltlvisit/relabel.cc, src/ltlvisit/simplify.cc, src/ltlvisit/tostring.cc, src/misc/bitvect.cc, src/misc/optionmap.cc, src/misc/timer.cc, src/neverparse/fmterror.cc, src/priv/freelist.cc, src/saba/sabacomplementtgba.cc, src/sabaalgos/sabadotty.cc, src/taalgos/dotty.cc, src/taalgos/minimize.cc, src/tgba/bdddict.cc, src/tgba/bddprint.cc, src/tgba/futurecondcol.cc, src/tgba/taatgba.hh, src/tgba/tgbakvcomplement.cc, src/tgba/tgbasafracomplement.cc, src/tgbaalgos/compsusp.cc, src/tgbaalgos/cycles.cc, src/tgbaalgos/dotty.cc, src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/emptiness.cc, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gv04.cc, src/tgbaalgos/lbtt.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/minimize.cc, src/tgbaalgos/neverclaim.cc, src/tgbaalgos/powerset.cc, src/tgbaalgos/replayrun.cc, src/tgbaalgos/save.cc, src/tgbaalgos/scc.cc, src/tgbaalgos/sccfilter.cc, src/tgbaalgos/weight.cc, src/tgbaalgos/word.cc, src/tgbaparse/fmterror.cc, src/tgbatest/bitvect.cc, src/tgbatest/complementation.cc, src/tgbatest/intvcmp2.cc, src/tgbatest/intvcomp.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/randtgba.cc: Replace << "c" by << 'c' when appropriate.
162 lines
3.6 KiB
C++
162 lines
3.6 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2008, 2013, 2014 Laboratoire de Recherche et
|
|
// Développement de l'Epita (LRDE).
|
|
// Copyright (C) 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
// License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#include "config.h"
|
|
#include <cstring>
|
|
#include <iostream>
|
|
#include <cstdlib>
|
|
#include "optionmap.hh"
|
|
|
|
namespace spot
|
|
{
|
|
const char*
|
|
option_map::parse_options(const char* options)
|
|
{
|
|
while (*options)
|
|
{
|
|
// Skip leading separators.
|
|
while (*options && strchr(" \t\n,;", *options))
|
|
++options;
|
|
|
|
// `!foo' is a shorthand for `foo=0'.
|
|
const char* negated = 0;
|
|
if (*options == '!')
|
|
{
|
|
// Skip spaces.
|
|
while (*options && strchr(" \t\n", *options))
|
|
++options;
|
|
negated = options++;
|
|
}
|
|
|
|
if (!*options)
|
|
{
|
|
if (negated)
|
|
return negated;
|
|
else
|
|
break;
|
|
}
|
|
|
|
const char* name_start = options;
|
|
|
|
// Find the end of the name.
|
|
while (*options && !strchr(", \t\n;=", *options))
|
|
++options;
|
|
|
|
std::string name(name_start, options);
|
|
|
|
// Skip spaces.
|
|
while (*options && strchr(" \t\n", *options))
|
|
++options;
|
|
|
|
if (*options != '=')
|
|
{
|
|
options_[name] = (negated ? 0 : 1);
|
|
}
|
|
else if (negated)
|
|
{
|
|
return negated;
|
|
}
|
|
else
|
|
{
|
|
++options;
|
|
// Skip spaces.
|
|
while (*options && strchr(" \t\n", *options))
|
|
++options;
|
|
if (!*options)
|
|
return name_start;
|
|
|
|
char* val_end;
|
|
int val = strtol(options, &val_end, 10);
|
|
if (val_end == options)
|
|
return name_start;
|
|
|
|
if (*val_end == 'K')
|
|
{
|
|
val *= 1024;
|
|
++val_end;
|
|
}
|
|
else if (*val_end == 'M')
|
|
{
|
|
val *= 1024 * 1024;
|
|
++val_end;
|
|
}
|
|
else if (*val_end && !strchr(" \t\n,;", *val_end))
|
|
{
|
|
return options;
|
|
}
|
|
|
|
options = val_end;
|
|
|
|
options_[name] = val;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
option_map::get(const char* option, int def) const
|
|
{
|
|
std::map<std::string, int>::const_iterator it = options_.find(option);
|
|
if (it == options_.end())
|
|
// default value if not declared
|
|
return def;
|
|
else
|
|
return it->second;
|
|
}
|
|
|
|
int
|
|
option_map::operator[](const char* option) const
|
|
{
|
|
return get(option);
|
|
}
|
|
|
|
int
|
|
option_map::set(const char* option, int val, int def)
|
|
{
|
|
int old = get(option, def);
|
|
options_[option] = val;
|
|
return old;
|
|
}
|
|
|
|
void
|
|
option_map::set(const option_map& o)
|
|
{
|
|
for (std::map<std::string, int>::const_iterator it = o.options_.begin();
|
|
it != o.options_.end(); ++it)
|
|
options_[it->first] = it->second;
|
|
}
|
|
|
|
int&
|
|
option_map::operator[](const char* option)
|
|
{
|
|
return options_[option];
|
|
}
|
|
|
|
std::ostream&
|
|
operator<<(std::ostream& os, const option_map& m)
|
|
{
|
|
for (std::map<std::string, int>::const_iterator it = m.options_.begin();
|
|
it != m.options_.end(); ++it)
|
|
os << '"' << it->first << "\" = " << it->second << '\n';
|
|
return os;
|
|
}
|
|
}
|