| /external/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 59 bool SinkInstruction(Instruction *I, SmallPtrSetImpl<Instruction*> &Stores);
135 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local
148 if (SinkInstruction(Inst, Stores)) in ProcessBlock()
158 SmallPtrSetImpl<Instruction *> &Stores) { in isSafeToMove() argument
161 Stores.insert(Inst); in isSafeToMove()
167 for (Instruction *S : Stores) in isSafeToMove()
233 SmallPtrSetImpl<Instruction *> &Stores) { in SinkInstruction() argument
242 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction()
|
| D | Scalarizer.cpp | 632 ValueVector Stores; in visitStoreInst() local
633 Stores.resize(NumElems); in visitStoreInst()
636 Stores[I] = Builder.CreateAlignedStore(Val[I], Ptr[I], Align); in visitStoreInst()
638 transferMetadata(&SI, Stores); in visitStoreInst()
|
| D | SROA.cpp | 3354 SmallVector<StoreInst *, 4> Stores; in presplitLoadsAndStores() local
3423 Stores.push_back(SI); in presplitLoadsAndStores()
3465 Stores.erase( in presplitLoadsAndStores()
3466 std::remove_if(Stores.begin(), Stores.end(), in presplitLoadsAndStores()
3502 Stores.end()); in presplitLoadsAndStores()
3507 Stores.erase(std::remove_if(Stores.begin(), Stores.end(), in presplitLoadsAndStores()
3513 Stores.end()); in presplitLoadsAndStores()
3525 if (Loads.empty() && Stores.empty()) in presplitLoadsAndStores()
3610 if (!Stores.empty() && SplitOffsetsMap.count(SI)) { in presplitLoadsAndStores()
3666 for (StoreInst *SI : Stores) { in presplitLoadsAndStores()
|
| /external/llvm/lib/Analysis/ |
| D | AliasAnalysisEvaluator.cpp | 150 SetVector<Value *> Stores; in runOnFunction() local
162 Stores.insert(&*I); in runOnFunction()
227 for (SetVector<Value *>::iterator I2 = Stores.begin(), E2 = Stores.end(); in runOnFunction()
256 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); in runOnFunction()
258 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runOnFunction()
|
| D | LoopAccessAnalysis.cpp | 1365 ValueVector Stores; in analyzeLoop() local
1432 Stores.push_back(St); in analyzeLoop()
1443 if (!Stores.size()) { in analyzeLoop()
1461 for (I = Stores.begin(), IE = Stores.end(); I != IE; ++I) { in analyzeLoop()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonStoreWidening.cpp | 86 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO);
87 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI);
168 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument
175 for (auto SI : Stores) { in instrAliased()
191 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument
194 if (instrAliased(Stores, *I)) in instrAliased()
|
| /external/llvm/test/MC/Disassembler/AArch64/ |
| D | ldp-offset-predictable.txt | 4 # Stores are OK.
|
| D | ldp-preind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
| D | ldp-postind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
| /external/llvm/test/Analysis/CostModel/AArch64/ |
| D | store.ll | 5 ; Stores of <2 x i64> should be expensive because we don't split them and
|
| /external/llvm/test/Transforms/InstMerge/ |
| D | st_sink_barrier_call.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_no_barrier_call.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_no_barrier_store.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_no_barrier_load.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_two_stores.ll | 2 ; Stores sunks into the footer.
|
| D | ld_hoist_st_sink.ll | 2 ; Loads are hoisted into the header. Stores sunks into the footer.
|
| /external/autotest/client/site_tests/policy_CookiesBlockedForUrls/ |
| D | control | 30 -Stores cookies for Urls that match the url patterns listed in the
|
| /external/autotest/client/site_tests/policy_CookiesAllowedForUrls/ |
| D | control | 31 - Stores cookies for URLs that do not match the URL patterns listed in the
|
| /external/clang/lib/CodeGen/ |
| D | CGExprCXX.cpp | 364 SmallVector<std::pair<CharUnits, CharUnits>, 1> Stores; in EmitNullBaseClassInitialization() local
365 Stores.emplace_back(CharUnits::Zero(), NVSize); in EmitNullBaseClassInitialization()
372 std::pair<CharUnits, CharUnits> LastStore = Stores.pop_back_val(); in EmitNullBaseClassInitialization()
380 Stores.emplace_back(SplitBeforeOffset, SplitBeforeSize); in EmitNullBaseClassInitialization()
386 Stores.emplace_back(SplitAfterOffset, SplitAfterSize); in EmitNullBaseClassInitialization()
409 for (std::pair<CharUnits, CharUnits> Store : Stores) { in EmitNullBaseClassInitialization()
423 for (std::pair<CharUnits, CharUnits> Store : Stores) { in EmitNullBaseClassInitialization()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | ArgumentPromotion.cpp | 178 SmallVector<StoreInst *, 16> Stores; in canPaddingBeAccessed() local
191 Stores.push_back(Store); in canPaddingBeAccessed()
198 for (StoreInst *Store : Stores) in canPaddingBeAccessed()
|
| /external/libpng/scripts/ |
| D | README.txt | 4 pnglibconf.h.prebuilt => Stores configuration settings
|
| /external/webrtc/webrtc/modules/video_capture/mac/qtkit/ |
| D | video_capture_qtkit_info_objc.mm | 169 /// ***** Stores them in an NSArray instance
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | atomics.ll | 44 ; Stores
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 3276 bool vectorizeStores(ArrayRef<StoreInst *> Stores, int costThreshold,
3343 bool SLPVectorizer::vectorizeStores(ArrayRef<StoreInst *> Stores, in vectorizeStores() argument
3356 for (unsigned i = 0, e = Stores.size(); i < e; ++i) { in vectorizeStores()
3357 const DataLayout &DL = Stores[i]->getModule()->getDataLayout(); in vectorizeStores()
3370 if (R.isConsecutiveAccess(Stores[i], Stores[k], DL)) { in vectorizeStores()
3371 Tails.insert(Stores[k]); in vectorizeStores()
3372 Heads.insert(Stores[i]); in vectorizeStores()
3373 ConsecutiveChain[Stores[i]] = Stores[k]; in vectorizeStores()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCScheduleP8.td | 33 // Load/Store pipelines can handle Stores, fixed-point loads, and simple
248 // Stores are dual-issued from the issue queue, so may only take up one
|