pattern_root(new match_node),
user_file (other.user_file),
dfa_counter(0),
+ need_tagged_dfa(other.need_tagged_dfa),
be_derived_probes(0),
dwarf_derived_probes(0),
kprobe_derived_probes(0),
/* Manage the linked list of states in a DFA: */
state::state (state_kernel *kernel)
- : next(NULL), kernel(kernel), accepts(false), accept_outcome(0) {}
+ : label(~0), next(NULL), kernel(kernel), accepts(false), accept_outcome(0) {}
state *
dfa::add_state (state *s)
// ------------------------------------------------------------------------
-cursor::cursor() : input(NULL), pos(~0) {}
+cursor::cursor() : input(NULL), pos(~0),
+ last_pos(~0), next_c(0), last_c(0) {}
cursor::cursor(const std::string *input, bool do_unescape)
- : input(input), do_unescape(do_unescape), pos(0)
+ : input(input), do_unescape(do_unescape), pos(0), last_pos(0)
{
next_c = 0; last_c = 0;
finished = ( pos >= input->length() );
class regex_parser {
public:
regex_parser (const std::string& input, bool do_unescape = true)
- : input(input), do_unescape(do_unescape) {}
+ : input(input), do_unescape(do_unescape),
+ do_tag(false), num_tags(~0) {}
regexp *parse (bool do_tag = true);
private: