| /external/selinux/libsepol/cil/src/ |
| cil_parser.c | 49 struct cil_tree_node *node = NULL; local
66 cil_tree_node_init(&node);
67 node->parent = current;
68 node->flavor = CIL_NODE;
69 node->line = tok.line;
70 node->path = path;
72 current->cl_head = node;
74 current->cl_tail->next = node;
76 current->cl_tail = node;
77 current = node;
[all...] |
| /frameworks/av/media/libstagefright/omx/ |
| OMX.cpp | 42 // node ids are created by concatenating the pid with a 16-bit counter
132 ALOGV("Would have dispatched a message to a node that's already gone.");
206 bool OMX::isSecure(node_id node) {
207 OMXNodeInstance *instance = findInstance(node);
211 bool OMX::livesLocally(node_id /* node */, pid_t pid) {
245 sp<IBinder> *nodeBinder, node_id *node) {
248 *node = 0;
254 // all possible node IDs are in use
273 *node = makeNodeID_l(instance);
274 mDispatchers.add(*node, new CallbackDispatcher(instance))
728 node_id node = 0; local
[all...] |
| /frameworks/av/services/audiopolicy/engineconfigurable/wrapper/ |
| ParameterManagerWrapper.cpp | 142 cnode *node; local
143 for (node = root->first_child; node != NULL; node = node->next) {
145 ALOG_ASSERT(node != NULL, "error in parsing file");
146 const char *typeName = node->name;
147 char *valueNames = strndup(node->value, strlen(node->value));
187 cnode *node = config_find(root, gInclusiveCriterionTypeTag.c_str()) local
197 cnode *node = config_find(root, gExclusiveCriterionTypeTag.c_str()); local
207 cnode *node; local
242 cnode *node = config_find(root, gCriterionTag.c_str()); local
295 cnode *node = config_find(root, gPolicyConfTag.c_str()); local
[all...] |
| /frameworks/base/packages/Osu/src/com/android/hotspot2/pps/ |
| SubscriptionParameters.java | 26 public SubscriptionParameters(OMANode node) throws OMAException {
27 mCDate = MOManager.getTime(node.getChild(TAG_CreationDate));
28 mXDate = MOManager.getTime(node.getChild(TAG_ExpirationDate));
29 mType = MOManager.getString(node.getChild(TAG_TypeOfSubscription));
31 OMANode ulNode = node.getChild(TAG_UsageLimits);
38 throw new OMAException("Not expecting leaf node in " +
53 private Limit(OMANode node) throws OMAException {
54 mDataLimit = MOManager.getLong(node, TAG_DataLimit, Long.MAX_VALUE);
55 mStartDate = MOManager.getTime(node.getChild(TAG_StartDate));
56 mTimeLimit = MOManager.getLong(node, TAG_TimeLimit, Long.MAX_VALUE)
[all...] |
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/hotspot2/pps/ |
| SubscriptionParameters.java | 26 public SubscriptionParameters(OMANode node) throws OMAException {
27 mCDate = PasspointManagementObjectManager.getTime(node.getChild(TAG_CreationDate));
28 mXDate = PasspointManagementObjectManager.getTime(node.getChild(TAG_ExpirationDate));
29 mType = PasspointManagementObjectManager.getString(node.getChild(TAG_TypeOfSubscription));
31 OMANode ulNode = node.getChild(TAG_UsageLimits);
39 throw new OMAException("Not expecting leaf node in " +
54 private Limit(OMANode node) throws OMAException {
56 .getLong(node, TAG_DataLimit, Long.MAX_VALUE);
58 .getTime(node.getChild(TAG_StartDate));
60 .getLong(node, TAG_TimeLimit, Long.MAX_VALUE
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 55 def transform(self, node, results):
57 method = results["method"][0] # Extract node for method name
68 special = not tail and self.in_special_context(node, isiter)
69 args = head + [pytree.Node(syms.trailer,
74 new = pytree.Node(syms.power, args)
79 new = pytree.Node(syms.power, [new] + tail)
80 new.prefix = node.prefix
83 P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
86 P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
87 | comp_for< 'for' any 'in' node=any any*
[all...] |
| fix_idioms.py | 32 from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
79 def match(self, node):
80 r = super(FixIdioms, self).match(node)
90 def transform(self, node, results):
92 return self.transform_isinstance(node, results)
94 return self.transform_while(node, results)
96 return self.transform_sort(node, results)
100 def transform_isinstance(self, node, results):
108 test = Node(syms.not_test, [Name(u"not"), test])
109 test.prefix = node.prefi
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 55 def transform(self, node, results):
57 method = results["method"][0] # Extract node for method name
68 special = not tail and self.in_special_context(node, isiter)
69 args = head + [pytree.Node(syms.trailer,
74 new = pytree.Node(syms.power, args)
79 new = pytree.Node(syms.power, [new] + tail)
80 new.prefix = node.prefix
83 P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
86 P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
87 | comp_for< 'for' any 'in' node=any any*
[all...] |
| fix_idioms.py | 32 from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
79 def match(self, node):
80 r = super(FixIdioms, self).match(node)
90 def transform(self, node, results):
92 return self.transform_isinstance(node, results)
94 return self.transform_while(node, results)
96 return self.transform_sort(node, results)
100 def transform_isinstance(self, node, results):
108 test = Node(syms.not_test, [Name(u"not"), test])
109 test.prefix = node.prefi
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 55 def transform(self, node, results):
57 method = results["method"][0] # Extract node for method name
68 special = not tail and self.in_special_context(node, isiter)
69 args = head + [pytree.Node(syms.trailer,
74 new = pytree.Node(syms.power, args)
79 new = pytree.Node(syms.power, [new] + tail)
80 new.prefix = node.prefix
83 P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
86 P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
87 | comp_for< 'for' any 'in' node=any any*
[all...] |
| fix_idioms.py | 32 from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
79 def match(self, node):
80 r = super(FixIdioms, self).match(node)
90 def transform(self, node, results):
92 return self.transform_isinstance(node, results)
94 return self.transform_while(node, results)
96 return self.transform_sort(node, results)
100 def transform_isinstance(self, node, results):
108 test = Node(syms.not_test, [Name(u"not"), test])
109 test.prefix = node.prefi
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 55 def transform(self, node, results):
57 method = results["method"][0] # Extract node for method name
68 special = not tail and self.in_special_context(node, isiter)
69 args = head + [pytree.Node(syms.trailer,
74 new = pytree.Node(syms.power, args)
79 new = pytree.Node(syms.power, [new] + tail)
80 new.prefix = node.prefix
83 P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
86 P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
87 | comp_for< 'for' any 'in' node=any any*
[all...] |
| fix_idioms.py | 32 from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
79 def match(self, node):
80 r = super(FixIdioms, self).match(node)
90 def transform(self, node, results):
92 return self.transform_isinstance(node, results)
94 return self.transform_while(node, results)
96 return self.transform_sort(node, results)
100 def transform_isinstance(self, node, results):
108 test = Node(syms.not_test, [Name(u"not"), test])
109 test.prefix = node.prefi
[all...] |
| /external/jemalloc/test/unit/ |
| rb.c | 53 assert_ptr_null(tree_first(&tree), "Unexpected node");
54 assert_ptr_null(tree_last(&tree), "Unexpected node");
58 assert_ptr_null(tree_search(&tree, &key), "Unexpected node");
62 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node");
66 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node");
71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth)
77 if (node == NULL)
80 left_node = rbtn_left_get(node_t, link, node);
81 right_node = rbtn_right_get(node_t, link, node);
83 if (!rbtn_red_get(node_t, link, node))
[all...] |
| /external/v8/src/ |
| global-handles.cc | 26 class GlobalHandles::Node {
39 // Maps handle location (slot) to the containing node.
40 static Node* FromLocation(Object** location) {
41 DCHECK(offsetof(Node, object_) == 0);
42 return reinterpret_cast<Node*>(location);
45 Node() {
46 DCHECK(offsetof(Node, class_id_) == Internals::kNodeClassIdOffset);
47 DCHECK(offsetof(Node, flags_) == Internals::kNodeFlagsOffset);
62 ~Node() {
80 void Initialize(int index, Node** first_free)
[all...] |
| /frameworks/compile/mclinker/include/mcld/ |
| InputTree.h | 49 // skip the Group node
58 // skip the Group node
90 typedef Node<value_type> node_type;
100 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
107 return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
112 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
119 return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
123 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
130 return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
135 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left)
177 node_type* node = BinaryTreeBase<Input>::createNode(); local
302 BinTreeTy::node_type* node = createNode(); local
315 BinTreeTy::node_type* node = createNode(); local
[all...] |
| /external/dbus/dbus/ |
| dbus-marshal-recursive-util.c | 366 dbus_bool_t (* construct) (TestTypeNode *node);
367 void (* destroy) (TestTypeNode *node);
369 dbus_bool_t (* write_value) (TestTypeNode *node,
373 dbus_bool_t (* read_value) (TestTypeNode *node,
376 dbus_bool_t (* set_value) (TestTypeNode *node,
380 dbus_bool_t (* build_signature) (TestTypeNode *node,
382 dbus_bool_t (* write_multi) (TestTypeNode *node,
387 dbus_bool_t (* read_multi) (TestTypeNode *node,
403 static dbus_bool_t int16_write_value (TestTypeNode *node,
407 static dbus_bool_t int16_read_value (TestTypeNode *node,
938 TestTypeNode *node; local
1557 TestTypeNode *node; local
1761 TestTypeNode *node; local
1774 TestTypeNode *node; local
1861 TestTypeNode *node; local
1889 TestTypeNode *node; local
1907 TestTypeNode *node; local
[all...] |
| /external/markdown/markdown/ |
| treeprocessors.py | 71 def __stashNode(self, node, type):
72 """ Add node to stash """
74 self.stashed_nodes[id] = node
100 def __processElementText(self, node, subnode, isText=True):
107 * node: parent node
108 * subnode: processing node
123 if not isText and node is not subnode:
124 pos = node.getchildren().index(subnode)
125 node.remove(subnode
[all...] |
| /external/libxml2/ |
| check-xsddata-test-suite.py | 56 def handle_valid(node, schema):
61 instance = node.prop("dtd")
64 child = node.children
84 print "instance line %d" % (node.lineNo())
96 nb_instances_tests, node.lineNo())
109 def handle_invalid(node, schema):
114 instance = node.prop("dtd")
117 child = node.children
137 print "instance line %d" % (node.lineNo())
150 # nb_instances_tests, node.lineNo()
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| DocumentImpl.java | 32 import org.w3c.dom.Node;
69 * <p>Attaching user data directly to the corresponding node would cost a
70 * field per node. Under the assumption that user data is rarely needed, we
119 * Returns a shallow copy of the given node. If the node is an element node,
122 * @param node a node belonging to any document or DOM implementation.
125 * responsibility to notify user data handlers of the returned node.
126 * @return a new node whose document is this document and whose DO
[all...] |
| /external/mesa3d/src/glsl/ |
| ir_function_detect_recursion.cpp | 147 void *node; local
149 node = ralloc_size(ctx, size);
150 assert(node != NULL);
152 return node;
157 static void operator delete(void *node)
159 ralloc_free(node);
225 call_node *node = new(mem_ctx) call_node; local
226 node->func = target;
227 this->current->callees.push_tail(node);
231 node = new(mem_ctx) call_node
[all...] |
| /external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/ |
| UriMatcherTest.java | 40 MatchNode node = root; local
44 assertThat(node.map.keySet(), hasItem(AUTH));
46 node = node.map.get(AUTH);
47 assertThat(node.map.keySet(), hasItem("bar"));
49 node = node.map.get("bar");
50 assertThat(node.map.keySet(), hasItem("cat"));
52 node = node.map.get("cat")
59 MatchNode node = root.map.get(AUTH); local
[all...] |
| /external/sfntly/cpp/src/test/tinyxml/ |
| tinyxml.cpp | 149 TiXmlNode* node = firstChild; local
152 while ( node )
154 temp = node;
155 node = node->next;
171 TiXmlNode* node = firstChild; local
174 while ( node )
176 temp = node;
177 node = node->next
222 TiXmlNode* node = addThis.Clone(); local
242 TiXmlNode* node = addThis.Clone(); local
275 TiXmlNode* node = addThis.Clone(); local
312 TiXmlNode* node = withThis.Clone(); local
363 const TiXmlNode* node; local
375 const TiXmlNode* node; local
415 const TiXmlNode* node; local
427 const TiXmlNode* node; local
441 TiXmlAttribute* node = attributeSet.Find( str ); local
454 const TiXmlNode* node; local
469 const TiXmlNode* node; local
484 const TiXmlNode* node; local
499 const TiXmlNode* node; local
514 const TiXmlNode* node; local
570 TiXmlAttribute* node = attributeSet.First(); local
579 const TiXmlAttribute* node = attributeSet.Find( name ); local
672 const TiXmlAttribute* node = attributeSet.Find( name ); local
685 const TiXmlAttribute* node = attributeSet.Find( name ); local
821 TiXmlNode* node; local
868 TiXmlNode* node = 0; local
[all...] |
| /external/skia/samplecode/ |
| SampleAnimator.cpp | 64 const SkDOMNode* node, const char name[]) {
65 if (nullptr == node) {
66 node = dom.getRootNode();
69 const char* idval = dom.findAttr(node, "id");
71 return node;
73 const SkDOMNode* child = dom.getFirstChild(node);
80 } while ((node = dom.getNextSibling(node)) != nullptr);
99 const SkDOM::Node* root = dom.build(text, len);
111 const SkDOM::Node* node = find_nodeID(dom, nullptr, name.c_str()) local
[all...] |
| /external/skia/tools/ |
| sk_tool_utils.h | 147 // check that the topological sort is valid for this node
157 // This node should've been output after all the nodes on which it depends
167 static void SetTempMark(TopoTestNode* node) { node->fTempMark = true; }
168 static void ResetTempMark(TopoTestNode* node) { node->fTempMark = false; }
169 static bool IsTempMarked(TopoTestNode* node) { return node->fTempMark; }
170 static void Output(TopoTestNode* node, int outputPos) {
172 node->fOutputPos = outputPos;
[all...] |
