353 	pANTLR3_VECTOR	newChildren;			// Iterator for whatever we are going to add in  in replaceChildren()  local
367 		newChildren = newTree->children;  in replaceChildren()
372 		newChildren = antlr3VectorNew(1);  in replaceChildren()
373 		if	(newChildren == NULL)  in replaceChildren()
378 		newChildren->add(newChildren, (void *)newTree, NULL);  in replaceChildren()
386 	replacingWithHowMany	= newChildren->size(newChildren);  in replaceChildren()
388 	numNewChildren			= newChildren->size(newChildren);  in replaceChildren()
401 			child = (pANTLR3_BASE_TREE) newChildren->get(newChildren, j);  in replaceChildren()
416 …parent->children->set(parent->children, startChildIndex + j, newChildren->get(newChildren, j), NUL…  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()
454 		ANTLR3_FREE(newChildren->elements);  in replaceChildren()
455 		newChildren->elements = NULL;  in replaceChildren()
456 		newChildren->size = 0;  in replaceChildren()
457 		ANTLR3_FREE(newChildren);		// Will not free the nodes  in replaceChildren()