/macosx-10.9.5/ruby-104/ruby/lib/rexml/ |
H A D | parent.rb | 78 # child2 will be inserted before child1 in the child list of the parent. 79 # If an xpath, child2 will be inserted before the first child to match 81 # @param child2 the child to insert 83 def insert_before( child1, child2 ) 86 child1.parent.insert_before child1, child2 89 child2.parent.delete(child2) if child2.parent 90 @children[ind,0] = child2 91 child2 [all...] |
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGBackwardsPropagationPhase.cpp | 112 || isWithinPowerOfTwoNonRecursive<power>(node->child2().node()); 127 Node* shiftAmount = node->child2().node(); 161 if (!node->child2()) 163 changed |= node->child2()->mergeFlags(NodeUsedAsValue); 200 node->child2()->mergeFlags(flags); 213 node->child2()->mergeFlags(NodeUsedAsValue | NodeUsedAsInt); 224 if (isNotNegZero(node->child1().node()) || isNotNegZero(node->child2().node())) 226 if (node->child1()->hasNumberResult() || node->child2()->hasNumberResult()) 228 if (!isWithinPowerOfTwo<32>(node->child1()) && !isWithinPowerOfTwo<32>(node->child2())) 234 node->child2() [all...] |
H A D | DFGAdjacencyList.h | 57 AdjacencyList(Kind kind, Edge child1, Edge child2, Edge child3) argument 60 initialize(child1, child2, child3); 89 Edge child2() const { return child(1); } 93 Edge& child2() { return child(1); } 102 void initialize(Edge child1, Edge child2, Edge child3) 105 child(1) = child2; 109 void initialize(Node* child1 = 0, Node* child2 = 0, Node* child3 = 0) 111 initialize(Edge(child1), Edge(child2), Edge(child3));
|
H A D | DFGFixupPhase.cpp | 106 fixIntEdge(node->child2()); 149 if (Node::shouldSpeculateNumberExpectingDefined(node->child1().node(), node->child2().node())) { 151 fixDoubleEdge<NumberUse>(node->child2()); 161 && attemptToMakeFastStringAdd<StringUse>(node, node->child1(), node->child2())) 163 if (node->child2()->shouldSpeculateString() 164 && attemptToMakeFastStringAdd<StringUse>(node, node->child2(), node->child1())) 167 && attemptToMakeFastStringAdd<StringObjectUse>(node, node->child1(), node->child2())) 169 if (node->child2()->shouldSpeculateStringObject() 170 && attemptToMakeFastStringAdd<StringObjectUse>(node, node->child2(), node->child1())) 173 && attemptToMakeFastStringAdd<StringOrStringObjectUse>(node, node->child1(), node->child2())) 428 Edge& child2 = m_graph.varArgChild(node, 1); local [all...] |
H A D | DFGPredictionPropagationPhase.cpp | 213 SpeculatedType right = node->child2()->prediction(); 232 SpeculatedType right = node->child2()->prediction(); 245 SpeculatedType right = node->child2()->prediction(); 268 SpeculatedType right = node->child2()->prediction(); 271 if (Node::shouldSpeculateIntegerForArithmetic(node->child1().node(), node->child2().node()) 282 SpeculatedType right = node->child2()->prediction(); 295 SpeculatedType right = node->child2()->prediction(); 298 if (Node::shouldSpeculateIntegerForArithmetic(node->child1().node(), node->child2().node()) 309 SpeculatedType right = node->child2()->prediction(); 312 if (Node::shouldSpeculateIntegerForArithmetic(node->child1().node(), node->child2() 688 Edge child2 = m_graph.varArgChild(node, 1); local [all...] |
H A D | DFGGraph.h | 136 performSubstitutionForEdge(node->child2()); 210 Node* right = add->child2().node(); 222 return addSpeculationMode(add, add->child1()->shouldSpeculateIntegerExpectingDefined(), add->child2()->shouldSpeculateIntegerExpectingDefined()); 227 return addSpeculationMode(add, add->child1()->shouldSpeculateIntegerForArithmetic(), add->child2()->shouldSpeculateIntegerForArithmetic()); 248 Node* right = mul->child2().node(); 488 return isNumerical(node->child1().useKind()) && isNumerical(node->child2().useKind()); 624 if (!node->child2()) 626 voteNode(node->child2(), ballot); 647 if (!node->child2()) 649 compareAndSwap(node->children.child2(), oldThin [all...] |
H A D | DFGCSEPhase.cpp | 95 Node* child2 = canonicalize(node->child2()); local 100 if (otherNode == child1 || otherNode == child2 || otherNode == child3) 115 otherChild = canonicalize(otherNode->child2()); 118 if (otherChild != child2) 259 if (node->child2() == registers) 334 if (node->child1() == scope && node->child2() == registers) 363 Node* getByValLoadElimination(Node* child1, Node* child2) argument 367 if (node == child1 || node == canonicalize(child2)) 374 if (node->child1() == child1 && canonicalize(node->child2()) 1281 Edge child2 = m_graph.varArgChild(node, 1); local [all...] |
H A D | DFGNode.h | 101 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) 225 RELEASE_ASSERT(!child2()); 342 children.setChild3(children.child2()); 1012 return child1().useKindUnchecked() != UntypedUse || child2().useKindUnchecked() != UntypedUse || child3().useKindUnchecked() != UntypedUse; 1052 Edge& child2() function in struct:JSC::DFG::Node [all...] |
H A D | DFGSpeculativeJIT.cpp | 863 if (!node->child2()) { 868 SpeculateIntegerOperand property(this, node->child2()); 913 ASSERT(!node->child2() && !node->child3()); 918 Edge child2 = node->child2(); local 919 if (!child2) { 923 use(child2); 1389 SpeculateDoubleOperand op2(this, node->child2()); 1410 SpeculateCellOperand op2(this, node->child2()); 1425 if (m_state.forNode(node->child2()) [all...] |
H A D | DFGVirtualRegisterAllocationPhase.cpp | 95 scoreBoard.useIfHasResult(node->child2());
|
H A D | DFGSpeculativeJIT32_64.cpp | 505 use(node->child2()); 535 JSValueOperand arg2(this, node->child2()); 543 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) { 563 if (!isKnownInteger(node->child2().node())) 568 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) { 626 JSValueOperand arg2(this, node->child2()); 634 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) { 654 if (!isKnownInteger(node->child2().node())) 659 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) { 685 JSValueOperand arg2(this, node->child2()); 2733 Edge child2 = m_jit.graph().varArgChild(node, 1); local [all...] |
H A D | DFGSpeculativeJIT64.cpp | 451 use(node->child2()); 481 JSValueOperand arg2(this, node->child2()); 487 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) { 507 if (!isKnownInteger(node->child2().node())) 512 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) { 563 JSValueOperand arg2(this, node->child2()); 569 if (isKnownNotInteger(node->child1().node()) || isKnownNotInteger(node->child2().node())) { 590 if (!isKnownInteger(node->child2().node())) 596 if (!isKnownInteger(node->child1().node()) || !isKnownInteger(node->child2().node())) { 621 JSValueOperand arg2(this, node->child2()); 2626 Edge child2 = m_jit.graph().varArgChild(node, 1); local [all...] |
H A D | DFGGraph.cpp | 174 if (!!node->child1() || !!node->child2() || !!node->child3()) 176 if (!!node->child2() || !!node->child3()) 177 out.print(comma, node->child2()); 310 if (phiNode->child2()) { 311 out.print(", @", phiNode->child2()->index());
|
H A D | DFGAbstractState.cpp | 343 JSValue right = forNode(node->child2()).value(); 450 JSValue right = forNode(node->child2()).value(); 464 && isRealNumberSpeculation(forNode(node->child2()).m_type)) 486 JSValue right = forNode(node->child2()).value(); 533 JSValue right = forNode(node->child2()).value(); 548 || isRealNumberSpeculation(forNode(node->child2()).m_type)) 570 JSValue right = forNode(node->child2()).value(); 797 JSValue rightConst = forNode(node->child2()).value(); 826 SpeculatedType rightType = forNode(node->child2()).m_type; 852 Node* rightNode = node->child2() [all...] |
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/t/ |
H A D | 90_Tree_Simple_Visitor_FromNestedHash_test.t | 45 my ($child1, $child2) = $root->getAllChildren(); 56 is($child2->getNodeValue(), 'Child2', '... got the node value we expected from Child2'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 80 my ($child1, $child2) = $root->getAllChildren(); 91 is($child2->getNodeValue(), 'Child2', '... got the node value we expected from Child2'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 118 my ($child1, $child2) = $root->getAllChildren(); 129 is($child2->getNodeValue(), 'CHILD2', '... got the node value we expected from Child2'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
H A D | 91_Tree_Simple_Visitor_FromNestedArray_test.t | 45 my ($child1, $child2) = $root->getAllChildren(); 56 is($child2->getNodeValue(), 'Child2', '... got the value we expected from Child2'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 80 my ($child1, $child2) = $root->getAllChildren(); 91 is($child2->getNodeValue(), 'Child2', '... got the value we expected from Child2'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 118 my ($child1, $child2) = $root->getAllChildren(); 129 is($child2->getNodeValue(), 'CHILD2', '... got the value we expected from Child2'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/t/ |
H A D | 90_Tree_Simple_Visitor_FromNestedHash_test.t | 45 my ($child1, $child2) = $root->getAllChildren(); 56 is($child2->getNodeValue(), 'Child2', '... got the node value we expected from Child2'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 80 my ($child1, $child2) = $root->getAllChildren(); 91 is($child2->getNodeValue(), 'Child2', '... got the node value we expected from Child2'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 118 my ($child1, $child2) = $root->getAllChildren(); 129 is($child2->getNodeValue(), 'CHILD2', '... got the node value we expected from Child2'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
H A D | 91_Tree_Simple_Visitor_FromNestedArray_test.t | 45 my ($child1, $child2) = $root->getAllChildren(); 56 is($child2->getNodeValue(), 'Child2', '... got the value we expected from Child2'); 57 ok($child2->isLeaf(), '... Child2 is a leaf node'); 80 my ($child1, $child2) = $root->getAllChildren(); 91 is($child2->getNodeValue(), 'Child2', '... got the value we expected from Child2'); 92 ok($child2->isLeaf(), '... Child2 is a leaf node'); 118 my ($child1, $child2) = $root->getAllChildren(); 129 is($child2->getNodeValue(), 'CHILD2', '... got the value we expected from Child2'); 130 ok($child2->isLeaf(), '... Child2 is a leaf node');
|
/macosx-10.9.5/CF-855.17/ |
H A D | CFXMLTree.c | 60 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/BerkeleyDB-21/db/test/ |
H A D | recd022.tcl | 85 set child2 [$dbenv txn -parent $parent] 87 eval {$db put} -txn $child2 $i $data 90 eval {$db del} -txn $child2 $i 95 eval {$db put} -txn $child2 $i $data 100 error_check_good child2_commit [$child2 commit] 0
|
H A D | txn014.tcl | 127 set child2 [$env txn -parent $parent] 129 [berkdb_open_noerr -env $env -txn $child2 $method $parentfile] 135 set ret [$child2db get -txn $child2 $key] 143 error_check_good child2_commit [$child2 commit] 0
|
H A D | recd006.tcl | 156 proc nesttest { db parent env do p1 p2 child1 child2} { 199 # Now start child2 222 # In either case, child2 should now be able to get the 230 puts -nonewline "\tKid2 $child2..." 231 if { [string compare $child2 "commit"] == 0 } { 252 if { [string compare $child2 "commit"] == 0 } {
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/API/tests/ |
H A D | minidom.js | 53 child2 = new Node(); 57 node.appendChild(child2); 70 node.replaceChild(child3, child2);
|
/macosx-10.9.5/BerkeleyDB-21/db/test/scr024/src/com/sleepycat/collections/test/ |
H A D | IterDeadlockTest.java | 130 final Object child2 = new Object(); 182 synchronized (child2) { 189 child2.wait(); 214 synchronized (child2) { child2.notify(); }
|
/macosx-10.9.5/CPANInternal-140/Test-Simple/t/subtest/ |
H A D | exceptions.t | 29 ok my $child2 = $child->child('two'), 'Trying to create nested children should succeed';
|