Lines Matching refs:szB
175 if (fb1->szB < fb2->szB) return -1;
176 if (fb1->szB > fb2->szB) return 1;
188 /* Returns True if all fields except .szB are the same. szBs may or
230 " StackBlock{ off %ld szB %lu spRel:%c isVec:%c \"%s\" }\n",
231 sb->base, sb->szB, sb->spRel ? 'Y' : 'N',
300 /* StackBlock{ off 16 szB 66 spRel:Y isVec:Y "sz" }
301 StackBlock{ off 16 szB 130 spRel:Y isVec:Y "sz" }
302 StackBlock{ off 208 szB 16 spRel:Y isVec:Y "ar" }
314 according to < on .szB fields. Hence: */
315 tl_assert(sb0->szB < sb1->szB);
316 sb0->szB = sb1->szB;
344 || sb1->base + sb1->szB > sb2->base)) {
404 if (gb1->szB < gb2->szB) return -1;
405 if (gb1->szB > gb2->szB) return 1;
465 /* A node in a stack interval tree. Zero length intervals (.szB == 0)
474 SizeT szBszB */
487 VG_(printf)(" [%#lx,+%lu) descr=%p %s %lu\n", nd->addr, nd->szB,
488 nd->descr, nd->descr->name, nd->descr->szB);
497 return cmp_nonempty_intervals(sn1->addr, sn1->szB,
498 sn2->addr, sn2->szB);
508 key.szB = 1;
550 tl_assert(descr->szB > 0);
553 nyu->szB = descr->szB;
556 if (debug) VG_(printf)("ADD %#lx %lu\n", addr, descr->szB);
620 (.szB == 0) are not allowed.
628 SizeT szB; /* copied from .descr->szB */
636 nd->addr, nd->szB, nd->descr->name);
661 return cmp_nonempty_intervals( gn1->addr, gn1->szB,
662 gn2->addr, gn2->szB );
671 key.szB = 1;
694 tl_assert(descr->szB > 0);
697 nyu->szB = descr->szB;
712 if (nd->addr == nyu->addr && nd->szB == nyu->szB
759 Addr a, SizeT szB )
761 /* One easy way to do this: look up [a,a+szB) in the tree. That
770 tl_assert(szB > 0);
775 key.szB = szB;
782 tl_assert(cmp_nonempty_intervals(a, szB, nd->addr, nd->szB) == 0);
824 SizeT szB;
854 i->Inv.Stack0.addr, i->Inv.Stack0.szB);
858 i->Inv.StackN.nd->addr, i->Inv.StackN.nd->szB);
862 i->Inv.Global.nd->addr, i->Inv.Global.nd->szB);
881 && i1->Inv.Stack0.szB == i2->Inv.Stack0.szB;
903 SizeT szB = 0;
914 szB = inv->Inv.Stack0.szB;
918 szB = inv->Inv.StackN.nd->szB;
922 szB = inv->Inv.Global.nd->szB;
927 tl_assert(szB > 0);
932 else if (ea >= block + szB) {
933 *absDelta = ea - (block + szB);
958 inv->Inv.Stack0.szB );
964 inv->Inv.StackN.nd->descr->szB,
971 inv->Inv.Global.nd->descr->szB,
1002 SizeT szB;
1024 VG_(printf)(" [%#lx,+%#lx) ", qc->elems[i].addr, qc->elems[i].szB);
1096 gb->szB, gb->addr, gb->soname, gb->name );
1097 tl_assert(gb->szB > 0);
1140 tl_assert(nd->szB > 0);
1141 tl_assert(nd->addr + nd->szB <= a
1254 tl_assert(inv->Inv.Global.nd->szB > 0);
1257 inv->Inv.Global.nd->szB);
1259 inv->Inv.Global.nd->szB)) {
1511 UWord szB,
1514 tl_assert(szB > 0);
1523 if (bea <= ea && ea + szB <= bea + descr->szB) {
1527 inv->Inv.Stack0.szB = descr->szB;
1541 tl_assert(cache->elems[i].addr + cache->elems[i].szB != 0);
1544 cache->elems[i].szB, ea, szB)) {
1566 if (nd && !is_subinterval_of(nd->addr, nd->szB, ea, szB)) {
1582 if (nd && !is_subinterval_of(nd->addr, nd->szB, ea, szB)) {
1612 toadd_szB = inv->Inv.Global.nd->szB;
1616 toadd_szB = inv->Inv.StackN.nd->szB;
1621 interval trees into which [ea,ea+szB) falls. This is
1622 further complicated by the fact that [ea,ea+szB) might
1632 sNegInf.szB = 1;
1634 sPosInf.szB = 1;
1636 gNegInf.szB = 1;
1638 gPosInf.szB = 1;
1640 sKey.szB = szB;
1642 gKey.szB = szB;
1658 /* If this happens, then [ea,ea+szB) partially overlaps
1663 [ea] and [ea+szB-1] overlap the same block, since if
1671 ndLast = find_StackTreeNode( siTrees[tid], ea+szB-1 );
1681 ndFirst->szB, ea, szB));
1684 ndLast->szB, ea, szB));
1689 ndLast = find_GlobalTreeNode( giTree, ea+szB-1 );
1699 ndFirst->szB, ea, szB));
1702 ndLast->szB, ea, szB));
1707 sMin = sLB == &sNegInf ? 0 : (sLB->addr + sLB->szB);
1709 gMin = gLB == &gNegInf ? 0 : (gLB->addr + gLB->szB);
1714 [ea,ea+szB) (right?) That implies they must overlap at
1715 at least over [ea,ea+szB). */
1716 tl_assert(sMin <= ea && ea+szB-1 <= sMax);
1717 tl_assert(gMin <= ea && ea+szB-1 <= gMax);
1723 tl_assert(uMin <= ea && ea+szB-1 <= uMax);
1750 cache->elems[ip].szB = toadd_szB;
1768 UWord szB;
1788 szB = (sszB < 0) ? (-sszB) : sszB;
1789 tl_assert(szB > 0);
1800 tid, ea, sp, fp, szB, iinstance->blocks );
1808 tid, ea, sp, fp, szB, iinstance->blocks );
2120 Int szB,
2153 addr current_SP current_FP szB curr_IP frameBlocks
2161 mkIRExpr_HWord( isStore ? (-szB) : szB ),
