| /external/google-breakpad/src/processor/ |
| static_map.h | 38 // uint32 (4 bytes): address offset of node1's mapped_value
44 // (X bytes): node1's key
50 // (? bytes): node1's mapped_value
|
| /external/snakeyaml/src/test/java/examples/jodatime/ |
| JodaTimeFlowStylesTest.java | 51 Node node1 = dumper.represent(bean); local
56 assertEquals(node2.toString(), node1.toString());
58 List<Event> events1 = dumper.serialize(node1);
|
| /external/v8/src/compiler/ |
| instruction-scheduler.h | 93 // Compare the two nodes and return true if node1 is a better candidate than
94 // node2 (i.e. node1 should be scheduled before node2).
95 bool CompareNodes(ScheduleGraphNode *node1, ScheduleGraphNode *node2) const;
|
| instruction-scheduler.cc | 113 bool InstructionScheduler::CompareNodes(ScheduleGraphNode *node1,
115 return node1->total_latency() > node2->total_latency();
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator_unittest.cc | 21 PartitionTreeNode* node1 = local
24 new PartitionTreeNode(node1, kVector, kNumPartitions, 17);
25 delete node1;
|
| /external/opencv/cv/src/ |
| cvhistogram.cpp | 516 CvSparseNode *node1, *node2; local
527 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
528 node1 != 0; node1 = cvGetNextSparseNode( &iterator ))
530 double v1 = *(float*)CV_NODE_VAL(mat1,node1);
531 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), 0, 0, &node1->hashval );
559 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
560 node1 != 0; node1 = cvGetNextSparseNode( &iterator )
[all...] |
| /external/v8/test/unittests/compiler/ |
| graph-reducer-unittest.cc | 244 Node* node1 = graph()->NewNode(&kOpA1, node0); local
246 EXPECT_CALL(e, Replace(node1, node1));
248 EXPECT_FALSE(r.Reduce(node1).Changed());
263 Node* node1 = graph()->NewNode(&kOpA1, node0); local
265 EXPECT_CALL(e, Revisit(node1));
267 EXPECT_FALSE(r.Reduce(node1).Changed());
459 Node* node1 = graph()->NewNode(&kOpA1, node0); local
462 EXPECT_CALL(r, Reduce(node1)).WillOnce(Return(Reducer::Replace(node2)));
463 ReduceNode(node1, &r)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMHelper.java | 188 * in the document than node1, in Document Order as defined
197 * @param node1 DOM Node to perform position comparison on.
200 * @return false if node2 comes before node1, otherwise return true.
202 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>.
204 public static boolean isNodeAfter(Node node1, Node node2)
206 if (node1 == node2 || isNodeTheSame(node1, node2))
212 Node parent1 = getParentOfNode(node1);
219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2);
263 Node startNode1 = node1, startNode2 = node2
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| load.ll | 41 @node2 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node1 to %struct.ListNode*), i32 1, [4 x i8] undef }, align 8
42 @node1 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* null, i32 0, [4 x i8] undef }, align 8
53 ; CHECK: --> %n.01{{ U: [^ ]+ S: [^ ]+}}{{ *}}Exits: @node1
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBody.h | 711 int node1) const;
713 const Node* node1) const;
716 int node1,
742 int node1,
746 Node* node1,
752 int node1,
758 int node1,
861 bool cutLink(int node0,int node1,btScalar position);
862 bool cutLink(const Node* node0,const Node* node1,btScalar position);
|
| btSoftBody.cpp | 131 bool btSoftBody::checkLink(int node0,int node1) const
133 return(checkLink(&m_nodes[node0],&m_nodes[node1]));
137 bool btSoftBody::checkLink(const Node* node0,const Node* node1) const
139 const Node* n[]={node0,node1};
153 bool btSoftBody::checkFace(int node0,int node1,int node2) const
156 &m_nodes[node1],
272 int node1,
276 appendLink(&m_nodes[node0],&m_nodes[node1],mat,bcheckexist);
281 Node* node1,
285 if((!bcheckexist)||(!checkLink(node0,node1)))
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| btSoftBody.java | [all...] |
| /external/libweave/src/notification/ |
| xml_node.h | 65 // <node1 id="1"><node2 id="2"><node3 id="3"/></node2></node1>
|
| /external/opencv3/modules/core/test/ |
| test_io.cpp | 41 CvSparseNode* node1; local
48 for( node1 = cvInitSparseMatIterator( m1, &it1 );
49 node1 != 0; node1 = cvGetNextSparseNode( &it1 ))
51 uchar* v1 = (uchar*)CV_NODE_VAL(m1,node1);
52 uchar* v2 = cvPtrND( m2, CV_NODE_IDX(m1,node1), 0, 0, &node1->hashval );
|
| /art/runtime/ |
| profiler.h | 72 bool operator()(StackTrieNode* node1, StackTrieNode* node2) const {
73 MethodReference mr1 = node1->GetMethod();
77 return node1->GetDexPC() < node2->GetDexPC();
|
| /external/zopfli/src/zopfli/ |
| katajainen.c | 149 Node* node1 = GetFreeNode(0, maxbits, pool); local
151 InitNode(leaves[1].weight, 2, 0, node1);
154 lists[i][1] = node1;
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| gc_test.go | 234 type Node1 struct {
240 benchSetType(b, new(Node1))
244 benchSetType(b, make([]Node1, 32))
|
| /prebuilts/go/linux-x86/src/runtime/ |
| gc_test.go | 234 type Node1 struct {
240 benchSetType(b, new(Node1))
244 benchSetType(b, make([]Node1, 32))
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
| DOM2Helper.java | 34 * dropped method isNodeAfter(Node node1, Node node2)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| CanvasViewInfoTest.java | 487 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
489 MergeCookie cookie1 = new MergeCookie(node1);
518 Object cookie = (i % 2) == 0 ? node1 : node2;
539 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
541 MergeCookie cookie1 = new MergeCookie(node1);
569 Object cookie = (i % 2) == 0 ? node1 : node2;
602 UiViewElementNode node1 = createNode(rootNode, "childNode1", false); local
605 ViewInfo childView1 = new ViewInfo("childView1", node1, 0, 20, 50, 40);
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| histogram.cpp | [all...] |
| /external/libxml2/ |
| xpath.c | 141 * @node1: the first node
151 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) {
158 if ((node1 == NULL) || (node2 == NULL))
161 if (node1 == node2)
167 switch (node1->type) {
170 if ((0 > (long) node1->content) && /* TODO: Would a != 0 suffice here? */
172 (node1->doc == node2->doc))
174 l1 = -((long) node1->content);
186 miscNode1 = node1;
187 node1 = node1->parent
[all...] |
| /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treebuilders/ |
| _base.py | 112 def nodesEqual(self, node1, node2):
113 if not node1.nameTuple == node2.nameTuple:
116 if not node1.attributes == node2.attributes:
|
| /external/v8/test/cctest/compiler/ |
| test-js-constant-cache.cc | 248 Node* node1 = T.Constant(value); local
251 CHECK_EQ(node1, node2);
252 CHECK_EQ(node1, node3);
|
| /external/valgrind/coregrind/ |
| m_deduppoolalloc.c | 184 static Word cmp_pool_elt (const void* node1, const void* node2 )
186 const ht_node* hnode1 = node1;
|
