Home | History | Annotate | Download | only in s390

Lines Matching defs:equal

130   // If exponent is greater than or equal to 84, the 32 less significant
211 // They are both equal and they are not both Smis so both of them are not
212 // Smis. If it's not a heap number, then return equal.
262 __ LoadImmP(r2, Operand(EQUAL)); // Things are <=, >=, ==, === themselves
271 // It is a heap number, so return non-equal if it's NaN and equal if it's
290 // For equal we already have the right value in r2: Return zero (equal)
297 // All-zero means Infinity means equal.
326 // succeed. Return non-equal
356 // succeed. Return non-equal.
385 // not equal since their pointers are different.
465 // they are not equal. Return non-equal by returning the non-zero object
485 // Return non-equal by returning the non-zero object pointer in r2.
501 __ LoadImmP(r2, Operand(EQUAL));
554 // be strictly equal if the other is a HeapNumber.
575 Label nan, equal, less_than;
577 __ beq(&equal, Label::kNear);
581 __ bind(&equal);
582 __ LoadImmP(r2, Operand(EQUAL));
603 // This returns non-equal for some object types, or falls through if it
654 STATIC_ASSERT(EQUAL == 0);
670 // Call the native; it returns -1 (less), 0 (equal), or 1 (greater)
2623 __ LoadSmiLiteral(r2, Smi::FromInt(EQUAL));
2631 // Characters are equal.
2632 __ LoadSmiLiteral(r2, Smi::FromInt(EQUAL));
2658 // Compare lengths - strings up to min-length are equal.
2660 DCHECK(Smi::FromInt(EQUAL) == static_cast<Smi*>(0));
2667 Label less_equal, equal;
2672 __ beq(&equal);
2674 __ bind(&equal);
2780 Label equal, less_than;
2819 __ beq(&equal);
2824 __ bind(&equal);
2825 __ LoadImmP(r2, Operand(EQUAL));
2886 STATIC_ASSERT(EQUAL == 0);
2888 __ LoadSmiLiteral(r2, Smi::FromInt(EQUAL));
2926 STATIC_ASSERT(EQUAL == 0);
2928 __ LoadSmiLiteral(r2, Smi::FromInt(EQUAL));
2965 STATIC_ASSERT(EQUAL == 0);
2968 __ LoadSmiLiteral(r2, Smi::FromInt(EQUAL));
3118 // not equal to the name and kProbes-th slot is not used (its name is the
3191 // If lookup was successful |scratch2| will be equal to elements + 4 * index.