Searched refs:node (Results 1 - 25 of 206) sorted by relevance

123456789

/frameworks/av/services/audiopolicy/common/managerdefinitions/src/
H A DConfigParsingUtils.cpp36 cnode *node = root->first_child; local
40 while (node) {
41 if (strcmp(node->name, GAIN_MODE) == 0) {
42 gain->setMode(GainModeConverter::maskFromString(node->value));
43 } else if (strcmp(node->name, GAIN_CHANNELS) == 0) {
46 if (InputChannelConverter::fromString(node->value, mask)) {
50 if (OutputChannelConverter::fromString(node->value, mask)) {
54 } else if (strcmp(node->name, GAIN_MIN_VALUE) == 0) {
55 gain->setMinValueInMb(atoi(node->value));
56 } else if (strcmp(node
82 cnode *node = root->first_child; local
103 cnode *node = root->first_child; local
153 cnode *node = root->first_child; local
225 cnode *node = config_find(root, DEVICES_TAG); local
271 cnode *node = config_find(root, AUDIO_HW_MODULE_TAG); local
323 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local
370 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local
[all...]
/frameworks/support/jetifier/jetifier/processor/src/main/kotlin/com/android/tools/build/jetifier/processor/transform/pom/
H A DPomDependencyExtensions.kt24 * Transforms the current data into XML '<dependency>' node.
27 val node = Element("dependency")
28 node.namespace = document.rootElement.namespace
30 XmlUtils.addStringNodeToNode(node, "groupId", groupId)
31 XmlUtils.addStringNodeToNode(node, "artifactId", artifactId)
32 XmlUtils.addStringNodeToNode(node, "version", version)
33 XmlUtils.addStringNodeToNode(node, "classifier", classifier)
34 XmlUtils.addStringNodeToNode(node, "type", type)
35 XmlUtils.addStringNodeToNode(node, "scope", scope)
36 XmlUtils.addStringNodeToNode(node, "systemPat
[all...]
/frameworks/base/libs/hwui/tests/microbench/
H A DRenderNodeBench.cpp26 auto node = new RenderNode(); local
27 node->incStrong(0);
28 benchmark::DoNotOptimize(node);
29 node->decStrong(0);
/frameworks/base/tools/incident_report/
H A Dgeneric_message.cpp30 Node node; local
31 node.type = TYPE_VALUE32;
32 node.value32 = value;
33 mNodes.insert(pair<int32_t,Node>(fieldId, node));
39 Node node; local
40 node.type = TYPE_VALUE64;
41 node.value64 = value;
42 mNodes.insert(pair<int32_t,Node>(fieldId, node));
49 Node node; local
50 node
59 Node node; local
[all...]
/frameworks/compile/mclinker/unittests/
H A DInputTreeTest.cpp68 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 local
120 InputTree::iterator node = m_pTestee->root(); local
139 InputTree::iterator node = m_pTestee->root(); local
[all...]
H A DFactoriesTest.cpp40 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
93 NodeAlloc::NodeType* node = 0; local
117 NodeAlloc::NodeType* node = 0; local
153 NodeAlloc::NodeType* node = 0; local
[all...]
/frameworks/rs/
H A DrsMap.h57 LinkNode* node = bucket[index]; local
60 while (node != nullptr) {
61 if (node->entry.first == key) {
62 return node->entry.second;
64 prev = node;
65 node = node->next;
68 node = new LinkNode();
69 node->entry.first = key;
70 node
122 LinkNode* node; member in class:android::renderscript::Map::iterator
128 LinkNode* node = bucket[i]; local
145 LinkNode* node = bucket[index]; local
[all...]
/frameworks/opt/telephony/tests/telephonytests/src/com/android/internal/telephony/uicc/euicc/asn1/
H A DAsn1NodeTest.java40 Asn1Node node = Asn1Node.newBuilder(0x65).build();
41 assertEquals(0x65, node.getTag());
42 assertTrue(node.isConstructed());
43 assertEquals(2, node.getEncodedLength());
44 assertEquals(0, node.getDataLength());
45 assertArrayEquals(new byte[] {0x65, 0x00}, node.toBytes());
51 Asn1Node node = Asn1Node.newBuilder(0x3F34).build();
52 assertEquals(0x3F34, node.getTag());
53 assertTrue(node.isConstructed());
54 assertEquals(3, node
[all...]
/frameworks/base/apct-tests/perftests/core/src/android/graphics/perftests/
H A DRenderNodePerfTest.java38 final RenderNode node = RenderNode.create("benchmark", null);
42 node.setTranslationX(1.0f);
50 RenderNode node = RenderNode.create(null, null);
51 node.destroy();
59 RenderNode node = RenderNode.create("LinearLayout", null);
60 node.destroy();
67 RenderNode node = RenderNode.create("LinearLayout", null);
69 node.isValid();
76 RenderNode node = RenderNode.create("LinearLayout", null);
78 DisplayListCanvas canvas = node
[all...]
H A DCanvasPerfTest.java42 RenderNode node = RenderNode.create("benchmark", null);
46 DisplayListCanvas canvas = node.start(100, 100);
47 node.end(canvas);
53 canvas = node.start(200, 200);
62 node.end(canvas);
71 RenderNode node = RenderNode.create("benchmark", null);
73 DisplayListCanvas canvas = node.start(100, 100);
74 node.end(canvas);
80 canvas = node.start(100, 100);
92 node
[all...]
/frameworks/base/cmds/uiautomator/library/core-src/com/android/uiautomator/core/
H A DUiObject.java151 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout());
152 if(node == null) {
155 return node.getChildCount();
167 AccessibilityNodeInfo node = null;
171 node = getQueryController().findAccessibilityNodeInfo(getSelector());
172 if (node != null) {
183 return node;
335 * @param node
336 * @return null if node is null, else a Rect containing visible bounds
338 private Rect getVisibleBounds(AccessibilityNodeInfo node) { argument
376 getScrollableParent(AccessibilityNodeInfo node) argument
[all...]
H A DAccessibilityNodeInfoDumper.java47 * @param root The root accessibility node.
69 * @param root The root accessibility node.
101 private static void dumpNodeRec(AccessibilityNodeInfo node, XmlSerializer serializer,int index, argument
103 serializer.startTag("", "node");
104 if (!nafExcludedClass(node) && !nafCheck(node))
107 serializer.attribute("", "text", safeCharSeqToString(node.getText()));
108 serializer.attribute("", "resource-id", safeCharSeqToString(node.getViewIdResourceName()));
109 serializer.attribute("", "class", safeCharSeqToString(node.getClassName()));
110 serializer.attribute("", "package", safeCharSeqToString(node
150 nafExcludedClass(AccessibilityNodeInfo node) argument
169 nafCheck(AccessibilityNodeInfo node) argument
195 childNafCheck(AccessibilityNodeInfo node) argument
[all...]
H A DAccessibilityNodeInfoHelper.java28 * Returns the node's bounds clipped to the size of the display
30 * @param node
33 * @return null if node is null, else a Rect containing visible bounds
35 static Rect getVisibleBoundsInScreen(AccessibilityNodeInfo node, int width, int height) { argument
36 if (node == null) {
39 // targeted node's bounds
41 node.getBoundsInScreen(nodeRect);
/frameworks/support/coordinatorlayout/src/main/java/androidx/coordinatorlayout/widget/
H A DDirectedAcyclicGraph.java47 * Add a node to the graph.
49 * <p>If the node already exists in the graph then this method is a no-op.</p>
51 * @param node the node to add
53 public void addNode(@NonNull T node) { argument
54 if (!mGraph.containsKey(node)) {
55 mGraph.put(node, null);
60 * Returns true if the node is already present in the graph, false otherwise.
62 public boolean contains(@NonNull T node) { argument
63 return mGraph.containsKey(node);
75 addEdge(@onNull T node, @NonNull T incomingEdge) argument
97 getIncomingEdges(@onNull T node) argument
108 getOutgoingEdges(@onNull T node) argument
129 hasOutgoingEdges(@onNull T node) argument
173 dfs(final T node, final ArrayList<T> result, final HashSet<T> tmpMarked) argument
[all...]
/frameworks/base/tools/aapt2/java/
H A DProguardRules.cpp45 void Visit(xml::Element* node) override {
46 if (!node->namespace_uri.empty()) {
48 xml::ExtractPackageFromNamespace(node->namespace_uri);
51 std::string package = maybe_package.value().package + "." + node->name;
53 AddClass(node->line_number, package);
56 } else if (util::IsJavaClassName(node->name)) {
57 AddClass(node->line_number, node->name);
60 for (const auto& child : node->children) {
64 for (const auto& attr : node
[all...]
/frameworks/support/navigation/common/ktx/src/main/java/androidx/navigation/
H A DNavGraph.kt42 * @param node destination to add
44 inline operator fun NavGraph.plusAssign(node: NavDestination) {
45 addDestination(node)
59 /** Removes `node` from this navigation graph. */
60 inline operator fun NavGraph.minusAssign(node: NavDestination) {
61 remove(node)
/frameworks/base/cmds/statsd/benchmark/
H A Dfilter_value_benchmark.cpp30 AttributionNodeInternal node; local
31 node.set_uid(100);
32 node.set_tag("LOCATION");
34 std::vector<AttributionNodeInternal> nodes = {node, node};
/frameworks/opt/setupwizard/tools/docs/
H A Djsilver.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/clearsilver/ org/clearsilver/DelegatedHdf.class DelegatedHdf. ...
/frameworks/av/media/libeffects/factory/
H A DEffectsConfigLoader.c41 static int loadEffect(cnode *node);
42 // To get and add the effect pointed by the passed node to the gSubEffectList
80 cnode *node; local
82 node = config_find(root, LIBRARIES_TAG);
83 if (node == NULL) {
86 node = node->first_child;
87 while (node) {
88 loadLibrary(node, node
153 cnode *node; local
236 cnode *node; local
291 cnode *node; local
307 cnode *node; local
[all...]
/frameworks/base/core/java/android/animation/
H A DAnimatorSet.java79 * to a single node representing that Animator, not create a new Node
190 throw new AndroidRuntimeException("Error: animation ended is not in the node map");
306 Node node = mNodes.get(i);
307 if (node != mRootNode) {
308 childList.add(node.mAnimation);
325 Node node = mNodes.get(i);
326 Animator animation = node.mAnimation;
573 Node node = mNodes.get(i);
574 if (node == mRootNode) {
575 node
1159 pulseFrame(Node node, long animPlayTime) argument
1168 getPlayTimeForNode(long overallPlayTime, Node node) argument
1172 getPlayTimeForNode(long overallPlayTime, Node node, boolean inReverse) argument
1709 findSiblings(Node node, ArrayList<Node> siblings) argument
1829 addChild(Node node) argument
1839 addSibling(Node node) argument
1849 addParent(Node node) argument
1886 AnimationEvent(Node node, int event) argument
[all...]
/frameworks/compile/mclinker/lib/Core/
H A DInputTree.cpp26 pMover.connect(pRoot, pTree.m_Root.node.right);
29 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
36 NodeBase* node = createNode(); local
37 pMover.connect(pRoot, node);
44 BinaryTree<Input>::node_type* node = createNode(); local
45 node->data = &pInput;
46 pMover.connect(pRoot, node);
/frameworks/base/tools/aapt2/tools/
H A Dpublic_attr_map.py31 for node in tree.iter('public'):
32 if node.get('type') == 'attr':
33 sdkLevel = findSdkLevelForAttribute(node.get('id', '0'))
35 attrs.append("{{ u\"{}\", {} }}".format(node.get('name'), sdkLevel))
/frameworks/support/navigation/common/src/main/java/androidx/navigation/
H A DNavGraph.java109 * @param node destination to add
111 public void addDestination(@NonNull NavDestination node) { argument
112 if (node.getId() == 0) {
116 NavDestination existingDestination = mNodes.get(node.getId());
117 if (existingDestination == node) {
120 if (node.getParent() != null) {
127 node.setParent(this);
128 mNodes.put(node.getId(), node);
142 for (NavDestination node
246 remove(@onNull NavDestination node) argument
[all...]
/frameworks/support/coordinatorlayout/src/androidTest/java/androidx/coordinatorlayout/widget/
H A DDirectedAcyclicGraphTest.java45 final TestNode node = new TestNode("node");
46 mGraph.addNode(node);
48 assertTrue(mGraph.contains(node));
53 final TestNode node = new TestNode("node");
54 mGraph.addNode(node);
55 mGraph.addNode(node);
58 assertTrue(mGraph.contains(node));
63 final TestNode node
[all...]
/frameworks/base/core/java/android/content/
H A DUriMatcher.java125 * Creates the root node of the URI tree.
177 UriMatcher node = this;
180 ArrayList<UriMatcher> children = node.mChildren;
187 node = child;
202 node.mChildren.add(child);
203 node = child;
206 node.mCode = code;
214 * @return The code for the matched node (added using addURI),
215 * or -1 if there is no matched node.
222 UriMatcher node
[all...]

Completed in 672 milliseconds

123456789