6 * Use, modification and distribution are subject to the
7 * Boost Software License, Version 1.0. (See accompanying file
8 * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
12 #ifndef BOOST_REGEX_MATCHER_HPP
13 #define BOOST_REGEX_MATCHER_HPP
15 #include <boost/regex/v4/iterator_category.hpp>
19 #pragma warning(disable: 4103)
21 #ifdef BOOST_HAS_ABI_HEADERS
22 # include BOOST_ABI_PREFIX
29 # pragma warning(push)
30 # pragma warning(disable: 4800)
37 // error checking API:
39 BOOST_REGEX_DECL void BOOST_REGEX_CALL verify_options(boost::regex_constants::syntax_option_type ef, match_flag_type mf);
41 // function can_start:
43 template <class charT>
44 inline bool can_start(charT c, const unsigned char* map, unsigned char mask)
46 return ((c < static_cast<charT>(0)) ? true : ((c >= static_cast<charT>(1 << CHAR_BIT)) ? true : map[c] & mask));
48 inline bool can_start(char c, const unsigned char* map, unsigned char mask)
50 return map[(unsigned char)c] & mask;
52 inline bool can_start(signed char c, const unsigned char* map, unsigned char mask)
54 return map[(unsigned char)c] & mask;
56 inline bool can_start(unsigned char c, const unsigned char* map, unsigned char mask)
60 inline bool can_start(unsigned short c, const unsigned char* map, unsigned char mask)
62 return ((c >= (1 << CHAR_BIT)) ? true : map[c] & mask);
64 #if !defined(__hpux) // WCHAR_MIN not usable in pp-directives.
65 #if defined(WCHAR_MIN) && (WCHAR_MIN == 0) && !defined(BOOST_NO_INTRINSIC_WCHAR_T)
66 inline bool can_start(wchar_t c, const unsigned char* map, unsigned char mask)
68 return ((c >= static_cast<wchar_t>(1u << CHAR_BIT)) ? true : map[c] & mask);
72 #if !defined(BOOST_NO_INTRINSIC_WCHAR_T)
73 inline bool can_start(unsigned int c, const unsigned char* map, unsigned char mask)
75 return (((c >= static_cast<unsigned int>(1u << CHAR_BIT)) ? true : map[c] & mask));
81 // Unfortunately Rogue Waves standard library appears to have a bug
82 // in std::basic_string::compare that results in eroneous answers
83 // in some cases (tested with Borland C++ 5.1, Rogue Wave lib version
84 // 0x020101) the test case was:
85 // {39135,0} < {0xff,0}
86 // which succeeds when it should not.
89 #if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
90 template <class C, class T, class A>
91 inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)
95 if(s.empty() || ((s.size() == 1) && (s[0] == 0)))
102 #if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
103 template <class C, class T, class A>
104 inline int string_compare(const std::basic_string<C,T,A>& s, const C* p)
108 if(s.empty() || ((s.size() == 1) && (s[0] == 0)))
114 inline int string_compare(const std::string& s, const char* p)
115 { return std::strcmp(s.c_str(), p); }
116 # ifndef BOOST_NO_WREGEX
117 inline int string_compare(const std::wstring& s, const wchar_t* p)
118 { return std::wcscmp(s.c_str(), p); }
121 template <class Seq, class C>
122 inline int string_compare(const Seq& s, const C* p)
125 while((i < s.size()) && (p[i] == s[i]))
129 return (i == s.size()) ? -p[i] : s[i] - p[i];
131 # define STR_COMP(s,p) string_compare(s,p)
133 template<class charT>
134 inline const charT* re_skip_past_null(const charT* p)
136 while (*p != static_cast<charT>(0)) ++p;
140 template <class iterator, class charT, class traits_type, class char_classT>
141 iterator BOOST_REGEX_CALL re_is_set_member(iterator next,
143 const re_set_long<char_classT>* set_,
144 const regex_data<charT, traits_type>& e, bool icase)
146 const charT* p = reinterpret_cast<const charT*>(set_+1);
149 //bool icase = e.m_flags & regex_constants::icase;
151 if(next == last) return next;
153 typedef typename traits_type::string_type traits_string_type;
154 const ::boost::regex_traits_wrapper<traits_type>& traits_inst = *(e.m_ptraits);
156 // dwa 9/13/00 suppress incorrect MSVC warning - it claims this is never
160 // try and match a single character, could be a multi-character
161 // collating element...
162 for(i = 0; i < set_->csingles; ++i)
165 if(*p == static_cast<charT>(0))
167 // treat null string as special case:
168 if(traits_inst.translate(*ptr, icase) != *p)
170 while(*p == static_cast<charT>(0))++p;
173 return set_->isnot ? next : (ptr == next) ? ++next : ptr;
177 while(*p && (ptr != last))
179 if(traits_inst.translate(*ptr, icase) != *p)
185 if(*p == static_cast<charT>(0)) // if null we've matched
186 return set_->isnot ? next : (ptr == next) ? ++next : ptr;
188 p = re_skip_past_null(p); // skip null
192 charT col = traits_inst.translate(*next, icase);
195 if(set_->cranges || set_->cequivalents)
197 traits_string_type s1;
199 // try and match a range, NB only a single character can match
202 if((e.m_flags & regex_constants::collate) == 0)
206 charT a[2] = { col, charT(0), };
207 s1 = traits_inst.transform(a, a + 1);
209 for(i = 0; i < set_->cranges; ++i)
211 if(STR_COMP(s1, p) >= 0)
215 if(STR_COMP(s1, p) <= 0)
216 return set_->isnot ? next : ++next;
224 // skip second string
230 // try and match an equivalence class, NB only a single character can match
231 if(set_->cequivalents)
233 charT a[2] = { col, charT(0), };
234 s1 = traits_inst.transform_primary(a, a +1);
235 for(i = 0; i < set_->cequivalents; ++i)
237 if(STR_COMP(s1, p) == 0)
238 return set_->isnot ? next : ++next;
245 if(traits_inst.isctype(col, set_->cclasses) == true)
246 return set_->isnot ? next : ++next;
247 if((set_->cnclasses != 0) && (traits_inst.isctype(col, set_->cnclasses) == false))
248 return set_->isnot ? next : ++next;
249 return set_->isnot ? ++next : next;
252 template <class BidiIterator>
255 repeater_count** stack;
256 repeater_count* next;
258 std::size_t count; // the number of iterations so far
259 BidiIterator start_pos; // where the last repeat started
261 repeater_count(repeater_count** s)
268 repeater_count(int i, repeater_count** s, BidiIterator start)
275 if(state_id > next->state_id)
279 repeater_count* p = next;
280 while(p->state_id != state_id)
283 start_pos = p->start_pos;
290 std::size_t get_count() { return count; }
291 int get_id() { return state_id; }
292 std::size_t operator++() { return ++count; }
293 bool check_null_repeat(const BidiIterator& pos, std::size_t max)
295 // this is called when we are about to start a new repeat,
296 // if the last one was NULL move our count to max,
297 // otherwise save the current position.
298 bool result = (count == 0) ? false : (pos == start_pos);
309 enum saved_state_type
312 saved_type_paren = 1,
313 saved_type_recurse = 2,
314 saved_type_assertion = 3,
316 saved_state_repeater_count = 5,
317 saved_state_extra_block = 6,
318 saved_state_greedy_single_repeat = 7,
319 saved_state_rep_slow_dot = 8,
320 saved_state_rep_fast_dot = 9,
321 saved_state_rep_char = 10,
322 saved_state_rep_short_set = 11,
323 saved_state_rep_long_set = 12,
324 saved_state_non_greedy_long_repeat = 13,
325 saved_state_count = 14
329 #pragma warning(push)
330 #pragma warning(disable : 4251 4231 4660)
333 template <class BidiIterator, class Allocator, class traits>
337 typedef typename traits::char_type char_type;
338 typedef perl_matcher<BidiIterator, Allocator, traits> self_type;
339 typedef bool (self_type::*matcher_proc_type)(void);
340 typedef std::size_t traits_size_type;
341 typedef typename is_byte<char_type>::width_type width_type;
342 typedef typename regex_iterator_traits<BidiIterator>::difference_type difference_type;
344 perl_matcher(BidiIterator first, BidiIterator end,
345 match_results<BidiIterator, Allocator>& what,
346 const basic_regex<char_type, traits>& e,
349 : m_result(what), base(first), last(end),
350 position(first), backstop(l_base), re(e), traits_inst(e.get_traits()),
351 m_independent(false), next_count(&rep_obj), rep_obj(&next_count)
353 construct_init(e, f);
359 void setf(match_flag_type f)
360 { m_match_flags |= f; }
361 void unsetf(match_flag_type f)
362 { m_match_flags &= ~f; }
365 void construct_init(const basic_regex<char_type, traits>& e, match_flag_type f);
369 #ifdef BOOST_REGEX_HAS_MS_STACK_GUARD
370 typedef bool (perl_matcher::*protected_proc_type)();
371 bool protected_call(protected_proc_type);
373 void estimate_max_state_count(std::random_access_iterator_tag*);
374 void estimate_max_state_count(void*);
376 bool match_all_states();
378 // match procs, stored in s_match_vtable:
379 bool match_startmark();
380 bool match_endmark();
381 bool match_literal();
382 bool match_start_line();
383 bool match_end_line();
386 bool match_word_boundary();
387 bool match_within_word();
388 bool match_word_start();
389 bool match_word_end();
390 bool match_buffer_start();
391 bool match_buffer_end();
392 bool match_backref();
393 bool match_long_set();
398 bool match_combining();
399 bool match_soft_buffer_end();
400 bool match_restart_continue();
401 bool match_long_set_repeat();
402 bool match_set_repeat();
403 bool match_char_repeat();
404 bool match_dot_repeat_fast();
405 bool match_dot_repeat_slow();
406 bool match_backstep();
407 bool match_assert_backref();
408 bool match_toggle_case();
409 #ifdef BOOST_REGEX_RECURSIVE
410 bool backtrack_till_match(std::size_t count);
413 // find procs stored in s_find_vtable:
414 bool find_restart_any();
415 bool find_restart_word();
416 bool find_restart_line();
417 bool find_restart_buf();
418 bool find_restart_lit();
421 // final result structure to be filled in:
422 match_results<BidiIterator, Allocator>& m_result;
423 // temporary result for POSIX matches:
424 scoped_ptr<match_results<BidiIterator, Allocator> > m_temp_match;
425 // pointer to actual result structure to fill in:
426 match_results<BidiIterator, Allocator>* m_presult;
427 // start of sequence being searched:
429 // end of sequence being searched:
431 // current character being examined:
432 BidiIterator position;
433 // where to restart next search after failed match attempt:
434 BidiIterator restart;
435 // where the current search started from, acts as base for $` during grep:
436 BidiIterator search_base;
437 // how far we can go back when matching lookbehind:
438 BidiIterator backstop;
439 // the expression being examined:
440 const basic_regex<char_type, traits>& re;
441 // the expression's traits class:
442 const ::boost::regex_traits_wrapper<traits>& traits_inst;
443 // the next state in the machine being matched:
444 const re_syntax_base* pstate;
445 // matching flags in use:
446 match_flag_type m_match_flags;
447 // how many states we have examined so far:
448 boost::uintmax_t state_count;
449 // max number of states to examine before giving up:
450 boost::uintmax_t max_state_count;
451 // whether we should ignore case or not:
453 // set to true when (position == last), indicates that we may have a partial match:
454 bool m_has_partial_match;
455 // set to true whenever we get a match:
456 bool m_has_found_match;
457 // set to true whenever we're inside an independent sub-expression:
459 // the current repeat being examined:
460 repeater_count<BidiIterator>* next_count;
461 // the first repeat being examined (top of linked list):
462 repeater_count<BidiIterator> rep_obj;
463 // the mask to pass when matching word boundaries:
464 typename traits::char_class_type m_word_mask;
465 // the bitmask to use when determining whether a match_any matches a newline or not:
466 unsigned char match_any_mask;
468 #ifdef BOOST_REGEX_NON_RECURSIVE
470 // additional members for non-recursive version:
472 typedef bool (self_type::*unwind_proc_type)(bool);
476 bool unwind_end(bool);
477 bool unwind_paren(bool);
478 bool unwind_recursion_stopper(bool);
479 bool unwind_assertion(bool);
480 bool unwind_alt(bool);
481 bool unwind_repeater_counter(bool);
482 bool unwind_extra_block(bool);
483 bool unwind_greedy_single_repeat(bool);
484 bool unwind_slow_dot_repeat(bool);
485 bool unwind_fast_dot_repeat(bool);
486 bool unwind_char_repeat(bool);
487 bool unwind_short_set_repeat(bool);
488 bool unwind_long_set_repeat(bool);
489 bool unwind_non_greedy_repeat(bool);
490 void destroy_single_repeat();
491 void push_matched_paren(int index, const sub_match<BidiIterator>& sub);
492 void push_recursion_stopper();
493 void push_assertion(const re_syntax_base* ps, bool positive);
494 void push_alt(const re_syntax_base* ps);
495 void push_repeater_count(int i, repeater_count<BidiIterator>** s);
496 void push_single_repeat(std::size_t c, const re_repeat* r, BidiIterator last_position, int state_id);
497 void push_non_greedy_repeat(const re_syntax_base* ps);
500 // pointer to base of stack:
501 saved_state* m_stack_base;
502 // pointer to current stack position:
503 saved_state* m_backup_state;
504 // determines what value to return when unwinding from recursion,
505 // allows for mixed recursive/non-recursive algorithm:
506 bool m_recursive_result;
507 // how many memory blocks have we used up?:
508 unsigned used_block_count;
511 // these operations aren't allowed, so are declared private,
512 // bodies are provided to keep explicit-instantiation requests happy:
513 perl_matcher& operator=(const perl_matcher&)
517 perl_matcher(const perl_matcher& that)
518 : m_result(that.m_result), re(that.re), traits_inst(that.traits_inst), rep_obj(0) {}
525 } // namespace re_detail
528 #pragma warning(push)
529 #pragma warning(disable: 4103)
531 #ifdef BOOST_HAS_ABI_HEADERS
532 # include BOOST_ABI_SUFFIX
541 # pragma warning(pop)
545 // include the implementation of perl_matcher:
547 #ifdef BOOST_REGEX_RECURSIVE
548 #include <boost/regex/v4/perl_matcher_recursive.hpp>
550 #include <boost/regex/v4/perl_matcher_non_recursive.hpp>
552 // this one has to be last:
553 #include <boost/regex/v4/perl_matcher_common.hpp>