/usr/include/lexertl/lookup.hpp is in libpuma-dev 1:2.1-2+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 | // lookup.hpp
// Copyright (c) 2009-2015 Ben Hanson (http://www.benhanson.net/)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file licence_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef LEXERTL_LOOKUP_HPP
#define LEXERTL_LOOKUP_HPP
#include <assert.h>
#include "bool.hpp"
#include "match_results.hpp"
#include "state_machine.hpp"
namespace lexertl
{
namespace detail
{
template<bool>
struct bol_state
{
bol_state(const bool)
{
}
};
template<>
struct bol_state<true>
{
bool _bol;
bool _end_bol;
bol_state(const bool bol_) :
_bol(bol_),
_end_bol(bol_)
{
}
};
template<typename id_type, bool>
struct eol_state
{
};
template<typename id_type>
struct eol_state<id_type, true>
{
id_type _EOL_state;
eol_state() :
_EOL_state(0)
{
}
};
template<typename id_type, bool>
struct multi_state_state
{
multi_state_state(const id_type)
{
}
};
template<typename id_type>
struct multi_state_state<id_type, true>
{
id_type _start_state;
multi_state_state(const id_type state_) :
_start_state(state_)
{
}
};
template<typename id_type, bool>
struct recursive_state
{
recursive_state(const id_type *)
{
}
};
template<typename id_type>
struct recursive_state<id_type, true>
{
bool _pop;
id_type _push_dfa;
recursive_state(const id_type *ptr_) :
_pop((*ptr_ & pop_dfa_bit) != 0),
_push_dfa(*(ptr_ + push_dfa_index))
{
}
};
template<typename id_type, typename index_type, std::size_t flags>
struct lookup_state
{
typedef basic_internals<id_type> internals;
const id_type *_lookup;
id_type _dfa_alphabet;
const id_type *_dfa;
const id_type *_ptr;
bool _end_state;
id_type _id;
id_type _uid;
bol_state<(flags & bol_bit) != 0> _bol_state;
eol_state<id_type, (flags & eol_bit) != 0> _eol_state;
multi_state_state<id_type, (flags & multi_state_bit) != 0>
_multi_state_state;
recursive_state<id_type, (flags & recursive_bit) != 0> _recursive_state;
lookup_state(const internals &internals_, const bool bol_,
const id_type state_) :
_lookup(&internals_._lookup[state_]->front()),
_dfa_alphabet(internals_._dfa_alphabet[state_]),
_dfa(&internals_._dfa[state_]->front()),
_ptr(_dfa + _dfa_alphabet),
_end_state(*_ptr != 0),
_id(*(_ptr + id_index)),
_uid(*(_ptr + user_id_index)),
_bol_state(bol_),
_eol_state(),
_multi_state_state(state_),
_recursive_state(_ptr)
{
}
void reset_recursive(const false_ &)
{
// Do nothing
}
void reset_recursive(const true_ &)
{
_recursive_state._pop = (*_ptr & pop_dfa_bit) != 0;
_recursive_state._push_dfa = *(_ptr + push_dfa_index);
}
void bol_start_state(const false_ &)
{
// Do nothing
}
void bol_start_state(const true_ &)
{
if (_bol_state._bol)
{
const id_type state_ = *_dfa;
if (state_)
{
_ptr = &_dfa[state_ * _dfa_alphabet];
}
}
}
template<typename char_type>
bool is_eol(const char_type, const false_ &)
{
return false;
}
template<typename char_type>
bool is_eol(const char_type curr_, const true_ &)
{
bool ret_ = false;
_eol_state._EOL_state = _ptr[eol_index];
ret_ = _eol_state._EOL_state && curr_ == '\n';
if (ret_)
{
_ptr = &_dfa[_eol_state._EOL_state * _dfa_alphabet];
}
return ret_;
}
template<typename char_type>
id_type next_char(const char_type prev_char_, const false_ &)
{
const id_type state_= _ptr[_lookup
[static_cast<index_type>(prev_char_)]];
if (state_ != 0)
{
_ptr = &_dfa[state_ * _dfa_alphabet];
}
return state_;
}
template<typename char_type>
id_type next_char(const char_type prev_char_, const true_ &)
{
const std::size_t bytes_ = sizeof(char_type) < 3 ?
sizeof(char_type) : 3;
const std::size_t shift_[] = {0, 8, 16};
id_type state_= 0;
for (std::size_t i_ = 0; i_ < bytes_; ++i_)
{
state_ = _ptr[_lookup[static_cast<unsigned char>((prev_char_ >>
shift_[bytes_ - 1 - i_]) & 0xff)]];
if (state_ == 0)
{
break;
}
_ptr = &_dfa[state_ * _dfa_alphabet];
}
return state_;
}
template<typename char_type>
void bol(const char_type, const false_ &)
{
// Do nothing
}
template<typename char_type>
void bol(const char_type prev_char_, const true_ &)
{
_bol_state._bol = prev_char_ == '\n';
}
void eol(const id_type, const false_ &)
{
// Do nothing
}
void eol(const id_type err_val_, const true_ &)
{
_eol_state._EOL_state = err_val_;
}
void reset_start_state(const false_ &)
{
// Do nothing
}
void reset_start_state(const true_ &)
{
_multi_state_state._start_state = *(_ptr + next_dfa_index);
}
void reset_end_bol(const false_ &)
{
// Do nothing
}
void reset_end_bol(const true_ &)
{
_bol_state._end_bol = _bol_state._bol;
}
template<typename iter_type>
void end_state(iter_type &end_token_, iter_type &curr_)
{
if (*_ptr)
{
_end_state = true;
reset_end_bol(bool_<(flags & bol_bit) != 0>());
_id = *(_ptr + id_index);
_uid = *(_ptr + user_id_index);
reset_recursive(bool_<(flags & recursive_bit) != 0>());
reset_start_state(bool_<(flags & multi_state_bit) != 0>());
end_token_ = curr_;
}
}
template<typename iter_type, typename char_type>
void check_eol(iter_type &, iter_type &, const id_type,
const char_type, const false_ &)
{
// Do nothing
}
template<typename iter_type, typename char_type>
void check_eol(iter_type &end_token_, iter_type &curr_,
const id_type npos, const char_type eoi_, const true_ &)
{
if (_eol_state._EOL_state != npos && curr_ == eoi_)
{
_eol_state._EOL_state = _ptr[eol_index];
if (_eol_state._EOL_state)
{
_ptr = &_dfa[_eol_state._EOL_state * _dfa_alphabet];
end_state(end_token_, curr_);
}
}
}
template<typename results>
void pop(results &, const false_ &)
{
// Nothing to do
}
template<typename results>
void pop(results &results_, const true_ &)
{
if (_recursive_state._pop)
{
_multi_state_state._start_state = results_.stack.top().first;
results_.stack.pop();
}
else if (_recursive_state._push_dfa != results::npos())
{
results_.stack.push(typename results::id_type_pair
(_recursive_state._push_dfa, _id));
}
}
template<typename results>
bool is_id_eoi(const id_type eoi_, const results &, const false_ &)
{
return _id == eoi_;
}
template<typename results>
bool is_id_eoi(const id_type eoi_, const results &results_, const true_ &)
{
return _id == eoi_ || (_recursive_state._pop &&
!results_.stack.empty() && results_.stack.top().second == eoi_);
}
void start_state(id_type &, const false_ &)
{
// Do nothing
}
void start_state(id_type &start_state_, const true_ &)
{
start_state_ = _multi_state_state._start_state;
}
void bol(bool &, const false_ &)
{
// Do nothing
}
void bol(bool &end_bol_, const true_ &)
{
end_bol_ = _bol_state._end_bol;
}
};
template<typename results>
void inc_end(results &, const false_ &)
{
// Do nothing
}
template<typename results>
void inc_end(results &results_, const true_ &)
{
++results_.end;
}
template<typename iter_type, std::size_t flags, typename id_type,
typename results, bool compressed, bool recursive>
void next(const basic_state_machine<typename std::iterator_traits
<iter_type>::value_type, id_type> &sm_,
results &results_, const bool_<compressed> &compressed_,
const bool_<recursive> &recursive_)
{
const basic_internals<id_type> &internals_ = sm_.data();
typename results::iter_type end_token_ = results_.end;
skip:
typename results::iter_type curr_ = results_.end;
results_.start = curr_;
again:
if (curr_ == results_.eoi)
{
results_.id = internals_._eoi;
results_.user_id = results::npos();
return;
}
lookup_state<id_type, typename results::index_type, flags> lu_state_
(internals_, results_.bol, results_.state);
lu_state_.bol_start_state(bool_<(flags & bol_bit) != 0>());
while (curr_ != results_.eoi)
{
if (!lu_state_.is_eol(*curr_, bool_<(flags & eol_bit) != 0>()))
{
const typename results::char_type prev_char_ = *curr_++;
const id_type state_ = lu_state_.next_char(prev_char_,
compressed_);
lu_state_.bol(prev_char_, bool_<(flags & bol_bit) != 0>());
if (state_ == 0)
{
lu_state_.is_eol(results::npos(),
bool_<(flags & eol_bit) != 0>());
break;
}
}
lu_state_.end_state(end_token_, curr_);
}
lu_state_.check_eol(end_token_, curr_, results::npos(), results_.eoi,
bool_<(flags & eol_bit) != 0>());
if (lu_state_._end_state)
{
// Return longest match
lu_state_.pop(results_, recursive_);
lu_state_.start_state(results_.state,
bool_<(flags & multi_state_bit) != 0>());
lu_state_.bol(results_.bol, bool_<(flags & bol_bit) != 0>());
results_.end = end_token_;
if (lu_state_._id == sm_.skip()) goto skip;
if (lu_state_.is_id_eoi(internals_._eoi, results_, recursive_))
{
curr_ = end_token_;
goto again;
}
}
else
{
results_.end = end_token_;
results_.bol = *results_.end == '\n';
results_.start = results_.end;
// No match causes char to be skipped
inc_end(results_, bool_<(flags & advance_bit) != 0>());
lu_state_._id = results::npos();
lu_state_._uid = results::npos();
}
results_.id = lu_state_._id;
results_.user_id = lu_state_._uid;
}
}
template<typename iter_type, typename id_type, std::size_t flags>
void lookup(const basic_state_machine<typename std::iterator_traits
<iter_type>::value_type, id_type> &sm_,
match_results<iter_type, id_type, flags> &results_)
{
// If this asserts, you have either not defined all the correct
// flags, or you should be using recursive_match_results instead
// of match_results.
assert((sm_.data()._features & flags) == sm_.data()._features);
detail::next<iter_type, flags, id_type>(sm_, results_, bool_<(sizeof
(typename std::iterator_traits<iter_type>::value_type) > 1)>(),
false_());
}
template<typename iter_type, typename id_type, std::size_t flags>
void lookup(const basic_state_machine<typename std::iterator_traits
<iter_type>::value_type, id_type> &sm_,
recursive_match_results<iter_type, id_type, flags> &results_)
{
// If this asserts, you have not defined all the correct flags
assert((sm_.data()._features & flags) == sm_.data()._features);
detail::next<iter_type, flags | recursive_bit, id_type>(sm_, results_,
bool_<(sizeof(typename std::iterator_traits<iter_type>::
value_type) > 1)>(), true_());
}
}
#endif
|