/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | ptrmem4.C | 13 void ready(); 17 void SpyExample::ready() function in class:SpyExample
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | pr28839.c | 4 static int ready[10]; variable 12 ready[i] = 0;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/other/ |
H A D | default6.C | 7 int ready (); 9 STATE commonEventProcessing (STATE pIdleTarget=(STATE)&BaseRobot::ready);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/match_results/ctors/wchar_t/ |
H A D | default.cc | 34 VERIFY( !cm.ready() ); 43 VERIFY( !sm.ready() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/match_results/ctors/char/ |
H A D | default.cc | 34 VERIFY( !cm.ready() ); 43 VERIFY( !sm.ready() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/packaged_task/members/ |
H A D | at_thread_exit.cc | 36 bool ready(std::future<int>& f) function 38 return f.wait_for(std::chrono::milliseconds(1)) == std::future_status::ready; 52 VERIFY( !ready(f1) ); 59 VERIFY( ready(f1) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/promise/members/ |
H A D | at_thread_exit.cc | 41 bool ready(std::future<Obj>& f) function 43 return f.wait_for(std::chrono::milliseconds(1)) == std::future_status::ready; 57 VERIFY( !ready(f1) ); 64 VERIFY( ready(f1) );
|
H A D | swap.cc | 40 VERIFY( p2.get_future().wait_for(delay) == std::future_status::ready );
|
H A D | set_value2.cc | 52 VERIFY( f1.wait_for(delay) == std::future_status::ready ); 79 VERIFY( f1.wait_for(delay) == std::future_status::ready );
|
H A D | set_value3.cc | 30 // Test promise::set_value() for deadlock by checking if the state is ready 73 VERIFY (fglobal.wait_for(delay) == std::future_status::ready);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | variadic97.C | 28 bool ready() { return true; } function in struct:State 32 bind(&State::ready, this);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/shared_future/members/ |
H A D | wait_for.cc | 47 VERIFY( f1.wait_for(delay) == std::future_status::ready ); 48 VERIFY( f2.wait_for(delay) == std::future_status::ready );
|
H A D | wait_until.cc | 55 VERIFY( f1.wait_until(when) == std::future_status::ready ); 56 VERIFY( f2.wait_until(when) == std::future_status::ready );
|
/haiku-buildtools/gcc/gcc/ada/ |
H A D | expect.c | 262 int i, num, ready = 0; local 296 ready = -1; 298 return ready; 319 ready = -1; 326 ready = 1; 334 ready = 0; 351 return ready; 424 int ready; local 446 ready = 449 if (ready > [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/future/members/ |
H A D | wait_for.cc | 45 VERIFY( f1.wait_for(delay) == std::future_status::ready );
|
H A D | wait_until.cc | 50 VERIFY( f1.wait_until(when) == std::future_status::ready );
|
/haiku-buildtools/gcc/gcc/ |
H A D | haifa-sched.c | 42 all the ready insns, and sorted according to priority number, we 48 or add it to the ready list. As the instructions are scheduled or 50 the ready list. When all insns down to the lowest priority have 56 among insns in the ready list: 223 N=2: bb's probabilities, detailed ready list info, unit/insn info. 254 /* Original order of insns in the ready list. 258 /* The deciding reason for INSN's place in the ready list. */ 297 /* An instruction is ready to be scheduled when all insns preceding it 316 sufficient time has passed to make them ready. As time passes, 320 unscheduled insns, i.e., those that are ready, queue 369 struct ready_list ready = {NULL, 0, 0, 0, 0}; variable in typeref:struct:ready_list 2922 ready_lastpos(struct ready_list *ready) argument 2932 ready_add(struct ready_list *ready, rtx_insn *insn, bool first_p) argument 2977 ready_remove_first(struct ready_list *ready) argument 3005 ready_element(struct ready_list *ready, int index) argument 3017 ready_remove(struct ready_list *ready, int index) argument 3062 print_rank_for_schedule_stats(const char *prefix, const rank_for_schedule_stats_t *stats, struct ready_list *ready) argument 3090 ready_sort_debug(struct ready_list *ready) argument 3105 ready_sort_real(struct ready_list *ready) argument 3136 ready_sort(struct ready_list *ready) argument 4310 struct ready_list ready; member in struct:haifa_saved_data 5134 queue_to_ready(struct ready_list *ready) argument 5290 early_queue_to_ready(state_t state, struct ready_list *ready) argument 5391 debug_ready_list_1(struct ready_list *ready, signed char *ready_try) argument 5428 debug_ready_list(struct ready_list *ready) argument 5848 max_issue(struct ready_list *ready, int privileged_n, state_t state, bool first_cycle_insn_p, int *index) argument 6025 choose_ready(struct ready_list *ready, bool first_cycle_insn_p, rtx_insn **insn_ptr) argument 9141 ready_remove_first_dispatch(struct ready_list *ready) argument [all...] |
H A D | sel-sched.c | 151 expressions which are not yet ready (tick_check_p) or which dest registers 158 the resulting set to the ready list format and use max_issue and reorder* 227 whether the given expression is ready for scheduling by removing from it 3744 /* Bail out early when the ready list contained only USEs/CLOBBERs that are 3900 /* Don't allow any insns whose data is not yet ready. 3919 sel_print ("Expr %d is not ready until cycle %d (cached)\n", 3957 sel_print ("Expr %d is not ready yet until cycle %d\n", 3982 when ready list is empty. */ 3994 sel_print ("Total ready exprs: %d, stalled: %d\n", 4006 /* Convert a vectored and sorted av set to the ready lis [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/async/ |
H A D | async.cc | 61 VERIFY( status == std::future_status::ready ); 63 VERIFY( status == std::future_status::ready );
|
H A D | sync.cc | 61 // timed waiting functions should return 'ready' immediately 62 VERIFY( f1.wait_until(then) == std::future_status::ready ); 63 VERIFY( f1.wait_for(delay) == std::future_status::ready );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/30_threads/future/ |
H A D | polling.cc | 25 return f.wait_for(std::chrono::microseconds(1)) == std::future_status::ready;
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/ |
H A D | select4.go | 7 // Test that a select statement proceeds when a value is ready.
|
H A D | select3.go | 109 // receiving from a non-ready channel always blocks 143 // selects with non-ready non-nil channels always block 173 // selects with ready channels don't block
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | sched.c | 45 all the ready insns, and sorted according to priority number, we 51 or add it to the ready list. As the instructions are scheduled or 53 the ready list. When all insns down to the lowest priority have 61 As insns on the ready list are considered for scheduling, those 64 the ready list to be considered, the first one with the largest 68 among insns in the ready list: 73 4. choose insn that conflicts with the most ready insns, or finally 243 /* An instruction is ready to be scheduled when all insns following it 262 sufficient time has passed to make them ready. As time passes, 268 insns, i.e., those that are ready, queue 2611 rtx *ready, link; local [all...] |
/haiku-buildtools/legacy/gcc/gcc/config/sparc/ |
H A D | sparc.c | 6647 results are in fact ready. */ 6656 group, the results are not ready. */ 6742 /* Short circuit if no such insn exists in the ready 6840 ultra_build_types_avail (ready, n_ready) 6841 rtx *ready; 6849 rtx insn = ready[i]; 6863 ultra_schedule_insn (ip, ready, this, type) 6865 rtx *ready; 6891 /* Update ready list. */ 6892 if (ip != &ready[thi [all...] |