/frameworks/av/services/audiopolicy/common/managerdefinitions/src/ |
ConfigParsingUtils.cpp | 36 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->name, GAIN_MAX_VALUE) == 0) 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 371 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local [all...] |
/system/core/include/cutils/ |
list.h | 32 #define node_to_item(node, container, member) \ 33 (container *) (((char*) (node)) - offsetof(container, member)) 41 #define list_for_each(node, list) \ 42 for (node = (list)->next; node != (list); node = node->next) 44 #define list_for_each_reverse(node, list) \ 45 for (node = (list)->prev; node != (list); node = node->prev [all...] |
/external/jemalloc/src/ |
base.c | 20 extent_node_t *node; local 24 node = base_nodes; 25 base_nodes = *(extent_node_t **)node; 26 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t)); 27 return (node); 32 base_node_dalloc(extent_node_t *node) 35 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t)); 36 *(extent_node_t **)node = base_nodes; 37 base_nodes = node; 44 extent_node_t *node; local 83 extent_node_t *node; local [all...] |
/system/bt/btif/src/ |
btif_uid.c | 50 uid_set_node_t* node = set->head; local 51 while (node) { 52 uid_set_node_t* temp = node; 53 node = node->next; 64 uid_set_node_t* node = set->head; local 65 while (node && node->data.app_uid != app_uid) { 66 node = node->next 84 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local 95 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local 105 uid_set_node_t* node = set->head; local [all...] |
/external/v8/src/compiler/ |
node-properties.cc | 8 #include "src/compiler/node-properties.h" 18 int NodeProperties::PastValueIndex(Node* node) { 19 return FirstValueIndex(node) + node->op()->ValueInputCount(); 24 int NodeProperties::PastContextIndex(Node* node) { 25 return FirstContextIndex(node) + 26 OperatorProperties::GetContextInputCount(node->op()); 31 int NodeProperties::PastFrameStateIndex(Node* node) 86 Node* const node = edge.from(); local 94 Node* const node = edge.from(); local 102 Node* const node = edge.from(); local 110 Node* const node = edge.from(); local 118 Node* const node = edge.from(); local [all...] |
escape-analysis.h | 38 bool IsVirtual(Node* node); 39 bool IsEscaped(Node* node); 40 bool IsAllocation(Node* node); 49 void Process(Node* node); 50 void ProcessAllocate(Node* node); [all...] |
graph-reducer.h | 8 #include "src/compiler/node-marker.h" 17 class Node; 21 // out-of-line data associated with each node. 25 // Represents the result of trying to reduce a node in the graph. 28 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {} 30 Node* replacement() const { return replacement_; } 34 Node* replacement_; 38 // A reducer can reduce or simplify a given node based on its operator and 47 // Try to reduce a node if possible. 48 virtual Reduction Reduce(Node* node) = 0 140 Node* node; member in class:v8::internal::compiler::GraphReducer::State [all...] |
js-typed-lowering.h | 46 Reduction Reduce(Node* node) final; 51 Reduction ReduceJSAdd(Node* node); 52 Reduction ReduceJSModulus(Node* node); 53 Reduction ReduceJSBitwiseOr(Node* node); 54 Reduction ReduceJSMultiply(Node* node); [all...] |
/external/blktrace/ |
rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) 27 struct rb_node *right = node->rb_right; 28 struct rb_node *parent = rb_parent(node); 30 if ((node->rb_right = right->rb_left)) 31 rb_set_parent(right->rb_left, node); 32 right->rb_left = node; 38 if (node == parent->rb_left) 45 rb_set_parent(node, right); 48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) 50 struct rb_node *left = node->rb_left [all...] |
/external/ltrace/ |
expr.c | 29 expr_init_common(struct expr_node *node, enum expr_node_kind kind) 31 node->kind = kind; 32 node->lhs = NULL; 33 node->own_lhs = 0; 34 memset(&node->u, 0, sizeof(node->u)); 38 expr_init_self(struct expr_node *node) 40 expr_init_common(node, EXPR_OP_SELF); 44 expr_init_named(struct expr_node *node, 47 expr_init_common(node, EXPR_OP_NAMED) 410 static struct expr_node node; local [all...] |
/external/opencv3/3rdparty/jinja2/ |
optimizer.py | 23 def optimize(node, environment): 27 return optimizer.visit(node) 35 def visit_If(self, node): 39 if node.find(nodes.Block) is not None: 40 return self.generic_visit(node) 42 val = self.visit(node.test).as_const() 44 return self.generic_visit(node) 46 body = node.body 48 body = node.else_ 50 for node in body [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
ALoopIncCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 67 public void setPosition(PPosition node) 74 if(node != null) 76 if(node.parent() != null) 78 node.parent().removeChild(node); 81 node.parent(this); 84 this._position_ = node; 92 public void setVariable(PVariable node) 99 if(node != null [all...] |
AEachCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 57 public void setPosition(PPosition node) 64 if(node != null) 66 if(node.parent() != null) 68 node.parent().removeChild(node); 71 node.parent(this); 74 this._position_ = node; 82 public void setVariable(PVariable node) 89 if(node != null [all...] |
AIfCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 57 public void setPosition(PPosition node) 64 if(node != null) 66 if(node.parent() != null) 68 node.parent().removeChild(node); 71 node.parent(this); 74 this._position_ = node; 82 public void setExpression(PExpression node) 89 if(node != null [all...] |
ALoopToCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 57 public void setPosition(PPosition node) 64 if(node != null) 66 if(node.parent() != null) 68 node.parent().removeChild(node); 71 node.parent(this); 74 this._position_ = node; 82 public void setVariable(PVariable node) 89 if(node != null [all...] |
AWithCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 57 public void setPosition(PPosition node) 64 if(node != null) 66 if(node.parent() != null) 68 node.parent().removeChild(node); 71 node.parent(this); 74 this._position_ = node; 82 public void setVariable(PVariable node) 89 if(node != null [all...] |
PCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node; 5 public abstract class PCommand extends Node
|
PExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node; 5 public abstract class PExpression extends Node
|
PPosition.java | 3 package com.google.clearsilver.jsilver.syntax.node; 5 public abstract class PPosition extends Node
|
PVariable.java | 3 package com.google.clearsilver.jsilver.syntax.node; 5 public abstract class PVariable extends Node
|
/external/freetype/src/cache/ |
ftcmru.c | 30 FTC_MruNode node ) 47 if ( cnode == node ) 58 first->prev = node; 59 last->next = node; 60 node->next = first; 61 node->prev = last; 65 node->next = node; 66 node->prev = node; 207 FTC_MruNode first, node; local 241 FTC_MruNode node = NULL; local 295 FTC_MruNode node; local 331 FTC_MruNode first, node, next; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) 27 struct rb_node *right = node->rb_right; 28 struct rb_node *parent = ext2fs_rb_parent(node); 30 if ((node->rb_right = right->rb_left)) 31 ext2fs_rb_set_parent(right->rb_left, node); 32 right->rb_left = node; 38 if (node == parent->rb_left) 45 ext2fs_rb_set_parent(node, right); 48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) 50 struct rb_node *left = node->rb_left [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
AutoEscaper.java | 23 import com.google.clearsilver.jsilver.syntax.node.AAltCommand; 24 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand; 25 import com.google.clearsilver.jsilver.syntax.node.ACallCommand; 26 import com.google.clearsilver.jsilver.syntax.node.AContentTypeCommand; 27 import com.google.clearsilver.jsilver.syntax.node.ACsOpenPosition; 28 import com.google.clearsilver.jsilver.syntax.node.ADataCommand; 29 import com.google.clearsilver.jsilver.syntax.node.ADefCommand; 30 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand; 31 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand; 32 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand 134 PCommand node = start.getPCommand(); 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...] |
/development/ndk/platforms/android-3/include/asm-generic/ |
topology.h | 19 #define parent_node(node) (0) 22 #define node_to_cpumask(node) (cpu_online_map) 25 #define node_to_first_cpu(node) (0) 28 #define pcibus_to_node(node) (-1)
|