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

12

/external/valgrind/main/helgrind/tests/
H A Dlocked_vs_unlocked1.c27 pthread_t child1, child2; local
34 if (pthread_create(&child2, NULL, child_fn, (void*)(long)(sw ? 1 : 0))) {
44 if (pthread_join(child2, NULL)) {
H A Dlocked_vs_unlocked3.c45 pthread_t child1, child2; local
53 r= pthread_create(&child2, NULL, child_fn2, NULL); assert(!r);
57 r= pthread_join(child2, NULL); assert(!r);
H A Dlocked_vs_unlocked2.c53 pthread_t child1, child2; local
61 r= pthread_create(&child2, NULL, child_fn2, NULL); assert(!r);
65 r= pthread_join(child2, NULL); assert(!r);
H A Dtc22_exit_w_lock.c37 pthread_t child1, child2; local
39 r= pthread_create(&child2, NULL, child_fn2, NULL); assert(!r);
/external/chromium/chrome/browser/ui/gtk/
H A Dgtk_expanded_container_unittest.cc54 GtkWidget* child2 = gtk_fixed_new(); local
58 gtk_container_add(GTK_CONTAINER(expanded_), child2); local
59 ASSERT_TRUE(FindChild(child2));
64 ASSERT_TRUE(FindChild(child2));
66 gtk_container_remove(GTK_CONTAINER(expanded_), child2); local
67 ASSERT_FALSE(FindChild(child2));
72 GtkWidget* child2 = gtk_fixed_new(); local
75 child2, 10, 20); local
86 EXPECT_EQ(10, child2->allocation.x);
87 EXPECT_EQ(20, child2
[all...]
/external/webkit/Source/JavaScriptCore/dfg/
H A DDFGGraph.cpp76 if (node.child2 != NoNode)
77 printf(", @%u", node.child2);
143 ASSERT(node.child2 == NoNode && node.child3 == NoNode);
148 if (node.child2 == NoNode) {
152 ref(node.child2);
163 ASSERT(node.child2 == NoNode && node.child3 == NoNode);
168 if (node.child2 == NoNode) {
172 deref(node.child2);
H A DDFGNode.h174 Node(NodeType op, ExceptionInfo exceptionInfo, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
178 , child2(child2)
186 Node(NodeType op, ExceptionInfo exceptionInfo, OpInfo imm, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
190 , child2(child2)
199 Node(NodeType op, ExceptionInfo exceptionInfo, OpInfo imm1, OpInfo imm2, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
203 , child2(child2)
335 NodeIndex child1, child2, child member in struct:JSC::DFG::Node
[all...]
H A DDFGSpeculativeJIT.cpp272 SpeculateIntegerOperand op2(this, node.child2);
278 } else if (isInt32Constant(node.child2)) {
282 bitOp(op, valueOfInt32Constant(node.child2), op1.registerID(), result.registerID());
287 SpeculateIntegerOperand op2(this, node.child2);
301 if (isInt32Constant(node.child2)) {
305 shiftOp(op, op1.registerID(), valueOfInt32Constant(node.child2) & 0x1f, result.registerID());
311 SpeculateIntegerOperand op2(this, node.child2);
370 SpeculateIntegerOperand op2(this, node.child2);
381 if (isDoubleConstantWithInt32Value(node.child2, imm2)) {
393 SpeculateIntegerOperand op2(this, node.child2);
[all...]
H A DDFGNonSpeculativeJIT.cpp219 IntegerOperand op2(this, node.child2);
225 } else if (isInt32Constant(node.child2)) {
229 bitOp(op, valueOfInt32Constant(node.child2), op1.registerID(), result.registerID());
234 IntegerOperand op2(this, node.child2);
248 if (isInt32Constant(node.child2)) {
252 int shiftAmount = valueOfInt32Constant(node.child2) & 0x1f;
261 IntegerOperand op2(this, node.child2);
352 JSValueOperand arg2(this, node.child2);
366 DoubleOperand op2(this, node.child2);
379 DoubleOperand op2(this, node.child2);
[all...]
H A DDFGAliasTracker.h63 if (possibleAlias.child1 == base && equalIgnoringLaterNumericConversion(possibleAlias.child2, property))
H A DDFGJITCodeGenerator.cpp319 ASSERT(node.child2 == NoNode && node.child3 == NoNode);
324 NodeIndex child2 = node.child2; local
325 if (child2 == NoNode) {
329 use(child2);
H A DDFGByteCodeParser.cpp432 NodeIndex addToGraph(NodeType op, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
435 m_graph.append(Node(op, m_currentIndex, child1, child2, child3));
441 NodeIndex addToGraph(NodeType op, OpInfo info, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
444 m_graph.append(Node(op, m_currentIndex, info, child1, child2, child3));
450 NodeIndex addToGraph(NodeType op, OpInfo info1, OpInfo info2, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex child3 = NoNode)
453 m_graph.append(Node(op, m_currentIndex, info1, info2, child1, child2, child3));
1044 scoreBoard.use(node.child2);
/external/apache-harmony/prefs/src/test/java/org/apache/harmony/prefs/tests/java/util/prefs/
H A DFilePreferencesImplTest.java83 Preferences child2 = uroot.node("\u4e2d child2");
93 childNames = child2.childrenNames();
100 child2.removeNode();
105 child2 = sroot.node("child2");
115 childNames = child2.childrenNames();
124 child2.removeNode();
H A DAbstractPreferencesTest.java176 .publicChildSpi("child2");
202 // MockAbstractPreferences child2 = new MockAbstractPreferences(pref,
203 // "child2");
211 pref.node("child2");
520 Preferences child2 = pref.node("child2");
521 assertSame(child2, ((MockAbstractPreferences) pref)
522 .publicChildSpi("child2"));
578 assertFalse(pref.nodeExists("child2/grandchild"));
579 pref.node("child2/grandchil
[all...]
/external/webkit/Source/JavaScriptCore/API/tests/
H A Dminidom.js53 child2 = new Node();
57 node.appendChild(child2);
70 node.replaceChild(child3, child2);
/external/chromium/chrome/common/extensions/docs/examples/api/contextMenus/basic/
H A Dsample.js28 var child2 = chrome.contextMenus.create( variable
30 console.log("parent:" + parent + " child1:" + child1 + " child2:" + child2);
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeWizard.java357 TreePattern child2 = (TreePattern)tpattern.getChild(i);
358 if ( !_parse(child1, child2, labels) ) {
368 * (root child1 ... child2).
425 Object child2 = adaptor.getChild(t2, i);
426 if ( !_equals(child1, child2, adaptor) ) {
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOMHelper.java348 * Figure out if child2 is after child1 in document order.
356 * @param parent Must be the parent of both child1 and child2.
357 * @param child1 Must be the child of parent and not equal to child2.
358 * @param child2 Must be the child of parent and not equal to child1.
362 Node child2)
367 short child2type = child2.getNodeType();
405 else if (child2 == child || isNodeTheSame(child2, child))
449 else if (child2 == child || isNodeTheSame(child2, chil
361 isNodeAfterSibling(Node parent, Node child1, Node child2) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DTreeWizard.cs442 TreePattern child2 = (TreePattern)tpattern.GetChild(i);
443 if (!ParseCore(child1, child2, labels)) {
454 * (root child1 ... child2).
521 object child2 = adaptor.GetChild(t2, i);
522 if (!EqualsCore(child1, child2, adaptor)) {
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeWizard.cs508 TreePattern child2 = (TreePattern)tpattern.GetChild( i );
509 if ( !ParseCore( child1, child2, labels ) )
521 * (root child1 ... child2).
597 object child2 = adaptor.GetChild( t2, i );
598 if ( !EqualsCore( child1, child2, adaptor ) )
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dtreewizard.py353 (root child1 ... child2).
574 child2 = tpattern.getChild(i)
575 if not self._parse(child1, child2, labels):
615 child2 = adaptor.getChild(t2, i)
616 if not self._equals(child1, child2, adaptor):
/external/chromium/chrome/browser/profiles/
H A Dprofile_dependency_manager_unittest.cc86 TestService child2("child2", shutdown_order(), manager());
88 DependOn(&child2, &parent);
93 EXPECT_STREQ("child2", (*shutdown_order())[0].c_str());
/external/chromium/chrome/browser/sync/syncable/
H A Dsyncable_unittest.cc928 MutableEntry child2(&wtrans, CREATE, parent2.Get(ID), "Pete");
929 ASSERT_TRUE(child2.good());
930 child2.Put(IS_DIR, true);
931 child2.Put(ID, id_factory.NewServerId());
932 child2.Put(BASE_VERSION, 1);
933 MutableEntry grandchild2(&wtrans, CREATE, child2.Get(ID), "Pete");
942 // child child2
/external/webkit/Source/WebCore/dom/
H A DNode.cpp2258 Node* child2 = chain2[--index2]; local
2259 if (child1 != child2) {
2263 if (child2->nodeType() == ATTRIBUTE_NODE)
2266 if (!child2->nextSibling())
2271 // Otherwise we need to see which node occurs first. Crawl backwards from child2 looking for child1.
2272 for (Node* child = child2->previousSibling(); child; child = child->previousSibling()) {
/external/bison/tests/
H A Dtestsuite[all...]

Completed in 1846 milliseconds

12