| /external/mesa3d/src/mesa/vbo/ |
| vbo_save_draw.c | 51 const struct vbo_save_vertex_list *node)
58 if (node->current_size == 0)
61 if (node->current_data) {
62 data = node->current_data;
67 if (node->count)
68 offset = (node->buffer_offset +
69 (node->count-1) * node->vertex_size * sizeof(GLfloat));
71 offset = node->buffer_offset;
74 node->vertex_size * sizeof(GLfloat),
259 const struct vbo_save_vertex_list *node = local
[all...] |
| /external/oprofile/libpp/ |
| profile.cpp | 50 odb_node_t * node = odb_get_iterator(&samples_db, &node_nr); local
52 count += node[pos].value;
110 odb_node_t * node = odb_get_iterator(&samples_db, &node_nr); local
114 ordered_samples.find(node[pos].key);
116 it->second += node[pos].value;
119 val(node[pos].key, node[pos].value);
|
| /external/owasp/sanitizer/src/tests/org/owasp/html/ |
| Benchmark.java | 36 import org.w3c.dom.Node;
128 Node node = parser.parse(new InputSource(new StringReader(html))); local
129 return System.identityHashCode(node) >> 24;
|
| /external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/ |
| tgt.c | 51 opj_tgt_node_t *node = 00; local
91 fprintf(stderr, "ERROR in tgt_create while allocating node of the tree\n");
98 node = tree->nodes;
106 node->parent = l_parent_node;
107 ++node;
109 node->parent = l_parent_node;
110 ++node;
122 node->parent = 0;
254 opj_tgt_node_t *node; local
255 node = &tree->nodes[leafno]
265 opj_tgt_node_t *node; local
305 opj_tgt_node_t *node; local
[all...] |
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_; local
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next
[all...] |
| /external/skia/samplecode/ |
| SampleAnimator.cpp | 66 const SkDOMNode* node, const char name[]) {
67 if (NULL == node) {
68 node = dom.getRootNode();
71 const char* idval = dom.findAttr(node, "id");
73 return node;
75 const SkDOMNode* child = dom.getFirstChild(node);
82 } while ((node = dom.getNextSibling(node)) != NULL);
101 const SkDOM::Node* root = dom.build(text, len);
113 const SkDOM::Node* node = find_nodeID(dom, NULL, name.c_str()) local
[all...] |
| /external/skia/src/views/ |
| SkViewInflate.cpp | 20 void SkViewInflate::rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent)
22 const char* str = dom.findAttr(node, "id");
26 const SkDOM::Node* child = dom.getFirstChild(node);
50 this->inflateView(parent, dom, node);
53 void SkViewInflate::inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node)
58 view->inflate(dom, node);
61 SkView* SkViewInflate::inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root
104 const SkDOM::Node* node = dom.build(xml, len); local
[all...] |
| /external/smack/src/org/jivesoftware/smackx/pubsub/ |
| Affiliation.java | 20 * Represents a affiliation between a user and a node, where the {@link #type} defines
32 protected String node;
field in class:Affiliation
55 * @param node The node with affiliation.
58 public Affiliation(String jid, String node, Type affiliation)
61 this.node = node;
72 return node;
94 if (node != null)
95 appendAttribute(builder, "node", node);
[all...] |
| /frameworks/opt/vcard/tests/src/com/android/vcard/tests/testutils/ |
| PropertyNode.java | 128 PropertyNode node = (PropertyNode)obj; local
130 if (propName == null || !propName.equals(node.propName)) {
132 } else if (!paramMap_TYPE.equals(node.paramMap_TYPE)) {
134 } else if (!paramMap_TYPE.equals(node.paramMap_TYPE)) {
136 } else if (!propGroupSet.equals(node.propGroupSet)) {
140 if (propValue_bytes != null && Arrays.equals(propValue_bytes, node.propValue_bytes)) {
143 if (!propValue.equals(node.propValue)) {
151 return (propValue_vector.equals(node.propValue_vector) ||
153 node.propValue_vector.size() == 1);
|
| /hardware/qcom/audio/hal/audio_extn/ |
| ext_speaker.c | 123 struct listnode *node; local
125 list_for_each(node, &data->adev->usecase_list) {
126 usecase = node_to_item(node, struct audio_usecase, list);
|
| /libcore/luni/src/test/java/libcore/xml/ |
| SimpleBuilderTest.java | 25 import org.w3c.dom.Node;
46 private String getTextContent(Node node) {
47 String result = (node instanceof Text ? ((Text) node).getData() : "");
49 Node child = node.getFirstChild();
97 Node node = list.item(i); local
99 if (node instanceof ProcessingInstruction)
[all...] |
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
85 // 1. Deletes every node.
86 QueueNode<E>* node = head_; local
87 QueueNode<E>* next = node->next();
89 delete node;
90 node = next
[all...] |
| /packages/apps/OMA-DM/plugins/pluginhelper/com/android/omadm/pluginhelper/ |
| DmtMoBuilder.java | 46 * Checks if a node by given path exists in the subtree.
48 * @param nodePath path to the node.
49 * @return true if the node is exist otherwise false.
57 * Creates new leaf node in the subtree. The parent node is updated automatically.
59 * @param nodePath path to the new node.
60 * @param nodeValue new node value.
102 * @param nodePath path to the new node.
103 * @param nodeValue new node value.
114 * @param nodePath path to the new node
157 DmtPluginNode node = mNodes.get(nodePath); local
208 DmtPluginNode node = mNodes.get(nodePath); local
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_node_priority_queue.h | 87 DicNode *node = mDicNodesQueue.top(); local
89 DicNodeUtils::initByCopy(node, dest);
91 mDicNodePool.placeBackInstance(node);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 85 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 76 typedef base_type::_Node_base<synth_access_traits, metadata> node; typedef in struct:__gnu_pbds::detail::trie_traits
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_const_iterator;
90 typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iterator;
92 /// Type for node update.
123 typedef base_type::_Node_base<synth_access_traits, metadata> node; typedef in struct:__gnu_pbds::detail::trie_traits
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-dump.h | 33 /* Information about a node to be dumped. */
37 /* The index for the node. */
39 /* Nonzero if the node is a binfo. */
47 /* The queued tree node. */
48 splay_tree_node node; member in struct:dump_queue
49 /* The next node in the queue. */
60 /* The original node. */
61 const_tree node; member in struct:dump_info
64 /* The next unused node index. */
68 /* The first node in the queue of nodes to be written out. *
[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/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 85 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 76 typedef base_type::_Node_base<synth_access_traits, metadata> node; typedef in struct:__gnu_pbds::detail::trie_traits
81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator;
82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator;
83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator;
84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator;
88 typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_const_iterator;
90 typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iterator;
92 /// Type for node update.
123 typedef base_type::_Node_base<synth_access_traits, metadata> node; typedef in struct:__gnu_pbds::detail::trie_traits
128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
