Lines Matching refs:children
93 for (var i = 0; i < node.children.length; i++) {
94 CollectDamaged(node.children[i]);
103 CollectNew(node_list[i].children);
119 for (var i = 0; i < old_node.children.length; i++) {
120 HarvestTodo(old_node.children[i]);
240 // nested functions serialized as parent followed by serialized children.
278 // The recursive function, that goes over all children of a particular
319 for (var i = 0; i < old_node.children.length; i++) {
320 if (old_node.children[i].corresponding_node) {
322 old_node.children[i].corresponding_node.info.
325 if (old_node.children[i].live_shared_function_infos) {
326 old_node.children[i].live_shared_function_infos.
522 function CodeInfoTreeNode(code_info, children, array_index) {
524 this.children = children;
580 // children of unchanged functions are ignored.
610 if (child_index < info_node.children.length) {
611 var child = info_node.children[child_index];
655 while (child_index < info_node.children.length) {
656 var child = info_node.children[child_index];
689 var old_children = old_node.children;
690 var new_children = new_node.children;
808 for (var i = 0; i < node.children.length; i++) {
809 TraverseTree(node.children[i]);
1020 for (var i = 0; i < node.children.length; i++) {
1021 var child = node.children[i];
1037 children: child_infos,
1053 for (var i = 0; i < node.children.length; i++) {
1054 child_infos.push(ProcessNewNode(node.children[i]));
1060 children: child_infos,
