Lines Matching defs:at
234 // and the total executable memory at any point.
579 // If set to true, there is no way this quick check can match at all.
580 // E.g., if it requires to be at the start of the input, and isn't.
596 // Generates a goto to this node or actually generates the code at this point.
598 // How many characters must this node consume at a minimum in order to
599 // succeed. If we have found at least 'still_to_find' characters that
602 // used to indicate that we know we are not at the start of the input. In
636 // the number of nodes we are willing to look at in order to create this data.
669 // If non-generic code is generated for a node (i.e. the node is not at the
700 // generated code is located unless the code is generated at the start of
1120 // If true, this node is never checked at the start of the input.
1145 alternatives_->at(1).node()->FillInBMInfo(
1201 // character one at a time. For example in the middle of the regexp
1203 // inserted at the start of any non-anchored regexp.
1206 // characters that can come at given distances. For example for the regexp
1207 // /.?foo/ we know that there are at least 3 characters ahead of us, and the
1216 // We also look at the first string fed to the regexp and use that to get a hint
1222 // to determine whether a match is possible at this point.
1256 bool& at(int i) { return map_->at(i); }
1288 return bitmaps_->at(map_number)->map_count();
1291 BoyerMoorePositionInfo* at(int i) { return bitmaps_->at(i); }
1295 BoyerMoorePositionInfo* info = bitmaps_->at(map_number);
1301 BoyerMoorePositionInfo* info = bitmaps_->at(map_number);
1310 bitmaps_->at(map_number)->SetAll();
1319 // This is the value obtained by EatsAtLeast. If we do not have at least this
