Lines Matching refs:nd
486 StackTreeNode* nd = (StackTreeNode*)keyW;
487 VG_(printf)(" [%#lx,+%lu) descr=%p %s %lu\n", nd->addr, nd->szB,
488 nd->descr, nd->descr->name, nd->descr->szB);
579 StackTreeNode* nd = find_StackTreeNode(sitree, addr);
582 tl_assert(nd);
583 b = VG_(delFromFM)( sitree, &oldK, &oldV, (UWord)nd );
587 tl_assert(nd == (StackTreeNode*)oldK);
588 sg_free(nd);
594 StackTreeNode* nd = (StackTreeNode*)keyW;
595 tl_assert(nd);
596 sg_free(nd);
633 static void GlobalTreeNode__pp ( GlobalTreeNode* nd ) {
634 tl_assert(nd->descr);
636 nd->addr, nd->szB, nd->descr->name);
643 GlobalTreeNode* nd;
648 nd = (GlobalTreeNode*)keyW;
650 GlobalTreeNode__pp(nd);
690 GlobalTreeNode *nyu, *nd;
707 nd = (GlobalTreeNode*)keyW;
708 tl_assert(nd);
709 tl_assert(nd != nyu);
710 tl_assert(nd->descr);
712 if (nd->addr == nyu->addr && nd->szB == nyu->szB
713 /* && 0 == VG_(strcmp)(nd->descr->name, nyu->descr->name) */
726 && 0 == VG_(strcmp)(nd->descr->soname, nyu->descr->soname)) {
767 GlobalTreeNode key, *nd;
779 nd = (GlobalTreeNode*)keyW;
781 tl_assert(nd != &key);
782 tl_assert(cmp_nonempty_intervals(a, szB, nd->addr, nd->szB) == 0);
830 StackTreeNode* nd;
835 GlobalTreeNode* nd;
858 i->Inv.StackN.nd->addr, i->Inv.StackN.nd->szB);
862 i->Inv.Global.nd->addr, i->Inv.Global.nd->szB);
883 return i1->Inv.StackN.nd == i2->Inv.StackN.nd;
885 return i1->Inv.Global.nd == i2->Inv.Global.nd;
917 block = inv->Inv.StackN.nd->addr;
918 szB = inv->Inv.StackN.nd->szB;
921 block = inv->Inv.Global.nd->addr;
922 szB = inv->Inv.Global.nd->szB;
963 str, inv->Inv.StackN.nd->descr->name,
964 inv->Inv.StackN.nd->descr->szB,
965 depth - inv->Inv.StackN.nd->depth );
970 str, inv->Inv.Global.nd->descr->name,
971 inv->Inv.Global.nd->descr->szB,
972 inv->Inv.Global.nd->descr->soname );
1138 GlobalTreeNode* nd = (GlobalTreeNode*)keyW;
1140 tl_assert(nd->szB > 0);
1141 tl_assert(nd->addr + nd->szB <= a
1142 || a + len <= nd->addr);
1253 tl_assert(inv->Inv.Global.nd);
1254 tl_assert(inv->Inv.Global.nd->szB > 0);
1256 inv->Inv.Global.nd->addr,
1257 inv->Inv.Global.nd->szB);
1258 if (0 == cmp_nonempty_intervals(a, len, inv->Inv.Global.nd->addr,
1259 inv->Inv.Global.nd->szB)) {
1562 { StackTreeNode* nd = find_StackTreeNode( siTrees[tid], ea );
1566 if (nd && !is_subinterval_of(nd->addr, nd->szB, ea, szB)) {
1567 nd = NULL;
1569 if (nd) {
1572 inv->Inv.StackN.nd = nd;
1578 { GlobalTreeNode* nd = find_GlobalTreeNode(giTree, ea);
1582 if (nd && !is_subinterval_of(nd->addr, nd->szB, ea, szB)) {
1583 nd = NULL;
1585 if (nd) {
1588 inv->Inv.Global.nd = nd;
1611 toadd_addr = inv->Inv.Global.nd->addr;
1612 toadd_szB = inv->Inv.Global.nd->szB;
1615 toadd_addr = inv->Inv.StackN.nd->addr;
1616 toadd_szB = inv->Inv.StackN.nd->szB;
1797 can compare it against what happens for 2nd and subsequent
