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

12

/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGFixupPhase.cpp105 fixIntEdge(node->child1());
111 setUseKindAndUnboxIfProfitable<KnownInt32Use>(node->child1());
121 if (node->child1()->shouldSpeculateInteger()) {
122 setUseKindAndUnboxIfProfitable<Int32Use>(node->child1());
127 if (node->child1()->shouldSpeculateNumber()) {
128 setUseKindAndUnboxIfProfitable<NumberUse>(node->child1());
132 if (node->child1()->shouldSpeculateBoolean()) {
133 setUseKindAndUnboxIfProfitable<BooleanUse>(node->child1());
137 setUseKindAndUnboxIfProfitable<NotCellUse>(node->child1());
149 if (Node::shouldSpeculateNumberExpectingDefined(node->child1()
427 Edge& child1 = m_graph.varArgChild(node, 0); local
[all...]
H A DDFGBackwardsPropagationPhase.cpp111 return isWithinPowerOfTwoNonRecursive<power>(node->child1().node())
158 if (!node->child1())
160 changed |= node->child1()->mergeFlags(NodeUsedAsValue);
186 node->child1()->mergeFlags(NodeUsedAsValue);
199 node->child1()->mergeFlags(flags);
207 node->child1()->mergeFlags(flags);
212 node->child1()->mergeFlags(NodeUsedAsValue);
219 node->child1()->mergeFlags(flags);
224 if (isNotNegZero(node->child1().node()) || isNotNegZero(node->child2().node()))
226 if (node->child1()
[all...]
H A DDFGCSEPhase.cpp69 node = node->child1().node();
94 Node* child1 = canonicalize(node->child1()); local
100 if (otherNode == child1 || otherNode == child2 || otherNode == child3)
109 Node* otherChild = canonicalize(otherNode->child1());
112 if (otherChild != child1)
136 if (otherNode == node->child1())
141 if (otherNode->child1() == node->child1())
191 return node->child1()
363 getByValLoadElimination(Node* child1, Node* child2) argument
406 checkFunctionElimination(JSCell* function, Node* child1) argument
419 checkExecutableElimination(ExecutableBase* executable, Node* child1) argument
432 checkStructureElimination(const StructureSet& structureSet, Node* child1) argument
491 structureTransitionWatchpointElimination(Structure* structure, Node* child1) argument
545 putStructureStoreElimination(Node* child1) argument
603 getByOffsetLoadElimination(unsigned identifierNumber, Node* child1) argument
648 putByOffsetStoreElimination(unsigned identifierNumber, Node* child1) argument
691 getPropertyStorageLoadElimination(Node* child1) argument
746 checkArrayElimination(Node* child1, ArrayMode arrayMode) argument
780 getIndexedPropertyStorageLoadElimination(Node* child1, ArrayMode arrayMode) argument
1280 Edge child1 = m_graph.varArgChild(node, 0); local
[all...]
H A DDFGAdjacencyList.h57 AdjacencyList(Kind kind, Edge child1, Edge child2, Edge child3) argument
60 initialize(child1, child2, child3);
88 Edge child1() const { return child(0); }
92 Edge& child1() { return child(0); }
102 void initialize(Edge child1, Edge child2, Edge child3)
104 child(0) = child1;
109 void initialize(Node* child1 = 0, Node* child2 = 0, Node* child3 = 0)
111 initialize(Edge(child1), Edge(child2), Edge(child3));
H A DDFGDCEPhase.cpp98 if (node->child1().isProved() || node->child1().useKind() == UntypedUse) {
101 if (!node->child1()->shouldGenerate()
102 && node->child1()->op() == UInt32ToNumber)
103 node->child1() = node->child1()->child1();
105 if (!node->child1()->shouldGenerate()) {
107 node->child1() = Edge();
H A DDFGPredictionPropagationPhase.cpp158 changed |= variableAccessData->predict(node->child1()->prediction());
212 SpeculatedType left = node->child1()->prediction();
231 SpeculatedType left = node->child1()->prediction();
244 SpeculatedType left = node->child1()->prediction();
257 if (node->child1()->prediction()) {
261 changed |= mergePrediction(speculatedDoubleTypeForPrediction(node->child1()->prediction()));
267 SpeculatedType left = node->child1()->prediction();
271 if (Node::shouldSpeculateIntegerForArithmetic(node->child1().node(), node->child2().node())
281 SpeculatedType left = node->child1()->prediction();
294 SpeculatedType left = node->child1()
687 Edge child1 = m_graph.varArgChild(node, 0); local
[all...]
H A DDFGAbstractState.cpp285 forNode(node) = forNode(node->child1());
315 m_variables.operand(node->local()) = forNode(node->child1());
342 JSValue left = forNode(node->child1()).value();
381 JSValue child = forNode(node->child1()).value();
399 JSValue child = forNode(node->child1()).value();
415 JSValue child = forNode(node->child1()).value();
434 JSValue child = forNode(node->child1()).value();
440 if (isInt32Speculation(forNode(node->child1()).m_type))
449 JSValue left = forNode(node->child1()).value();
463 if (isRealNumberSpeculation(forNode(node->child1())
[all...]
H A DDFGMinifiedNode.cpp42 result.m_childOrInfo = MinifiedID(node->child1().node()).m_id;
H A DDFGCPSRethreadingPhase.cpp89 if (!node->child1())
91 switch (node->child1()->op()) {
98 ASSERT(node->child1()->hasResult());
155 ASSERT(!node->child1());
163 otherNode = otherNode->child1().node();
189 otherNode = otherNode->child1().node();
208 node->replacement = otherNode->child1().node();
236 ASSERT(!node->child1());
245 otherNode = otherNode->child1().node();
265 node->children.setChild1(otherNode->child1());
[all...]
H A DDFGTypeCheckHoistingPhase.cpp73 Node* child = node->child1().node();
112 Node* child = node->child1().node();
131 Node* source = node->child1().node();
136 if (subNode->child1() != source)
143 if (subNode->child1() != source)
308 Edge child1 = node->child1(); local
311 indexInBlock, SpecNone, SetLocal, codeOrigin, OpInfo(variable), child1);
318 Edge(child1.node(), CellUse));
H A DDFGGraph.h135 performSubstitutionForEdge(node->child1());
209 Node* left = add->child1().node();
222 return addSpeculationMode(add, add->child1()->shouldSpeculateIntegerExpectingDefined(), add->child2()->shouldSpeculateIntegerExpectingDefined());
227 return addSpeculationMode(add, add->child1()->shouldSpeculateIntegerForArithmetic(), add->child2()->shouldSpeculateIntegerForArithmetic());
247 Node* left = mul->child1().node();
256 return negate->child1()->shouldSpeculateIntegerForArithmetic() && negate->canSpeculateInteger();
488 return isNumerical(node->child1().useKind()) && isNumerical(node->child2().useKind());
541 switch (node->child1().useKind()) {
594 node = node->child1().node();
621 if (!node->child1())
[all...]
H A DDFGArgumentsSimplificationPhase.cpp190 Node* source = node->child1().node();
305 observeProperArgumentsUse(node, node->child1());
315 observeProperArgumentsUse(node, node->child1());
359 Node* source = node->child1().node();
435 Node* source = node->child1().node();
466 if (node->child1().useKind() != UntypedUse) {
467 node->child1().setUseKind(UntypedUse);
522 if (!isOKToOptimize(node->child1().node()))
540 if (!isOKToOptimize(node->child1().node()))
543 node->children.child1()
[all...]
H A DDFGSpeculativeJIT64.cpp221 IntegerOperand op1(this, node->child1());
450 use(node->child1());
480 JSValueOperand arg1(this, node->child1());
487 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) {
505 if (!isKnownInteger(node->child1().node()))
512 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) {
562 JSValueOperand arg1(this, node->child1());
569 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) {
588 if (!isKnownInteger(node->child1().node()))
596 if (!isKnownInteger(node->child1()
2625 Edge child1 = m_jit.graph().varArgChild(node, 0); local
[all...]
H A DDFGNode.h101 Node(NodeType op, CodeOrigin codeOrigin, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge())
103 , children(AdjacencyList::Fixed, child1, child2, child3)
113 Node(NodeType op, CodeOrigin codeOrigin, OpInfo imm, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge())
115 , children(AdjacencyList::Fixed, child1, child2, child3)
126 Node(NodeType op, CodeOrigin codeOrigin, OpInfo imm1, OpInfo imm2, Edge child1 = Edge(), Edge child2 = Edge(), Edge child3 = Edge())
128 , children(AdjacencyList::Fixed, child1, child2, child3)
224 RELEASE_ASSERT(child1());
343 children.setChild2(children.child1());
351 ASSERT(m_op == Phantom && (child1()->op() == Phi || child1()
1038 Edge& child1() function in struct:JSC::DFG::Node
[all...]
H A DDFGSpeculativeJIT32_64.cpp246 IntegerOperand op1(this, node->child1());
504 use(node->child1());
534 JSValueOperand arg1(this, node->child1());
543 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) {
561 if (!isKnownInteger(node->child1().node()))
568 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) {
625 JSValueOperand arg1(this, node->child1());
634 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) {
652 if (!isKnownInteger(node->child1().node()))
659 if (!isKnownInteger(node->child1()
2732 Edge child1 = m_jit.graph().varArgChild(node, 0); local
[all...]
/macosx-10.9.5/ruby-104/ruby/lib/rexml/
H A Dparent.rb77 # @param child1 this is either an xpath or an Element. If an Element,
78 # child2 will be inserted before child1 in the child list of the parent.
83 def insert_before( child1, child2 )
84 if child1.kind_of? String
85 child1 = XPath.first( self, child1 )
86 child1.parent.insert_before child1, child2
88 ind = index(child1)
97 # @param child1 thi
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/t/
H A D90_Tree_Simple_Visitor_FromNestedHash_test.t45 my ($child1, $child2) = $root->getAllChildren();
46 is($child1->getNodeValue(), 'Child1', '... got the node value we expected from Child1');
47 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
49 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
80 my ($child1, $child2) = $root->getAllChildren();
81 is($child1->getNodeValue(), 'Child1', '... got the node value we expected from Child1');
82 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
84 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
118 my ($child1, $child2) = $root->getAllChildren();
119 is($child1
[all...]
H A D91_Tree_Simple_Visitor_FromNestedArray_test.t45 my ($child1, $child2) = $root->getAllChildren();
46 is($child1->getNodeValue(), 'Child1', '... got the value we expected from Child1');
47 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
49 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
80 my ($child1, $child2) = $root->getAllChildren();
81 is($child1->getNodeValue(), 'Child1', '... got the value we expected from Child1');
82 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
84 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
118 my ($child1, $child2) = $root->getAllChildren();
119 is($child1
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/t/
H A D90_Tree_Simple_Visitor_FromNestedHash_test.t45 my ($child1, $child2) = $root->getAllChildren();
46 is($child1->getNodeValue(), 'Child1', '... got the node value we expected from Child1');
47 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
49 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
80 my ($child1, $child2) = $root->getAllChildren();
81 is($child1->getNodeValue(), 'Child1', '... got the node value we expected from Child1');
82 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
84 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
118 my ($child1, $child2) = $root->getAllChildren();
119 is($child1
[all...]
H A D91_Tree_Simple_Visitor_FromNestedArray_test.t45 my ($child1, $child2) = $root->getAllChildren();
46 is($child1->getNodeValue(), 'Child1', '... got the value we expected from Child1');
47 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
49 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
80 my ($child1, $child2) = $root->getAllChildren();
81 is($child1->getNodeValue(), 'Child1', '... got the value we expected from Child1');
82 cmp_ok($child1->getChildCount(), '==', 2, '... Child1 has 2 children');
84 my ($grandchild1, $grandchild2) = $child1->getAllChildren();
118 my ($child1, $child2) = $root->getAllChildren();
119 is($child1
[all...]
/macosx-10.9.5/CF-855.17/
H A DCFXMLTree.c60 CFXMLTreeRef child1, child2; local
65 for (child1 = CFTreeGetFirstChild(xmlTree1), child2 = CFTreeGetFirstChild(xmlTree2); child1 && child2; child1 = CFTreeGetNextSibling(child1), child2 = CFTreeGetNextSibling(child2)) {
66 if (!CFXMLTreeEqual(child1, child2)) return false;
/macosx-10.9.5/bind9-45.100/bind9/bin/tests/system/dlv/
H A Dtests.sh31 $DIG $DIGOPTS child1.utld dnskey @10.53.0.5 > dig.out.ns5.test$n || ret=1
39 $DIG $DIGOPTS grand.child1.utld dnskey @10.53.0.5 > dig.out.ns5.test$n || ret=1
47 $DIG $DIGOPTS child1.druz soa @10.53.0.5 > dig.out.ns5.test$n || ret=1
55 $DIG $DIGOPTS grand.child1.druz soa @10.53.0.5 > dig.out.ns5.test$n || ret=1
/macosx-10.9.5/JavaScriptCore-7537.78.1/API/tests/
H A Dminidom.js52 child1 = new Node();
56 node.appendChild(child1);
69 node.removeChild(child1);
/macosx-10.9.5/BerkeleyDB-21/db/test/
H A Drecd022.tcl71 set child1 [$dbenv txn -parent $parent]
75 eval {$db put} -txn $child1 $i $data
80 error_check_good child1_abort [$child1 abort] 0
/macosx-10.9.5/BerkeleyDB-21/db/test/scr024/src/com/sleepycat/collections/test/
H A DIterDeadlockTest.java129 final Object child1 = new Object();
151 synchronized (child1) {
158 child1.wait();
213 synchronized (child1) { child1.notify(); }

Completed in 218 milliseconds

12