| /src/external/bsd/ntp/dist/tests/ntpd/ |
| leapsec.c | 492 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
511 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
530 TEST_ASSERT_EQUAL(LSPROX_SCHEDULE, qr.proximity);
549 TEST_ASSERT_EQUAL(LSPROX_ANNOUNCE, qr.proximity);
568 TEST_ASSERT_EQUAL(LSPROX_ALERT, qr.proximity);
587 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
606 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
629 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
985 TEST_ASSERT_EQUAL(LSPROX_NOWARN, qr.proximity);
990 TEST_ASSERT_EQUAL(LSPROX_SCHEDULE, qr.proximity);
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| graphite-optimize-isl.cc | 132 /* FIXME: proximity should not be validity. */
133 isl_union_map *proximity = isl_union_map_copy (validity); local
136 sc = isl_schedule_constraints_set_proximity (sc, proximity);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphite-optimize-isl.cc | 132 /* FIXME: proximity should not be validity. */
133 isl_union_map *proximity = isl_union_map_copy (validity); local
136 sc = isl_schedule_constraints_set_proximity (sc, proximity);
|
| /src/external/bsd/ntp/dist/ntpd/ |
| ntp_leapsec.h | 92 * 'proximity' is a proximity warning. See definitions below. This is
103 uint8_t proximity; member in struct:leap_result
|
| ntp_leapsec.c | 341 qr->proximity = LSPROX_SCHEDULE;
347 qr->proximity = LSPROX_ANNOUNCE;
352 qr->proximity = LSPROX_ALERT;
|
| ntp_timer.c | 81 u_long leapsec; /* seconds to next leap (proximity class) */
690 lsprox = lsdata.proximity;
|
| /src/external/mit/isl/dist/include/isl/ |
| schedule.h | 72 __isl_take isl_union_map *proximity);
129 __isl_take isl_union_map *proximity);
|
| cpp-checked.h | 3242 inline isl::checked::union_map proximity() const;
3247 inline isl::checked::schedule_constraints set_proximity(isl::checked::union_map proximity) const;
15843 isl::checked::union_map schedule_constraints::proximity() const function in class:isl::checked::schedule_constraints
15851 return proximity();
15872 isl::checked::schedule_constraints schedule_constraints::set_proximity(isl::checked::union_map proximity) const
15874 auto res = isl_schedule_constraints_set_proximity(copy(), proximity.release());
|
| cpp.h | 3308 inline isl::union_map proximity() const;
3313 inline isl::schedule_constraints set_proximity(isl::union_map proximity) const;
21874 isl::union_map schedule_constraints::proximity() const function in class:isl::schedule_constraints
21888 return proximity();
21927 isl::schedule_constraints schedule_constraints::set_proximity(isl::union_map proximity) const
21929 if (!ptr || proximity.is_null())
21933 auto res = isl_schedule_constraints_set_proximity(copy(), proximity.release());
|
| /src/external/mit/isl/dist/ |
| isl_schedule_constraints.c | 26 * "proximity" constraints map domain elements i to domains elements
222 /* Replace the proximity constraints of "sc" by "proximity".
226 __isl_take isl_union_map *proximity)
228 return isl_schedule_constraints_set(sc, isl_edge_proximity, proximity);
319 /* Return the proximity constraints of "sc".
483 [isl_sc_key_proximity] = "proximity",
|
| isl_test.c | 4463 isl_union_map *validity, *proximity, *coincidence; local
4499 proximity = isl_union_map_copy(dep);
4504 sc = isl_schedule_constraints_set_proximity(sc, proximity);
4595 * proximity constraints and context and return a corresponding union map
4599 const char *domain, const char *validity, const char *proximity,
4613 prox = isl_union_map_read_from_str(ctx, proximity);
4626 * proximity constraints and return a corresponding union map representation.
4629 const char *domain, const char *validity, const char *proximity)
4631 return compute_schedule_with_context(ctx, domain, validity, proximity,
4636 * with the given validity and proximity constraints
4680 isl_union_map *validity, *proximity; local
4718 isl_union_map *validity, *proximity, *condition; local
[all...] |
| isl_scheduler.c | 115 /* Is "edge" marked as a proximity edge?
2186 * If a given proximity dependence is identical to a validity
2312 * validity+proximity -> 2 (>= 0 and upper bound)
2313 * proximity -> 2 (lower and upper bound)
2335 * Only proximity edges that are not forced zero need
2428 * validity+proximity -> 2 (>= 0 and upper bound)
2429 * proximity -> 2 (lower and upper bound)
2732 * In particular, the dependence distances over proximity edges
3536 * graph, then it must be a backward proximity edge and it should simply
5876 * the dependence distances over the proximity dependences
[all...] |
| /src/external/mit/isl/dist/interface/ |
| isl.py | 14984 def proximity(arg0): member in class:schedule_constraints
14995 return arg0.proximity()
|
