Lines Matching refs:comparison

85 top-level. Second part describes the comparison procedure itself. The third
172 Every comparison is based either on the numbers or on flags comparison. In
173 *random-access* approach we could use the same comparison algorithm. During
174 comparison we exit once we find the difference, but here we might have to scan
177 comparison, we should get numbers sequence and then create the hash number. So,
192 exactly; this is a key point in fast functions comparison).
246 As it was mentioned before, comparison routine consists of
247 "sub-comparison-routines", each of them also consists
248 "sub-comparison-routines", and so on, finally it ends up with a primitives
249 comparison.
267 Functions comparison
271 Complex objects comparison (function, basic-block, etc) is mostly based on its
272 sub-objects comparison results. So it is similar to the next "tree" objects
273 comparison:
279    most-significant-item-first order. Result of items comparison would be the
280    result of *T1* and *T2* comparison itself.
284 Brief look at the source code tells us, that comparison starts in
289 changing its body. This part of comparison is usually done within simple
320 4. Function body comparison. As it written in method comments:
336 Consider how types comparison works.
346 IDs comparison, treating them as a numbers (use ``cmpNumbers`` operation).
348 4. If types are vectors or integers, return result of their pointers comparison,
372 6. Left and right are pointers. Return result of address space comparison
373 (numbers comparison).
375 7. Complex types (structures, arrays, etc.). Follow complex objects comparison
402 So, now our conclusion depends on *Value* instances comparison.
478 comparison:
482 Of course, we can combine insertion and comparison:
507   This comparison has been implemented in initial *MergeFunctions* pass
509   we can't convert to less-equal-greater comparison. It is a seldom case, 4-5
517 comparison.
522 result of numbers comparison:
533 Now when *cmpValues* returns 0, we can proceed comparison procedure. Otherwise,
535 comparison procedure.
539 Performs constants comparison as follows:
567      comparison (*cmpFlags* operation).
569      result of types comparison (-1 or 1).
575 ``cmpFlags(L->isNullValue, R->isNullValue)`` comparison.
584 5. Compare the contents of constants. The comparison depends on kind of
585 constants, but on this stage it is just a lexicographical comparison. Just see
586 how it was described in the beginning of "*Functions comparison*" paragraph.
602 method for comparison. If result is -1 or 1, pass it to the top-level
603 comparison (return it).
631 It differs from regular operations comparison with the only thing: possibility
635 numbers, and return comparison result.
662 for nodes comparison in a binary tree. So we can organize functions set into