Searched refs:TREE_PURPOSE (Results 1 - 25 of 152) sorted by relevance

1234567

/haiku-buildtools/legacy/gcc/gcc/ch/
H A Dtiming.c53 TREE_PURPOSE (TREE_VALUE (after_stack)) = the duration location
54 TREE_VALUE (TREE_PURPOSE (after_stack)) = label at TIMEOUT
55 TREE_PURPOSE (TREE_PURPOSE (after_stack)) = label at the end of AFTER action
287 TREE_PURPOSE (TREE_PURPOSE (toid)) = duration_value;
292 TREE_VALUE (TREE_PURPOSE (toid)) = force_addr_of (now_location);
297 build_tree_list (NULL_TREE, TREE_VALUE (TREE_PURPOSE (toid)))));
316 tree_cons (NULL_TREE, TREE_VALUE (TREE_PURPOSE (toid)),
317 tree_cons (NULL_TREE, TREE_PURPOSE (TREE_PURPOS
[all...]
H A Dconvert.c91 && TREE_PURPOSE (valuelist) == NULL_TREE
198 /* Remove from *LISTP the first TREE_LIST node whose TREE_PURPOSE == KEY.
209 if (TREE_PURPOSE (node) == key)
287 val = TREE_PURPOSE (list);
309 TREE_PURPOSE (list) = convert (domain, val);
346 else if (elements && TREE_PURPOSE (elements) == NULL_TREE)
367 TREE_PURPOSE (value) = field;
414 if (TREE_PURPOSE (tag_value) == tag_decl)
463 && elements && TREE_PURPOSE (elements) == NULL_TREE)
489 TREE_PURPOSE (valu
[all...]
H A Dactions.c566 tree purpose = TREE_PURPOSE (element);
793 lowval = TREE_INT_CST_LOW (TREE_PURPOSE (this_range));
816 TREE_PURPOSE (this_range) = build_int_2 (label_value + 1, 0);
851 low_range_val = TREE_INT_CST_LOW (TREE_PURPOSE (this_range));
900 low_range_val = TREE_INT_CST_LOW (TREE_PURPOSE (this_range));
902 TREE_PURPOSE (this_range) = build_int_2 (high_target_val + 1, 0);
947 tree label_list = TREE_PURPOSE (alternatives);
982 TREE_PURPOSE (selector) =
1210 else_range = TREE_PURPOSE (selector);
1217 low = convert (selector_type, TREE_PURPOSE (else_rang
[all...]
H A Dexcept.c131 The TREE_PURPOSE is an INTEGER_CST whose value is the
297 { tree handler_number = TREE_PURPOSE(t);
514 while (TREE_INT_CST_LOW (TREE_PURPOSE (tmp)) != alternative)
518 chill_handle_case_label (TREE_PURPOSE (tmp),
621 if (TREE_INT_CST_LOW (TREE_PURPOSE (list)) > label_level)
/haiku-buildtools/legacy/gcc/gcc/
H A Dc-parse.y294 prefix_attributes = TREE_PURPOSE (declspec_stack);
299 prefix_attributes = TREE_PURPOSE (declspec_stack);
304 prefix_attributes = TREE_PURPOSE (declspec_stack);
330 prefix_attributes = TREE_PURPOSE (declspec_stack);
335 prefix_attributes = TREE_PURPOSE (declspec_stack);
348 prefix_attributes = TREE_PURPOSE (declspec_stack);
353 prefix_attributes = TREE_PURPOSE (declspec_stack);
366 prefix_attributes = TREE_PURPOSE (declspec_stack);
371 prefix_attributes = TREE_PURPOSE (declspec_stack);
802 prefix_attributes = TREE_PURPOSE (declspec_stac
[all...]
H A Dc-parse.in335 prefix_attributes = TREE_PURPOSE (declspec_stack);
340 prefix_attributes = TREE_PURPOSE (declspec_stack);
345 prefix_attributes = TREE_PURPOSE (declspec_stack);
371 prefix_attributes = TREE_PURPOSE (declspec_stack);
376 prefix_attributes = TREE_PURPOSE (declspec_stack);
389 prefix_attributes = TREE_PURPOSE (declspec_stack);
394 prefix_attributes = TREE_PURPOSE (declspec_stack);
407 prefix_attributes = TREE_PURPOSE (declspec_stack);
412 prefix_attributes = TREE_PURPOSE (declspec_stack);
957 prefix_attributes = TREE_PURPOSE (declspec_stac
[all...]
H A Dc-parse.c1813 prefix_attributes = TREE_PURPOSE (declspec_stack);
1820 prefix_attributes = TREE_PURPOSE (declspec_stack);
1827 prefix_attributes = TREE_PURPOSE (declspec_stack);
1859 prefix_attributes = TREE_PURPOSE (declspec_stack);
1866 prefix_attributes = TREE_PURPOSE (declspec_stack);
1885 prefix_attributes = TREE_PURPOSE (declspec_stack);
1892 prefix_attributes = TREE_PURPOSE (declspec_stack);
1911 prefix_attributes = TREE_PURPOSE (declspec_stack);
1918 prefix_attributes = TREE_PURPOSE (declspec_stack);
2394 prefix_attributes = TREE_PURPOSE (declspec_stac
[all...]
H A Dc-pragma.c191 tree name = TREE_PURPOSE (a);
199 tree name = TREE_PURPOSE (a);
H A Dvarasm.c2503 if (TREE_PURPOSE (link))
2513 Then insist that either both or none have any TREE_PURPOSE
2558 if (TREE_PURPOSE (link)
2559 && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL)
2561 if (bcmp ((char *) &TREE_PURPOSE (link), p,
2562 sizeof TREE_PURPOSE (link)))
2565 p += sizeof TREE_PURPOSE (link);
2567 else if (TREE_PURPOSE (link))
2569 if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0)
2714 if (TREE_PURPOSE (lin
[all...]
H A Dsdbout.c297 (((link) && TREE_PURPOSE ((link)) \
298 && IDENTIFIER_POINTER (TREE_PURPOSE ((link)))) \
299 ? IDENTIFIER_POINTER (TREE_PURPOSE ((link))) : (char *) 0)
372 if (link && TREE_PURPOSE (link)
373 && IDENTIFIER_POINTER (TREE_PURPOSE (link)))
374 TYPE_SYMTAB_ADDRESS (type) = IDENTIFIER_POINTER (TREE_PURPOSE (link));
1266 PUT_SDB_DEF (IDENTIFIER_POINTER (TREE_PURPOSE (tem)));
H A Dc-decl.c332 * It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
340 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
1226 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link)) = TREE_VALUE (link);
2933 if (TREE_PURPOSE (tail) == name)
2982 return TREE_PURPOSE (tail);
3762 TREE_PURPOSE (typename),
3775 TREE_PURPOSE (typename),
4257 decl = grokdeclarator (TREE_VALUE (TREE_PURPOSE (parm)),
4258 TREE_PURPOSE (TREE_PURPOSE (par
[all...]
/haiku-buildtools/gcc/gcc/
H A Dstmt.c526 i_name = TREE_PURPOSE (TREE_PURPOSE (i));
531 if (simple_cst_equal (i_name, TREE_PURPOSE (TREE_PURPOSE (j))))
537 i_name = TREE_PURPOSE (TREE_PURPOSE (i));
542 if (simple_cst_equal (i_name, TREE_PURPOSE (TREE_PURPOSE (j))))
545 if (simple_cst_equal (i_name, TREE_PURPOSE (TREE_PURPOSE (
[all...]
H A Dattribs.c341 ns = TREE_PURPOSE (name);
361 return TREE_PURPOSE (TREE_PURPOSE (attr));
655 a TREE_LIST which TREE_PURPOSE is itself a TREE_LIST. TREE_PURPOSE
656 (TREE_PURPOSE (ATTR)) is the namespace of the attribute, and the
657 TREE_VALUE (TREE_PURPOSE (ATTR)) is its non-qualified name. Please
669 return (TREE_CODE (TREE_PURPOSE (attr)) == TREE_LIST);
682 return TREE_VALUE (TREE_PURPOSE (attr));
683 return TREE_PURPOSE (att
[all...]
H A Dgimplify-me.c216 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
227 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/plugin/
H A Dattribute_plugin.c50 tree attrname = TREE_PURPOSE (attr);
/haiku-buildtools/legacy/gcc/gcc/cp/
H A Dtypeck2.c163 if (TREE_PURPOSE (u) == NULL_TREE)
165 TREE_PURPOSE (u) = error_mark_node;
938 if (TREE_PURPOSE (tail)
939 && (TREE_CODE (TREE_PURPOSE (tail)) != INTEGER_CST
940 || TREE_INT_CST_LOW (TREE_PURPOSE (tail)) != i))
1039 if (TREE_PURPOSE (tail)
1040 && TREE_PURPOSE (tail) != field
1041 && TREE_PURPOSE (tail) != DECL_NAME (field))
1120 if (TREE_PURPOSE (tail) != NULL_TREE)
1124 if (TREE_CODE (TREE_PURPOSE (tai
[all...]
H A Dfriend.c66 if (same_type_p (ctype, TREE_PURPOSE (friends)))
203 while (friends && TREE_PURPOSE (friends) != friend_type)
455 attributes = TREE_PURPOSE (attrlist);
H A Dpt.c60 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
224 (TREE_INT_CST_HIGH (TREE_PURPOSE (NODE)))
755 if (comp_template_args (TREE_PURPOSE (s), args))
832 if (comp_template_args (TREE_PURPOSE (s), args))
1122 TREE_PURPOSE (templates));
1125 *targs_out = TREE_PURPOSE (templates);
1295 if (TREE_PURPOSE (t))
1747 defval = TREE_PURPOSE (parm);
1749 is_type = TREE_PURPOSE (parm) == class_type_node;
1768 my_friendly_assert (TREE_CODE (TREE_PURPOSE (par
[all...]
/haiku-buildtools/legacy/gcc/gcc/objc/
H A Dobjc-parse.y284 prefix_attributes = TREE_PURPOSE (declspec_stack);
289 prefix_attributes = TREE_PURPOSE (declspec_stack);
294 prefix_attributes = TREE_PURPOSE (declspec_stack);
320 prefix_attributes = TREE_PURPOSE (declspec_stack);
325 prefix_attributes = TREE_PURPOSE (declspec_stack);
338 prefix_attributes = TREE_PURPOSE (declspec_stack);
343 prefix_attributes = TREE_PURPOSE (declspec_stack);
356 prefix_attributes = TREE_PURPOSE (declspec_stack);
361 prefix_attributes = TREE_PURPOSE (declspec_stack);
888 prefix_attributes = TREE_PURPOSE (declspec_stac
[all...]
H A Dobjc-parse.c2223 prefix_attributes = TREE_PURPOSE (declspec_stack);
2230 prefix_attributes = TREE_PURPOSE (declspec_stack);
2237 prefix_attributes = TREE_PURPOSE (declspec_stack);
2269 prefix_attributes = TREE_PURPOSE (declspec_stack);
2276 prefix_attributes = TREE_PURPOSE (declspec_stack);
2295 prefix_attributes = TREE_PURPOSE (declspec_stack);
2302 prefix_attributes = TREE_PURPOSE (declspec_stack);
2321 prefix_attributes = TREE_PURPOSE (declspec_stack);
2328 prefix_attributes = TREE_PURPOSE (declspec_stack);
2905 prefix_attributes = TREE_PURPOSE (declspec_stac
[all...]
/haiku-buildtools/gcc/gcc/objc/
H A Dobjc-runtime-shared-support.c339 ADDR_EXPR, TREE_PURPOSE (*chain), 1));
638 tree decl = TREE_PURPOSE (chain);
701 decl = TREE_PURPOSE (chain);
710 decl = TREE_PURPOSE (chain);
719 decl = TREE_PURPOSE (chain);
728 decl = TREE_PURPOSE (chain);
/haiku-buildtools/legacy/gcc/gcc/java/
H A Dexcept.c161 h->handlers = build_tree_list (TREE_PURPOSE (range->handlers),
259 && TREE_PURPOSE (ptr->handlers) == type
328 start_catch_handler (prepare_eh_table_type (TREE_PURPOSE (handler)));
/haiku-buildtools/gcc/gcc/config/
H A Dsol2.c62 tree name = TREE_PURPOSE (*x);
83 tree name = TREE_PURPOSE (*x);
100 tree name = TREE_PURPOSE (*x);
/haiku-buildtools/legacy/gcc/gcc/config/i860/
H A Dfx2800.h226 IDENTIFIER_POINTER (TREE_PURPOSE (tem)), \
228 CHARS (11 + IDENTIFIER_LENGTH (TREE_PURPOSE (tem))); \
/haiku-buildtools/gcc/gcc/java/
H A Dexcept.c111 tree type = TREE_PURPOSE (handler);
230 h->handlers = build_tree_list (TREE_PURPOSE (range->handlers),
527 type = TREE_PURPOSE (handler);

Completed in 208 milliseconds

1234567