Lines Matching refs:EQUAL
183 __ j(equal, &skip_mov, Label::kNear);
329 __ Check(equal, kUnexpectedTypeForRegExpDataFixedArrayExpected);
534 __ j(equal, &success);
537 __ j(equal, &failure);
550 __ j(equal, &runtime);
687 __ j(equal, &thin_string, Label::kNear);
701 DCHECK(cc != equal);
770 if (cc != equal) {
785 __ j(equal, &generic_heap_number_comparison, Label::kNear);
786 if (cc != equal) {
789 // Call runtime on identical JSObjects. Otherwise return equal.
794 __ j(equal, &runtime_call, Label::kFar);
796 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
803 // Strict equality can quickly decide whether objects are equal.
805 if (cc == equal && strict()) {
813 // be equal if the other is a HeapNumber. If so, use the slow case.
836 __ j(equal, &slow, Label::kNear);
837 // Return non-equal (ebx is not zero)
843 // equal since their pointers are different
862 __ j(equal, &return_not_equal);
869 __ j(equal, &return_not_equal);
905 // The cc is never not-equal.
920 if (cc == equal) {
925 // are internalized they aren't equal. Register eax already holds a
926 // non-zero value, which indicates not equal, so just return.
936 if (cc == equal) {
947 if (cc == equal && !strict()) {
977 // Return non-equal by returning the non-zero object pointer in eax.
994 __ Move(eax, Immediate(EQUAL));
999 if (cc == equal) {
1004 : isolate()->builtins()->Equal(),
1009 STATIC_ASSERT(EQUAL == 0);
1021 // Call the native; it returns -1 (less), 0 (equal), or 1 (greater)
1081 __ j(equal, &done, Label::kFar);
1083 __ j(equal, &done, Label::kFar);
1111 __ j(equal, &initialize);
1168 __ j(equal, &feedback_register_initialized);
1267 __ j(equal, &call);
1286 __ j(equal, &uninitialized);
1320 __ j(equal, &miss);
1505 __ j(equal, &exception_returned);
1517 __ j(equal, &okay, Label::kNear);
1787 __ j(equal, &check_zero_length, Label::kNear);
1798 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
1806 // Characters are equal.
1807 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
1843 // Compare lengths - strings up to min-length are equal.
1849 // Result is EQUAL.
1850 STATIC_ASSERT(EQUAL == 0);
1852 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
1919 __ Assert(equal, kExpectedAllocationSite);
1963 if (GetCondition() == equal) {
2028 __ j(equal, &unordered);
2038 DCHECK(GetCondition() == equal);
2070 STATIC_ASSERT(EQUAL == 0);
2072 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
2083 DCHECK(GetCondition() == equal);
2115 STATIC_ASSERT(EQUAL == 0);
2117 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
2161 STATIC_ASSERT(EQUAL == 0);
2163 __ Move(eax, Immediate(Smi::FromInt(EQUAL)));
2236 DCHECK_EQ(equal, GetCondition());
2310 // not equal to the name and kProbes-th slot is not used (its name is the
2333 __ j(equal, done);
2337 __ j(equal, miss);
2342 __ j(equal, &good, Label::kNear);
2386 // not equal to the name and kProbes-th slot is not used (its name is the
2407 __ j(equal, ¬_in_dictionary);
2411 __ j(equal, &in_dictionary);
2415 // lookup we have to bailout as this key might be equal to the
2749 __ Assert(equal, kExpectedAllocationSite);
2848 __ Assert(equal, kUnexpectedInitialMapForArrayFunction);
2866 __ j(equal, &no_info);
2942 __ Assert(equal, kUnexpectedInitialMapForArrayFunction);
2957 __ j(equal, &done);
2959 __ Assert(equal, kInvalidElementsKindForInternalArrayOrInternalPackedArray);
2965 __ j(equal, &fast_elements_case);
2991 __ j(equal, &ok);
3076 __ j(equal, &done_loop, Label::kNear);
3155 __ j(equal, &ok);
3178 __ j(equal, &adaptor_frame, Label::kNear);
3410 __ j(equal, &ok);
3420 __ j(equal, &arguments_adaptor, Label::kNear);
3463 __ j(equal, &done_loop, Label::kNear);
3659 __ j(equal, &ok, Label::kNear);
3662 equal, &ok, Label::kNear);
3665 __ j(equal, &ok, Label::kNear);
3668 __ j(equal, &ok, Label::kNear);
3671 __ j(equal, &ok, Label::kNear);
