Searched refs:flow (Results 1 - 19 of 19) sorted by relevance

/haiku-buildtools/gcc/gmp/mpq/
H A Dset_f.c32 mp_limb_t flow; local
44 flow = *fptr;
45 MPN_STRIP_LOW_ZEROS_NOT_ZERO (fptr, abs_fsize, flow);
73 if (flow & 1)
87 count_trailing_zeros (shift, flow);
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/
H A Dpr52493.c24 struct Flow *flow, void *p)
31 __v = cmpmtime(&flow->mtime, &start_time);
23 fill(int fields, unsigned short *format, struct Flow *flow, void *p) argument
/haiku-buildtools/legacy/binutils/opcodes/
H A Darc-dis.h61 enum Flow flow; member in struct:arcDisState
H A Darc-dis.c570 state->flow = noflow;
595 state->flow = invalid_instr;
625 state->flow = invalid_instr;
653 state->flow = invalid_instr;
708 state->flow=invalid_instr;
724 state->flow = invalid_instr;
804 state->flow=invalid_instr;
893 state->flow = state->_opcode == op_BLC /* BL */
919 state->flow = is_linked ? direct_call : direct_jump;
928 state->flow
[all...]
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/maxq10/
H A Dcall.s2 ;# check program flow instruction involving CALL & RET in MAXQ10
H A Djump.s2 ;# Program flow instructions using JUMP
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/maxq20/
H A Dcall.s2 ;# check program flow instruction involving CALL & RET
H A Djump.s2 ;# Program flow instructions using JUMP
/haiku-buildtools/binutils/opcodes/
H A Darc-dis.h88 enum Flow flow; member in struct:arcDisState
/haiku-buildtools/gcc/gcc/
H A Dmcf.c1 /* Routines to implement minimum-cost maximal flow algorithm used to smooth
33 2. find_max_flow: Find maximal flow.
37 the flow on the found cycle by the minimum residual capacity in that
39 5. Form the minimal cost flow
92 /* Flag denoting type of edge and attributes for the flow field. */
98 gcov_type flow; member in struct:fixup_edge_d
99 /* Residual flow for this edge - used during negative cycle canceling. */
142 /* Structure used in the maximal flow routines to find augmenting path. */
217 fprintf (file, "flow/capacity=%"PRId64 "/",
218 fedge->flow);
[all...]
H A Dgraphite-dependences.c29 #include <isl/flow.h>
/haiku-buildtools/isl/
H A Disl_flow.c19 #include <isl/flow.h>
426 /* Iterate over all sources and for each resulting flow dependence
656 /* Given a possible flow dependence temp_rel[j] between source j and the sink
659 * The flow dependences temp_rel[k] are updated with the improved sources.
1297 isl_flow *flow; local
1335 flow = isl_access_info_compute_flow(data->accesses);
1338 if (!flow)
1342 isl_union_map_from_map(isl_flow_get_no_source(flow, 1)));
1344 isl_union_map_from_map(isl_flow_get_no_source(flow, 0)));
1346 for (i = 0; i < flow
[all...]
H A Disl_test.c17 #include <isl/flow.h>
1815 isl_flow *flow; local
1833 flow = isl_access_info_compute_flow(ai);
1838 isl_flow_foreach(flow, collect_must_may, &mm);
1848 isl_flow_free(flow);
1863 flow = isl_access_info_compute_flow(ai);
1868 isl_flow_foreach(flow, collect_must_may, &mm);
1877 isl_flow_free(flow);
1892 flow = isl_access_info_compute_flow(ai);
1897 isl_flow_foreach(flow, collect_must_ma
[all...]
/haiku-buildtools/binutils/gas/testsuite/gas/bfin/
H A Dflow.d2 #name: flow
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/bfin/
H A Dflow.d2 #name: flow
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/
H A Dselect3.go19 panic("control flow shouldn't reach here")
H A Dpowser1.go10 // A power series is a channel, along which flow rational
309 // series flow. They start an encapsulated generator that
H A Dpowser2.go14 // A power series is a channel, along which flow rational
323 // series flow. They start an encapsulated generator that
/haiku-buildtools/legacy/gcc/gcc/
H A Dmakefile.vms68 integrate.obj,jump.obj,cse.obj,loop.obj,unroll.obj,flow.obj,stupid.obj,\
247 flow.obj: flow.c insn-config.h
336 $(RM) *.flow;

Completed in 109 milliseconds