/external/lzma/CPP/7zip/Common/ |
CWrappers.h | 38 UInt64 Processed;
52 UInt64 Processed;
63 Processed = 0;
67 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
85 UInt64 Processed;
96 Processed = 0;
99 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
|
CWrappers.cpp | 66 p->Processed += size;
81 Processed = 0;
156 Processed += (Cur - Buf);
207 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 | 1106 if (!inStreamSpec->Processed[subIndex])
|
/external/llvm/lib/Analysis/ |
IVUsers.cpp | 119 // Add this IV user to the Processed set before returning false to ensure that 121 if (!Processed.insert(I).second) 155 if (isa<PHINode>(User) && Processed.count(User)) 174 // If User is already in Processed, we don't want to recurse into it again, 178 if (isa<PHINode>(User) || Processed.count(User) || 184 } else if (Processed.count(User) || !AddUsersImpl(User, SimpleLoopNests)) { 306 Processed.clear(); 355 Parent->Processed.erase(this->getUser());
|
ScalarEvolutionExpander.cpp | [all...] |
/external/llvm/include/llvm/Analysis/ |
IVUsers.h | 125 SmallPtrSet<Instruction*,16> Processed; 168 return Processed.count(Inst);
|
ScalarEvolutionExpander.h | 121 SmallPtrSet<const SCEV *, 8> Processed; 122 return isHighCostExpansionHelper(Expr, L, Processed); 201 SmallPtrSetImpl<const SCEV *> &Processed);
|
/external/llvm/lib/Transforms/Scalar/ |
EarlyCSE.cpp | 349 Processed(false) {} 363 bool isProcessed() { return Processed; } 364 void process() { Processed = true; } 377 bool Processed; 659 // Check if the node needs to be processed. 673 // It has been processed, and there are no more children to process,
|
LoopStrengthReduce.cpp | 746 SmallPtrSetImpl<const SCEV*> &Processed, 755 Processed, SE); 758 Processed, SE); 761 Processed, SE); 764 if (!Processed.insert(S).second) 770 if (isHighCostExpansion(*I, Processed, SE)) 780 return isHighCostExpansion(Mul->getOperand(1), Processed, SE); [all...] |
/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 122 if (I->getNodeId() != Processed) { 138 dbgs() << "Processed value not in any map!"; 329 // Recompute the NodeId and correct processed operands, adding the node to 356 // If we reach here, the node was processed, potentially creating new nodes. 357 // Mark it as processed and add its users to the worklist as appropriate [all...] |
LegalizeTypes.h | 41 /// ReadyToProcess - All operands have been processed, so this node is ready 53 /// Processed - This is a node that has already been processed. 54 Processed = -3 123 /// processed. 185 /// GetPromotedInteger - Given a processed operand Op which was promoted to a 303 /// GetExpandedInteger - Given a processed operand Op which was expanded into 377 /// GetSoftenedFloat - Given a processed operand Op which was converted to an 450 /// GetExpandedFloat - Given a processed operand Op which was expanded into 549 /// GetScalarizedVector - Given a processed one-element vector Op which wa [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
DwarfDebug.cpp | 710 DenseSet<InlinedVariable> &Processed) { 718 Processed.insert(Var); 879 DenseSet<InlinedVariable> &Processed) { 881 collectVariableInfoFromMMITable(Processed); 885 if (Processed.count(IV)) 902 Processed.insert(IV); [all...] |
/external/v8/tools/ |
logreader.js | 96 * @return {Array.<number>} Processed stack.
|
/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. 90 // Set of already processed instructions in the current block. 91 SmallPtrSet<MachineInstr*, 8> Processed; 356 /// two-address instruction which is being processed. It also returns the last 547 /// the two-address instruction that's being processed. 744 if (IsCopy && !Processed.insert(UseMI).second) 780 /// processCopy - If the specified instruction is not yet processed, process it 793 if (Processed.count(MI)) 812 Processed.insert(MI); [all...] |
/external/llvm/lib/Target/X86/ |
X86FloatingPoint.cpp | 323 SmallPtrSet<MachineBasicBlock*, 8> Processed; 327 for (MachineBasicBlock *BB : depth_first_ext(Entry, Processed)) 331 if (MF.size() != Processed.size()) 333 if (Processed.insert(BB).second) [all...] |