| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_node_unittest.cc | 32 WPDNode node(kDataLength, kCoefficients, kCoefficientsLength);
33 EXPECT_EQ(0, node.set_data(kParentData, kDataLength));
34 EXPECT_EQ(0, memcmp(node.data(),
36 kDataLength * sizeof(node.data()[0])));
41 WPDNode node(kDataLength, &kIndentyCoefficient, 1);
42 EXPECT_EQ(0, node.Update(kParentData, kParentDataLength));
44 EXPECT_FLOAT_EQ(kParentData[i * 2 + 1], node.data()[i]);
49 WPDNode node(kDataLength, kCoefficients, kCoefficientsLength);
50 EXPECT_EQ(0, node.Update(kParentData, kParentDataLength));
51 EXPECT_NEAR(0.1f, node.data()[0], kTolerance)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseIterators.java | 39 * Construct a DTMDefaultBaseTraversers object from a DOM node.
61 * Construct a DTMDefaultBaseTraversers object from a DOM node.
72 * @param usePrevsib true if we want to build the previous sibling node array.
92 * with a start node (using iterator.setStartNode()).
174 * with a start node (using iterator.setStartNode()).
257 * returned (starting point for the next() search); for single-node
258 * iterators it may instead be initialized to point to that single node.
263 * Remembers the current node for the next call to gotoMark().
273 * Restores the current node remembered by setMark().
285 * Iterator that returns all immediate children of a given node
328 int node = _currentNode; local
473 int node = _currentNode; local
628 int node = _currentNode; local
666 int node; local
771 int node = _startNode; local
852 int node = _currentNode; local
936 int node = _currentNode; local
1005 final int node = _currentNode; local
1068 final int node = _currentNode; local
1159 final int node = _currentNode; local
1196 int node = _currentNode; local
1427 int node = _currentNode; local
1532 int node = _currentNode; local
1568 int node; local
1881 int node = _currentNode; local
1946 int node; local
2002 int node; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| TokenIndex.java | 5 import com.google.clearsilver.jsilver.syntax.node.*;
13 public void caseTData(@SuppressWarnings("unused") TData node)
19 public void caseTComment(@SuppressWarnings("unused") TComment node)
25 public void caseTVar(@SuppressWarnings("unused") TVar node)
31 public void caseTLvar(@SuppressWarnings("unused") TLvar node)
37 public void caseTEvar(@SuppressWarnings("unused") TEvar node)
43 public void caseTUvar(@SuppressWarnings("unused") TUvar node)
49 public void caseTSet(@SuppressWarnings("unused") TSet node)
55 public void caseTIf(@SuppressWarnings("unused") TIf node)
61 public void caseTElseIf(@SuppressWarnings("unused") TElseIf node)
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ALoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
62 public void setPosition(PPosition node)
69 if(node != null)
71 if(node.parent() != null)
73 node.parent().removeChild(node);
76 node.parent(this);
79 this._position_ = node;
87 public void setVariable(PVariable node)
94 if(node != null
[all...] |
| /external/parameter-framework/upstream/tools/xmlGenerator/ |
| hostConfig.py | 43 for node in dom.getElementsByTagName("ParameterFrameworkConfiguration"):
45 node.setAttribute("ServerPort", serverPort)
46 node.setAttribute("TuningAllowed", "true")
49 for node in dom.getElementsByTagName(tag):
50 node.parentNode.removeChild(node)
55 for node in dom.getElementsByTagName("StructureDescriptionFileLocation"):
56 node.setAttribute("Path", structPath + "/" + node.getAttribute("Path"))
|
| /external/selinux/libsemanage/src/ |
| node_record.c | 28 int semanage_node_compare(const semanage_node_t * node,
32 return sepol_node_compare(node, key);
37 int semanage_node_compare2(const semanage_node_t * node,
41 return sepol_node_compare2(node, node2);
46 hidden int semanage_node_compare2_qsort(const semanage_node_t ** node,
50 return sepol_node_compare2(*node, *node2);
64 const semanage_node_t * node,
68 return sepol_node_key_extract(handle->sepolh, node, key_ptr);
83 const semanage_node_t * node, char **addr_ptr)
86 return sepol_node_get_addr(handle->sepolh, node, addr_ptr)
[all...] |
| /system/core/liblog/ |
| config_read.h | 31 struct android_log_transport_read, node); \
33 struct android_log_transport_read, node)); \
34 transp = node_to_item(transp->node.next, \
35 struct android_log_transport_read, node)) \
39 struct android_log_transport_read, node), \
40 n = transp->node.next; \
42 struct android_log_transport_read, node)); \
43 transp = node_to_item(n, struct android_log_transport_read, node), \
44 n = transp->node.next)
|
| config_write.h | 31 struct android_log_transport_write, node); \
33 struct android_log_transport_write, node)); \
34 transp = node_to_item(transp->node.next, \
35 struct android_log_transport_write, node)) \
39 struct android_log_transport_write, node), \
40 n = transp->node.next; \
42 struct android_log_transport_write, node)); \
43 transp = node_to_item(n, struct android_log_transport_write, node), \
44 n = transp->node.next)
|
| /external/opencv3/3rdparty/libjasper/ |
| jpc_tagtree.c | 99 jpc_tagtreenode_t *node; local
134 node = tree->nodes_;
142 node->parent_ = parentnode;
143 ++node;
145 node->parent_ = parentnode;
146 ++node;
158 node->parent_ = 0;
225 jpc_tagtreenode_t *node; local
228 node = tree->nodes_;
231 node->value_ = INT_MAX
244 jpc_tagtreenode_t *node; local
272 jpc_tagtreenode_t *node; local
332 jpc_tagtreenode_t *node; local
382 jpc_tagtreenode_t *node; local
[all...] |
| /external/v8/src/compiler/ |
| tail-call-optimization.cc | 10 #include "src/compiler/node-properties.h"
16 Reduction TailCallOptimization::Reduce(Node* node) {
17 if (node->opcode() != IrOpcode::kReturn) return NoChange();
21 Node* const call = NodeProperties::GetValueInput(node, 0);
24 NodeProperties::GetEffectInput(node) == call &&
26 Node* const control = NodeProperties::GetControlInput(node);
28 call->OwnedBy(node, control) && control->OwnedBy(node))
[all...] |
| dead-code-elimination.cc | 9 #include "src/compiler/node-properties.h"
24 Reduction DeadCodeElimination::Reduce(Node* node) {
25 switch (node->opcode()) {
27 return ReduceEnd(node);
30 return ReduceLoopOrMerge(node);
32 return ReduceNode(node);
39 Reduction DeadCodeElimination::ReduceEnd(Node* node) {
40 DCHECK_EQ(IrOpcode::kEnd, node->opcode())
[all...] |
| control-equivalence.h | 9 #include "src/compiler/node.h"
40 // Run the main algorithm starting from the {exit} control node. This causes
46 void Run(Node* exit);
49 size_t ClassOf(Node* node) {
50 DCHECK_NE(kInvalidClass, GetClass(node));
51 return GetClass(node);
62 Node* from; // Node that this bracket originates from.
63 Node* to; // Node that this bracket points to
74 Node* node; \/\/ Node that this stack entry belongs to. member in struct:v8::internal::compiler::final::DFSStackEntry
[all...] |
| control-equivalence.cc | 6 #include "src/compiler/node-properties.h"
17 void ControlEquivalence::Run(Node* exit) {
29 void ControlEquivalence::VisitPre(Node* node) {
30 TRACE("CEQ: Pre-visit of #%d:%s\n", node->id(), node->op()->mnemonic());
33 SetNumber(node, NewDFSNumber());
34 TRACE(" Assigned DFS number is %zu\n", GetNumber(node));
38 void ControlEquivalence::VisitMid(Node* node, DFSDirection direction)
99 Node* node = entry.node; local
182 Node* node = queue.front(); local
[all...] |
| js-intrinsic-lowering.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
32 Reduction JSIntrinsicLowering::Reduce(Node* node) {
33 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange();
35 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id());
39 return ReduceConstructDouble(node);
41 return ReduceCreateIterResultObject(node);
43 return ReduceDeoptimizeNow(node);
45 return ReduceDoubleHi(node);
[all...] |
| /external/v8/src/ |
| futex-emulation.cc | 44 void FutexWaitList::AddNode(FutexWaitListNode* node) {
45 DCHECK(node->prev_ == nullptr && node->next_ == nullptr);
47 tail_->next_ = node;
49 head_ = node;
52 node->prev_ = tail_;
53 node->next_ = nullptr;
54 tail_ = node;
58 void FutexWaitList::RemoveNode(FutexWaitListNode* node) {
59 if (node->prev_)
90 FutexWaitListNode* node = isolate->futex_wait_list_node(); local
200 FutexWaitListNode* node = wait_list_.Pointer()->head_; local
234 FutexWaitListNode* node = wait_list_.Pointer()->head_; local
263 FutexWaitListNode* node = wait_list_.Pointer()->head_; local
[all...] |
| /external/icu/icu4c/source/common/ |
| ucharstrie.cpp | 35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...] |
| bytestrie.cpp | 72 int32_t node; local
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos; local
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node-kMinOneByteValueLead
140 int32_t node=*pos; local
151 int32_t node=*pos++; local
395 int32_t node=*pos++; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| ExpressionTranslator.java | 28 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
30 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
31 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
32 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
33 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
34 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
35 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
36 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
37 import com.google.clearsilver.jsilver.syntax.node.AGteExpression
[all...] |
| /hardware/qcom/camera/QCamera2/util/ |
| QCameraQueue.cpp | 68 * @data_rel_fn : function ptr to release node data internal resource
147 camera_q_node *node = local
149 if (NULL == node) {
154 memset(node, 0, sizeof(camera_q_node));
155 node->data = data;
159 cam_list_add_tail_node(&node->list, &m_head.list);
163 free(node);
184 camera_q_node *node = local
186 if (NULL == node) {
191 memset(node, 0, sizeof(camera_q_node))
224 camera_q_node* node = NULL; local
259 camera_q_node* node = NULL; local
300 camera_q_node* node = NULL; local
344 camera_q_node* node = NULL; local
386 camera_q_node* node = NULL; local
431 camera_q_node* node = NULL; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...] |
| /external/skia/src/views/ |
| SkParsePaint.cpp | 14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node)
16 if ((node = dom.getFirstChild(node, "shader")) == nullptr)
21 if (dom.hasAttr(node, "type", "linear-gradient"))
27 if ((str = dom.findAttr(node, "c0")) != nullptr &&
29 (str = dom.findAttr(node, "c1")) != nullptr &&
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| ScalarNodeTest.java | 27 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
28 assertEquals(NodeId.scalar, node.getNodeId());
32 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
33 assertTrue(node.toString().contains("ScalarNode"));
34 assertTrue(node.toString().contains("tag="));
35 assertTrue(node.toString().contains("value="));
|
| /system/bt/osi/src/ |
| list.c | 20 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
55 for (const list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node)) {
56 if (list_node(node) == data)
94 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local
95 if (!node)
98 node->next = prev_node->next;
99 node->data = data
111 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local
127 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| 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...] |
| /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treewalkers/ |
| lxmletree.py | 31 node = root
33 while node.getprevious() is not None:
34 node = node.getprevious()
35 while node is not None:
36 self.children.append(node)
37 node = node.getnext()
127 def getNodeDetails(self, node):
128 if isinstance(node, tuple): # Text nod
[all...] |
