Lines Matching refs:child
65 /* The first child (head of a linked list) */
66 struct ralloc_header *child;
96 info->next = parent->child;
97 parent->child = info;
134 info->child = NULL;
165 ralloc_header *child, *old, *info;
176 if (info->parent->child == old)
177 info->parent->child = info;
186 /* Update child->parent links for all children */
187 for (child = info->child; child != NULL; child = child->next)
188 child->parent = info;
273 if (info->parent->child == info)
274 info->parent->child = info->next;
292 while (info->child != NULL) {
293 temp = info->child;
294 info->child = temp->next;
324 ralloc_header *new_info, *old_info, *child;
333 if (unlikely(old_info->child == NULL))
336 /* Set all the children's parent to new_ctx; get a pointer to the last child. */
337 for (child = old_info->child; child->next != NULL; child = child->next) {
338 child->parent = new_info;
340 child->parent = new_info;
343 child->next = new_info->child;
344 if (child->next)
345 child->next->prev = child;
346 new_info->child = old_info->child;
347 old_info->child = NULL;
540 * a ralloc parent, and child nodes (allocations). Child nodes can't be freed