Home
last modified time | relevance | path

Searched refs:CHILD (Results 1 – 15 of 15) sorted by relevance

/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
Dparsermodule.c107 w = node2tuple(CHILD(n, i), mkseq, addelem, lineno, col_offset); in node2tuple()
228 int v = parser_compare_nodes(CHILD(left, j), CHILD(right, j)); in parser_compare_nodes()
808 node* new_child = CHILD(root, i - 1); in build_node_children()
1006 && vfunc(CHILD(tree, 0))); in validate_repeating_list()
1012 res = validate_comma(CHILD(tree, --nch)); in validate_repeating_list()
1016 res = (validate_comma(CHILD(tree, pos)) in validate_repeating_list()
1017 && vfunc(CHILD(tree, pos + 1))); in validate_repeating_list()
1037 res = (validate_name(CHILD(tree, 0), "class") in validate_class()
1038 && validate_ntype(CHILD(tree, 1), NAME) in validate_class()
1039 && validate_colon(CHILD(tree, nch - 2)) in validate_class()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/
Dparsermodule.c107 w = node2tuple(CHILD(n, i), mkseq, addelem, lineno, col_offset); in node2tuple()
259 int v = parser_compare_nodes(CHILD(left, j), CHILD(right, j)); in parser_compare_nodes()
837 node* new_child = CHILD(root, i - 1); in build_node_children()
1035 && vfunc(CHILD(tree, 0))); in validate_repeating_list()
1041 res = validate_comma(CHILD(tree, --nch)); in validate_repeating_list()
1045 res = (validate_comma(CHILD(tree, pos)) in validate_repeating_list()
1046 && vfunc(CHILD(tree, pos + 1))); in validate_repeating_list()
1066 res = (validate_name(CHILD(tree, 0), "class") in validate_class()
1067 && validate_ntype(CHILD(tree, 1), NAME) in validate_class()
1068 && validate_colon(CHILD(tree, nch - 2)) in validate_class()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/
Dast.c173 if (TYPE(CHILD(n, 0)) == NEWLINE) in num_stmts()
176 return num_stmts(CHILD(n, 0)); in num_stmts()
180 ch = CHILD(n, i); in num_stmts()
186 return num_stmts(CHILD(n, 0)); in num_stmts()
193 return num_stmts(CHILD(n, 0)); in num_stmts()
197 l += num_stmts(CHILD(n, i)); in num_stmts()
233 n = CHILD(n, 0); in PyAST_FromNode()
248 ch = CHILD(n, i); in PyAST_FromNode()
260 ch = CHILD(ch, 0); in PyAST_FromNode()
263 s = ast_for_stmt(&c, CHILD(ch, j * 2)); in PyAST_FromNode()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/
Dast.c173 if (TYPE(CHILD(n, 0)) == NEWLINE) in num_stmts()
176 return num_stmts(CHILD(n, 0)); in num_stmts()
180 ch = CHILD(n, i); in num_stmts()
186 return num_stmts(CHILD(n, 0)); in num_stmts()
193 return num_stmts(CHILD(n, 0)); in num_stmts()
197 l += num_stmts(CHILD(n, i)); in num_stmts()
233 n = CHILD(n, 0); in PyAST_FromNode()
248 ch = CHILD(n, i); in PyAST_FromNode()
260 ch = CHILD(ch, 0); in PyAST_FromNode()
263 s = ast_for_stmt(&c, CHILD(ch, j * 2)); in PyAST_FromNode()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Parser/
Dparser.c130 return s_push(s, d, CHILD(n, NCH(n)-1)); in push()
186 n = CHILD(n, 0); in future_hack()
189 ch = CHILD(n, 0); in future_hack()
192 ch = CHILD(n, 1); in future_hack()
193 if (NCH(ch) == 1 && STR(CHILD(ch, 0)) && in future_hack()
194 strcmp(STR(CHILD(ch, 0)), "__future__") != 0) in future_hack()
196 ch = CHILD(n, 3); in future_hack()
201 ch = CHILD(n, 4); in future_hack()
204 cch = CHILD(ch, i); in future_hack()
205 if (NCH(cch) >= 1 && TYPE(CHILD(cch, 0)) == NAME) { in future_hack()
[all …]
Dnode.c144 freechildren(CHILD(n, i)); in freechildren()
157 res += sizeofchildren(CHILD(n, i)); in sizeofchildren()
Dlistnode.c36 list1node(fp, CHILD(n, i)); in list1node()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/
Dparser.c130 return s_push(s, d, CHILD(n, NCH(n)-1)); in push()
186 n = CHILD(n, 0); in future_hack()
189 ch = CHILD(n, 0); in future_hack()
192 ch = CHILD(n, 1); in future_hack()
193 if (NCH(ch) == 1 && STR(CHILD(ch, 0)) && in future_hack()
194 strcmp(STR(CHILD(ch, 0)), "__future__") != 0) in future_hack()
196 ch = CHILD(n, 3); in future_hack()
201 ch = CHILD(n, 4); in future_hack()
204 cch = CHILD(ch, i); in future_hack()
205 if (NCH(cch) >= 1 && TYPE(CHILD(cch, 0)) == NAME) { in future_hack()
[all …]
Dlistnode.c36 list1node(fp, CHILD(n, i)); in list1node()
Dnode.c133 freechildren(CHILD(n, i)); in freechildren()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
Dpty.py19 CHILD = 0 variable
99 if pid == CHILD:
109 if pid == CHILD:
160 if pid == CHILD:
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Include/
Dnode.h27 #define CHILD(n, i) (&(n)->n_child[i]) macro
28 #define RCHILD(n, i) (CHILD(n, NCH(n) + i))
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Include/
Dnode.h28 #define CHILD(n, i) (&(n)->n_child[i]) macro
29 #define RCHILD(n, i) (CHILD(n, NCH(n) + i))
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
Dtest_pty.py115 if pid == pty.CHILD:
Dtest_logging.py255 CHILD = logging.getLogger("INF.BADPARENT")
261 CHILD.log(logging.FATAL, m())
262 CHILD.info(m())
266 CHILD.debug(m())