#include <stdint.h>#include <string.h>#include <algorithm>#include <map>#include <string>#include <vector>#include "util/util.h"#include "util/logging.h"#include "util/pod_array.h"#include "util/sparse_set.h"#include "util/strutil.h"#include "util/utf.h"#include "re2/prog.h"#include "re2/stringpiece.h"
Include dependency graph for bloaty/third_party/re2/re2/onepass.cc:
Go to the source code of this file.
Classes | |
| struct | re2::InstCond |
| struct | re2::OneState |
Namespaces | |
| re2 | |
Typedefs | |
| typedef SparseSet | re2::Instq |
Functions | |
| static bool | re2::AddQ (Instq *q, int id) |
| static void | re2::ApplyCaptures (uint32_t cond, const char *p, const char **cap, int ncap) |
| static OneState * | re2::IndexToNode (uint8_t *nodes, int statesize, int nodeindex) |
| void | re2::OnePass_Checks () |
| static bool | re2::Satisfy (uint32_t cond, const StringPiece &context, const char *p) |
Variables | |
| static const bool | re2::ExtraDebug = false |
| static const uint32_t | re2::kCapMask = ((1 << kRealMaxCap) - 1) << kRealCapShift |
| static const int | re2::kCapShift = kRealCapShift - 2 |
| static const int | re2::kEmptyShift = 6 |
| static const uint32_t | re2::kImpossible = kEmptyWordBoundary | kEmptyNonWordBoundary |
| static const int | re2::kIndexShift = 16 |
| static const uint32_t | re2::kMatchWins = 1 << kEmptyShift |
| static const int | re2::kMaxCap = kRealMaxCap + 2 |
| static const int | re2::kRealCapShift = kEmptyShift + 1 |
| static const int | re2::kRealMaxCap = (kIndexShift - kRealCapShift) / 2 * 2 |