Home
last modified time | relevance | path

Searched refs:n_child (Results 1 – 10 of 10) sorted by relevance

/external/python/cpython2/Parser/
Dnode.c17 n->n_child = NULL; in PyNode_New()
97 n = n1->n_child; in PyNode_AddChild()
102 n1->n_child = n; in PyNode_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
111 n->n_child = NULL; in PyNode_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
Dpgen.c172 n = n->n_child; in metacompile()
187 n = n->n_child; in compile_rule()
208 n = n->n_child; in compile_rhs()
241 n = n->n_child; in compile_alt()
263 n = n->n_child; in compile_item()
300 n = n->n_child; in compile_atom()
Dparsetok.c264 r->n_child = n; in parsetok()
/external/python/cpython3/Parser/
Dnode.c20 n->n_child = NULL; in PyNode_New()
120 n = n1->n_child; in PyNode_AddChild()
125 n1->n_child = n; in PyNode_AddChild()
128 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
136 n->n_child = NULL; in PyNode_AddChild()
170 if (n->n_child != NULL) in freechildren()
171 PyObject_FREE(n->n_child); in freechildren()
183 if (n->n_child != NULL) in sizeofchildren()
Dparsetok.c452 r->n_child = n; in parsetok()
/external/tensorflow/tensorflow/python/autograph/pyct/
Dast_util.py327 n_child = getattr(n, f, None)
329 if f.startswith('__') or n_child is None or o_child is None:
332 if isinstance(n_child, (list, tuple)):
334 len(n_child) != len(o_child)):
337 f, n_child, o_child))
338 node_stack.extend(n_child)
341 elif isinstance(n_child, (gast.AST, ast.AST)):
342 node_stack.append(n_child)
345 elif n_child != o_child:
348 f, n_child, o_child))
/external/python/cpython2/Include/
Dnode.h16 struct _node *n_child; member
28 #define CHILD(n, i) (&(n)->n_child[i])
/external/python/cpython3/Include/
Dnode.h16 struct _node *n_child; member
33 #define CHILD(n, i) (&(n)->n_child[i])
/external/llvm-project/polly/lib/External/isl/
Disl_schedule_node.c1029 isl_size n, n_child; in isl_schedule_node_has_next_sibling() local
1043 n_child = isl_schedule_tree_n_children(tree); in isl_schedule_node_has_next_sibling()
1045 if (n_child < 0) in isl_schedule_node_has_next_sibling()
1048 return isl_bool_ok(node->child_pos[n - 1] + 1 < n_child); in isl_schedule_node_has_next_sibling()
/external/python/cpython3/Python/
Dast.c4709 parent = parent->n_child; in fstring_fix_node_location()