OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Dependences
(Results
1 - 8
of
8
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonVectorLoopCarriedReuse.cpp
11
// to identify loop carried
dependences
. This is scalar replacement for vector
58
cl::desc("Maximum distance of loop carried
dependences
that are handled"),
194
SetVector<DepChain *>
Dependences
;
372
for (auto *D :
Dependences
) {
589
Dependences
.clear();
599
llvm::for_each(
Dependences
, std::default_delete<DepChain>());
643
for (auto *D :
Dependences
) {
660
Dependences
.insert(D);
664
LLVM_DEBUG(dbgs() << "Found " <<
Dependences
.size() << "
dependences
\n")
[
all
...]
/src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
VectorUtils.h
704
// To avoid breaking
dependences
, vectorized instructions of an interleave
811
/// Holds
dependences
among the memory accesses in the loop. It maps a source
813
DenseMap<Instruction *, SmallPtrSet<Instruction *, 2>>
Dependences
;
899
//
dependences
could potentially be reordered safely.
909
// Code motion for interleaved accesses can't violate WAR
dependences
.
925
return
Dependences
.find(Src) ==
Dependences
.end() ||
926
!
Dependences
.lookup(Src).count(Sink);
929
/// Collect the
dependences
from LoopAccessInfo.
931
/// We process the
dependences
once during the interleaved access analysis t
[
all
...]
LoopAccessAnalysis.h
53
/// Checks memory
dependences
among accesses to the same underlying
98
// Can vectorize safely without RT checks. All
dependences
are known to be
117
// FIXME: If we only have loop-independent forward
dependences
(e.g. a
120
// enumerating loop-independent forward
dependences
in
231
/// Returns the memory
dependences
. If null is returned we exceeded
235
return RecordDependences ? &
Dependences
: nullptr;
238
void clearDependences() {
Dependences
.clear(); }
265
/// expressions need to be made in order to avoid unknown
dependences
. For
294
///
dependences
are safe for vectorization, require RT checks or are known to
298
//// True if
Dependences
reflects the dependences in th
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopDistribute.cpp
11
// tries to isolate the offending
dependences
into a new loop allowing
612
/// number of unsafe
dependences
that start out from this instruction minus
635
const SmallVectorImpl<Dependence> &
Dependences
) {
638
LLVM_DEBUG(dbgs() << "Backward
dependences
:\n");
639
for (auto &Dep :
Dependences
)
691
auto *
Dependences
= LAI->getDepChecker().getDependences();
692
if (!
Dependences
||
Dependences
->empty())
693
return fail("NoUnsafeDeps", "no unsafe
dependences
to isolate");
699
// with unsafe
dependences
into "cyclic" partition otherwise put each stor
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp
103
/// We collect
dependences
up to this threshold.
105
MaxDependences("max-
dependences
", cl::Hidden,
106
cl::desc("Maximum number of
dependences
collected by "
1304
// Positive
dependences
might cause troubles because vectorizing them might
1694
// Gather
dependences
unless we accumulated MaxDependences
1695
//
dependences
. In that case return as soon as we find the first
1700
Dependences
.push_back(Dependence(A.second, B.second, Type));
1702
if (
Dependences
.size() >= MaxDependences) {
1704
Dependences
.clear();
1706
<< "Too many
dependences
, stopped recording\n")
[
all
...]
/src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGOpenMPRuntime.h
116
SmallVector<DependData, 4>
Dependences
;
CGOpenMPRuntime.cpp
5124
// Process list of
dependences
.
5128
emitDependClause(CGF, Data.
Dependences
, Loc);
5140
if (!Data.
Dependences
.empty()) {
5156
if (!Data.
Dependences
.empty()) {
5173
if (!Data.
Dependences
.empty()) {
5190
if (!Data.
Dependences
.empty())
CGStmtOpenMP.cpp
2335
//
dependences
of 'safelen' iterations are possible.
2345
//
dependences
of 'safelen' iterations are possible.
4328
// Build list of
dependences
.
4331
Data.
Dependences
.emplace_back(C->getDependencyKind(), C->getModifier());
4647
// Build list of
dependences
.
4650
Data.
Dependences
.emplace_back(C->getDependencyKind(), C->getModifier());
Completed in 91 milliseconds
Indexes created Mon Sep 21 00:25:25 UTC 2026