| /netbsd-src/external/mit/isl/dist/ |
| H A D | isl_schedule.c | 19 #include <isl/schedule.h>
27 /* Return a schedule encapsulating the given schedule tree.
29 * We currently only allow schedule trees with a domain or extension as root.
32 * used to represent leaves in the constructed schedule.
35 * these leaves to ensure that they are only used while the schedule
42 isl_schedule *schedule; in isl_schedule_from_schedule_tree() local
50 "root of schedule tree should be a domain or extension", in isl_schedule_from_schedule_tree()
53 schedule = isl_calloc_type(ctx, isl_schedule); in isl_schedule_from_schedule_tree()
54 if (!schedule) in isl_schedule_from_schedule_tree()
57 schedule->ref = 1; in isl_schedule_from_schedule_tree()
[all …]
|
| H A D | codegen.c | 11 * the domain of a given schedule in the order specified by
12 * the schedule tree or by their image(s) in the schedule map.
14 * The input consists of either a schedule tree or
16 * - a schedule map
61 /* Set the "name" option for the entire schedule domain.
64 __isl_keep isl_union_map *schedule, const char *name) in set_universe() argument
72 domain = isl_union_map_range(isl_union_map_copy(schedule)); in set_universe()
88 __isl_keep isl_union_map *schedule) in set_options() argument
94 ctx = isl_union_map_get_ctx(schedule); in set_options()
103 opt = set_universe(opt, schedule, "separate"); in set_options()
[all …]
|
| H A D | isl_schedule_private.h | 5 #include <isl/schedule.h>
8 /* A complete schedule tree.
10 * "root" is the root of the schedule tree.
12 * "leaf" may be used to represent a leaf of the schedule.
15 * a leaf of this schedule tree.
28 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree);
30 __isl_keep isl_schedule *schedule);
32 __isl_keep isl_schedule *schedule);
34 __isl_keep isl_schedule *schedule);
|
| H A D | isl_ast_build_private.h | 15 * "domain" represents constraints on the internal schedule domain,
21 * is changed to refer to the internal schedule domain.
63 * large as the dimension of the internal schedule domain. The
65 * used in a nested AST generation should the schedule be non-injective.
83 * "schedule_map" maps the internal schedule domain to the external schedule
87 * "internal2input" maps the internal schedule domain to the original
88 * input schedule domain. In case of a schedule tree input, the original
89 * input schedule domain consist of the flat product of all outer
95 * an AST from a flat schedule map. When creating an AST from a schedule
119 * "executed" contains the inverse schedule at this point
[all …]
|
| H A D | isl_test_cpp-generic.cc | 237 /* Construct a simple schedule tree with an outer sequence node and
241 static isl::schedule construct_schedule_tree(isl::ctx ctx) in construct_schedule_tree()
267 return node.schedule(); in construct_schedule_tree()
270 /* Test basic schedule tree functionality that is independent
273 * In particular, create a simple schedule tree and
280 auto schedule = construct_schedule_tree(ctx); in test_schedule_tree_generic() local
281 auto root = schedule.root(); in test_schedule_tree_generic()
298 * "schedule" is the schedule created by construct_schedule_tree.
303 static void test_ast_build_unroll(isl::schedule schedule) in test_ast_build_unroll() argument
305 auto root = schedule.root(); in test_ast_build_unroll()
[all …]
|
| H A D | isl_scheduler.h | 20 * of a schedule.
23 * sched is a matrix representation of the schedule being constructed
24 * for this node; if compressed is set, then this schedule is
26 * sched_map is an isl_map representation of the same (partial) schedule
33 * the schedule rows; the remaining rows are linearly independent
34 * the rows of "indep" represent linear combinations of the schedule
35 * coefficients that are non-zero when the schedule coefficients are
36 * linearly independent of previously computed schedule rows.
38 * represents the schedule coefficients of this node
41 * a parametric schedule
[all …]
|
| H A D | isl_test_python.py | 292 # Construct a simple schedule tree with an outer sequence node and
319 return node.schedule()
321 # Test basic schedule tree functionality.
323 # In particular, create a simple schedule tree and
330 schedule = construct_schedule_tree()
331 root = schedule.root()
390 # "schedule" is the schedule created by construct_schedule_tree.
395 def test_ast_build_unroll(schedule): argument
396 root = schedule.root()
402 schedule = root.schedule()
[all …]
|
| H A D | isl_options.c | 17 #include <isl/schedule.h>
84 /* Callback for setting the "schedule-fuse" option.
86 * replaced by the schedule-serialize-sccs option.
88 * expressed by turning on the schedule-serialize-sccs option.
141 "schedule-max-coefficient", "limit", -1, "Only consider schedules "
145 "schedule-max-constant-term", "limit", -1, "Only consider schedules "
149 "schedule-parametric", 1, "construct possibly parametric schedules")
151 "schedule-outer-coincidence", 0,
155 "schedule-maximize-band-depth", 0,
158 "schedule-maximize-coincidence", 0,
[all …]
|
| H A D | isl_schedule_node_private.h | 8 /* An isl_schedule_node points to a particular location in a schedule tree.
10 * "schedule" is the schedule that the node is pointing to.
13 * The first ancestor is the root of "schedule", while the last ancestor
21 * in a schedule tree and therefore does not uniquely identify a position
22 * in the schedule tree.
27 isl_schedule *schedule; member
34 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree,
|
| H A D | isl_scheduler_clustering.c | 25 * a band of schedule rows for each SCC.
82 * In particular, is its current schedule band empty and incomplete.
270 * to the number of schedule rows in the current band of "scc".
293 * to the number of schedule rows in the current band of the cluster.
359 /* Add "umap" to the schedule constraints "sc" of all types of "edge"
384 /* Add schedule constraints of types isl_edge_condition and
416 * the cluster instances, add schedule constraints on the clusters
470 * the cluster instances, add schedule constraints on the clusters
496 * In particular, the nodes of the graph correspond to the schedule
528 /* Compute the maximal number of remaining schedule rows that still need
[all …]
|
| H A D | isl_ast_codegen.c | 70 * the (non single valued) inverse schedule "executed".
72 * We extend the schedule with the iteration domain
83 * The extended inverse schedule is clearly single valued
86 * to be executed from the current schedule domain.
109 * after recording the current inverse schedule in the build.
137 * domain. "executed" is the original inverse schedule from which "map"
184 * the inverse schedule "executed" and add it to data->list.
187 * schedule "time", then we need to continue the generation process
189 * Note that the inverse schedule being single-valued may depend
207 * we may in rare cases fail to recognize that the inverse schedule
[all …]
|
| H A D | schedule.c | 10 * prints a schedule that satisfies those constraints.
15 #include <isl/schedule.h>
23 isl_schedule *schedule; in main() local
31 schedule = isl_schedule_constraints_compute_schedule(sc); in main()
35 p = isl_printer_print_schedule(p, schedule); in main()
38 isl_schedule_free(schedule); in main()
|
| H A D | isl_schedule_tree.c | 33 /* Is "tree" the leaf of a schedule tree?
40 /* Create a new schedule tree of type "type".
223 /* Create and return a new leaf schedule tree.
230 /* Create a new band schedule tree referring to "band"
256 /* Create a new context schedule tree with the given context and no children.
257 * Since the context references the outer schedule dimension,
283 /* Create a new domain schedule tree with the given domain and no children.
307 /* Create a new expansion schedule tree with the given contraction and
335 /* Create a new extension schedule tree with the given extension and
337 * Since the domain of the extension refers to the outer schedule dimension,
[all …]
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/doc/doxyout/hcrypto/man/man3/ |
| H A D | hcrypto_des.3 | 90 \fIks\fP key schedule to use
109 \fIks\fP key schedule to use
130 \fIks\fP key schedule to use
163 \fIks1\fP key schedule to use
165 \fIks2\fP key schedule to use
167 \fIks3\fP key schedule to use
182 \fIks\fP key schedule to use
201 \fIks1\fP key schedule to use
203 \fIks2\fP key schedule to use
205 \fIks3\fP key schedule to use
[all …]
|
| /netbsd-src/external/mit/isl/dist/include/isl/ |
| H A D | schedule.h | 146 __isl_keep isl_schedule *schedule);
149 __isl_keep isl_schedule *schedule);
156 __isl_take isl_schedule *schedule,
161 __isl_take isl_schedule *schedule, __isl_take isl_set *context);
163 __isl_take isl_schedule *schedule,
166 __isl_take isl_schedule *schedule, __isl_take isl_set *guard);
172 __isl_take isl_schedule *schedule, __isl_take isl_union_set *domain);
174 __isl_take isl_schedule *schedule, __isl_take isl_set *context);
177 __isl_take isl_schedule *schedule);
179 __isl_take isl_schedule *schedule, __isl_take isl_space *space);
[all …]
|
| /netbsd-src/external/mit/isl/dist/test_inputs/codegen/cloog/ |
| H A D | reservoir-mg-interp.st | 8 …schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(i0)]; S1[i0, i1, i2] -> [(i0)]; …
11 …schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(2i1)]; S1[i0, i1, i2] -> [(-3 + …
17 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S10[i0, i1, i2] -> [(i2)] }]"
21 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i2)] }]"
25 …schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i2)]; S6[i0, i1, i2] -> [(i2)]; S…
33 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S11[i0, i1, i2] -> [(i2)] }]"
37 …schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i0)]; S8[i0, i1, i2] -> [(i0)]; S…
40 …schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(2i1)]; S8[i0, i1, i2] -> [(2i1)];…
46 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i2)] }]"
50 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S8[i0, i1, i2] -> [(i2)] }]"
[all …]
|
| H A D | reservoir-mg-interp2.st | 8 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i0)] }]"
11 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i1)] }]"
14 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S1[i0, i1, i2] -> [(i2)] }]"
18 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i0)] }]"
21 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i1)] }]"
24 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S2[i0, i1, i2] -> [(i2)] }]"
28 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i0)] }]"
31 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i1)] }]"
34 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S3[i0, i1, i2] -> [(i2)] }]"
38 schedule: "[M, N, O, P, Q, R, S, T, U] -> [{ S4[i0, i1, i2] -> [(i0)] }]"
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/include/openssl/ |
| H A D | des.h | 74 long length, DES_key_schedule *schedule,
78 long length, DES_key_schedule *schedule,
81 long length, DES_key_schedule *schedule,
84 long length, DES_key_schedule *schedule,
88 long length, DES_key_schedule *schedule,
138 long length, DES_key_schedule *schedule,
141 long length, DES_key_schedule *schedule,
154 int DES_set_key(const_DES_cblock *key, DES_key_schedule *schedule);
155 int DES_key_sched(const_DES_cblock *key, DES_key_schedule *schedule);
156 int DES_set_key_checked(const_DES_cblock *key, DES_key_schedule *schedule);
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl/dist/include/openssl/ |
| H A D | des.h | 83 long length, DES_key_schedule *schedule,
90 long length, DES_key_schedule *schedule, DES_cblock *ivec,
94 long length, DES_key_schedule *schedule, DES_cblock *ivec,
98 long length, DES_key_schedule *schedule, DES_cblock *ivec,
102 long length, DES_key_schedule *schedule, DES_cblock *ivec,
167 long length, DES_key_schedule *schedule, DES_cblock *ivec);
170 long length, DES_key_schedule *schedule,
186 int DES_set_key(const_DES_cblock *key, DES_key_schedule *schedule);
188 int DES_key_sched(const_DES_cblock *key, DES_key_schedule *schedule);
190 int DES_set_key_checked(const_DES_cblock *key, DES_key_schedule *schedule);
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | GCNIterativeScheduler.cpp | 96 OS << "Region to schedule "; in printRegions()
185 void schedule() { in schedule() function in GCNIterativeScheduler::OverrideLegacyStrategy
189 Sch.BaseClass::schedule(); in schedule()
201 // so just use SUnits as the restoring schedule in restoreOrder()
262 // returns max pressure for a tentative schedule
265 Range &&Schedule) const { in getSchedulePressure()
270 // schedule doesn't include it in getSchedulePressure()
277 for (auto I = Schedule.end(), B = Schedule.begin(); I != B;) { in getSchedulePressure()
296 void GCNIterativeScheduler::schedule() { // overriden in schedule() function in GCNIterativeScheduler
318 // Detach schedule from SUnits and interleave it with debug values.
[all …]
|
| H A D | GCNIterativeScheduler.h | 11 /// approach to find a best schedule for GCN architecture. It basically makes
43 void schedule() override;
56 std::vector<MachineInstr *> Schedule; member
62 // `const` fields are to emphasize they shouldn't change for any schedule.
69 // best schedule for the region so far (not scheduled yet)
85 Range &&Schedule) const;
95 ScheduleRef Schedule,
100 std::vector<MachineInstr*> detachSchedule(ScheduleRef Schedule) const;
105 void scheduleRegion(Region &R, Range &&Schedule,
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | ModuloSchedule.h | 1 //===- ModuloSchedule.h - Software pipeline schedule expansion ------------===//
12 // There are multiple methods for analyzing a loop and creating a schedule.
14 // MachinePipeliner). The details of how a schedule is arrived at are irrelevant
15 // for the task of actually rewriting a loop to adhere to the schedule, which
18 // A schedule is, for every instruction in a block, a Cycle and a Stage. Note
37 // In the schedule for this unrolled sequence we would say that I0 was scheduled
52 // an arbitrary schedule containing loop-carried values are complex.
76 /// Represents a schedule for a single-block loop. For every instruction we
84 /// order; the total order within cycles has been decided by the schedule
94 /// The number of stages in this schedule (Max(Stage) + 1).
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/ |
| H A D | DES_random_key.pod | 25 int DES_set_key(const_DES_cblock *key, DES_key_schedule *schedule);
26 int DES_key_sched(const_DES_cblock *key, DES_key_schedule *schedule);
27 int DES_set_key_checked(const_DES_cblock *key, DES_key_schedule *schedule);
28 void DES_set_key_unchecked(const_DES_cblock *key, DES_key_schedule *schedule);
42 long length, DES_key_schedule *schedule, DES_cblock *ivec,
45 int numbits, long length, DES_key_schedule *schedule,
48 int numbits, long length, DES_key_schedule *schedule,
51 long length, DES_key_schedule *schedule, DES_cblock *ivec,
54 long length, DES_key_schedule *schedule, DES_cblock *ivec,
57 long length, DES_key_schedule *schedule, DES_cblock *ivec,
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/ |
| H A D | DES_random_key.pod | 21 int DES_set_key(const_DES_cblock *key, DES_key_schedule *schedule);
22 int DES_key_sched(const_DES_cblock *key, DES_key_schedule *schedule);
23 int DES_set_key_checked(const_DES_cblock *key, DES_key_schedule *schedule);
24 void DES_set_key_unchecked(const_DES_cblock *key, DES_key_schedule *schedule);
38 long length, DES_key_schedule *schedule, DES_cblock *ivec,
41 int numbits, long length, DES_key_schedule *schedule,
44 int numbits, long length, DES_key_schedule *schedule,
47 long length, DES_key_schedule *schedule, DES_cblock *ivec,
50 long length, DES_key_schedule *schedule, DES_cblock *ivec,
53 long length, DES_key_schedule *schedule, DES_cblock *ivec,
[all …]
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/krb5/ |
| H A D | salt-des.c | 85 DES_key_schedule schedule; in krb5_DES_AFS3_Transarc_string_to_key() local
104 DES_set_key_unchecked (&temp_key, &schedule); in krb5_DES_AFS3_Transarc_string_to_key()
105 DES_cbc_cksum ((void*)password, &ivec, passlen, &schedule, &ivec); in krb5_DES_AFS3_Transarc_string_to_key()
109 DES_set_key_unchecked (&temp_key, &schedule); in krb5_DES_AFS3_Transarc_string_to_key()
110 DES_cbc_cksum ((void*)password, key, passlen, &schedule, &ivec); in krb5_DES_AFS3_Transarc_string_to_key()
111 memset(&schedule, 0, sizeof(schedule)); in krb5_DES_AFS3_Transarc_string_to_key()
142 DES_key_schedule schedule; in DES_string_to_key_int() local
164 DES_set_key_unchecked(key, &schedule); in DES_string_to_key_int()
165 DES_cbc_cksum((void*)data, key, length, &schedule, key); in DES_string_to_key_int()
166 memset(&schedule, 0, sizeof(schedule)); in DES_string_to_key_int()
|