/haiku-buildtools/gcc/gcc/testsuite/gcc.target/alpha/ |
H A D | cix-1.c | 7 volatile long sink; local 9 sink = __builtin_alpha_cttz (x); 10 sink = __builtin_alpha_ctlz (x); 11 sink = __builtin_alpha_ctpop (x);
|
H A D | base-1.c | 7 volatile long sink; local 10 sink = __builtin_alpha_implver (); 11 sink = __builtin_alpha_rpcc (); 13 sink = __builtin_alpha_amask (-1); 14 sink = __builtin_alpha_amask (x); 16 sink = __builtin_alpha_cmpbge (x, y); 17 sink = __builtin_alpha_cmpbge (-1, x); 19 sink = __builtin_alpha_extbl (x, y); 20 sink = __builtin_alpha_extwl (x, y); 21 sink 48 volatile long sink; local 61 volatile long sink; local [all...] |
H A D | max-1.c | 7 volatile long sink; local 9 sink = __builtin_alpha_pklb (x); 10 sink = __builtin_alpha_pkwb (x); 11 sink = __builtin_alpha_unpkbl (x); 12 sink = __builtin_alpha_unpkbw (x); 14 sink = __builtin_alpha_minub8 (0, x); 15 sink = __builtin_alpha_minub8 (1, x); 16 sink = __builtin_alpha_minub8 (x, y); 17 sink = __builtin_alpha_minsb8 (x, y); 18 sink [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | uninit-11-O0.c | 5 int sink; variable 9 sink = parm; /* { dg-bogus "uninitialized" "parameter" } */ 15 sink = x; /* { dg-warning "is used" "unconditional" } */ 23 sink = x; 33 sink = x; 41 sink = x;
|
H A D | uninit-11.c | 5 int sink; variable 9 sink = parm; /* { dg-bogus "uninitialized" "parameter" } */ 15 sink = x; /* { dg-warning "is used" "unconditional" } */ 23 sink = x; /* { dg-warning "may be used" "conditional" } */ 33 sink = x; 41 sink = x;
|
H A D | 20041106-1.c | 10 volatile long sink; variable 14 sink = s->x;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/warn/ |
H A D | Wunused-5.C | 5 volatile int sink; variable 13 ~S() { sink = x; }
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | variadic113.C | 12 void sink( Args&&... ) {} function 16 sink( f<Indices>(t)... );
|
H A D | sfinae-nullptr1.C | 8 void sink(T); 11 class = decltype(sink<T2>(make<T1>()))
|
H A D | variadic143.C | 9 static void sink(T); 11 template<class T, class U, class = decltype(sink<U>(declval<T>()))>
|
/haiku-buildtools/gcc/liboffloadmic/runtime/coi/ |
H A D | coi_server.h | 38 #include <sink/COIProcess_sink.h> 39 #include <sink/COIPipeline_sink.h> 40 #include <sink/COIBuffer_sink.h>
|
/haiku-buildtools/isl/ |
H A D | isl_flow.c | 33 isl_set *sink; member in struct:isl_restriction 77 * based on the given source and sink restrictions. 95 restr->sink = sink_restr; 136 isl_set_free(restr->sink); 157 * - a sink 159 * - a function for determining the relative order of sources and sink 162 * domain_map is an auxiliary map that maps the sink access relation 170 struct isl_labeled_map sink; member in struct:isl_access_info 184 * - a wrapped subset of the sink for which definitely no source could be found 185 * - a wrapped subset of the sink fo 197 isl_access_info_alloc(__isl_take isl_map *sink, void *sink_user, isl_access_level_before fn, int max_source) argument 520 restricted_partial_lexmax( __isl_keep isl_access_info *acc, __isl_take isl_map *dep, int source, __isl_take isl_set *sink, __isl_give isl_set **empty) argument 1397 isl_union_map_compute_flow(__isl_take isl_union_map *sink, __isl_take isl_union_map *must_source, __isl_take isl_union_map *may_source, __isl_take isl_union_map *schedule, __isl_give isl_union_map **must_dep, __isl_give isl_union_map **may_dep, __isl_give isl_union_map **must_no_source, __isl_give isl_union_map **may_no_source) argument [all...] |
/haiku-buildtools/isl/include/isl/ |
H A D | flow.h | 35 __isl_keep isl_map *source_map, __isl_keep isl_set *sink, 43 __isl_give isl_access_info *isl_access_info_alloc(__isl_take isl_map *sink, 63 int isl_union_map_compute_flow(__isl_take isl_union_map *sink,
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | deferfin.go | 18 var sink func() var 45 sink = f
|
/haiku-buildtools/gcc/gcc/ |
H A D | mcf.c | 81 SINK_CONNECT_EDGE, /* Single edge connecting to single sink. */ 82 BALANCE_EDGE, /* Edge connecting with source/sink: cp(e) = 0. */ 597 /* 4. Create single source and sink. Connect new source vertex s' to function 598 entry block. Connect sink vertex t' to function exit. */ 615 /* Connect vertices with unbalanced D(v) to source/sink. */ 789 D - D[I] holds minimum cost of path from i to sink 973 int sink) 1014 if (dest == sink) 1027 2. Find an augmenting path form source to sink. 1033 SINK: index of sink verte 971 find_augmenting_path(fixup_graph_type *fixup_graph, augmenting_path_type *augmenting_path, int source, int sink) argument 1039 find_max_flow(fixup_graph_type *fixup_graph, int source, int sink) argument [all...] |
H A D | Makefile.in | 1467 tree-ssa-sink.o \
|
/haiku-buildtools/gcc/gcc/go/ |
H A D | go-gcc.cc | 1668 tree sink = NULL_TREE; local 1689 append_to_statement_list(val, &sink); 1705 if (sink != NULL_TREE) 1707 type_tree, sink, ret); 1727 tree sink = NULL_TREE; local 1744 append_to_statement_list(val, &sink); 1760 if (sink != NULL_TREE) 1762 type_tree, sink, ret);
|
/haiku-buildtools/gcc/libatomic/ |
H A D | configure | 12278 T *x; volatile T sink; asm("" : "=g"(x)); 12279 sink = __atomic_load_n(x, 0); 12280 __atomic_store_n(x, sink, 0); 12345 T *x; volatile T sink; asm("" : "=g"(x)); 12346 sink = __atomic_load_n(x, 0); 12347 __atomic_store_n(x, sink, 0); 12412 T *x; volatile T sink; asm("" : "=g"(x)); 12413 sink = __atomic_load_n(x, 0); 12414 __atomic_store_n(x, sink, 0); 12479 T *x; volatile T sink; as [all...] |