/external/webkit/Source/WebCore/xml/ |
XPathStep.cpp | 44 Step::Step(Axis axis, const NodeTest& nodeTest, const Vector<Predicate*>& predicates) 51 Step::~Step() 57 void Step::optimize() 73 void optimizeStepPair(Step* first, Step* second, bool& dropSecondStep) 77 if (first->m_axis == Step::DescendantOrSelfAxis 78 && first->m_nodeTest.kind() == Step::NodeTest::AnyNodeTest 86 if (second->m_axis == Step::ChildAxis && second->predicatesAreContextListInsensitive()) [all...] |
XPathGrammar.y | 61 Step::Axis axis; 62 Step::NodeTest* nodeTest; 69 Step* step; 94 %type <step> Step 96 %type <step> DescendantOrSelf 101 %type <step> AbbreviatedStep 160 Step 168 RelativeLocationPath '/' Step [all...] |
XPathStep.h | 42 class Step : public ParseNode { 43 WTF_MAKE_NONCOPYABLE(Step); WTF_MAKE_FAST_ALLOCATED; 79 Step(Axis, const NodeTest& nodeTest, const Vector<Predicate*>& predicates = Vector<Predicate*>()); 80 ~Step(); 90 friend void optimizeStepPair(Step*, Step*, bool&); 102 void optimizeStepPair(Step*, Step*, bool& dropSecondStep);
|
/external/chromium/chrome/browser/sync/ |
sync_setup_wizard.cc | 22 void SyncSetupWizard::Step(State advance_state) {
|
/external/chromium/third_party/libjingle/source/talk/base/ |
task.cc | 86 void Task::Step() {
|
/external/chromium/app/sql/ |
statement.cc | 48 bool Statement::Step() { 57 // the last error that Step() caused thereby generating a second
|
/external/llvm/utils/TableGen/ |
SetTheory.cpp | 169 int Step = 1; 175 Step = II->getValue(); 205 Step *= From <= To ? 1 : -1; 207 if (Step > 0 && From > To) 209 else if (Step < 0 && From < To) 224 From += Step;
|
/external/regex-re2/re2/ |
nfa.cc | 98 inline int Step(Threadq* runq, Threadq* nextq, int c, int flag, const char* p); 292 int NFA::Step(Threadq* runq, Threadq* nextq, int c, int flag, const char* p) { 314 LOG(DFATAL) << "Unhandled " << ip->opcode() << " in step"; 517 int id = Step(runq, nextq, c, flag, p-1); 602 // Will run step(runq, nextq, c, ...) on next iteration. See above.
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/ |
armVCM4P10_InterpolateLuma_HalfDiagVerHor4x4_unsafe_s.s | 39 ;// r0,r1,r2,r3, r8 where r0,r2 input pointer and r1,r3 step size, r8 intermediate-buf pointer 99 Step RN 6
|
armVCM4P10_InterpolateLuma_HalfVer4x4_unsafe_s.s | 33 ;// r0,r1,r2,r3 where r0,r2 input pointer and r1,r3 corresponding step size 93 Step RN 6
|
omxVCM4P10_FilterDeblockingChroma_HorEdge_I_s.s | 67 Step RN 1
|
omxVCM4P10_FilterDeblockingChroma_VerEdge_I_s.s | 91 Step RN 1
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
toy.cpp | 154 ExprAST *Start, *End, *Step, *Body; 157 ExprAST *step, ExprAST *body) 158 : VarName(varname), Start(start), End(end), Step(step), Body(body) {} 323 // The step value is optional. 324 ExprAST *Step = 0; 327 Step = ParseExpression(); 328 if (Step == 0) return 0; 338 return new ForExprAST(IdName, Start, End, Step, Body); 572 // step = stepexp [all...] |
/external/v8/src/ |
incremental-marking.cc | 769 void IncrementalMarking::Step(intptr_t allocated_bytes,
|
/external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
XPathParser.java | [all...] |
/external/chromium/chrome/browser/sync/syncable/ |
syncable_unittest.cc | 1493 Step step; local 1590 Step step; local [all...] |
/external/llvm/examples/Kaleidoscope/Chapter6/ |
toy.cpp | 169 ExprAST *Start, *End, *Step, *Body; 172 ExprAST *step, ExprAST *body) 173 : VarName(varname), Start(start), End(end), Step(step), Body(body) {} 351 // The step value is optional. 352 ExprAST *Step = 0; 355 Step = ParseExpression(); 356 if (Step == 0) return 0; 366 return new ForExprAST(IdName, Start, End, Step, Body); 676 // step = stepexp [all...] |
/external/llvm/examples/Kaleidoscope/Chapter7/ |
toy.cpp | 174 ExprAST *Start, *End, *Step, *Body; 177 ExprAST *step, ExprAST *body) 178 : VarName(varname), Start(start), End(end), Step(step), Body(body) {} 369 // The step value is optional. 370 ExprAST *Step = 0; 373 Step = ParseExpression(); 374 if (Step == 0) return 0; 384 return new ForExprAST(IdName, Start, End, Step, Body); 773 // step = stepexp [all...] |
/external/llvm/lib/Analysis/ |
ScalarEvolutionExpander.cpp | 286 // In an AddRec, check if both start and step are divisible. 288 const SCEV *Step = A->getStepRecurrence(SE); 289 const SCEV *StepRem = SE.getConstant(Step->getType(), 0); 290 if (!FactorOutConstant(Step, StepRem, Factor, SE, TD)) 298 S = SE.getAddRecExpr(Start, Step, A->getLoop(), SCEV::FlagAnyWrap); [all...] |
DependenceAnalysis.cpp | 809 const SCEV *Step = AddRec->getStepRecurrence(*SE); 810 if (!isLoopInvariant(Step, LoopNest)) 827 const SCEV *Step = AddRec->getStepRecurrence(*SE); 828 if (!isLoopInvariant(Step, LoopNest)) [all...] |
ScalarEvolution.cpp | 707 // to do is multiply by the inverse. Therefore, this step can be done at 711 // is done is by doing the multiplication step at a width of at least W + T 720 // a division step, whereas this formula only requires multiplies and shifts. 722 // It doesn't matter whether the subtraction step is done in the calculation 757 // We need at least W + T bits for the multiplication step [all...] |
/external/llvm/lib/Transforms/Scalar/ |
IndVarSimplify.cpp | 440 // First step. Check to see if there are any floating-point recurrences. [all...] |
LoopStrengthReduce.cpp | 501 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, 503 if (!Step) return 0; 507 // FlagNW is independent of the start value, step direction, and is 510 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); 859 // Add the step value register, if it needs one. [all...] |
/external/clang/include/clang/Sema/ |
Initialization.h | 568 /// \brief Describes the kind of a particular step in an initialization 638 /// \brief A single step in the initialization sequence. 639 class Step { 641 /// \brief The kind of conversion or initialization step we are taking. 683 SmallVector<Step, 4> Steps; 838 typedef SmallVector<Step, 4>::const_iterator step_iterator; 853 /// \brief Returns whether the last step in this initialization sequence is [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
LoopVectorize.cpp | 353 IK_IntInduction, ///< Integer induction variable. Step = 1. 354 IK_ReverseIntInduction, ///< Reverse int induction variable. Step = -1. 355 IK_PtrInduction, ///< Pointer induction var. Step = sizeof(elem). 356 IK_ReversePtrInduction ///< Reverse ptr indvar. Step = - sizeof(elem). [all...] |