Lines Matching refs:equal
401 __ Check(equal, kUnexpectedTypeForRegExpDataFixedArrayExpected);
621 __ j(equal, &success, Label::kNear);
623 __ j(equal, &exception);
714 __ j(equal, &runtime);
766 __ j(equal, &thin_string, Label::kNear);
780 DCHECK(cc != equal);
842 // Two identical objects are equal unless they are both NaN or undefined.
848 if (cc != equal) {
862 // If it's not a heap number, then return equal for (in)equality operator.
865 __ j(equal, &heap_number, Label::kNear);
866 if (cc != equal) {
869 // Call runtime on identical objects. Otherwise return equal.
874 __ j(equal, &runtime_call, Label::kFar);
876 __ Set(rax, EQUAL);
880 // It is a heap number, so return equal if it's not NaN.
882 // greater-equal. Return -1 for them, so the comparison yields
883 // false for all conditions except not-equal.
884 __ Set(rax, EQUAL);
888 // rax is 0 for equal non-NaN heapnumbers, 1 for NaNs.
897 if (cc == equal) { // Both strict and non-strict.
906 // be equal if the other is a HeapNumber. If so, use the slow case.
915 __ j(equal, &slow);
916 // Return non-equal. ebx (the lower half of rbx) is not zero.
924 // equal since their pointers are different
941 __ j(equal, &return_not_equal);
948 __ j(equal, &return_not_equal);
972 // The cc is never not-equal.
987 if (cc == equal) {
994 // internalized strings they aren't equal. Register rax (not rax) already
995 // holds a non-zero value, which indicates not equal, so just return.
1005 if (cc == equal) {
1017 if (cc == equal && !strict()) {
1046 // Return non-equal by returning the non-zero object pointer in rax.
1063 __ Set(rax, EQUAL);
1068 if (cc == equal) {
1073 : isolate()->builtins()->Equal(),
1078 STATIC_ASSERT(EQUAL == 0);
1147 __ j(equal, &done, Label::kFar);
1149 __ j(equal, &done, Label::kFar);
1156 __ j(equal, &initialize);
1178 __ j(equal, &initialize);
1231 __ j(equal, &feedback_register_initialized, Label::kNear);
1380 __ j(equal, &exception_returned);
1392 __ j(equal, &okay, Label::kNear);
1708 __ j(equal, &check_zero_length, Label::kNear);
1718 __ Move(rax, Smi::FromInt(EQUAL));
1727 // Characters are equal.
1728 EQUAL));
1731 // Characters are not equal.
1783 // Result is EQUAL.
1784 __ Move(rax, Smi::FromInt(EQUAL));
1851 __ Assert(equal, kExpectedAllocationSite);
1895 if (GetCondition() == equal) {
1960 __ setcc(above, rax); // Add one to zero if carry clear and not equal.
1983 __ j(equal, &unordered);
1993 DCHECK(GetCondition() == equal);
2023 STATIC_ASSERT(EQUAL == 0);
2025 __ Move(rax, Smi::FromInt(EQUAL));
2036 DCHECK(GetCondition() == equal);
2066 STATIC_ASSERT(EQUAL == 0);
2068 __ Move(rax, Smi::FromInt(EQUAL));
2110 STATIC_ASSERT(EQUAL == 0);
2112 __ Move(rax, Smi::FromInt(EQUAL));
2184 DCHECK_EQ(equal, GetCondition());
2252 // not equal to the name and kProbes-th slot is not used (its name is the
2278 __ j(equal, done);
2282 __ j(equal, miss);
2287 __ j(equal, &good, Label::kNear);
2330 // not equal to the name and kProbes-th slot is not used (its name is the
2353 __ j(equal, ¬_in_dictionary);
2357 __ j(equal, &in_dictionary);
2361 // lookup we have to bailout as this key might be equal to the
2712 __ Assert(equal, kExpectedAllocationSite);
2813 __ Check(equal, kUnexpectedInitialMapForArrayFunction);
2830 __ j(equal, &no_info);
2911 __ Check(equal, kUnexpectedInitialMapForArrayFunction);
2926 __ j(equal, &done);
2928 __ Assert(equal,
2935 __ j(equal, &fast_elements_case);
3081 __ j(equal, &ok, Label::kNear);
3084 __ j(equal, &ok, Label::kNear);
3087 __ j(equal, &ok, Label::kNear);
3090 __ j(equal, &ok, Label::kNear);
3093 __ j(equal, &ok, Label::kNear);
