Searched refs:Step (Results 1 - 25 of 25) sorted by relevance

/macosx-10.10/WebCore-7600.1.25/xml/
H A DXPathGrammar.y68 %union { Step::Axis axis; }
78 %union { Step::NodeTest* nodeTest; }
86 %union { Step* step; }
87 %type <step> Step AbbreviatedStep DescendantOrSelf
88 %destructor { delete $$; } Step AbbreviatedStep DescendantOrSelf
138 $$->prependStep(std::unique_ptr<Step>($1));
143 Step
146 $$->appendStep(std::unique_ptr<Step>($1));
149 RelativeLocationPath '/' Step
152 $$->appendStep(std::unique_ptr<Step>(
163 Step: label
[all...]
H A DXPathStep.h42 class Step { class in namespace:WebCore::XPath
84 friend class Step;
85 friend void optimizeStepPair(Step&, Step&, bool&);
95 Step(Axis, NodeTest);
96 Step(Axis, NodeTest, Vector<std::unique_ptr<Expression>>);
97 ~Step();
106 friend void optimizeStepPair(Step&, Step&, bool&);
118 void optimizeStepPair(Step
[all...]
H A DXPathParser.cpp53 Step::Axis axis;
59 Token(int type, Step::Axis axis) : type(type), axis(axis) { }
81 static void populateAxisNamesMap(HashMap<String, Step::Axis>& axisNames)
85 Step::Axis axis;
88 { "ancestor", Step::AncestorAxis },
89 { "ancestor-or-self", Step::AncestorOrSelfAxis },
90 { "attribute", Step::AttributeAxis },
91 { "child", Step::ChildAxis },
92 { "descendant", Step::DescendantAxis },
93 { "descendant-or-self", Step
[all...]
H A DXPathStep.cpp42 Step::Step(Axis axis, NodeTest nodeTest) function in class:WebCore::XPath::Step
48 Step::Step(Axis axis, NodeTest nodeTest, Vector<std::unique_ptr<Expression>> predicates) function in class:WebCore::XPath::Step
55 Step::~Step()
59 void Step::optimize()
75 void optimizeStepPair(Step& first, Step& second, bool& dropSecondStep)
79 if (first.m_axis != Step
[all...]
H A DXPathPath.h36 class Step;
58 void appendStep(std::unique_ptr<Step>);
59 void prependStep(std::unique_ptr<Step>);
65 Vector<std::unique_ptr<Step>> m_steps;
H A DXPathPath.cpp113 Step& step = *m_steps[i];
117 bool needToCheckForDuplicateNodes = !nodes.subtreesAreDisjoint() || (step.axis() != Step::ChildAxis && step.axis() != Step::SelfAxis
118 && step.axis() != Step::DescendantAxis && step.axis() != Step::DescendantOrSelfAxis && step.axis() != Step::AttributeAxis);
124 if (nodes.subtreesAreDisjoint() && (step.axis() == Step::ChildAxis || step.axis() == Step::SelfAxis))
147 void LocationPath::appendStep(std::unique_ptr<Step> step)
160 void LocationPath::prependStep(std::unique_ptr<Step> ste
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/examples/tepam/
H A Dtepam_demo.tcl44 proc ExecuteExampleStep {Step} {
47 foreach es $ExampleScript($Step) {
48 .rightside.code mark set insert step$Step-cmd$CmdNbr
56 lappend ExecutedSteps $Step
58 foreach Step [array names IsExecutable] {
59 set Executed [expr [lsearch -exact $ExecutedSteps $Step]>=0]
60 if $IsExecutable($Step) {
62 .rightside.code tag configure step$Step -background white -relief flat
63 .rightside.code tag bind step$Step <Any-Enter> ".rightside.code tag configure step$Step
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/devtools/
H A Ddialog.tcl64 proc Step {sock} { procedure
80 # Step commands ...
86 Step $sock
93 Step $sock
117 Step $sock
123 Step $sock
129 Step $sock
140 # No "Step" here. Comes through input.
167 Step $sock
177 Step
[all...]
/macosx-10.10/ruby-106/ruby/test/ruby/
H A Dtest_lazy_enumerator.rb5 class Step class in class:TestLazyEnumerator
28 a = Step.new(1..3)
64 a = Step.new(1..6)
70 a = Step.new(['word', nil, 1])
90 a = Step.new(1..3)
98 a = Step.new(1..3)
106 a = Step.new(1..3)
142 a = Step.new(1..6)
148 a = Step.new(['word', nil, 1])
168 a = Step
[all...]
/macosx-10.10/llvmCore-3425.0.34/utils/TableGen/
H A DSetTheory.cpp163 int Step = 1; local
169 Step = II->getValue();
198 Step *= From <= To ? 1 : -1;
200 if (Step > 0 && From > To)
202 else if (Step < 0 && From < To)
216 From += Step;
/macosx-10.10/llvmCore-3425.0.34/examples/Kaleidoscope/Chapter5/
H A Dtoy.cpp154 ExprAST *Start, *End, *Step, *Body; member in class:ForExprAST
158 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
324 ExprAST *Step = 0;
327 Step = ParseExpression();
328 if (Step == 0) return 0;
338 return new ForExprAST(IdName, Start, End, Step, Body);
611 if (Step) {
612 StepVal = Step->Codegen();
/macosx-10.10/llvmCore-3425.0.34/examples/Kaleidoscope/Chapter6/
H A Dtoy.cpp169 ExprAST *Start, *End, *Step, *Body; member in class:ForExprAST
173 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
352 ExprAST *Step = 0;
355 Step = ParseExpression();
356 if (Step == 0) return 0;
366 return new ForExprAST(IdName, Start, End, Step, Body);
715 if (Step) {
716 StepVal = Step->Codegen();
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/
H A DScalarEvolutionExpander.cpp288 const SCEV *Step = A->getStepRecurrence(SE); local
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);
1105 const SCEV *Step = Normalized->getStepRecurrence(SE); local
1109 bool useSubtract = !ExpandTy->isPointerTy() && Step->isNonConstantNegative();
1111 Step = SE.getNegativeSCEV(Step);
1113 Value *StepV = expandCodeFor(Step, IntTy, L->getHeader()->begin());
1188 const SCEV *Step local
[all...]
H A DScalarEvolution.cpp938 const SCEV *Step = AR->getStepRecurrence(*this); local
946 getZeroExtendExpr(Step, Ty),
970 // Check whether Start+Step*MaxBECount has no unsigned overflow.
971 const SCEV *ZMul = getMulExpr(CastedMaxBECount, Step);
979 getZeroExtendExpr(Step, WideTy)));
985 getZeroExtendExpr(Step, Ty),
993 getSignExtendExpr(Step, WideTy)));
1000 getSignExtendExpr(Step, Ty),
1009 if (isKnownPositive(Step)) {
1011 getUnsignedRange(Step)
1054 getOverflowLimitForStep(const SCEV *Step, ICmpInst::Predicate *Pred, ScalarEvolution *SE) argument
1082 const SCEV *Step = AR->getStepRecurrence(*SE); local
1204 const SCEV *Step = AR->getStepRecurrence(*this); local
[all...]
/macosx-10.10/llvmCore-3425.0.34/examples/Kaleidoscope/Chapter7/
H A Dtoy.cpp174 ExprAST *Start, *End, *Step, *Body; member in class:ForExprAST
178 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
370 ExprAST *Step = 0;
373 Step = ParseExpression();
374 if (Step == 0) return 0;
384 return new ForExprAST(IdName, Start, End, Step, Body);
817 if (Step) {
818 StepVal = Step->Codegen();
/macosx-10.10/tcl-105/tcl_ext/incrtcl/iwidgets/generic/
H A Dspinint.itk66 itk_option define -step step Step 1
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Analysis/
H A DScalarEvolution.h431 const SCEV *Step,
612 const SCEV *getAddRecExpr(const SCEV *Start, const SCEV *Step,
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/doctools2base/
H A Dtcl_parse.tcl16 # TODO :: input. Callback. Invoked in 'Initialize', 'Step', and
341 # Step over any whitespace after the last word
632 ## stepping over a range. Match = Peek + Step.
642 if {$ok} {Step $range}
660 proc Step {range} { procedure
/macosx-10.10/vim-55/runtime/syntax/
H A Dvb.vim39 syn keyword vbRepeat Step To Until Wend While
228 syn keyword vbStatement Sendkeys Set SetAttr Static Step Stop Sub Time
237 syn keyword vbKeyword Set Static Step String Time WithEvents
H A Dlscript.vim161 syn keyword lscriptFunction Random Read Shared Step UChr UChr$ Uni Unicode
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp1381 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); local
1382 if (!Step || !Step->isOne())
H A DLoopStrengthReduce.cpp490 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, local
492 if (!Step) return 0;
499 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap);
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex1086 the most. For example, this will happen in cases where there is not a carry to fill the last position. Step two fixes the sign for
1429 This algorithm sets a mp\_int to a small single digit value. Step number 1 ensures that the integer is reset to the default state. The
1477 mp\_int. Step 2.1 will multiply the current result by sixteen making room for four more bits in the less significant positions. In step 2.2 the
1592 $\vert a \vert < \vert b \vert$. Step number four will compare the two when they are both positive.
1821 If $b$ has a smaller magnitude than $a$ then step 9 will force the carry and copy operation to propagate through the larger input $a$ into $c$. Step
2059 Step 1 and 2 grow the input as required to accomodate the maximum number of \textbf{used} digits in the result. The initial \textbf{used} count
2062 Step 6 is an optimization implementation of the addition loop for this specific case. That is since the two values being added together
2063 are the same there is no need to perform two reads from the digits of $a$. Step 6.1 performs a single precision shift on the current digit $a_n$ to
2064 obtain what will be the carry for the next iteration. Step 6.2 calculates the $n$'th digit of the result as single precision shift of $a_n$ plus
2068 Step
[all...]
/macosx-10.10/tcl-105/tcl_ext/bwidget/bwidget/
H A Dwizard.tcl20 namespace eval Step {
21 Widget::declare Wizard::Step {
826 Widget::init Wizard::Step $items($node) $args
/macosx-10.10/tcl-105/tcl_ext/tdom/tdom/generic/
H A Ddomxpath.c1576 | Step production
1625 Production(Step)
1642 if (*errMsg == NULL) { ErrExpected("Step"); }
1665 a = Recurse(Step);
1670 Append(a, Recurse(Step));
1674 b = Recurse(Step);

Completed in 396 milliseconds