Lines Matching full:child
20 struct hieralloc_header * child;
70 hieralloc_header_t * child = header->child;
71 while (child)
74 check_children(child);
75 child = child->nextSibling;
88 if (parent->child)
90 // hieralloc_header_t * child = parent->child;
91 // while (child)
93 // assert(child != header);
94 // child = child->nextSibling;
96 parent->child->prevSibling = header;
98 header->nextSibling = parent->child;
101 parent->child = header;
134 assert(parent->child == header);
135 parent->child = header->nextSibling;
151 ptr->parent = ptr->child = ptr->prevSibling = ptr->nextSibling = NULL;
207 parent->child = header;
209 hieralloc_header_t * child = header->child;
210 while (child)
212 child->parent = header;
213 child = child->nextSibling;
243 hieralloc_header_t * child = header->child;
244 while (child)
246 hieralloc_header_t * current = child;
248 child = child->nextSibling;
263 assert(!header->child);
477 fprintf(file, "%p: child=%d ref=%d size=%d dctor=%p name='%.256s' \n", header + 1,
479 const hieralloc_header_t * child = header->child;
480 while (child)
482 _hieralloc_report(child, file, tab + 2);
483 child = child->nextSibling;
488 // report self and child allocations
504 const hieralloc_header_t * child = header->child;
505 while (child)
507 _hieralloc_report_brief(child, file, data);
508 child = child->nextSibling;
518 fprintf(file, "hieralloc_report %p total: count=%d size=%d child=%d ref=%d \n",
529 fprintf(file, "hieralloc_report_lineage %p: size=%d child=%d ref=%d name='%s' parent=%p \n",
547 const hieralloc_header_t * child = start->child;
548 while (child)
550 found += hieralloc_find(child + 1, ptr, file, tab + 2);
551 child = child->nextSibling;
