Home | History | Annotate | Download | only in mips

Lines Matching full:branch

56   __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE));
57 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE));
58 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE));
83 __ Branch(miss, lt, scratch1, Operand(FIRST_SPEC_OBJECT_TYPE));
94 __ Branch(miss, ne, scratch1, Operand(zero_reg));
99 __ Branch(miss, ne, scratch1, Operand(scratch0));
150 __ Branch(miss, ne, at, Operand(zero_reg));
204 __ Branch(miss, ne, at, Operand(zero_reg));
233 __ Branch(slow, ne, at, Operand(zero_reg));
240 __ Branch(slow, lt, scratch, Operand(JS_OBJECT_TYPE));
273 // Holds the elements map if not_fast_array branch is taken.
282 __ Branch(not_fast_array, ne, scratch1, Operand(at));
289 __ Branch(out_of_range, hs, key, Operand(scratch1));
303 __ Branch(out_of_range, eq, scratch2, Operand(at));
320 __ Branch(not_unique, hi, hash, Operand(LAST_UNIQUE_NAME_TYPE));
322 __ Branch(&unique, eq, hash, Operand(LAST_UNIQUE_NAME_TYPE));
327 __ Branch(index_string, eq, at, Operand(zero_reg));
335 __ Branch(not_unique, ne, at, Operand(zero_reg));
373 __ Branch(&non_number, ne, a3, Operand(HEAP_NUMBER_TYPE));
377 __ Branch(&probe);
381 __ Branch(&non_string, Ugreater_equal, a3, Operand(FIRST_NONSTRING_TYPE));
384 __ Branch(&probe);
389 __ Branch(&boolean, eq, a1, Operand(t0));
391 __ Branch(&miss, ne, a1, Operand(t1));
416 __ Branch(miss, ne, scratch, Operand(JS_FUNCTION_TYPE));
491 __ Branch(&global, eq, a3, Operand(JS_GLOBAL_OBJECT_TYPE));
492 __ Branch(&invoke, ne, a3, Operand(JS_BUILTINS_OBJECT_TYPE));
568 __ Branch(&slow_load, ne, a3, Operand(at));
576 // This branch is taken when calling KeyedCallIC_Miss is neither required
601 __ Branch(&lookup_monomorphic_cache, ne, a3, Operand(at));
616 // This branch is taken if:
735 __ Branch(slow_case, lt, scratch2, Operand(FIRST_JS_RECEIVER_TYPE));
739 __ Branch(slow_case, ne, scratch1, Operand(zero_reg));
752 __ Branch(unmapped_case, Ugreater_equal, key, Operand(scratch2));
765 __ Branch(unmapped_case, eq, scratch2, Operand(scratch3));
797 __ Branch(slow_case, Ugreater_equal, key, Operand(scratch));
825 __ Branch(&slow, eq, a2, Operand(a3));
887 __ Branch(&slow, eq, a1, Operand(a3));
968 __ Branch(&slow, ne, a3, Operand(at));
993 __ Branch(&probe_dictionary, eq, t0, Operand(at));
1019 __ Branch(&try_next_entry, ne, a2, Operand(t1));
1021 __ Branch(&hit_on_nth_entry[i], eq, a0, Operand(t1));
1026 __ Branch(&slow, ne, a2, Operand(t1));
1028 __ Branch(&slow, ne, a0, Operand(t1));
1047 __ Branch(&property_array_property, ge, t1, Operand(zero_reg));
1049 __ Branch(&load_in_object_property);
1101 __ Branch(&index_smi);
1179 __ Branch(fast_double, ne, elements_map,
1191 __ Branch(&holecheck_passed1, ne, scratch_value,
1246 __ Branch(slow, ne, elements_map, Operand(at));
1258 __ Branch(&fast_double_without_map_check, ne, scratch_value,
1282 __ Branch(&non_double_value, ne, t0, Operand(at));
1361 __ Branch(&slow, ne, t0, Operand(zero_reg));
1364 __ Branch(&array, eq, t0, Operand(JS_ARRAY_TYPE));
1366 __ Branch(&slow, lt, t0, Operand(FIRST_JS_OBJECT_TYPE));
1372 __ Branch(&fast_object, lo, key, Operand(t0));
1388 __ Branch(&slow, ne, key, Operand(t0));
1392 __ Branch(&slow, hs, key, Operand(t0));
1394 __ Branch(
1400 __ Branch(&slow, ne, elements_map, Heap::kFixedDoubleArrayMapRootIndex);
1411 __ Branch(&extra, hs, key, Operand(t0));
1437 __ Branch(&slow, ne, t0, Operand(zero_reg));
1446 __ Branch(&slow, ne, a3, Operand(1 << Map::kHasIndexedInterceptor));
1666 // Branch <target>, eq, at, Operand(zero_reg)
1669 // Branch <target>, ne, at, Operand(zero_reg)