| /external/ltp/pan/cgi/ |
| D | browse.cgi | 43 open (UF, $pf) || next;
44 while ($line = <UF>) {
46 close(UF);
55 open (UF, "gunzip -c $pf|") || next;
57 open (UF, "$pf") || next;
59 while ($line = <UF>) {
61 close(UF);
|
| /external/clang/tools/libclang/ |
| D | CXString.h | 103 static inline StringRef getContents(const CXUnsavedFile &UF) { in getContents() argument
104 return StringRef(UF.Contents, UF.Length); in getContents()
|
| D | CIndexCodeCompletion.cpp | 682 for (auto &UF : unsaved_files) { in clang_codeCompleteAt_Impl() local
684 llvm::MemoryBuffer::getMemBufferCopy(getContents(UF), UF.Filename); in clang_codeCompleteAt_Impl()
685 RemappedFiles.push_back(std::make_pair(UF.Filename, MB.release())); in clang_codeCompleteAt_Impl()
|
| D | Indexing.cpp | 501 for (auto &UF : unsaved_files) { in clang_indexSourceFile_Impl() local
503 llvm::MemoryBuffer::getMemBufferCopy(getContents(UF), UF.Filename); in clang_indexSourceFile_Impl()
504 CInvok->getPreprocessorOpts().addRemappedFile(UF.Filename, MB.get()); in clang_indexSourceFile_Impl()
|
| /external/llvm-project/clang/tools/libclang/ |
| D | CXString.h | 102 static inline StringRef getContents(const CXUnsavedFile &UF) { in getContents() argument
103 return StringRef(UF.Contents, UF.Length); in getContents()
|
| D | CIndexCodeCompletion.cpp | 724 for (auto &UF : unsaved_files) { in clang_codeCompleteAt_Impl() local
726 llvm::MemoryBuffer::getMemBufferCopy(getContents(UF), UF.Filename); in clang_codeCompleteAt_Impl()
727 RemappedFiles.push_back(std::make_pair(UF.Filename, MB.release())); in clang_codeCompleteAt_Impl()
|
| D | Indexing.cpp | 534 for (auto &UF : unsaved_files) { in clang_indexSourceFile_Impl() local
536 llvm::MemoryBuffer::getMemBufferCopy(getContents(UF), UF.Filename); in clang_indexSourceFile_Impl()
537 CInvok->getPreprocessorOpts().addRemappedFile(UF.Filename, MB.get()); in clang_indexSourceFile_Impl()
|
| /external/clang/test/Layout/ |
| D | ms-x86-member-pointers.cpp | 15 struct UF { char a; int (U::*mp)(); }; argument
80 sizeof(UF)];
|
| /external/llvm-project/clang/test/Layout/ |
| D | ms-x86-member-pointers.cpp | 15 struct UF { char a; int (U::*mp)(); }; struct
80 sizeof(UF)];
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | VPlan.h | 114 unsigned UF;
129 VectorizerValueMap(unsigned UF, unsigned VF) : UF(UF), VF(VF) {} in VectorizerValueMap()
138 assert(Part < UF && "Queried Vector Part is too large."); in hasVectorValue()
142 assert(Entry.size() == UF && "VectorParts has wrong dimensions."); in hasVectorValue()
153 assert(Instance.Part < UF && "Queried Scalar Part is too large."); in hasScalarValue()
158 assert(Entry.size() == UF && "ScalarParts has wrong dimensions."); in hasScalarValue()
183 VectorParts Entry(UF); in setVectorValue()
194 ScalarParts Entry(UF); in setScalarValue()
197 for (unsigned Part = 0; Part < UF; ++Part) in setScalarValue()
237 VPTransformState(unsigned VF, unsigned UF, LoopInfo *LI, DominatorTree *DT, in VPTransformState()
[all …]
|
| D | LoopVectorize.cpp | 408 AC(AC), ORE(ORE), VF(VecWidth), UF(UnrollFactor), in InnerLoopVectorizer()
433 void widenGEP(GetElementPtrInst *GEP, unsigned UF, unsigned VF,
439 void widenPHIInstruction(Instruction *PN, unsigned UF, unsigned VF);
712 unsigned UF; member in llvm::InnerLoopVectorizer
825 auto NewDIL = DIL->cloneByMultiplyingDuplicationFactor(UF * VF); in setDebugLocFromInst()
1738 for (unsigned Part = 0; Part < UF; ++Part) { in createVectorIntOrFpInductionPHI()
1882 for (unsigned Part = 0; Part < UF; ++Part) { in widenIntOrFpInduction()
1988 for (unsigned Part = 0; Part < UF; ++Part) { in buildScalarSteps()
2205 for (unsigned Part = 0; Part < UF; Part++) { in vectorizeInterleaveGroup()
2246 for (unsigned Part = 0; Part < UF; Part++) { in vectorizeInterleaveGroup()
[all …]
|
| D | VPlan.cpp | 262 for (unsigned Part = 0, UF = State->UF; Part < UF; ++Part) { in execute() local
351 for (unsigned Part = 0; Part < State.UF; ++Part) in execute()
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 761 NodeToUsesMap::iterator UF = Uses.find(Node); in recalculatePlacement() local
762 assert(UF != Uses.end() && "Used node with no use information"); in recalculatePlacement()
763 UseSet &Us = UF->second; in recalculatePlacement()
970 NodeToUsesMap::iterator UF = Uses.find(Node); in separateChainForNode() local
971 assert(UF != Uses.end()); in separateChainForNode()
972 UseSet &Us = UF->second; in separateChainForNode()
983 Uses.erase(UF); in separateChainForNode()
1007 NodeToUsesMap::iterator UF = Uses.find(N); in separateConstantChains() local
1008 assert(UF != Uses.end()); in separateConstantChains()
1009 UseSet &Us = UF->second; in separateConstantChains()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 771 NodeToUsesMap::iterator UF = Uses.find(Node); in recalculatePlacement() local
772 assert(UF != Uses.end() && "Used node with no use information"); in recalculatePlacement()
773 UseSet &Us = UF->second; in recalculatePlacement()
980 NodeToUsesMap::iterator UF = Uses.find(Node); in separateChainForNode() local
981 assert(UF != Uses.end()); in separateChainForNode()
982 UseSet &Us = UF->second; in separateChainForNode()
993 Uses.erase(UF); in separateChainForNode()
1017 NodeToUsesMap::iterator UF = Uses.find(N); in separateConstantChains() local
1018 assert(UF != Uses.end()); in separateConstantChains()
1019 UseSet &Us = UF->second; in separateConstantChains()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 753 NodeToUsesMap::iterator UF = Uses.find(Node); in recalculatePlacement() local
754 assert(UF != Uses.end() && "Used node with no use information"); in recalculatePlacement()
755 UseSet &Us = UF->second; in recalculatePlacement()
969 NodeToUsesMap::iterator UF = Uses.find(Node); in separateChainForNode() local
970 assert(UF != Uses.end()); in separateChainForNode()
971 UseSet &Us = UF->second; in separateChainForNode()
984 Uses.erase(UF); in separateChainForNode()
1009 NodeToUsesMap::iterator UF = Uses.find(N); in separateConstantChains() local
1010 assert(UF != Uses.end()); in separateConstantChains()
1011 UseSet &Us = UF->second; in separateConstantChains()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Vectorize/ |
| D | VPlan.h | 124 unsigned UF;
139 VectorizerValueMap(unsigned UF, ElementCount VF) : UF(UF), VF(VF) {} in VectorizerValueMap()
148 assert(Part < UF && "Queried Vector Part is too large."); in hasVectorValue()
152 assert(Entry.size() == UF && "VectorParts has wrong dimensions."); in hasVectorValue()
163 assert(Instance.Part < UF && "Queried Scalar Part is too large."); in hasScalarValue()
170 assert(Entry.size() == UF && "ScalarParts has wrong dimensions."); in hasScalarValue()
195 VectorParts Entry(UF); in setVectorValue()
206 ScalarParts Entry(UF); in setScalarValue()
209 for (unsigned Part = 0; Part < UF; ++Part) in setScalarValue()
249 VPTransformState(ElementCount VF, unsigned UF, LoopInfo *LI, in VPTransformState()
[all …]
|
| D | VPlan.cpp | 425 for (unsigned Part = 0, UF = State->UF; Part < UF; ++Part) { in execute() local
530 for (unsigned Part = 0; Part < State.UF; ++Part) in execute()
591 for (unsigned Part = 0, UF = State->UF; Part < UF; ++Part) in execute() local
1013 for (unsigned Part = 0, UF = State.UF; Part < UF; ++Part) { in execute() local
|
| D | LoopVectorize.cpp | 462 AC(AC), ORE(ORE), VF(VecWidth), UF(UnrollFactor), in InnerLoopVectorizer()
509 unsigned UF, ElementCount VF, bool IsPtrLoopInvariant,
515 void widenPHIInstruction(Instruction *PN, unsigned UF, ElementCount VF);
823 unsigned UF; member in llvm::InnerLoopVectorizer
1070 DIL->cloneByMultiplyingDuplicationFactor(UF * VF.getKnownMinValue()); in setDebugLocFromInst()
2052 for (unsigned Part = 0; Part < UF; ++Part) { in createVectorIntOrFpInductionPHI()
2176 for (unsigned Part = 0; Part < UF; ++Part) { in widenIntOrFpInduction()
2316 for (unsigned Part = 0; Part < UF; ++Part) { in buildScalarSteps()
2544 for (unsigned Part = 0; Part < UF; Part++) { in vectorizeInterleaveGroup()
2586 for (unsigned Part = 0; Part < UF; Part++) { in vectorizeInterleaveGroup()
[all …]
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 295 AC(AC), VF(VecWidth), UF(UnrollFactor), in InnerLoopVectorizer()
378 void widenPHIInstruction(Instruction *PN, VectorParts &Entry, unsigned UF,
481 ValueMap(unsigned UnrollFactor) : UF(UnrollFactor) {} in ValueMap()
491 Entry.assign(UF, Val); in splat()
499 Entry.resize(UF); in get()
500 assert(Entry.size() == UF); in get()
507 unsigned UF; member
547 unsigned UF; member in __anonaac874760111::InnerLoopVectorizer
1898 for (unsigned Part = 0; Part < UF; ++Part) { in createVectorIntInductionPHI()
1963 for (unsigned Part = 0; Part < UF; ++Part) in widenIntInduction()
[all …]
|
| /external/llvm-project/llvm/test/Transforms/LoopVectorize/PowerPC/ |
| D | reg-usage.ll | 11 ; CHECK-PWR8: Setting best plan to VF=16, UF=4
13 ; CHECK-PWR9: Setting best plan to VF=8, UF=8
49 ; CHECK: Setting best plan to VF=16, UF=4
82 ; CHECK: Setting best plan to VF=2, UF=12
110 ; CHECK: Setting best plan to VF=1, UF=12
|
| /external/llvm-project/llvm/docs/Proposals/ |
| D | VectorizationPlan.rst | 47 according to an Unroll Factor (UF).
67 VF and UF), mixed vectorization: vectorizing a loop with SLP patterns
72 related to a range of possible VF's and UF's must be represented efficiently.
82 replicated VF*UF times to handle scalarized and predicated instructions.
99 Once the best VPlan is determined, including the best VF and UF, this VPlan
138 multiple candidate VF's and UF's.
|
| /external/swiftshader/tests/regres/llvm/ |
| D | 10.0.0.pub.key | 29 +UF/kSW1rb5qhfXcGGubu48OMdtSfok9lOc0Q1L4HNlGE4lUBkZzmI7Ykqfl+Bwr
|
| /external/swiftshader/tests/kokoro/gcp_ubuntu/ |
| D | hans-gpg-key.asc | 29 +UF/kSW1rb5qhfXcGGubu48OMdtSfok9lOc0Q1L4HNlGE4lUBkZzmI7Ykqfl+Bwr
|
| /external/llvm-project/llvm/test/Transforms/LoopVectorize/ |
| D | miniters.ll | 10 …kip the vector loop and jump to scalar.ph directly when loop iteration number is less than VF * UF.
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | miniters.ll | 11 …kip the vector loop and jump to scalar.ph directly when loop iteration number is less than VF * UF.
|