| /hardware/qcom/audio/hal/audio_extn/ |
| ext_speaker.c | 124 struct listnode *node; local
126 list_for_each(node, &data->adev->usecase_list) {
127 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/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.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-linux-glibc2.15-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.15-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/current/sources/cxx-stl/gnu-libstdc++/4.9/include/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/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/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...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| EditTextRule.java | 40 public void onCreate(@NonNull INode node, @NonNull INode parent,
42 super.onCreate(node, parent, insertType);
48 node.appendChild(REQUEST_FOCUS);
52 node.setAttribute(ANDROID_URI, ATTR_EMS, "10"); //$NON-NLS-1$
79 public void handle(@NonNull INode node) {
80 INode focus = findFocus(findRoot(node));
85 node.appendChild(REQUEST_FOCUS);
97 /** Returns true if the given node currently has focus */
98 private static boolean hasFocus(INode node) {
99 INode focus = findFocus(node);
[all...] |
| ResizeState.java | 35 * The node being resized
37 public final INode node; field in class:ResizeState
40 * The layout containing the resized node
44 /** The proposed resized bounds of the node */
47 /** The preferred wrap_content bounds of the node */
90 * @param layout the parent layout containing the resized node
92 * @param node the node being resized
94 ResizeState(BaseLayoutRule rule, INode layout, Object layoutView, INode node) {
98 this.node = node
[all...] |
| TabHostRule.java | 44 public void onCreate(@NonNull INode node, @NonNull INode parent,
46 super.onCreate(node, parent, insertType);
52 node.setAttribute(ANDROID_URI, ATTR_ID, "@android:id/tabhost"); //$NON-NLS-1$
53 node.setAttribute(ANDROID_URI, ATTR_LAYOUT_WIDTH, fillParent);
54 node.setAttribute(ANDROID_URI, ATTR_LAYOUT_HEIGHT, fillParent);
56 INode linear = node.appendChild(FQCN_LINEAR_LAYOUT);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/color/ |
| ColorEditorDelegate.java | 32 import org.w3c.dom.Node;
81 // create the ui root node on demand.
90 // The manifest UI node is always created, even if there's no corresponding XML node.
109 Node node = getEditor().getXmlDocument(model).getDocumentElement(); local
110 getUiRootNode().reloadFromXmlNode(node);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/values/ |
| ValuesEditorDelegate.java | 33 import org.w3c.dom.Node;
90 * Processes the new XML Model, which XML root node is given.
105 Node node = (Node) xpath.evaluate("/" + resources_desc.getXmlName(), //$NON-NLS-1$ local
107 XPathConstants.NODE);
108 // Node can be null _or_ it must be the element we searched for.
109 assert node == null || node.getNodeName().equals(resources_desc.getXmlName());
111 // Refresh the manifest UI node and all its descendant
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockNamedNodeMap.java | 21 import org.w3c.dom.Node;
29 private final HashMap<String, HashMap<String, Node>> mNodeMap =
30 new HashMap<String, HashMap<String, Node>>();
33 private final ArrayList<Node> mNodeList = new ArrayList<Node>();
36 MockXmlNode node = new MockXmlNode(namespace, localName, value); local
43 HashMap<String, Node> map = mNodeMap.get(namespace);
45 map = new HashMap<String, Node>();
50 map.put(localName, node);
51 mNodeList.add(node);
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| CaptureRenderer.java | 25 private ViewNode node; field in class:CaptureRenderer
28 CaptureRenderer(ImageIcon icon, ViewNode node) {
30 this.node = node;
38 if (node.hasMargins) {
39 d.width += node.marginLeft + node.marginRight;
40 d.height += node.marginTop + node.marginBottom;
65 if ((node.paddingBottom | node.paddingLeft
[all...] |
| /system/core/init/ |
| ueventd_parser.cpp | 86 struct listnode *node; local
89 list_for_each(node, &subsystem_list) {
90 s = node_to_item(node, struct ueventd_subsystem, slist);
|
| /system/core/libcutils/ |
| android_reboot.c | 97 struct listnode* node; local
99 list_for_each_safe(node, n, entries) {
100 mntent_list* item = node_to_item(node, mntent_list, list);
111 struct listnode* node; local
112 list_for_each(node, rw_entries) {
113 mntent_list* item = node_to_item(node, mntent_list, list);
137 struct listnode* node; local
194 list_for_each(node, &rw_entries) {
195 mntent_list* item = node_to_item(node, mntent_list, list);
201 list_for_each(node, &ro_entries)
[all...] |
| /system/core/libmemunreachable/ |
| LeakFolding.h | 46 Node<SCCInfo> node; member in struct:LeakFolding::SCCInfo
57 SCCInfo(Allocator<SCCInfo> allocator) : node(this, allocator),
67 Node<LeakInfo> node; member in struct:LeakFolding::LeakInfo
74 : node(this, allocator), range(range),
|
| /system/sepolicy/tools/sepolicy-analyze/ |
| dups.c | 20 avtab_ptr_t node; local
56 for (node = avtab_search_node(&policydb->te_avtab, &avkey);
57 node != NULL;
58 node = avtab_search_node_next(node, avkey.specified)) {
59 uint32_t perms = node->datum.data & d->data;
60 if ((attrib1 && perms == node->datum.data) ||
68 display_allow(policydb, &node->key, i, node->datum.data);
|
| /system/update_engine/payload_generator/ |
| cycle_breaker_unittest.cc | 135 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node
151 const Vertex::Index node = counter++; local
152 graph[last_hub].out_edges.insert(EdgeWithWeight(node, weight));
153 graph[node].out_edges.insert(EdgeWithWeight(next_hub, weight));
|
