Home | History | Annotate | Download | only in mips

Lines Matching refs:Label

160   DECLARE_NORELOC_PROTOTYPE(Name, Label*) \
197 void Branch(Label* L,
225 void Call(Label* target);
258 // Jump unconditionally to given label.
262 // Use rather b(Label) for code generation.
263 void jmp(Label* L) {
317 Label* condition_met);
323 Label* branch) {
331 Label* branch) {
339 Label* has_color,
346 Label* on_black);
351 // black and fall through. For the rest we jump to the label so the
357 Label* object_is_white_and_not_data);
363 Label* not_data_object);
422 Label* miss);
426 void LoadFromNumberDictionary(Label* miss,
475 // gc_required label. The allocated object is returned in result. If
478 // continues at the gc_required label.
483 Label* gc_required,
489 Label* gc_required,
504 Label* gc_required);
510 Label* gc_required);
515 Label* gc_required);
520 Label* gc_required);
525 Label* gc_required);
530 Label* gc_required);
532 // Allocates a heap number or jumps to the gc_required label if the young
534 // when control continues at the gc_required label.
539 Label* gc_required);
544 Label* gc_required);
727 void BranchF(Label* target,
728 Label* nan,
736 Label* target,
737 Label* nan,
746 // to not_int32 label. If FPU is available double_scratch is used but not
753 Label *not_int32);
817 Label* no_map_match);
879 Label* fail);
883 Label* fail);
887 Label* fail);
937 // function and jumps to the miss label if the fast checks fail. The
943 Label* miss,
951 // Jump to the specified label if it does not.
954 Label* fail);
957 // and HeapObject elements. Jump to the specified label if it does not.
960 Label* fail);
963 // elements. Jump to the specified label if it does not.
966 Label* fail);
980 Label* fail);
989 Label* early_success,
991 Label* branch_to,
995 // label if not. Skip the smi check if not required (object is known to be a
1001 Label* fail,
1009 Label* fail,
1051 // object is not a number a jump to the label not_number is performed
1059 Label* not_number,
1086 void BranchOnOverflow(Label* label,
1089 Branch(label, lt, overflow_check, Operand(zero_reg), bd);
1092 void BranchOnNoOverflow(Label* label,
1095 Branch(label, ge, overflow_check, Operand(zero_reg), bd);
1273 // control continues at the label not_power_of_two. If reg is a power of two
1278 Label* not_power_of_two_or_zero);
1305 void UntagAndJumpIfSmi(Register dst, Register src, Label* smi_case);
1309 void UntagAndJumpIfNotSmi(Register dst, Register src, Label* non_smi_case);
1313 Label* smi_label,
1319 Label* not_smi_label,
1324 void JumpIfNotBothSmi(Register reg1, Register reg2, Label* on_not_both_smi);
1326 void JumpIfEitherSmi(Register reg1, Register reg2, Label* on_either_smi);
1346 Label* on_not_heap_number);
1352 // label if either is not.
1358 Label* failure);
1360 // Check if instance type is sequential ASCII string and jump to label if
1364 Label* failure);
1372 Label* failure);
1380 Label* failure);
1407 void CheckEnumCache(Register null_value, Label* call_runtime);
1418 void BranchShort(Label* L, BranchDelaySlot bdslot = PROTECT);
1419 void BranchShort(Label* L, Condition cond, Register rs,
1426 void BranchAndLinkShort(Label* L, BranchDelaySlot bdslot = PROTECT);
1427 void BranchAndLinkShort(Label* L, Condition cond, Register rs,
1430 void J(Label* L, BranchDelaySlot bdslot);
1431 void Jr(Label* L, BranchDelaySlot bdslot);
1432 void Jalr(Label* L, BranchDelaySlot bdslot);
1439 Label* done,
1459 Label* branch);