Home
last modified time | relevance | path

Searched refs:ready_set (Results 1 – 13 of 13) sorted by relevance

/dports/net-p2p/vuze/vuze-5.7.4.0_2/com/aelitis/azureus/core/networkmanager/impl/udp/
H A DUDPSelector.java38 private List ready_set = new LinkedList(); field in UDPSelector
77 synchronized( ready_set ){ in UDPSelector()
79 if ( ready_set.size() == 0 ){ in UDPSelector()
84 entry = (Object[])ready_set.remove(0); in UDPSelector()
124 synchronized( ready_set ){ in destroy()
140 synchronized( ready_set ){ in ready()
147 Iterator it = ready_set.iterator(); in ready()
183 synchronized( ready_set ){ in ready()
190 Iterator it = ready_set.iterator(); in ready()
220 synchronized( ready_set ){ in cancel()
[all …]
/dports/devel/libfirm/libfirm-1.21.0/ir/be/
H A Dbeschedrand.c38 static ir_node *random_select(void *block_env, ir_nodeset_t *ready_set) in random_select() argument
44 foreach_ir_nodeset(ready_set, irn, iter) { in random_select()
54 rand_node = ir_nodeset_first(ready_set); in random_select()
58 int n = rand() % ir_nodeset_size(ready_set); in random_select()
60 foreach_ir_nodeset(ready_set, irn, iter) { in random_select()
H A Dbeschedtrivial.c44 static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set) in trivial_select() argument
49 foreach_ir_nodeset(ready_set, irn, iter) { in trivial_select()
56 return ir_nodeset_first(ready_set); in trivial_select()
H A Dbeschedregpress.c255 static ir_node *reg_pressure_select(void *block_env, ir_nodeset_t *ready_set) in reg_pressure_select() argument
261 assert(ir_nodeset_size(ready_set) > 0); in reg_pressure_select()
263 foreach_ir_nodeset(ready_set, irn, iter) { in reg_pressure_select()
283 res = ir_nodeset_first(ready_set); in reg_pressure_select()
H A Dbeschedtrace.c542 static ir_node *basic_selection(ir_nodeset_t *ready_set) in basic_selection() argument
545 foreach_ir_nodeset(ready_set, irn, iter) { in basic_selection()
552 return get_nodeset_node(ready_set); in basic_selection()
558 static ir_node *muchnik_select(void *block_env, ir_nodeset_t *ready_set) in muchnik_select() argument
565 foreach_ir_nodeset(ready_set, irn, iter) { in muchnik_select()
575 foreach_ir_nodeset(ready_set, irn, iter) { in muchnik_select()
H A Dbelistsched.h75 ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set);
H A Dbeschednormal.c56 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set) in normal_select() argument
65 if (ir_nodeset_contains(ready_set, irn)) { in normal_select()
77 return ir_nodeset_first(ready_set); in normal_select()
/dports/lang/v/v-0.1.29/vlib/v/depgraph/
H A Ddepgraph.v97 mut ready_set := []string{}
101 ready_set << name
104 if ready_set.len == 0 {
112 for name in ready_set {
117 node_deps.apply_diff(name, ready_set)
/dports/devel/libfirm/libfirm-1.21.0/ir/opt/
H A Dfunccall.c60 static unsigned *ready_set; variable
311 #define SET_IRG_READY(irg) rbitset_set(ready_set, get_irg_idx(irg))
312 #define IS_IRG_READY(irg) rbitset_is_set(ready_set, get_irg_idx(irg))
853 ready_set = rbitset_malloc(last_idx); in optimize_funccalls()
874 rbitset_clear_all(ready_set, last_idx); in optimize_funccalls()
894 xfree(ready_set); in optimize_funccalls()
/dports/textproc/p5-KinoSearch1/KinoSearch1-1.01/lib/KinoSearch1/Util/
H A DClass.pm65 ready_set(@_);
76 sub ready_set { subroutine
/dports/devel/py-dask/dask-2021.11.2/dask/
H A Dlocal.py180 ready_set = {k for k, v in waiting.items() if not v}
181 ready = sorted(ready_set, key=sortkey, reverse=True)
/dports/lang/v/v-0.1.29/vc/
H A Dv.c8099 DepSet ready_set = (DepSet){.items = new_array(0, 1, sizeof(string))}; in DepGraph_resolve()
8110 DepSet_add(&/* ? */ ready_set, name); in DepGraph_resolve()
8114 if (DepSet_size(&/* ? */ ready_set) == 0) { in DepGraph_resolve()
8152 array_string tmp30 = ready_set.items; in DepGraph_resolve()
8172 &(DepSet[]){DepSet_diff(&/* ? */ deps, ready_set)}); in DepGraph_resolve()
H A Dv_win.c8228 DepSet ready_set = (DepSet){.items = new_array(0, 1, sizeof(string))}; in DepGraph_resolve()
8239 DepSet_add(&/* ? */ ready_set, name); in DepGraph_resolve()
8243 if (DepSet_size(&/* ? */ ready_set) == 0) { in DepGraph_resolve()
8281 array_string tmp30 = ready_set.items; in DepGraph_resolve()
8301 &(DepSet[]){DepSet_diff(&/* ? */ deps, ready_set)}); in DepGraph_resolve()