Lines Matching defs:vi1
3376 static inline UInt hash_VtsIDs ( VtsID vi1, VtsID vi2, UInt nTab ) {
3377 UInt hash = ROL32(vi1,19) ^ ROL32(vi2,13);
3383 struct { VtsID vi1; VtsID vi2; Bool leq; }
3388 struct { VtsID vi1; VtsID vi2; VtsID res; }
3394 cmpLEQ_cache[i].vi1 = VtsID_INVALID;
3399 join2_cache[i].vi1 = VtsID_INVALID;
3428 /* compute partial ordering relation of vi1 and vi2. */
3430 static Bool VtsID__cmpLEQ_WRK ( VtsID vi1, VtsID vi2 ) {
3434 //if (vi1 == vi2) return True;
3435 tl_assert(vi1 != vi2);
3438 hash = hash_VtsIDs(vi1, vi2, N_CMPLEQ_CACHE);
3439 if (cmpLEQ_cache[hash].vi1 == vi1
3444 v1 = VtsID__to_VTS(vi1);
3448 cmpLEQ_cache[hash].vi1 = vi1;
3454 static inline Bool VtsID__cmpLEQ ( VtsID vi1, VtsID vi2 ) {
3455 return LIKELY(vi1 == vi2) ? True : VtsID__cmpLEQ_WRK(vi1, vi2);
3460 static VtsID VtsID__join2_WRK ( VtsID vi1, VtsID vi2 ) {
3464 //if (vi1 == vi2) return vi1;
3465 tl_assert(vi1 != vi2);
3468 hash = hash_VtsIDs(vi1, vi2, N_JOIN2_CACHE);
3469 if (join2_cache[hash].vi1 == vi1
3474 vts1 = VtsID__to_VTS(vi1);
3480 join2_cache[hash].vi1 = vi1;
3486 static inline VtsID VtsID__join2 ( VtsID vi1, VtsID vi2 ) {
3487 return LIKELY(vi1 == vi2) ? vi1 : VtsID__join2_WRK(vi1, vi2);
3511 /* Assuming that !cmpLEQ(vi1, vi2), find the index of the first (or
3512 any, really) element in vi1 which is pointwise greater-than the
3516 static Thr* VtsID__findFirst_notLEQ ( VtsID vi1, VtsID vi2 )
3521 tl_assert(vi1 != vi2);
3522 vts1 = VtsID__to_VTS(vi1);
