HomeSort by relevance Sort by last modified time
    Searched defs:node (Results 301 - 325 of 2901) sorted by null

<<11121314151617181920>>

  /frameworks/base/libs/hwui/tests/unit/
RenderNodeTests.cpp 52 EXPECT_TRUE(child->hasParents()) << "Child node has no parent";
53 EXPECT_FALSE(parent->hasParents()) << "Root node shouldn't have any parents";
60 EXPECT_FALSE(parent->hasParents()) << "Root node shouldn't have any parents";
65 EXPECT_FALSE(parent->hasParents()) << "Root node shouldn't have any parents";
83 auto node = TestUtils::createNode(0, 0, 200, 400, local
88 TestUtils::syncHierarchyPropertiesAndDisplayList(node);
91 TestUtils::recordNode(*node, [&](TestCanvas& canvas) {
97 TestUtils::syncHierarchyPropertiesAndDisplayList(node);
100 TestUtils::recordNode(*node, [](TestCanvas& canvas) {});
102 TestUtils::syncHierarchyPropertiesAndDisplayList(node);
    [all...]
  /frameworks/compile/libbcc/lib/Renderscript/
RSIsThreadablePass.cpp 115 llvm::NamedMDNode *node = variable
117 node->addOperand(llvm::MDNode::get(context, val));
  /frameworks/compile/mclinker/unittests/
FactoriesTest.cpp 40 NodeAlloc::NodeType* node = m_pNodeAlloc->produce(); local
43 node = m_pNodeAlloc->produce();
46 node = m_pNodeAlloc->produce();
52 NodeAlloc::NodeType* node = 0; local
54 node = m_pNodeAlloc->produce();
55 node->data = (int*)malloc(sizeof(int));
56 *(node->data) = i;
71 NodeAlloc::NodeType* node = 0; local
73 node = m_pNodeAlloc->produce();
74 node->data = (int*)malloc(sizeof(int))
93 NodeAlloc::NodeType* node = 0; local
117 NodeAlloc::NodeType* node = 0; local
153 NodeAlloc::NodeType* node = 0; local
    [all...]
GraphTest.cpp 39 ListDigraph::Node* u1 = graph.addNode();
40 ListDigraph::Node* u2 = graph.addNode();
41 ListDigraph::Node* u3 = graph.addNode();
58 ListDigraph::Node* head = NULL;
86 ListDigraph::Node* u1 = graph.addNode();
87 ListDigraph::Node* u2 = graph.addNode();
88 ListDigraph::Node* u3 = graph.addNode();
105 ListDigraph::Node* head = NULL;
133 ListDigraph::Node* u1 = graph.addNode();
134 ListDigraph::Node* u2 = graph.addNode()
316 Digraph::Node node = graph.addNode(); local
    [all...]
InputTreeTest.cpp 68 InputTree::iterator node = m_pTestee->root(); local
69 InputTree::const_iterator const_node = node;
70 --node;
73 ASSERT_TRUE(isGroup(node));
78 --node;
80 m_pTestee->enterGroup(node, InputTree::Downward);
82 InputTree::const_iterator const_node2 = node;
84 ASSERT_FALSE(node.isRoot());
86 ASSERT_FALSE(isGroup(node));
95 InputTree::iterator node = m_pTestee->root() local
120 InputTree::iterator node = m_pTestee->root(); local
139 InputTree::iterator node = m_pTestee->root(); local
    [all...]
  /hardware/libhardware/tests/input/evdev/
InputMocks.cpp 30 auto node = new MockInputDeviceNode(); local
31 node->setPath("/dev/input/event0");
32 node->setName("elan-touchscreen");
35 node->setBusType(0);
36 node->setVendorId(0);
37 node->setProductId(0);
38 node->setVersion(0);
42 node->addAbsAxis(ABS_MT_SLOT, nullptr);
43 node->addAbsAxis(ABS_MT_TOUCH_MAJOR, nullptr);
44 node->addAbsAxis(ABS_MT_POSITION_X, nullptr)
55 auto node = new MockInputDeviceNode(); local
74 auto node = new MockInputDeviceNode(); local
93 auto node = new MockInputDeviceNode(); local
117 auto node = new MockInputDeviceNode(); local
135 auto node = new MockInputDeviceNode(); local
157 auto node = new MockInputDeviceNode(); local
175 auto node = new MockInputDeviceNode(); local
193 auto node = new MockInputDeviceNode(); local
212 auto node = new MockInputDeviceNode(); local
    [all...]
  /hardware/qcom/camera/QCamera2/stack/common/
cam_queue.h 57 cam_node_t *node = local
59 if (NULL == node) {
63 memset(node, 0, sizeof(cam_node_t));
64 node->data = data;
67 cam_list_add_tail_node(&node->list, &queue->head.list);
76 cam_node_t *node = NULL; local
85 node = member_of(pos, cam_node_t, list);
86 cam_list_del_node(&node->list);
91 if (NULL != node) {
92 data = node->data
101 cam_node_t *node = NULL; local
    [all...]
  /hardware/qcom/camera/QCamera2/stack/mm-camera-test/src/
mm_qcamera_queue.c 85 camera_q_node *node = local
87 if (NULL == node) {
92 memset(node, 0, sizeof(camera_q_node));
93 node->data = data;
96 cam_list_add_tail_node(&node->list, &queue->m_head.list);
109 camera_q_node* node = NULL; local
122 node = member_of(pos, camera_q_node, list);
123 cam_list_del_node(&node->list);
128 if (NULL != node) {
129 data = node->data
138 camera_q_node* node = NULL; local
    [all...]
  /hardware/qcom/camera/QCamera2/stack/mm-jpeg-interface/src/
mm_jpeg_queue.c 47 mm_jpeg_q_node_t* node = local
49 if (NULL == node) {
54 memset(node, 0, sizeof(mm_jpeg_q_node_t));
55 node->data = data;
58 cam_list_add_tail_node(&node->list, &queue->head.list);
70 mm_jpeg_q_node_t* node = local
72 if (NULL == node) {
77 memset(node, 0, sizeof(mm_jpeg_q_node_t));
78 node->data = data;
84 cam_list_insert_before_node(&node->list, pos)
94 mm_jpeg_q_node_t* node = NULL; local
139 mm_jpeg_q_node_t* node = NULL; local
168 mm_jpeg_q_node_t* node = NULL; local
    [all...]
  /hardware/qcom/camera/QCamera2/util/
QCameraCmdThread.cpp 141 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
142 if (NULL == node) {
146 memset(node, 0, sizeof(camera_cmd_t));
147 node->cmd = cmd;
150 if (!cmd_queue.enqueueWithPriority((void *)node)) {
151 free(node);
152 node = NULL;
155 if (!cmd_queue.enqueue((void *)node)) {
156 free(node);
157 node = NULL
181 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
    [all...]
  /libcore/luni/src/main/java/javax/xml/transform/dom/
DOMResult.java 23 import org.w3c.dom.Node;
28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
45 * <p><code>node</code>,
57 * <p>Use a DOM node to create a new output target.</p>
59 * <p>In practice, the node should be
60 * a {@link org.w3c.dom.Document} node,
61 * a {@link org.w3c.dom.DocumentFragment} node, or
62 * a {@link org.w3c.dom.Element} node.
63 * In other words, a node that accepts children.</p>
69 * @param node The DOM node that will contain the result tree
337 private Node node = null; field in class:DOMResult
    [all...]
DOMSource.java 23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node; field in class:DOMSource
60 * no DOM source is set using {@link #setNode(Node node)} , then the
70 * Create a new input source with a DOM node. The operation
71 * will be applied to the subtree rooted at this node. In XSLT,
74 * from the root node also.
76 * @param n The DOM node that will contain the Source tree
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/
traits.hpp 61 class Node,
69 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
74 node>::other::pointer,
87 node>::other::pointer,
100 node>::other::pointer,
113 node>::other::pointer,
127 Node,
135 Node,
167 class Node,
181 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/
traits.hpp 61 class Node,
69 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
74 node>::other::pointer,
87 node>::other::pointer,
100 node>::other::pointer,
113 node>::other::pointer,
127 Node,
135 Node,
167 class Node,
181 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/
traits.hpp 61 class Node,
69 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
74 node>::other::pointer,
87 node>::other::pointer,
100 node>::other::pointer,
113 node>::other::pointer,
127 Node,
135 Node,
167 class Node,
181 typedef Node node; typedef in struct:__gnu_pbds::detail::bin_search_tree_traits
    [all...]
  /prebuilts/gdb/darwin-x86/include/python2.7/
node.h 2 /* Parse tree node interface */
17 } node; typedef in typeref:struct:_node
19 PyAPI_FUNC(node *) PyNode_New(int type);
20 PyAPI_FUNC(int) PyNode_AddChild(node *n, int type,
22 PyAPI_FUNC(void) PyNode_Free(node *n);
24 PyAPI_FUNC(Py_ssize_t) _PyNode_SizeOf(node *n);
27 /* Node access functions */
35 /* Assert that the type of a node is what we expect */
38 PyAPI_FUNC(void) PyNode_ListTree(node *);
  /prebuilts/gdb/linux-x86/include/python2.7/
node.h 2 /* Parse tree node interface */
17 } node; typedef in typeref:struct:_node
19 PyAPI_FUNC(node *) PyNode_New(int type);
20 PyAPI_FUNC(int) PyNode_AddChild(node *n, int type,
22 PyAPI_FUNC(void) PyNode_Free(node *n);
24 PyAPI_FUNC(Py_ssize_t) _PyNode_SizeOf(node *n);
27 /* Node access functions */
35 /* Assert that the type of a node is what we expect */
38 PyAPI_FUNC(void) PyNode_ListTree(node *);
  /prebuilts/ndk/current/platforms/android-21/arch-arm/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-21/arch-arm64/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-21/arch-mips/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-21/arch-mips64/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-21/arch-x86/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-21/arch-x86_64/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-23/arch-arm/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
  /prebuilts/ndk/current/platforms/android-23/arch-arm64/usr/include/
search.h 23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;

Completed in 850 milliseconds

<<11121314151617181920>>