Lines Matching defs:label
964 if (!node->on_work_list() && !node->label()->is_bound()) {
1080 Label fail;
1089 if (!node->label()->is_bound()) node->Emit(this, &new_trace);
1367 Label undo;
1374 assembler->GoTo(successor->label());
1397 if (!label()->is_bound()) {
1400 assembler->Bind(label());
1425 if (!label()->is_bound()) {
1426 assembler->Bind(label());
1597 Label* on_failure,
1620 Label* on_failure,
1653 Label* on_failure) {
1691 Label* on_failure,
1701 Label* on_failure,
1715 Label ok;
1747 Label* fall_through,
1748 Label* above_or_equal,
1749 Label* below) {
1762 Label* fall_through,
1763 Label* in_range,
1764 Label* out_of_range) {
1790 Label* fall_through,
1791 Label* even_label,
1792 Label* odd_label) {
1806 Label* on_bit_set;
1807 Label* on_bit_clear;
1848 Label* even_label,
1849 Label* odd_label) {
1851 Label* in_range_label = odd ? odd_label : even_label;
1852 Label dummy;
1942 // Either label can be NULL indicating backtracking. Either label can also be
1943 // equal to the fall_through label.
1950 Label* fall_through,
1951 Label* even_label,
1952 Label* odd_label) {
2043 Label handle_rest;
2044 Label* above = &handle_rest;
2070 Label dummy;
2098 Label* on_failure, int cp_offset, bool check_offset,
2169 // entry at zero which goes to the failure label, but if there
2192 Label fall_through;
2228 // Generate generic version of the node and bind the label for later use.
2429 Label* on_possible_success,
2970 Label* word,
2971 Label* non_word,
3004 Label ok;
3057 Label before_non_word;
3058 Label before_word;
3066 Label ok;
3090 Label fall_through, dummy;
3092 Label* non_word = backtrack_if_previous == kIsNonWord ?
3095 Label* word = backtrack_if_previous == kIsNonWord ?
3133 Label ok;
3218 Label* backtrack = trace->backtrack();
3519 Label possible_success;
3521 Label after;
3771 Label cont, again;
3793 Label cont, again;
3949 // TODO(erikcorry): Delete this. We don't need this label, but it makes us
3951 Label second_choice;
3965 // label was bound.
4004 Label greedy_match_failed;
4008 Label loop_label;
4015 Label second_choice; // For use in greedy matches.
4026 macro_assembler->Bind(greedy_loop_state->label());
4190 Label reload_current_char;
4287 Label skip_empty_check;
4318 Label clear_registers_backtrack;
4376 void PrintNode(const char* label, RegExpNode* node);
4390 void DotPrinter::PrintNode(const char* label, RegExpNode* node) {
4391 os_ << "digraph G {\n graph [label=\"";
4392 for (int i = 0; label[i]; i++) {
4393 switch (label[i]) {
4401 os_ << label[i];
4506 << "margin=0.1, fontsize=10, label=\"{";
4512 Label* label = that->label();
4513 if (label->is_bound())
4514 printer.PrintPositive("@", label->pos());
4524 os_ << " n" << that << " [shape=Mrecord, label=\"";
4532 os_ << " n" << that << " [shape=Mrecord, label=\"?\"];\n";
4547 os_ << " n" << that << " [label=\"";
4582 os_ << " n" << that << " [label=\"$" << that->start_register() << "..$"
4600 os_ << "label=\"$\", shape=septagon";
4603 os_ << "label=\"^\", shape=septagon";
4606 os_ << "label=\"\\b\", shape=septagon";
4609 os_ << "label=\"\\B\", shape=septagon";
4612 os_ << "label=\"(?<=\\n)\", shape=septagon";
4627 os_ << "label=\"$" << that->data_.u_store_register.reg
4631 os_ << "label=\"$" << that->data_.u_increment_register.reg
4635 os_ << "label=\"$" << that->data_.u_position_register.reg
4639 os_ << "label=\"$" << that->data_.u_submatch.current_position_register
4643 os_ << "label=\"escape\", shape=septagon";
4646 os_ << "label=\"$" << that->data_.u_empty_match_check.start_register
4652 os_ << "label=\"clear $" << that->data_.u_clear_captures.range_from
4700 void RegExpEngine::DotPrint(const char* label,
4705 printer.PrintNode(label, node);
