| /src/external/mit/isl/dist/ |
| flow_test.sh.in | 8 for i in $srcdir/test_inputs/flow/*.ai; do
11 test=test-$base.flow
13 ref=$dir/$base.flow
|
| flow.c | 16 #include <isl/flow.h>
24 isl_union_flow *flow; local
32 flow = isl_union_access_info_compute_flow(access);
36 p = isl_printer_print_union_flow(p, flow);
39 isl_union_flow_free(flow);
|
| isl_flow.c | 25 #include <isl/flow.h>
482 /* Iterate over all sources and for each resulting flow dependence
716 /* Given a possible flow dependence temp_rel[j] between source j and the sink
719 * The flow dependences temp_rel[k] are updated with the improved sources.
963 * "flow" contains all dependences computed so far (apart from those
987 __isl_take isl_flow *flow)
992 return flow;
1008 return isl_flow_free(flow);
1030 return isl_flow_free(flow);
1039 flow->dep[pos].map = isl_map_union(flow->dep[pos].map
2238 isl_union_flow *flow; local
2338 isl_union_flow *flow; member in struct:isl_compute_flow_data
2499 isl_flow *flow; local
3078 isl_flow *flow; local
3146 isl_union_flow *flow; local
3211 isl_union_flow *flow; local
3311 isl_union_flow *flow; local
[all...] |
| all.h | 11 #include <isl/flow.h>
|
| /src/external/lgpl3/gmp/dist/mpq/ |
| set_f.c | 42 mp_limb_t flow; local
54 flow = *fptr;
55 MPN_STRIP_LOW_ZEROS_NOT_ZERO (fptr, abs_fsize, flow);
80 if (flow & 1)
94 count_trailing_zeros (shift, flow);
|
| /src/external/bsd/ipf/dist/lib/ |
| printpacket6.c | 25 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);
|
| /src/external/mit/isl/dist/include/isl/ |
| flow.h | 117 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...] |
| /src/sys/altq/ |
| altq_wfq.c | 244 struct flowinfo flow; local
246 altq_extractflow(m, af, &flow, wfqp->fbmask);
247 return (&wfqp->queue[(*wfqp->hash_func)(&flow, wfqp->nums)]);
308 /* the queue for this flow is selected to drop */
315 wfq_hash(struct flowinfo *flow, int n)
319 if (flow != NULL) {
320 if (flow->fi_family == AF_INET) {
321 struct flowinfo_in *fp = (struct flowinfo_in *)flow;
331 else if (flow->fi_family == AF_INET6) {
332 struct flowinfo_in6 *fp6 = (struct flowinfo_in6 *)flow;
[all...] |
| altq_wfq.h | 49 struct flowinfo flow; member in struct:wfq_getqid
|
| altq_afmap.c | 32 * mapping an ip flow to atm vpi/vci.
269 afm_match(struct ifnet *ifp, struct flowinfo *flow)
276 switch (flow->fi_family) {
278 return (afm_match4(head, (struct flowinfo_in *)flow));
282 return (afm_match6(head, (struct flowinfo_in6 *)flow));
|
| /src/usr.bin/tip/ |
| cu.c | 56 int flow = -1; /* -1 is "tandem" ^S/^Q */ local
65 { "flow", required_argument, NULL, 'F' },
99 flow = 1;
103 flow = -1;
106 errx(3, "bad flow setting");
108 flow = 0;
157 flow = 0;
239 switch (flow) {
294 " -F,--flow {hard,soft,none}: Use RTS/CTS, ^S/^Q, no flow control\n
[all...] |
| /src/external/bsd/tcpdump/dist/ |
| print-ip6.c | 239 u_int flow; local
292 flow = GET_BE_U_4(ip6->ip6_flow);
295 if (flow & 0x0ff00000)
296 ND_PRINT("class 0x%02x, ", (flow & 0x0ff00000) >> 20);
297 if (flow & 0x000fffff)
298 ND_PRINT("flowlabel 0x%05x, ", flow & 0x000fffff);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| mcf.cc | 1 /* 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
80 /* Flag denoting type of edge and attributes for the flow field. */
85 /* Flow for this edge. */
86 gcov_type flow; member in struct:fixup_edge_type
87 /* Residual flow for this edge - used during negative cycle canceling. */
130 /* Structure used in the maximal flow routines to find augmenting path. */
205 fprintf (file, "flow/capacity=%" PRId64 "/"
[all...] |
| graphite-dependences.cc | 307 isl_union_flow *flow = isl_union_access_info_compute_flow (ai); local
308 isl_union_map *raw = isl_union_flow_get_must_dependence (flow);
309 isl_union_flow_free (flow);
316 flow = isl_union_access_info_compute_flow (ai);
318 isl_union_map *waw = isl_union_flow_get_must_dependence (flow);
319 isl_union_map *war = isl_union_flow_get_may_dependence (flow);
321 isl_union_flow_free (flow);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| mcf.cc | 1 /* 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
80 /* Flag denoting type of edge and attributes for the flow field. */
85 /* Flow for this edge. */
86 gcov_type flow; member in struct:fixup_edge_type
87 /* Residual flow for this edge - used during negative cycle canceling. */
130 /* Structure used in the maximal flow routines to find augmenting path. */
205 fprintf (file, "flow/capacity=%" PRId64 "/"
[all...] |
| graphite-dependences.cc | 307 isl_union_flow *flow = isl_union_access_info_compute_flow (ai); local
308 isl_union_map *raw = isl_union_flow_get_must_dependence (flow);
309 isl_union_flow_free (flow);
316 flow = isl_union_access_info_compute_flow (ai);
318 isl_union_map *waw = isl_union_flow_get_must_dependence (flow);
319 isl_union_map *war = isl_union_flow_get_may_dependence (flow);
321 isl_union_flow_free (flow);
|
| /src/sys/net/npf/ |
| npf_state.c | 187 npf_state_inspect(npf_cache_t *npc, npf_state_t *nst, const npf_flow_t flow)
195 ret = npf_state_tcp(npc, nst, flow);
201 nst->nst_state = npf_generic_fsm[nst->nst_state][flow];
|
| npf_state_tcp.c | 292 npf_tcp_inwindow(npf_cache_t *npc, npf_state_t *nst, const npf_flow_t flow)
332 fstate = &nst->nst_tcpst[flow];
333 tstate = &nst->nst_tcpst[!flow];
458 npf_state_tcp(npf_cache_t *npc, npf_state_t *nst, npf_flow_t flow)
469 nstate = npf_tcp_fsm[state][flow][flagcase];
478 if (!npf_tcp_inwindow(npc, nst, flow)) {
|
| npf_nat.c | 377 * rewritten given the combination of the NAT type and flow direction.
382 npf_nat_which(const unsigned type, const npf_flow_t flow)
391 KASSERT(flow == NPF_FLOW_FORW || flow == NPF_FLOW_BACK);
401 which = (type == NPF_NATOUT) ? flow : !flow;
584 npf_dnat_translate(npf_cache_t *npc, npf_nat_t *nt, npf_flow_t flow)
587 const unsigned which = npf_nat_which(np->n_type, flow);
594 if (flow == NPF_FLOW_FORW) {
608 npf_alg_exec(npc, nt, flow);
721 npf_flow_t flow; local
[all...] |
| npf_connkey.c | 86 const void *ipv, const uint16_t *id, const npf_flow_t flow)
92 if (__predict_true(flow == NPF_FLOW_FORW)) {
227 const unsigned di, const npf_flow_t flow)
242 const bool invert = flow != NPF_FLOW_FORW;
280 ret = npf_connkey_setkey(key, alen, proto, npc->npc_ips, id, flow);
|
| npf_alg_icmp.c | 267 npf_flow_t flow; local
305 conn = npf_conn_lookup(&enpc, di, &flow);
320 npfa_icmp_nat(npf_cache_t *npc, npf_nat_t *nt, npf_flow_t flow)
327 if (flow == NPF_FLOW_FORW || !npf_iscached(npc, NPC_ICMP))
|
| /src/sys/arch/m68k/060sp/dist/ |
| fpsp.doc | 179 - Basic flow:
187 - Basic flow:
195 - Basic flow:
203 - Basic flow:
212 - Basic flow:
224 - Basic flow:
237 - Basic flow:
274 - Basic flow:
296 - Basic flow:
|
| /src/usr.sbin/memswitch/ |
| methods.c | 432 int baud, bit, parity, stop, flow; local
493 /* flow */
495 flow = 0;
497 flow = 1;
514 (flow << 9) +
686 char bit, parity, flow; local
706 flow = flows[(v & 0x0200) >> 9];
707 sprintf(str, "%s,%c,%c,%s,%c", baud, bit, parity, stop, flow);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/ |
| BenchmarkResult.cpp | 191 static const bool flow = false; member in struct:llvm::yaml::SequenceElementTraits
210 static const bool flow = true; member in struct:llvm::yaml::ScalarTraits
215 static const bool flow = false; member in struct:llvm::yaml::SequenceElementTraits
218 // exegesis::Measure is rendererd as a flow instead of a list.
230 static const bool flow = true; member in struct:llvm::yaml::MappingTraits
247 static const bool flow = false; member in struct:llvm::yaml::SequenceElementTraits
281 static const bool flow = true; member in struct:llvm::yaml::ScalarTraits
|
| /src/external/bsd/libpcap/dist/ |
| pcap-rdmasniff.c | 56 struct ibv_flow * flow; member in struct:pcap_rdmasniff
82 ibv_destroy_flow(priv->flow);
276 priv->flow = ibv_create_flow(priv->qp, &flow_attr);
277 if (!priv->flow) {
279 "Failed to create flow for device %s", handle->opt.device);
339 if (priv->flow) {
340 ibv_destroy_flow(priv->flow);
|
