Searched refs:void_type_node (Results 1 - 25 of 78) sorted by relevance

1234

/freebsd-11.0-release/contrib/gcc/config/i386/
H A Dnetware.c56 if (TREE_VALUE (tree_last (formal_type)) != void_type_node)
61 while (TREE_VALUE (formal_type) != void_type_node
102 if (TREE_VALUE (tree_last (formal_type)) != void_type_node)
107 while (TREE_VALUE (formal_type) != void_type_node
H A Dwinnt.c313 if (TREE_VALUE (tree_last (formal_type)) != void_type_node)
318 while (TREE_VALUE (formal_type) != void_type_node
/freebsd-11.0-release/contrib/gcc/
H A Dtree-eh.c406 label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
661 q->cont_stmt = build1 (RETURN_EXPR, void_type_node, x);
677 x = build1 (GOTO_EXPR, void_type_node, finlab);
692 x = build1 (GOTO_EXPR, void_type_node, finlab);
717 x = build1 (GOTO_EXPR, void_type_node, over);
723 x = build1 (LABEL_EXPR, void_type_node, lab);
731 x = build1 (LABEL_EXPR, void_type_node, over);
850 x = build2 (MODIFY_EXPR, void_type_node, save_eptr, x);
854 x = build2 (MODIFY_EXPR, void_type_node, save_filt, x);
859 x = build2 (MODIFY_EXPR, void_type_node,
[all...]
H A Dgimple-low.c96 x = build1 (RETURN_EXPR, void_type_node, NULL);
105 x = build1 (LABEL_EXPR, void_type_node, TREE_PURPOSE (t));
131 x = build1 (LABEL_EXPR, void_type_node, disp_label);
141 x = build2 (MODIFY_EXPR, void_type_node, disp_var, t);
145 x = build1 (GOTO_EXPR, void_type_node, disp_var);
491 t = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
501 t = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
531 end_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
586 t = build1 (GOTO_EXPR, void_type_node, label);
678 t = build2 (MODIFY_EXPR, void_type_node, des
[all...]
H A Dvalue-prof.c198 stmt3 = build3 (COND_EXPR, void_type_node,
200 build1 (GOTO_EXPR, void_type_node, label_decl2),
201 build1 (GOTO_EXPR, void_type_node, label_decl1));
208 label1 = build1 (LABEL_EXPR, void_type_node, label_decl1);
215 label2 = build1 (LABEL_EXPR, void_type_node, label_decl2);
222 label3 = build1 (LABEL_EXPR, void_type_node, label_decl3);
364 stmt4 = build3 (COND_EXPR, void_type_node,
367 build1 (GOTO_EXPR, void_type_node, label_decl2),
368 build1 (GOTO_EXPR, void_type_node, label_decl1));
375 label1 = build1 (LABEL_EXPR, void_type_node, label_decl
[all...]
H A Dc-omp.c44 return add_stmt (build1 (OMP_MASTER, void_type_node, stmt));
55 TREE_TYPE (stmt) = void_type_node;
67 return add_stmt (build1 (OMP_ORDERED, void_type_node, stmt));
140 return build2 (OMP_ATOMIC, void_type_node, addr, rhs);
352 incr = build2 (MODIFY_EXPR, void_type_node, decl, t);
373 TREE_TYPE (t) = void_type_node;
H A Dc-semantics.c121 TREE_TYPE (ret) = void_type_node;
H A Domp-low.c1109 type = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
1126 t = build_decl (RESULT_DECL, NULL_TREE, void_type_node);
1687 x = build2 (MODIFY_EXPR, void_type_node, ptr, x);
1723 x = build2 (MODIFY_EXPR, void_type_node, new_var, x);
1806 x = build2 (MODIFY_EXPR, void_type_node, new_var, x);
1826 x = build3 (COND_EXPR, void_type_node, x, copyin_seq, NULL);
1890 x = build3 (COND_EXPR, void_type_node, predicate, sub_list, NULL);
1950 x = build2 (OMP_ATOMIC, void_type_node, addr, x);
1971 x = build2 (MODIFY_EXPR, void_type_node, ref, x);
2010 x = build2 (MODIFY_EXPR, void_type_node, re
[all...]
H A Dgimplify.c368 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
940 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
943 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
953 and give it void_type_node. Returns the temporary, or NULL_TREE if
972 TREE_TYPE (*p) = void_type_node;
981 TREE_TYPE (*p) = void_type_node;
989 TREE_TYPE (*p) = void_type_node;
999 TREE_TYPE (*p) = void_type_node;
1103 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1249 t = build2 (MODIFY_EXPR, void_type_node, add
[all...]
H A Dtree-mudflap.c369 build_function_type_4 (void_type_node, ptr_type_node, size_type_node,
372 build_function_type_3 (void_type_node, ptr_type_node, size_type_node,
375 build_function_type_0 (void_type_node);
556 t = build2 (MODIFY_EXPR, void_type_node, mf_base,
564 t = build2 (MODIFY_EXPR, void_type_node, mf_limit,
580 t = build2 (MODIFY_EXPR, void_type_node, mf_elem, t);
632 t = build3 (COND_EXPR, void_type_node, cond,
633 build1 (GOTO_EXPR, void_type_node, tree_block_label (then_bb)),
634 build1 (GOTO_EXPR, void_type_node, tree_block_label (join_bb)));
679 t = build2 (MODIFY_EXPR, void_type_node,
[all...]
H A Dtree-profile.c73 = build_function_type_list (void_type_node,
83 = build_function_type_list (void_type_node,
91 = build_function_type_list (void_type_node,
H A Dc-gimplify.c166 bind = build3 (BIND_EXPR, void_type_node, decls, body, block);
H A Dlambda-code.c1545 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, integer_zero_node);
1560 stmt = build2 (MODIFY_EXPR, void_type_node, resvar,
1570 stmt = build2 (MODIFY_EXPR, void_type_node, resvar,
1585 stmt = build2 (MODIFY_EXPR, void_type_node, resvar,
1636 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, integer_zero_node);
1667 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, mult);
1675 stmt = build2 (MODIFY_EXPR, void_type_node, resvar,
1708 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, mult);
1716 stmt = build2 (MODIFY_EXPR, void_type_node, resvar,
1730 stmt = build2 (MODIFY_EXPR, void_type_node, resva
[all...]
H A Dc-format.h282 #define T_V &void_type_node
H A Dc-aux-info.c122 while (formal_type && TREE_VALUE (formal_type) != void_type_node)
171 /* assert (TREE_VALUE (TYPE_ARG_TYPES (fntype)) == void_type_node); */
180 void_type_node) then we need to tack on an ellipsis. */
200 while (formal_type && TREE_VALUE (formal_type) != void_type_node)
204 petered out to a NULL (i.e. without being terminated by a void_type_node)
H A Dtarghooks.c412 t = build_function_type_list (void_type_node, NULL_TREE);
444 t = build_function_type_list (void_type_node, NULL_TREE);
H A Dtree-vectorizer.c794 then_label = build1 (GOTO_EXPR, void_type_node, exit_label);
795 else_label = build1 (GOTO_EXPR, void_type_node, begin_label);
800 then_label = build1 (GOTO_EXPR, void_type_node, begin_label);
801 else_label = build1 (GOTO_EXPR, void_type_node, exit_label);
949 then_label = build1 (GOTO_EXPR, void_type_node,
951 else_label = build1 (GOTO_EXPR, void_type_node,
953 cond_stmt = build3 (COND_EXPR, void_type_node, cond,
H A Dlanghooks.c580 return build2 (MODIFY_EXPR, void_type_node, dst, src);
H A Dtree-iterator.c49 TREE_TYPE (list) = void_type_node;
H A Dtree-ssa-loop-im.c629 stmt1 = build2 (MODIFY_EXPR, void_type_node, var,
635 stmt2 = build2 (MODIFY_EXPR, void_type_node, lhs,
1073 load = build2 (MODIFY_EXPR, void_type_node, tmp_var, ref);
1084 store = build2 (MODIFY_EXPR, void_type_node,
H A Dtree-ssa-loop-manip.c105 stmt = build2 (MODIFY_EXPR, void_type_node, va,
630 return build3 (COND_EXPR, void_type_node,
632 build1 (GOTO_EXPR, void_type_node, then_label),
633 build1 (GOTO_EXPR, void_type_node, else_label));
/freebsd-11.0-release/contrib/gcc/cp/
H A Dcp-gimplify.c74 t = build1 (LABEL_EXPR, void_type_node, label);
106 return build1 (GOTO_EXPR, void_type_node, label);
124 *stmt_p = build2 (TRY_CATCH_EXPR, void_type_node, body, cleanup);
138 *stmt_p = build2 (CATCH_EXPR, void_type_node, type, body);
179 stmt = build3 (COND_EXPR, void_type_node, cond, then_, else_);
235 top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
250 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
257 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
458 TREE_TYPE (from) = void_type_node;
742 void_type_node,
[all...]
H A Dexcept.c68 tmp = build_function_type (void_type_node, void_list_node);
76 tmp = build_function_type (void_type_node, tmp);
588 cleanup = build1 (MUST_NOT_THROW_EXPR, void_type_node, cleanup);
610 return build_min (THROW_EXPR, void_type_node, exp);
658 tmp = build_function_type (void_type_node, tmp);
671 tmp = build_function_type (void_type_node, tmp);
755 exp = build1 (CLEANUP_POINT_EXPR, void_type_node, exp);
758 exp = build2 (TRY_CATCH_EXPR, void_type_node, exp,
761 exp = build1 (MUST_NOT_THROW_EXPR, void_type_node, exp);
810 (fn, build_function_type (void_type_node, void_list_nod
[all...]
H A Dinit.c318 arguments. If TREE_LIST is void_type_node, an empty initializer
336 if (init == void_type_node)
661 void_type_node for an empty list of arguments. */
696 if (arguments == void_type_node)
837 expr = fold_build3 (COND_EXPR, void_type_node,
1196 TREE_TYPE (init) = void_type_node;
1981 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2003 = build3 (COND_EXPR, void_type_node, sentry,
2010 = build2 (COMPOUND_EXPR, void_type_node, begin,
2011 build2 (COMPOUND_EXPR, void_type_node, init_exp
[all...]
H A Ddecl2.c381 t = build_min (DELETE_EXPR, void_type_node, exp, size);
423 return build1 (NOP_EXPR, void_type_node, t);
786 if (value == void_type_node)
828 return void_type_node;
918 return void_type_node;
943 return void_type_node;
974 return void_type_node;
1000 if (*decl == NULL_TREE || *decl == void_type_node
1192 if (!same_type_p (TREE_TYPE (type), void_type_node))
1195 error ("%<operator delete%> must return type %qT", void_type_node);
[all...]

Completed in 184 milliseconds

1234