| /external/libsepol/include/sepol/policydb/ |
| conditional.h | 63 avtab_ptr_t node; member in struct:cond_av_list
68 * A cond node represents a conditional block in a policy. It
98 extern void cond_node_destroy(cond_node_t * node);
105 extern cond_node_t *cond_node_create(policydb_t * p, cond_node_t * node);
|
| /external/libxml2/include/libxml/ |
| valid.h | 87 /* Node analysis stack used when validating within entities */
88 xmlNodePtr node; /* Current parsed Node */ member in struct:_xmlValidCtxt
|
| /external/linux-tools-perf/perf-3.12.0/lib/ |
| rbtree.c | 30 * 1) A node is either red or black
33 * 4) Both children of every red node are black
38 * consecutive red nodes in a path and every red node is therefore followed by
73 __rb_insert(struct rb_node *node, struct rb_root *root,
76 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;
80 * Loop invariant: node is red
87 rb_set_parent_color(node, NULL, RB_BLACK);
112 node = gparent;
113 parent = rb_parent(node);
114 rb_set_parent_color(node, parent, RB_RED)
205 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ui/browsers/ |
| scripts.c | 21 struct list_head node; member in struct:script_line
78 struct script_line *sline = list_entry(entry, struct script_line, node);
163 list_add_tail(&sline->node, &script.entries);
|
| /external/llvm/lib/Target/XCore/ |
| XCoreISelDAGToDAG.cpp | 152 SDNode *node = CurDAG->getMachineNode(XCore::LDWCP_lru6, dl, MVT::i32, local
158 cast<MachineSDNode>(node)->setMemRefs(MemOp, MemOp + 1);
159 return node;
|
| /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/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/mesa3d/src/mesa/main/ |
| shared.c | 361 struct simple_node *node; local
364 foreach_s(node, temp, & shared->SyncObjects) {
365 _mesa_unref_sync_object(ctx, (struct gl_sync_object *) node);
|
| /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/openssl/crypto/x509v3/ |
| pcy_tree.c | 74 X509_POLICY_NODE *node, int indent)
77 || !(node->data->flags & POLICY_DATA_FLAG_MAP_MASK))
82 STACK_OF(ASN1_OBJECT) *pset = node->data->expected_policy_set;
100 X509_POLICY_NODE *node; local
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
117 X509_POLICY_NODE_print(err, node, 2);
118 expected_print(err, plev, node, 2);
119 BIO_printf(err, " Flags: %x\n", node->data->flags);
314 X509_POLICY_NODE *node; local
319 node = sk_X509_POLICY_NODE_value(last->nodes, i)
448 X509_POLICY_NODE *node; local
507 X509_POLICY_NODE *node; local
590 X509_POLICY_NODE *node, *anyptr; local
637 X509_POLICY_NODE *node; local
[all...] |
| /external/oprofile/libdb/ |
| db_manage.c | 53 * return the number of bytes used by hash table, node table and header.
102 /* rebuild the hash table, node zero is never used. This works
103 * because layout of file is node table then hash table,
104 * sizeof(node) > sizeof(bucket) and when we grow table we
123 odb_node_t * node = &data->node_base[pos]; local
124 size_t index = odb_do_hash(data, node->key);
125 node->next = data->hash_base[index];
230 /* Calculate nr node allowing a sanity check later */
250 /* file already exist, sanity check nr node */
|
| /external/owasp/sanitizer/src/tests/org/owasp/html/ |
| HtmlPolicyBuilderFuzzerTest.java | 41 import org.w3c.dom.Node;
124 Node node = parser.parseFragment( local
126 checkSafe(node, html);
136 private static void checkSafe(Node node, String html) {
137 switch (node.getNodeType()) {
138 case Node.ELEMENT_NODE:
139 String name = node.getNodeName();
143 NamedNodeMap attrs = node.getAttributes()
[all...] |
| /external/qemu/distrib/libselinux/src/ |
| stringrep.c | 38 struct discover_class_node *node = discover_class_cache; local
40 for (; node != NULL && strcmp(s,node->name) != 0; node = node->next);
42 return node;
47 struct discover_class_node *node = discover_class_cache; local
49 for (; node != NULL && c != node->value; node = node->next)
63 struct discover_class_node *node; local
183 struct discover_class_node *node; local
200 struct discover_class_node *node; local
217 struct discover_class_node *node; local
230 struct discover_class_node *node; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/ |
| vectorbuffer.h | 152 TNode* node = iTop; local
154 if(iTop > node)
157 iSize -= node->Size();
158 return TPtrC8(node->Ptr(), node->Size());
|
| /external/regex-re2/re2/ |
| prefilter_tree.cc | 100 // Note that getting rid of a prefilter node simply means they are
103 // prefilter node.
129 Prefilter* PrefilterTree::CanonicalNode(Prefilter* node) {
130 string node_string = NodeString(node);
143 string PrefilterTree::NodeString(Prefilter* node) const {
145 string s = Itoa(node->op()) + ":";
146 if (node->op() == Prefilter::ATOM) {
147 s += node->atom();
149 for (int i = 0; i < node->subs()->size() ; i++) {
152 s += Itoa((*node->subs())[i]->unique_id())
191 Prefilter *node = v[i]; local
[all...] |
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| DrawableResourceLoader.java | 12 import org.w3c.dom.Node;
144 Node item = items.item(i);
145 Node drawableName = item.getAttributes().getNamedItem("android:drawable");
165 Node node = items.item(i); local
166 Node drawableName = node.getAttributes().getNamedItem("android:drawable");
169 int stateId = getStateId(node);
176 private int getStateId(Node node) {
[all...] |
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/res/ |
| ResourceLoaderTest.java | 33 ViewLoader.ViewNode node = resourceLoader.getLayoutViewNode("android:layout/simple_spinner_item"); local
34 assertNotNull(node);
|
| /external/smack/src/org/jivesoftware/smackx/packet/ |
| DiscoverItems.java | 37 * may be addressable by its JID and others may require to be addressed by a JID and a node name.
46 private String node; field in class:DiscoverItems
83 * Returns the node attribute that supplements the 'jid' attribute. A node is merely
86 * Node attributes SHOULD be used only when trying to provide or query information which
89 * @return the node attribute that supplements the 'jid' attribute
92 return node;
96 * Sets the node attribute that supplements the 'jid' attribute. A node is merely
99 * Node attributes SHOULD be used only when trying to provide or query information which
148 private String node; field in class:DiscoverItems.Item
[all...] |
| OfflineMessageRequest.java | 133 private String node; field in class:OfflineMessageRequest.Item
138 * @param node the actor's affiliation to the room
140 public Item(String node) {
141 this.node = node;
145 return node;
187 buf.append(" node=\"").append(getNode()).append("\"");
223 Item item = new Item(parser.getAttributeValue("", "node"));
|
| /external/smack/src/org/jivesoftware/smackx/pubsub/ |
| PubSubManager.java | 48 private Map<String, Node> nodeMap = new ConcurrentHashMap<String, Node>();
76 * Creates an instant node, if supported.
78 * @return The node that was created
95 * Creates a node with default configuration.
97 * @param id The id of the node, which must be unique within the
99 * @return The node that was created
109 * Creates a node with specified configuration.
111 * Note: This is the only way to create a collection node.
113 * @param name The name of the node, which must be unique within the
155 Node node = nodeMap.get(id); local
[all...] |
| /external/valgrind/main/coregrind/ |
| m_hashtable.c | 46 VgHashNode* iterNode; // current iterator node
95 VgHashNode * node; local
126 node = table->chains[i];
127 while (node != NULL) {
128 VgHashNode* next = node->next;
129 UWord chain = CHAIN_NO(node->key, table);
130 node->next = chains[chain];
131 chains[chain] = node;
132 node = next;
141 the node to the appropriate chain. No duplicate key detection is done. *
144 VgHashNode* node = (VgHashNode*)vnode; local
201 VgHashNode* node; local
255 VgHashNode *node, *node_next; local
[all...] |
| /external/webp/src/utils/ |
| huffman.c | 30 static void TreeNodeInit(HuffmanTreeNode* const node) {
31 node->children_ = -1; // means: 'unassigned so far'
34 static int NodeIsEmpty(const HuffmanTreeNode* const node) {
35 return (node->children_ < 0);
43 HuffmanTreeNode* const node) {
45 node->children_ = (int)(children - node);
46 assert(children - node == (int)(children - node));
192 HuffmanTreeNode* node = tree->root_ local
[all...] |
| /external/zopfli/src/zopfli/ |
| katajainen.c | 30 typedef struct Node Node;
35 struct Node {
37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */
46 Node* nodes; /* The pool. */
47 Node* next; /* Pointer to a possibly free node in the pool. */
52 Initializes a chain node with the given values and marks it as in use.
54 static void InitNode(size_t weight, int count, Node* tail, Node* node)
77 Node* node; local
164 Node* node; local
[all...] |
| /frameworks/av/include/media/ |
| IOMX.h | 47 virtual bool livesLocally(node_id node, pid_t pid) = 0;
57 node_id *node) = 0;
59 virtual status_t freeNode(node_id node) = 0;
62 node_id node, OMX_COMMANDTYPE cmd, OMX_S32 param) = 0;
65 node_id node, OMX_INDEXTYPE index,
69 node_id node, OMX_INDEXTYPE index,
73 node_id node, OMX_INDEXTYPE index,
77 node_id node, OMX_INDEXTYPE index,
81 node_id node, OMX_STATETYPE* state) = 0;
84 node_id node, OMX_U32 port_index, OMX_BOOL enable) = 0
169 IOMX::node_id node; member in struct:android::omx_message
[all...] |
| /frameworks/compile/libbcc/lib/Renderscript/ |
| RSInfoExtractor.cpp | 33 // Name of metadata node where pragma info resides (should be synced with
41 // Name of metadata node where exported variable names reside
44 // Name of metadata node where exported function names reside
47 // Name of metadata node where exported ForEach name information resides
50 // Name of metadata node where exported ForEach signature information resides
53 // Name of metadata node where RS object slot info resides (should be
71 llvm::MDNode *node = pMetadata->getOperand(i); local
72 if ((node != NULL) && (node->getNumOperands() >= NumOperands)) {
77 llvm::StringRef s = getStringFromOperand(node->getOperand(j))
181 llvm::MDNode *node; local
200 llvm::MDNode *node; local
217 llvm::MDNode *node; local
313 llvm::MDNode *node; local
[all...] |
