Home
last modified time | relevance | path

Searched refs:flow (Results 1 – 25 of 716) sorted by relevance

12345678910>>...29

/netbsd-src/external/mit/isl/dist/
H A Disl_flow.c987 __isl_take isl_flow *flow) in handle_coscheduled() argument
992 return flow; in handle_coscheduled()
1008 return isl_flow_free(flow); in handle_coscheduled()
1030 return isl_flow_free(flow); in handle_coscheduled()
1039 flow->dep[pos].map = isl_map_union(flow->dep[pos].map, in handle_coscheduled()
1048 return flow; in handle_coscheduled()
2101 isl_ctx *isl_union_flow_get_ctx(__isl_keep isl_union_flow *flow) in isl_union_flow_get_ctx() argument
2103 return flow ? isl_union_map_get_ctx(flow->must_dep) : NULL; in isl_union_flow_get_ctx()
2108 __isl_null isl_union_flow *isl_union_flow_free(__isl_take isl_union_flow *flow) in isl_union_flow_free() argument
2110 if (!flow) in isl_union_flow_free()
[all …]
H A Dflow.c24 isl_union_flow *flow; in main() local
32 flow = isl_union_access_info_compute_flow(access); in main()
36 p = isl_printer_print_union_flow(p, flow); in main()
39 isl_union_flow_free(flow); in main()
H A Dflow_test.sh.in8 for i in $srcdir/test_inputs/flow/*.ai; do
11 test=test-$base.flow
13 ref=$dir/$base.flow
/netbsd-src/sys/altq/
H A Daltq_wfq.c244 struct flowinfo flow; in wfq_classify() local
246 altq_extractflow(m, af, &flow, wfqp->fbmask); in wfq_classify()
247 return (&wfqp->queue[(*wfqp->hash_func)(&flow, wfqp->nums)]); in wfq_classify()
308 /* the queue for this flow is selected to drop */ in wfq_ifenqueue()
315 wfq_hash(struct flowinfo *flow, int n) in wfq_hash() argument
319 if (flow != NULL) { in wfq_hash()
320 if (flow->fi_family == AF_INET) { in wfq_hash()
321 struct flowinfo_in *fp = (struct flowinfo_in *)flow; in wfq_hash()
331 else if (flow->fi_family == AF_INET6) { in wfq_hash()
332 struct flowinfo_in6 *fp6 = (struct flowinfo_in6 *)flow; in wfq_hash()
343 wfq_hashbydstaddr(struct flowinfo * flow,int n) wfq_hashbydstaddr() argument
367 wfq_hashbysrcaddr(struct flowinfo * flow,int n) wfq_hashbysrcaddr() argument
391 wfq_hashbysrcport(struct flowinfo * flow,int n) wfq_hashbysrcport() argument
[all...]
/netbsd-src/external/mit/isl/dist/include/isl/
H A Dflow.h117 isl_ctx *isl_union_flow_get_ctx(__isl_keep isl_union_flow *flow);
119 __isl_keep isl_union_flow *flow);
122 __isl_keep isl_union_flow *flow);
125 __isl_keep isl_union_flow *flow);
128 __isl_keep isl_union_flow *flow);
131 __isl_keep isl_union_flow *flow);
134 __isl_keep isl_union_flow *flow);
137 __isl_keep isl_union_flow *flow);
138 __isl_null isl_union_flow *isl_union_flow_free(__isl_take isl_union_flow *flow);
141 __isl_take isl_printer *p, __isl_keep isl_union_flow *flow);
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpq/
H A Dset_f.c42 mp_limb_t flow; in mpq_set_f() local
54 flow = *fptr; in mpq_set_f()
55 MPN_STRIP_LOW_ZEROS_NOT_ZERO (fptr, abs_fsize, flow); in mpq_set_f()
80 if (flow & 1) in mpq_set_f()
94 count_trailing_zeros (shift, flow); in mpq_set_f()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dmcf.c86 gcov_type flow; member
206 fedge->flow); in dump_fixup_edge()
913 pfedge->flow += cycle_flow; in cancel_negative_cycle()
916 r_pfedge->flow -= cycle_flow; in cancel_negative_cycle()
944 pfedge->rflow = pfedge->max_capacity - pfedge->flow; in compute_residual_flow()
946 add_rfixup_edge (fixup_graph, pfedge->dest, pfedge->src, pfedge->flow, in compute_residual_flow()
1045 pfedge->flow = 0; in find_max_flow()
1072 pfedge->flow += increment; in find_max_flow()
1081 r_pfedge->flow -= increment; in find_max_flow()
1138 if (pfedge->flow) in adjust_cfg_counts()
[all …]
H A Dgraphite-dependences.c307 isl_union_flow *flow = isl_union_access_info_compute_flow (ai); in scop_get_dependences() local
308 isl_union_map *raw = isl_union_flow_get_must_dependence (flow); in scop_get_dependences()
309 isl_union_flow_free (flow); in scop_get_dependences()
316 flow = isl_union_access_info_compute_flow (ai); in scop_get_dependences()
318 isl_union_map *waw = isl_union_flow_get_must_dependence (flow); in scop_get_dependences()
319 isl_union_map *war = isl_union_flow_get_may_dependence (flow); in scop_get_dependences()
321 isl_union_flow_free (flow); in scop_get_dependences()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dmcf.cc86 gcov_type flow; member
206 fedge->flow); in dump_fixup_edge()
913 pfedge->flow += cycle_flow; in cancel_negative_cycle()
916 r_pfedge->flow -= cycle_flow; in cancel_negative_cycle()
944 pfedge->rflow = pfedge->max_capacity - pfedge->flow; in compute_residual_flow()
946 add_rfixup_edge (fixup_graph, pfedge->dest, pfedge->src, pfedge->flow, in compute_residual_flow()
1045 pfedge->flow = 0; in find_max_flow()
1072 pfedge->flow += increment; in find_max_flow()
1081 r_pfedge->flow -= increment; in find_max_flow()
1138 if (pfedge->flow) in adjust_cfg_counts()
[all …]
H A Dgraphite-dependences.cc307 isl_union_flow *flow = isl_union_access_info_compute_flow (ai); in scop_get_dependences() local
308 isl_union_map *raw = isl_union_flow_get_must_dependence (flow); in scop_get_dependences()
309 isl_union_flow_free (flow); in scop_get_dependences()
316 flow = isl_union_access_info_compute_flow (ai); in scop_get_dependences()
318 isl_union_map *waw = isl_union_flow_get_must_dependence (flow); in scop_get_dependences()
319 isl_union_map *war = isl_union_flow_get_may_dependence (flow); in scop_get_dependences()
321 isl_union_flow_free (flow); in scop_get_dependences()
/netbsd-src/sys/net/npf/
H A Dnpf_nat.c382 npf_nat_which(const unsigned type, const npf_flow_t flow) in npf_nat_which() argument
391 KASSERT(flow == NPF_FLOW_FORW || flow == NPF_FLOW_BACK); in npf_nat_which()
401 which = (type == NPF_NATOUT) ? flow : !flow; in npf_nat_which()
584 npf_dnat_translate(npf_cache_t *npc, npf_nat_t *nt, npf_flow_t flow) in npf_dnat_translate() argument
587 const unsigned which = npf_nat_which(np->n_type, flow); in npf_dnat_translate()
594 if (flow == NPF_FLOW_FORW) { in npf_dnat_translate()
608 npf_alg_exec(npc, nt, flow); in npf_dnat_translate()
621 npf_snat_translate(npf_cache_t *npc, const npf_natpolicy_t *np, npf_flow_t flow) in npf_snat_translate() argument
623 const unsigned which = npf_nat_which(np->n_type, flow); in npf_snat_translate()
679 const unsigned di, npf_flow_t *flow) in npf_nat_lookup() argument
[all …]
H A Dnpf_state_tcp.c292 npf_tcp_inwindow(npf_cache_t *npc, npf_state_t *nst, const npf_flow_t flow) in npf_tcp_inwindow() argument
332 fstate = &nst->nst_tcpst[flow]; in npf_tcp_inwindow()
333 tstate = &nst->nst_tcpst[!flow]; in npf_tcp_inwindow()
458 npf_state_tcp(npf_cache_t *npc, npf_state_t *nst, npf_flow_t flow) in npf_state_tcp() argument
469 nstate = npf_tcp_fsm[state][flow][flagcase]; in npf_state_tcp()
478 if (!npf_tcp_inwindow(npc, nst, flow)) { in npf_state_tcp()
H A Dnpf_conn.c296 const unsigned di, const npf_flow_t flow) in npf_conn_check() argument
310 if (__predict_false(flow != pflow)) { in npf_conn_check()
326 npf_conn_lookup(const npf_cache_t *npc, const unsigned di, npf_flow_t *flow) in npf_conn_lookup() argument
337 con = npf_conndb_lookup(npf, &key, flow); in npf_conn_lookup()
344 if (!npf_conn_check(con, nbuf, di, *flow)) { in npf_conn_lookup()
363 npf_flow_t flow; in npf_conn_inspect() local
384 if ((con = npf_conn_lookup(npc, di, &flow)) == NULL) { in npf_conn_inspect()
390 ok = npf_state_inspect(npc, &con->c_state, flow); in npf_conn_inspect()
947 npf_flow_t flow; in npf_conn_find() local
954 con = npf_conndb_lookup(npf, &key, &flow); in npf_conn_find()
[all …]
/netbsd-src/usr.bin/tip/
H A Dcu.c56 int flow = -1; /* -1 is "tandem" ^S/^Q */ in cumain() local
65 { "flow", required_argument, NULL, 'F' }, in cumain()
99 flow = 1; in cumain()
103 flow = -1; in cumain()
106 errx(3, "bad flow setting"); in cumain()
108 flow = 0; in cumain()
157 flow = 0; in cumain()
239 switch (flow) { in cumain()
294 " -F,--flow {hard,soft,none}: Use RTS/CTS, ^S/^Q, no flow contro in cuhelp()
[all...]
/netbsd-src/external/bsd/ipf/dist/lib/
H A Dprintpacket6.c25 u_32_t flow; local
30 flow = ntohl(*(u_32_t *)buf);
31 flow &= 0xfffff;
42 PRINTF("ip6/%d %d %#x %d", buf[0] & 0xf, plen, flow, p);
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DCFIVerify.rst14 indirect control flow operations are protected by CFI, and should output these
33 indirect control flow instructions are identified.
44 Unprotected indirect control flow instructions will be flagged for manual
64 The tool would operate by searching for indirect control flow instructions in
65 the disassembly. A control flow graph would be generated from a small buffer of
66 the instructions surrounding the 'target' control flow instruction. If the
70 conditional jump target should be the CFI trap. If an indirect control flow
87 present in these sections has already violated the control flow integrity.
90 control flow operations across DSO boundaries. Currently, these CFI features are
/netbsd-src/external/cddl/dtracetoolkit/dist/Docs/Notes/
H A DALLflow_notes.txt2 * Notes for all scripts that print a function or method flow.
10 * What is a flow?
12 Output that has some meaningful indent, such as function flow indented by
47 To deal with this behaviour, the flow scripts may,
51 column appears in these flow scripts.
/netbsd-src/external/cddl/dtracetoolkit/dist/Notes/
H A DALLflow_notes.txt2 * Notes for all scripts that print a function or method flow.
10 * What is a flow?
12 Output that has some meaningful indent, such as function flow indented by
47 To deal with this behaviour, the flow scripts may,
51 column appears in these flow scripts.
/netbsd-src/crypto/external/bsd/openssl.old/dist/ssl/statem/
H A DREADME18 - Separate message flow state from handshake state (in order to better
20 - message flow state = when to flush buffers; handling restarts in the
21 event of NBIO events; handling the common flow of steps for reading a
22 message and the common flow of steps for writing a message etc
27 The message flow state machine is divided into a reading sub-state machine and a
/netbsd-src/crypto/external/bsd/openssl/dist/ssl/statem/
H A DREADME.md19 - Separate message flow state from handshake state (in order to better
21 * message flow state = when to flush buffers; handling restarts in the
22 event of NBIO events; handling the common flow of steps for reading a
23 message and the common flow of steps for writing a message etc
28 The message flow state machine is divided into a reading sub-state machine and a
/netbsd-src/external/cddl/dtracetoolkit/dist/Examples/
H A Dsh_flow_example.txt3 This is a simple script to trace the flow of Bourne shell functions,
30 See Notes/ALLflow_notes.txt for important notes about reading flow outputs.
121 This shows the flow, incluing the handover between the "firefox" script
124 There is a point in the output where flow appears to reverse (at time
128 column to the flow script (or use sh_flowinfo.d).
/netbsd-src/external/cddl/dtracetoolkit/dist/Docs/Examples/
H A Dsh_flow_example.txt3 This is a simple script to trace the flow of Bourne shell functions,
30 See Notes/ALLflow_notes.txt for important notes about reading flow outputs.
121 This shows the flow, incluing the handover between the "firefox" script
124 There is a point in the output where flow appears to reverse (at time
128 column to the flow script (or use sh_flowinfo.d).
/netbsd-src/sys/arch/m68k/060sp/dist/
H A Dfpsp.doc178 - Basic flow:
186 - Basic flow:
194 - Basic flow:
202 - Basic flow:
210 - Basic flow:
222 - Basic flow:
234 - Basic flow:
270 - Basic flow:
291 - Basic flow:
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dcfg.texi15 A control flow graph (CFG) is a data structure built on top of the
17 stream) abstracting the control flow behavior of a function that is
20 control flow from one basic block to another. The data structures
21 used to represent the control flow graph are defined in
24 In GCC, the representation of control flow is maintained throughout
29 and its release. This way, transfer of information such as data flow,
42 * Maintaining the CFG:: Keeping the control flow graph and up to date.
122 A basic block ends with a control flow instruction or with the last
181 @cindex edge in the flow graph
183 Edges represent possible control flow transfers from the end of some
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Dcfg.texi15 A control flow graph (CFG) is a data structure built on top of the
17 stream) abstracting the control flow behavior of a function that is
20 control flow from one basic block to another. The data structures
21 used to represent the control flow graph are defined in
24 In GCC, the representation of control flow is maintained throughout
29 and its release. This way, transfer of information such as data flow,
42 * Maintaining the CFG:: Keeping the control flow graph and up to date.
122 A basic block ends with a control flow instruction or with the last
181 @cindex edge in the flow graph
183 Edges represent possible control flow transfers from the end of some
[all …]

12345678910>>...29