Lines Matching refs:Sig
564 SizeT szB; // memory size for the node, be it Sig or Insig
573 Sig;
657 // 0 sig, 0 insig alloc 0 children
658 // N sig, 0 insig alloc N children, dup all
659 // N sig, M insig alloc N+1, dup first N, aggregate remaining M
660 // 0 sig, M insig alloc 1, aggregate M
691 sxpt->Sig.ip = xpt->ip;
692 sxpt->Sig.n_children = n_child_sxpts;
698 sxpt->Sig.children = VG_(malloc)("ms.main.dX.2",
706 sxpt->Sig.children[j++] = dup_XTree(xpt->children[i], total_szB);
723 sxpt->Sig.children[n_sig_children] = insig_sxpt;
726 sxpt->Sig.children = NULL;
740 for (i = 0; i < sxpt->Sig.n_children; i++) {
741 free_SXTree(sxpt->Sig.children[i]);
742 sxpt->Sig.children[i] = NULL;
744 VG_(free)(sxpt->Sig.children); sxpt->Sig.children = NULL;
788 if (sxpt->Sig.n_children > 0) {
789 for (i = 0; i < sxpt->Sig.n_children; i++) {
790 sanity_check_SXTree(sxpt->Sig.children[i]);
1948 new_mem_stack_2(len, "sig-new");
1953 die_mem_stack_2(len, "sig-die");
2170 Vg_FnNameKind kind = VG_(get_fnname_kind_from_IP)(sxpt->Sig.ip);
2172 sxpt->Sig.n_children = 0;
2177 ip_desc = VG_(describe_IP)(sxpt->Sig.ip-1, ip_desc_array, BUF_LEN);
2181 FP("%sn%d: %lu ", depth_str, sxpt->Sig.n_children, sxpt->szB);
2229 VG_(ssort)(sxpt->Sig.children, sxpt->Sig.n_children, sizeof(SXPt*),
2234 for (i = 0; i < sxpt->Sig.n_children; i++) {
2235 child = sxpt->Sig.children[i];
