HomeSort by relevance Sort by last modified time
    Searched refs:Processed (Results 1 - 25 of 26) sorted by null

1 2

  /external/lzma/CPP/7zip/Common/
CWrappers.h 23 UInt64 Processed;
42 UInt64 Processed;
57 UInt64 Processed;
68 Processed = 0;
72 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
90 UInt64 Processed;
101 Processed = 0;
104 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
CWrappers.cpp 51 p->Processed += curSize;
68 p->Processed += size;
76 Processed = 0;
84 Processed = 0;
160 Processed += (Cur - Buf);
211 Processed += size;
  /external/llvm/tools/opt/
BreakpointPrinter.cpp 52 StringSet<> Processed;
61 if (!Name.empty() && Processed.insert(Name).second) {
  /external/lzma/CPP/7zip/Archive/7z/
7zFolderInStream.cpp 23 Processed.Clear();
56 Processed.Add(result == S_OK);
73 Processed.Add(true);
7zFolderInStream.h 37 CRecordVector<bool> Processed;
7zUpdate.cpp     [all...]
  /external/llvm/lib/Analysis/
IVUsers.cpp 122 // Add this IV user to the Processed set before returning false to ensure that
124 if (!Processed.insert(I).second)
163 if (isa<PHINode>(User) && Processed.count(User))
182 // If User is already in Processed, we don't want to recurse into it again,
186 if (isa<PHINode>(User) || Processed.count(User) ||
192 } else if (Processed.count(User) || !AddUsersImpl(User, SimpleLoopNests)) {
321 Processed.clear();
370 Parent->Processed.erase(this->getUser());
ScalarEvolutionExpander.cpp     [all...]
  /external/llvm/include/llvm/Analysis/
IVUsers.h 127 SmallPtrSet<Instruction*, 16> Processed;
173 return Processed.count(Inst);
ScalarEvolutionExpander.h 126 SmallPtrSet<const SCEV *, 8> Processed;
127 return isHighCostExpansionHelper(Expr, L, At, Processed);
233 SmallPtrSetImpl<const SCEV *> &Processed);
  /external/lzma/CPP/7zip/Bundles/LzmaSpec/
LzmaSpec.cpp 33 UInt64 Processed;
35 void Init() { Processed = 0; }
42 Processed++;
51 UInt64 Processed;
53 void Init() { Processed = 0; }
59 Processed++;
663 PrintUInt64("Read ", inStream.Processed);
664 PrintUInt64("Written ", lzmaDecoder.OutWindow.OutStream.Processed);
674 if (lzmaDecoder.OutWindow.OutStream.Processed != unpackSize)
  /external/webrtc/webrtc/modules/video_coding/
video_receiver.cc 70 _receiveStatsTimer.Processed();
104 _keyRequestTimer.Processed();
122 _retransmissionTimer.Processed();
video_coding_impl.h 46 void Processed();
video_sender.cc 59 _sendStatsTimer.Processed();
video_coding_impl.cc 36 void VCMProcessTimer::Processed() {
  /external/llvm/lib/Target/Hexagon/
HexagonGenPredicate.cpp 424 // If the processed instruction was C2_tfrrp (i.e. Rn = Pm; Pk = Rn),
497 VectOfInst Processed, Copy;
505 Processed.insert(MI);
511 auto Done = [Processed] (MachineInstr *MI) -> bool {
512 return Processed.count(MI);
  /external/lzma/CPP/7zip/Compress/
LzmaEncoder.cpp 151 _inputProcessed = inWrap.Processed;
  /external/llvm/lib/CodeGen/SelectionDAG/
LegalizeTypes.cpp 32 // If a node is not processed, then none of its values should be mapped by any
35 // If a node is processed, then each value with an illegal type must be mapped
41 // the node being processed may be put in a map before being marked Processed.
53 // node that morphs, or it is a processed value that was mapped to some other
121 if (Node.getNodeId() != Processed) {
137 dbgs() << "Processed value not in any map!";
331 // Recompute the NodeId and correct processed operands, adding the node to
358 // If we reach here, the node was processed, potentially creating new nodes.
359 // Mark it as processed and add its users to the worklist as appropriate
    [all...]
  /external/llvm/lib/Transforms/Scalar/
EarlyCSE.cpp 365 Processed(false) {}
379 bool isProcessed() { return Processed; }
380 void process() { Processed = true; }
393 bool Processed;
793 // Check if the node needs to be processed.
807 // It has been processed, and there are no more children to process,
    [all...]
LoopStrengthReduce.cpp 753 SmallPtrSetImpl<const SCEV*> &Processed,
762 Processed, SE);
765 Processed, SE);
768 Processed, SE);
771 if (!Processed.insert(S).second)
776 if (isHighCostExpansion(S, Processed, SE))
786 return isHighCostExpansion(Mul->getOperand(1), Processed, SE);
    [all...]
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfDebug.cpp 734 DenseSet<InlinedVariable> &Processed) {
742 Processed.insert(Var);
    [all...]
  /external/llvm/lib/CodeGen/
LiveVariables.cpp 250 SmallSet<unsigned, 8> Processed;
253 if (Processed.count(SubReg))
264 Processed.insert(*SS);
TwoAddressInstructionPass.cpp 83 // The current basic block being processed.
89 // Set of already processed instructions in the current block.
90 SmallPtrSet<MachineInstr*, 8> Processed;
354 /// instruction which is being processed. It also returns the last def location
544 /// instruction that's being processed.
742 if (IsCopy && !Processed.insert(UseMI).second)
778 /// If the specified instruction is not yet processed, process it if it's a
791 if (Processed.count(MI))
810 Processed.insert(MI);
    [all...]
  /external/llvm/lib/Target/X86/
X86FloatingPoint.cpp 322 SmallPtrSet<MachineBasicBlock*, 8> Processed;
326 for (MachineBasicBlock *BB : depth_first_ext(Entry, Processed))
330 if (MF.size() != Processed.size())
332 if (Processed.insert(&BB).second)
    [all...]
  /external/v8/tools/
logreader.js 145 * @return {Array.<number>} Processed stack.

Completed in 4884 milliseconds

1 2