75 	tree->children				= NULL;  in antlr3BaseTreeNew()
101 	if	(tree->children != NULL)  in getFirstChildWithType()
103 		cs	= tree->children->size(tree->children);  in getFirstChildWithType()
106 			t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i));  in getFirstChildWithType()
121 	if	(      tree->children == NULL  in getChild()
122 		|| i >= tree->children->size(tree->children))  in getChild()
126 	return  tree->children->get(tree->children, i);  in getChild()
133 	if	(tree->children == NULL)  in getChildCount()
139 		return	tree->children->size(tree->children);  in getChildCount()
156 		if  (child->children != NULL && child->children == tree->children)  in addChild()
164         // Add all of the children's children to this list  in addChild()
166         if (child->children != NULL)  in addChild()
168             if (tree->children == NULL)  in addChild()
173                 // copy in the child's children pointer as the child is  in addChild()
176                 tree->children = child->children;  in addChild()
177                 child->children = NULL;  in addChild()
183                 // Need to copy the children  in addChild()
185                 n = child->children->size(child->children);  in addChild()
190                     entry = (pANTLR3_BASE_TREE)child->children->get(child->children, i);  in addChild()
196 …ANTLR3_UINT32 count = tree->children->add(tree->children, entry, (void (ANTLR3_CDECL *) (void *))c…  in addChild()
207 		// Tree we are adding is not a Nil and might have children to copy  in addChild()
209 		if  (tree->children == NULL)  in addChild()
211 			// No children in the tree we are adding to, so create a new list on  in addChild()
217 …ANTLR3_UINT32 count = tree->children->add(tree->children, child, (void (ANTLR3_CDECL *)(void *))ch…  in addChild()
223 /// Add all elements of the supplied list as children of this node
242 	if	(tree->children == NULL)  in setChild()
246 	tree->children->set(tree->children, i, child, NULL, ANTLR3_FALSE);  in setChild()
252 	if	( tree->children == NULL)  in deleteChild()
257 	return  tree->children->remove(tree->children, i);  in deleteChild()
269 	if	(tree->children != NULL)  in dupTree()
271 		s	    = tree->children->size  (tree->children);  in dupTree()
278 			t   = (pANTLR3_BASE_TREE) tree->children->get(tree->children, i);  in dupTree()
299 	if	(tree->children == NULL || tree->children->size(tree->children) == 0)  in toStringTree()
314 	if	(tree->children != NULL)  in toStringTree()
316 		n = tree->children->size(tree->children);  in toStringTree()
320 			t   = (pANTLR3_BASE_TREE) tree->children->get(tree->children, i);  in toStringTree()
337 /// Delete children from start to stop and replace with t even if t is
338 /// a list (nil-root tree). Num of children can increase or decrease.
339 /// For huge child lists, inserting children can force walking rest of
340 /// children to set their child index; could be slow.
356 	if	(parent->children == NULL)  in replaceChildren()
358 …ANTLR3_FPRINTF(stderr, "replaceChildren call: Indexes are invalid; no children in list for %s", pa…  in replaceChildren()
362 	// Either use the existing list of children in the supplied nil node, or build a vector of the  in replaceChildren()
367 		newChildren = newTree->children;  in replaceChildren()
402 			parent->children->set(parent->children, i, child, NULL, ANTLR3_FALSE);  in replaceChildren()
416 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL…  in replaceChildren()
425 			parent->children->remove(parent->children, indexToDelete);  in replaceChildren()
439 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL…  in replaceChildren()
446 			parent->children->add(parent->children, newChildren->get(newChildren, j), NULL);  in replaceChildren()
461 /// Set the parent and child indexes for all children of the
470 /// Set the parent and child indexes for some of the children of the
479 	count	= tree->getChildCount(tree);		// How many children do we have   in freshenPACIndexes()