Lines Matching refs:comparison

72 on the top-level. The second part describes the comparison procedure itself.
160 Every comparison is based either on the numbers or on the flags comparison. In
161 the *random-access* approach, we could use the same comparison algorithm.
162 During comparison, we exit once we find the difference, but here we might have
165 comparison, we should get the numbers sequence and then create the hash number.
180 exactly; this is a key point in fast functions comparison).
236 As mentioned before, the comparison routine consists of
237 "sub-comparison-routines", with each of them also consisting of
238 "sub-comparison-routines", and so on. Finally, it ends up with primitive
239 comparison.
257 Functions comparison
261 Complex object comparison (function, basic-block, etc) is mostly based on its
262 sub-object comparison results. It is similar to the next "tree" objects
263 comparison:
269    the most-significant-item-first order. The result of items comparison
270    would be the result of *T1* and *T2* comparison itself.
274 A brief look at the source code tells us that the comparison starts in the
279 function different without changing its body. This part of the comparison is
310 4. Function body comparison. As it written in method comments:
326 Consider how type comparison works.
336 IDs comparison, treating them as numbers (use ``cmpNumbers`` operation).
338 4. If types are vectors or integers, return result of their pointers comparison,
362 6. Left and right are pointers. Return result of address space comparison
363 (numbers comparison).
365 7. Complex types (structures, arrays, etc.). Follow complex objects comparison
392 So, now our conclusion depends on *Value* instances comparison.
467 a simple comparison:
471 Of course, we can combine insertion and comparison:
496   This comparison has been implemented in initial *MergeFunctions* pass
498   we can't convert to less-equal-greater comparison. It is a seldom case, 4-5
506 comparison.
511 the result of numbers comparison:
522 Now when *cmpValues* returns 0, we can proceed the comparison procedure.
524 and finish comparison procedure.
528 Performs constants comparison as follows:
556      comparison (*cmpFlags* operation).
558      result of types comparison (-1 or 1).
564 ``cmpFlags(L->isNullValue, R->isNullValue)`` comparison.
573 5. Compare the contents of constants. The comparison depends on the kind of
574 constants, but on this stage it is just a lexicographical comparison. Just see
575 how it was described in the beginning of "*Functions comparison*" paragraph.
591 method for comparison. If result is -1 or 1, pass it to the top-level
592 comparison (return it).
620 It differs from regular operations comparison with the only thing: possibility
624 numbers, and return comparison result.
651 for nodes comparison in a binary tree. So we can organize functions set into