| /external/llvm/lib/Analysis/ |
| IVUsers.cpp | 115 // Add this IV user to the Processed set before returning false to ensure that
117 if (!Processed.insert(I))
146 if (isa<PHINode>(User) && Processed.count(User))
165 // If User is already in Processed, we don't want to recurse into it again,
169 if (isa<PHINode>(User) || Processed.count(User) ||
175 } else if (Processed.count(User) || !AddUsersImpl(User, SimpleLoopNests)) {
274 Processed.clear();
323 Parent->Processed.erase(this->getUser());
|
| ProfileInfo.cpp | 780 std::set<const BasicBlock *> Processed;
783 if (Processed.insert(*NBB).second) {
802 Processed.clear();
805 if (Processed.insert(*NBB).second) {
817 Processed.clear();
820 if (Processed.insert(*NBB).second) {
870 std::set<const BasicBlock *> Processed;
873 if (Processed.insert(*NBB).second) {
936 std::set<const BasicBlock *> Processed;
939 if (Processed.insert(*NBB).second)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IVUsers.h | 127 SmallPtrSet<Instruction*,16> Processed;
170 return Processed.count(Inst);
|
| /external/llvm/lib/CodeGen/ |
| TwoAddressInstructionPass.cpp | 145 SmallPtrSet<MachineInstr*, 8> &Processed);
148 SmallPtrSet<MachineInstr*, 8> &Processed);
151 SmallPtrSet<MachineInstr*, 8> &Processed);
355 /// two-address instruction which is being processed. It also returns the last
568 /// the two-address instruction that's being processed.
731 SmallPtrSet<MachineInstr*, 8> &Processed) {
739 if (IsCopy && !Processed.insert(UseMI))
775 /// ProcessCopy - If the specified instruction is not yet processed, process it
789 SmallPtrSet<MachineInstr*, 8> &Processed) {
790 if (Processed.count(MI)
[all...] |
| LiveVariables.cpp | 249 SmallSet<unsigned, 8> Processed;
252 if (Processed.count(SubReg))
263 Processed.insert(*SS);
|
| /external/llvm/lib/Transforms/Scalar/ |
| EarlyCSE.cpp | 298 Processed(false) {}
312 bool isProcessed() { return Processed; }
313 void process() { Processed = true; }
325 bool Processed;
543 // Check if the node needs to be processed.
559 // It has been processed, and there are no more children to process,
|
| IndVarSimplify.cpp | [all...] |
| LoopStrengthReduce.cpp | 671 SmallPtrSet<const SCEV*, 8> &Processed,
680 Processed, SE);
683 Processed, SE);
686 Processed, SE);
689 if (!Processed.insert(S))
695 if (isHighCostExpansion(*I, Processed, SE))
705 return isHighCostExpansion(Mul->getOperand(1), Processed, SE);
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.cpp | 30 // If a node is not processed, then none of its values should be mapped by any
33 // If a node is processed, then each value with an illegal type must be mapped
39 // the node being processed may be put in a map before being marked Processed.
51 // node that morphs, or it is a processed value that was mapped to some other
120 if (I->getNodeId() != Processed) {
136 dbgs() << "Processed value not in any map!";
319 // Recompute the NodeId and correct processed operands, adding the node to
346 // If we reach here, the node was processed, potentially creating new nodes.
347 // Mark it as processed and add its users to the worklist as appropriate
[all...] |
| LegalizeTypes.h | 42 /// ReadyToProcess - All operands have been processed, so this node is ready
54 /// Processed - This is a node that has already been processed.
55 Processed = -3
115 /// processed.
178 /// GetPromotedInteger - Given a processed operand Op which was promoted to a
294 /// GetExpandedInteger - Given a processed operand Op which was expanded into
368 /// GetSoftenedFloat - Given a processed operand Op which was converted to an
441 /// GetExpandedFloat - Given a processed operand Op which was expanded into
497 /// GetScalarizedVector - Given a processed one-element vector Op which wa
[all...] |
| /external/llvm/tools/opt/ |
| opt.cpp | 374 StringSet<> Processed;
382 if (!Name.empty() && Processed.insert(Name)) {
|
| /external/v8/tools/ |
| logreader.js | 96 * @return {Array.<number>} Processed stack.
|
| /external/llvm/lib/Target/X86/ |
| X86FloatingPoint.cpp | 362 SmallPtrSet<MachineBasicBlock*, 8> Processed;
367 I = df_ext_begin(Entry, Processed), E = df_ext_end(Entry, Processed);
372 if (MF.size() != Processed.size())
374 if (Processed.insert(BB))
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jstemplate.js | 21 * If the templates is processed again, changed values are merely
92 * processed in place. After processing, it will still be a valid
93 * template that, if processed again with the same data, will remain
153 * Map from jstid to processed js attributes.
240 * @return {Object} The jstcache entry. The processed jst attributes
433 * is processed in jstProcessInner_(), below. That function
479 * jsselect attribute will not be processed again, or else directly
561 // store the children to be processed.
585 * @param {Element} template The currently processed node of the template.
635 // are needed. If the template is first processed, as many
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 21 * If the templates is processed again, changed values are merely
92 * processed in place. After processing, it will still be a valid
93 * template that, if processed again with the same data, will remain
153 * Map from jstid to processed js attributes.
240 * @return {Object} The jstcache entry. The processed jst attributes
433 * is processed in jstProcessInner_(), below. That function
479 * jsselect attribute will not be processed again, or else directly
561 // store the children to be processed.
585 * @param {Element} template The currently processed node of the template.
635 // are needed. If the template is first processed, as man
[all...] |
