| /external/libcap-ng/libcap-ng-0.7/utils/ |
| D | proc-llist.c | 38 lnode* newnode; in list_append() local
43 newnode = malloc(sizeof(lnode)); in list_append()
44 if (newnode == NULL) in list_append()
47 newnode->ppid = node->ppid; in list_append()
48 newnode->pid = node->pid; in list_append()
49 newnode->uid = node->uid; in list_append()
50 newnode->inode = node->inode; in list_append()
52 newnode->cmd = node->cmd; in list_append()
53 newnode->capabilities = node->capabilities; in list_append()
54 newnode->bounds = node->bounds; in list_append()
[all …]
|
| /external/selinux/checkpolicy/ |
| D | queue.c | 28 queue_node_ptr_t newnode; in queue_insert() local
33 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_insert()
34 if (newnode == NULL) in queue_insert()
37 newnode->element = e; in queue_insert()
38 newnode->next = NULL; in queue_insert()
41 q->head = q->tail = newnode; in queue_insert()
43 q->tail->next = newnode; in queue_insert()
44 q->tail = newnode; in queue_insert()
52 queue_node_ptr_t newnode; in queue_push() local
57 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_push()
[all …]
|
| /external/python/cpython3/Lib/lib2to3/pgen2/ |
| D | parse.py | 110 newnode = (start, None, None, [])
111 stackentry = (self.grammar.dfas[start], 0, newnode)
181 newnode = (type, value, context, None)
182 newnode = self.convert(self.grammar, newnode)
183 if newnode is not None:
184 node[-1].append(newnode)
190 newnode = (type, None, context, [])
192 self.stack.append((newdfa, 0, newnode))
197 newnode = self.convert(self.grammar, popnode)
198 if newnode is not None:
[all …]
|
| /external/python/cpython2/Lib/lib2to3/pgen2/ |
| D | parse.py | 107 newnode = (start, None, None, [])
108 stackentry = (self.grammar.dfas[start], 0, newnode)
178 newnode = (type, value, context, None)
179 newnode = self.convert(self.grammar, newnode)
180 if newnode is not None:
181 node[-1].append(newnode)
187 newnode = (type, None, context, [])
189 self.stack.append((newdfa, 0, newnode))
194 newnode = self.convert(self.grammar, popnode)
195 if newnode is not None:
[all …]
|
| /external/selinux/libselinux/src/ |
| D | avc_sidtab.c | 51 struct sidtab_node *newnode; in sidtab_insert() local
54 newnode = (struct sidtab_node *)avc_malloc(sizeof(*newnode)); in sidtab_insert()
55 if (!newnode) { in sidtab_insert()
62 avc_free(newnode); in sidtab_insert()
67 newnode->next = s->htable[hvalue]; in sidtab_insert()
68 newnode->sid_s.ctx = newctx; in sidtab_insert()
69 newnode->sid_s.refcnt = 1; /* unused */ in sidtab_insert()
70 s->htable[hvalue] = newnode; in sidtab_insert()
|
| /external/selinux/policycoreutils/newrole/ |
| D | hashtab.c | 48 hashtab_ptr_t prev, cur, newnode; in hashtab_insert() local
64 newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t)); in hashtab_insert()
65 if (newnode == NULL) in hashtab_insert()
67 memset(newnode, 0, sizeof(struct hashtab_node)); in hashtab_insert()
68 newnode->key = key; in hashtab_insert()
69 newnode->datum = datum; in hashtab_insert()
71 newnode->next = prev->next; in hashtab_insert()
72 prev->next = newnode; in hashtab_insert()
74 newnode->next = h->htable[hvalue]; in hashtab_insert()
75 h->htable[hvalue] = newnode; in hashtab_insert()
|
| /external/selinux/libsepol/src/ |
| D | avtab.c | 96 avtab_ptr_t newnode; in avtab_insert_node() local
99 newnode = (avtab_ptr_t) malloc(sizeof(struct avtab_node)); in avtab_insert_node()
100 if (newnode == NULL) in avtab_insert_node()
102 memset(newnode, 0, sizeof(struct avtab_node)); in avtab_insert_node()
103 newnode->key = *key; in avtab_insert_node()
108 free(newnode); in avtab_insert_node()
114 newnode->datum.xperms = xperms; in avtab_insert_node()
119 newnode->datum.data = datum->data; in avtab_insert_node()
121 newnode->datum = *datum; in avtab_insert_node()
125 newnode->next = prev->next; in avtab_insert_node()
[all …]
|
| D | sidtab.c | 43 sidtab_node_t *prev, *cur, *newnode; in sepol_sidtab_insert() local
61 newnode = (sidtab_node_t *) malloc(sizeof(sidtab_node_t)); in sepol_sidtab_insert()
62 if (newnode == NULL) in sepol_sidtab_insert()
64 newnode->sid = sid; in sepol_sidtab_insert()
65 if (context_cpy(&newnode->context, context)) { in sepol_sidtab_insert()
66 free(newnode); in sepol_sidtab_insert()
71 newnode->next = prev->next; in sepol_sidtab_insert()
72 prev->next = newnode; in sepol_sidtab_insert()
74 newnode->next = s->htable[hvalue]; in sepol_sidtab_insert()
75 s->htable[hvalue] = newnode; in sepol_sidtab_insert()
|
| D | hashtab.c | 107 hashtab_ptr_t prev, cur, newnode; in hashtab_insert() local
125 newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t)); in hashtab_insert()
126 if (newnode == NULL) in hashtab_insert()
128 memset(newnode, 0, sizeof(struct hashtab_node)); in hashtab_insert()
129 newnode->key = key; in hashtab_insert()
130 newnode->datum = datum; in hashtab_insert()
132 newnode->next = prev->next; in hashtab_insert()
133 prev->next = newnode; in hashtab_insert()
135 newnode->next = h->htable[hvalue]; in hashtab_insert()
136 h->htable[hvalue] = newnode; in hashtab_insert()
|
| /external/toybox/toys/pending/ |
| D | tcpsvd.c | 89 struct list_pid *newnode = xmalloc(sizeof(struct list_pid)); in insert() local
90 newnode->pid = pid; in insert()
91 newnode->ip = addr; in insert()
92 newnode->next = NULL; in insert()
93 if (!*l) *l = newnode; in insert()
95 newnode->next = (*l); in insert()
96 *l = newnode; in insert()
266 struct list *head, *newnode; in tcpsvd_main() local
331 newnode = (struct list*)xzalloc(sizeof(struct list)); in tcpsvd_main()
332 newnode->d = addr; in tcpsvd_main()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMNodeProxy.java | 340 int newnode = dtm.getParent(node); in getParentNode() local
342 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode); in getParentNode()
353 int newnode = dtm.getParent(node); in getOwnerNode() local
355 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode); in getOwnerNode()
382 int newnode = dtm.getFirstChild(node); in getFirstChild() local
384 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode); in getFirstChild()
395 int newnode = dtm.getLastChild(node); in getLastChild() local
397 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode); in getLastChild()
408 int newnode = dtm.getPreviousSibling(node); in getPreviousSibling() local
410 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode); in getPreviousSibling()
[all …]
|
| /external/libxml2/doc/tutorial/ |
| D | includeaddattribute.c | 14 xmlNodePtr newnode;
38 newnode = xmlNewTextChild (cur, NULL, "reference", NULL);
39 newattr = xmlNewProp (newnode, "uri", uri);
|
| /external/iptables/iptables/ |
| D | xtables-eb.c | 564 struct ebt_match *newnode, **matchp; in ebt_add_match() local
582 newnode = calloc(1, sizeof(struct ebt_match)); in ebt_add_match()
583 if (newnode == NULL) in ebt_add_match()
586 newnode->ismatch = true; in ebt_add_match()
587 newnode->u.match = newm; in ebt_add_match()
591 *matchp = newnode; in ebt_add_match()
597 struct ebt_match *newnode, **matchp; in ebt_add_watcher() local
614 newnode = calloc(1, sizeof(struct ebt_match)); in ebt_add_watcher()
615 if (newnode == NULL) in ebt_add_watcher()
618 newnode->u.watcher = clone; in ebt_add_watcher()
[all …]
|
| /external/angle/src/third_party/ceval/ |
| D | ceval.h | 847 ceval_node * newnode = (ceval_node * ) malloc(sizeof(ceval_node)); in ceval_insert_node() local
848 * newnode = item; in ceval_insert_node()
849 newnode -> right = NULL; in ceval_insert_node()
851 newnode -> left = current -> right; in ceval_insert_node()
852 if (current -> right) current -> right -> parent = newnode; in ceval_insert_node()
853 current -> right = newnode; in ceval_insert_node()
854 newnode -> parent = current; in ceval_insert_node()
855 current = newnode; in ceval_insert_node()
|
| /external/deqp/external/vulkancts/framework/vulkan/ |
| D | vkPrograms.cpp | 269 int newnode = *tail; in cacheInsert() local
271 DE_ASSERT(newnode < cacheMaxItems); in cacheInsert()
274 if (newnode >= cacheMaxItems) in cacheInsert()
277 newnode = 0; in cacheInsert()
287 if (newnode == 0) in cacheInsert()
312 r[p].right_child = newnode; in cacheInsert()
324 r[p].left_child = newnode; in cacheInsert()
|
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| D | subgraph.cc | 100 auto newnode = newnode_ref.get(); in ExtractForSignature() local
102 full_to_new[node] = newnode; in ExtractForSignature()
|
| /external/curl/lib/ |
| D | splay.h | 43 struct Curl_tree *newnode);
|
| /external/zstd/tests/ |
| D | paramgrill.c | 789 winner_ll_node* newnode = malloc(sizeof(winner_ll_node)); in insertWinner() local
790 if(newnode == NULL) { in insertWinner()
793 newnode->res = cur_node->res; in insertWinner()
795 newnode->next = cur_node->next; in insertWinner()
796 cur_node->next = newnode; in insertWinner()
816 winner_ll_node* newnode = malloc(sizeof(winner_ll_node)); in insertWinner() local
817 if(newnode == NULL) { in insertWinner()
820 newnode->res = w; in insertWinner()
821 newnode->next = NULL; in insertWinner()
822 cur_node->next = newnode; in insertWinner()
[all …]
|
| /external/e2fsprogs/lib/support/ |
| D | dict.c | 1078 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key) in dict_load_next() argument
1083 dict_assert (!dnode_is_in_a_dict(newnode)); in dict_load_next()
1095 newnode->key = key; in dict_load_next()
1096 nil->right->left = newnode; in dict_load_next()
1097 nil->right = newnode; in dict_load_next()
1098 newnode->left = nil; in dict_load_next()
|
| /external/f2fs-tools/fsck/ |
| D | dict.c | 1036 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key) in dict_load_next() argument
1041 dict_assert(!dnode_is_in_a_dict(newnode)); in dict_load_next()
1053 newnode->key = key; in dict_load_next()
1054 nil->right->left = newnode; in dict_load_next()
1055 nil->right = newnode; in dict_load_next()
1056 newnode->left = nil; in dict_load_next()
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| D | DOM2DTM.java | 1028 Node newnode=(Node)m_nodes.elementAt(id); in getLocalName()
1029 String newname=newnode.getLocalName(); in getLocalName()
1033 String qname = newnode.getNodeName(); in getLocalName()
|
| /external/libfuse/lib/ |
| D | fuse.c | 1472 struct node *newnode; in rename_node() local
1477 newnode = lookup_node(f, newdir, newname); in rename_node()
1481 if (newnode != NULL) { in rename_node()
1487 unlink_node(f, newnode); in rename_node()
1508 struct node *newnode; in exchange_node() local
1513 newnode = lookup_node(f, newdir, newname); in exchange_node()
1517 if (newnode) in exchange_node()
1518 unhash_name(f, newnode); in exchange_node()
1525 if (newnode) { in exchange_node()
1526 if (hash_name(f, newnode, olddir, oldname) == -1) in exchange_node()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | ACBTree.m | 205 // newnode.lnodeid = tnew.btNodes[0].nodeid;
|