Home
last modified time | relevance | path

Searched refs:scop (Results 1 – 25 of 114) sorted by relevance

12345

/external/llvm-project/polly/lib/External/ppcg/
Dppcg.c101 int ppcg_scop_any_hidden_declarations(struct ppcg_scop *scop) in ppcg_scop_any_hidden_declarations() argument
105 if (!scop) in ppcg_scop_any_hidden_declarations()
111 for (i = 0; i < scop->pet->n_array; ++i) in ppcg_scop_any_hidden_declarations()
112 if (scop->pet->arrays[i]->declared && in ppcg_scop_any_hidden_declarations()
113 !scop->pet->arrays[i]->exposed) in ppcg_scop_any_hidden_declarations()
125 static __isl_give isl_id_to_ast_expr *collect_names(struct pet_scop *scop) in collect_names() argument
132 ctx = isl_set_get_ctx(scop->context); in collect_names()
134 n = isl_set_dim(scop->context, isl_dim_param); in collect_names()
136 names = isl_id_to_ast_expr_alloc(ctx, n + scop->n_array); in collect_names()
142 id = isl_set_get_dim_id(scop->context, isl_dim_param, i); in collect_names()
[all …]
Dcpu.c103 struct ppcg_scop *scop; member
126 struct ppcg_scop *scop) in ast_schedule_dim_is_parallel() argument
138 deps = isl_union_map_copy(scop->dep_flow); in ast_schedule_dim_is_parallel()
139 deps = isl_union_map_union(deps, isl_union_map_copy(scop->dep_false)); in ast_schedule_dim_is_parallel()
140 if (scop->options->live_range_reordering) { in ast_schedule_dim_is_parallel()
141 isl_union_map *order = isl_union_map_copy(scop->dep_order); in ast_schedule_dim_is_parallel()
180 if (ast_schedule_dim_is_parallel(build, build_info->scop)) { in mark_openmp_parallel()
261 static struct pet_stmt *find_stmt(struct ppcg_scop *scop, __isl_keep isl_id *id) in find_stmt() argument
265 for (i = 0; i < scop->pet->n_stmt; ++i) { in find_stmt()
266 struct pet_stmt *stmt = scop->pet->stmts[i]; in find_stmt()
[all …]
Dppcg.h111 int ppcg_scop_any_hidden_declarations(struct ppcg_scop *scop);
112 __isl_give isl_id_list *ppcg_scop_generate_names(struct ppcg_scop *scop,
118 struct ppcg_scop *scop, void *user), void *user);
125 void compute_dependences(struct ppcg_scop *scop);
Dprint.c420 struct ppcg_scop *scop, int exposed) in print_declarations() argument
425 if (!scop) in print_declarations()
428 build = isl_ast_build_from_context(isl_set_copy(scop->context)); in print_declarations()
429 for (i = 0; i < scop->pet->n_array; ++i) { in print_declarations()
430 struct pet_array *array = scop->pet->arrays[i]; in print_declarations()
448 __isl_take isl_printer *p, struct ppcg_scop *scop) in ppcg_print_exposed_declarations() argument
450 return print_declarations(p, scop, 1); in ppcg_print_exposed_declarations()
457 __isl_take isl_printer *p, struct ppcg_scop *scop) in ppcg_print_hidden_declarations() argument
459 return print_declarations(p, scop, 0); in ppcg_print_hidden_declarations()
Dgpu.c201 info->linearize = prog->scop->options->linearize_device_arrays; in extract_array_info()
258 for (i = 0; i < prog->scop->pet->n_independence; ++i) { in remove_independences()
259 struct pet_independence *pi = prog->scop->pet->independences[i]; in remove_independences()
289 accesses = isl_union_map_copy(prog->scop->tagged_reads); in collect_order_dependences()
291 isl_union_map_copy(prog->scop->tagged_may_writes)); in collect_order_dependences()
307 order = isl_union_map_copy(prog->scop->tagged_dep_order); in collect_order_dependences()
351 prog->n_array = prog->scop->pet->n_array; in collect_array_info()
356 for (i = 0; i < prog->scop->pet->n_array; ++i) { in collect_array_info()
359 field = isl_set_is_wrapping(prog->scop->pet->arrays[i]->extent); in collect_array_info()
365 prog->scop->pet->arrays[i], arrays) < 0) in collect_array_info()
[all …]
Dprint.h36 __isl_take isl_printer *p, struct ppcg_scop *scop);
38 __isl_take isl_printer *p, struct ppcg_scop *scop);
/external/llvm-project/polly/utils/
Djscop2cloog.py5 def getDomains(scop): argument
6 statements = scop['statements'];
11 for statement in scop['statements']:
18 def getSchedules(scop): argument
19 statements = scop['statements'];
24 for statement in scop['statements']:
29 def writeCloog(scop): argument
50 context = scop['context']
51 domains = getDomains(scop)
52 schedules = getSchedules(scop)
[all …]
/external/llvm-project/polly/utils/pyscop/
Djscop2iscc.py5 def printDomain(scop): argument
9 for statement in scop['statements']:
15 def printAccesses(scop): argument
19 for statement in scop['statements']:
29 for statement in scop['statements']:
37 def printSchedule(scop): argument
41 for statement in scop['statements']:
55 scop = json.load(inputFile)
57 printDomain(scop)
58 printAccesses(scop)
[all …]
/external/llvm-project/polly/lib/Analysis/
DScopBuilder.cpp303 int OldDepth = scop->getRelativeLoopDepth(OldL); in adjustDomainDimensions()
304 int NewDepth = scop->getRelativeLoopDepth(NewL); in adjustDomainDimensions()
322 auto &R = scop->getRegion(); in adjustDomainDimensions()
352 PWACtx PWAC = scop->getPwAff(E, BB, NonNegative, &RecordedAssumptions); in getPwAff()
450 getUniqueNonErrorValue(PHI, &scop->getRegion(), LI, DT)); in buildConditionSets()
489 Region &R = scop->getRegion(); in buildConditionSets()
553 scop->invalidate(COMPLEXITY, TI ? TI->getDebugLoc() : DebugLoc(), in buildConditionSets()
605 if (!scop->isNonAffineSubRegion(SubRegion)) { in propagateDomainConstraints()
613 isl::set &Domain = scop->getOrInitEmptyDomain(BB); in propagateDomainConstraints()
619 Domain = Domain.align_params(scop->getParamSpace()); in propagateDomainConstraints()
[all …]
DScopPass.cpp104 if (auto *scop = S.second.get()) in invalidate() local
106 InnerAM->clear(*scop, scop->getName()); in invalidate()
119 auto *scop = S.second.get(); in invalidate() local
120 if (!scop) in invalidate()
124 InnerAM->getCachedResult<FunctionAnalysisManagerScopProxy>(*scop)) { in invalidate()
138 InnerAM->invalidate(*scop, *InnerPA); in invalidate()
144 InnerAM->invalidate(*scop, PA); in invalidate()
/external/llvm-project/polly/lib/External/pet/include/
Dpet.h554 __isl_take pet_scop *scop, void *user), void *user);
558 __isl_give isl_printer *pet_scop_print_original(__isl_keep pet_scop *scop,
564 __isl_give pet_scop *pet_scop_align_params(__isl_take pet_scop *scop);
567 int pet_scop_has_data_dependent_accesses(__isl_keep pet_scop *scop);
569 int pet_scop_has_data_dependent_conditions(__isl_keep pet_scop *scop);
575 int pet_scop_can_build_ast_exprs(__isl_keep pet_scop *scop);
577 void pet_scop_dump(__isl_keep pet_scop *scop);
578 __isl_null pet_scop *pet_scop_free(__isl_take pet_scop *scop);
581 __isl_give isl_set *pet_scop_get_context(__isl_keep pet_scop *scop);
583 __isl_give isl_schedule *pet_scop_get_schedule(__isl_keep pet_scop *scop);
[all …]
/external/llvm-project/polly/test/ScopDetect/
Dreport-scop-location.ll26 ; CHECK: note: Polly detected an optimizable loop region (scop) in function 'foo'
27 ; CHECK: test.c:2: Start of scop
28 ; CHECK: test.c:3: End of scop
52 ; CHECK: note: Polly detected an optimizable loop region (scop) in function 'bar'
53 ; CHECK: test.c:9: Start of scop
54 ; CHECK: test.c:13: End of scop
/external/llvm-project/polly/test/Isl/CodeGen/
Dmultiple-scops-in-a-row.ll3 ; This test case has two scops in a row. When code generating the first scop,
4 ; the second scop is invalidated. This test case verifies that we do not crash
5 ; due to incorrectly assuming the second scop is still valid.
7 ; We explicitly check here that the second scop is not code generated. Later
Dscalar-references-used-in-scop-compute.ll3 ; Test the code generation in the presence of a scalar out-of-scop value being
29 ; CHECH-LABEL: @scalar-outside-of-scop
32 define void @scalar-outside-of-scop(float* %A) {
Dsplit_edge_of_exit.ll4 ; This is a scop directly precedented by a region, i.e. the scop's entry is the
Dentry_with_trivial_phi_other_bb.ll3 ; The entry of this scop's simple region (entry.split => for.end) has an trivial
4 ; PHI node that is used in a different of the scop region. LCSSA may create such
Dnon-affine-region-implicit-store.ll5 ; causes the dominance check to always fail any block in the scop. The
8 ; implicit stores is assumed to be not from the scop.
/external/llvm-project/polly/test/GPGPU/
Dadd-scalars-in-scop-to-kills.ll6 ; Check that we detect a scop.
11 ; Check that we have a scalar that is not a phi node in the scop.
18 ; Check that we add variables that are local to a scop into the kills that we
22 ; #pragma scop
/external/llvm-project/polly/include/polly/
DScopPass.h238 Scop *scop = SI.getScop(R);
239 if (!scop)
241 Updater.CurrentScop = scop;
243 PreservedAnalyses PassPA = Pass.run(*scop, SAM, AR, Updater);
245 SAM.invalidate(*scop, PassPA);
DScopBuilder.h62 std::unique_ptr<Scop> scop; variable
710 return scop->getRequiredInvariantLoads().count(LI); in isRequiredInvariantLoad()
839 std::unique_ptr<Scop> getScop() { return std::move(scop); } in getScop()
/external/llvm-project/polly/test/Isl/CodeGen/OpenMP/
Dreference-preceeding-loop.ll6 ; of the scop, but does not contain the scop.
/external/llvm-project/polly/test/ScopInfo/
Dbranch-references-loop-scev-with-unknown-iterations.ll23 ; did not identify the branch condition as non-affine during scop detection.
25 ; region (and return an empty scop) or only detect a smaller region if
Dmultidim_fold_constant_dim_zero.ll7 ; We verify that this scop is detected without crash. We also test the
8 ; output to undertand that the scop has been analyzed, but has also been
/external/llvm-project/polly/lib/External/ppcg/tests/
Dscalar.c6 #pragma scop in main()
Dlive_out.c12 #pragma scop in main()

12345