| /third_party/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 …]
|
| /third_party/python/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 …]
|
| /third_party/libuv/src/ |
| D | heap-inl.h | 53 struct heap_node* newnode,
107 struct heap_node* newnode, in HEAP_EXPORT() argument
115 newnode->left = NULL; in HEAP_EXPORT()
116 newnode->right = NULL; in HEAP_EXPORT()
117 newnode->parent = NULL; in HEAP_EXPORT()
139 newnode->parent = *parent; in HEAP_EXPORT()
140 *child = newnode; in HEAP_EXPORT()
146 while (newnode->parent != NULL && less_than(newnode, newnode->parent)) in HEAP_EXPORT()
147 heap_node_swap(heap, newnode->parent, newnode); in HEAP_EXPORT()
|
| /third_party/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()
|
| /third_party/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()
|
| /third_party/flutter/skia/third_party/externals/sdl/visualtest/src/ |
| D | action_configparser.c | 206 SDLVisualTest_ActionNode* newnode; in SDLVisualTest_InsertIntoActionQueue() local
223 newnode = (SDLVisualTest_ActionNode*)malloc(sizeof(SDLVisualTest_ActionNode)); in SDLVisualTest_InsertIntoActionQueue()
224 if(!newnode) in SDLVisualTest_InsertIntoActionQueue()
229 newnode->action = action; in SDLVisualTest_InsertIntoActionQueue()
238 prev->next = newnode; in SDLVisualTest_InsertIntoActionQueue()
239 newnode->next = n; in SDLVisualTest_InsertIntoActionQueue()
243 newnode->next = queue->front; in SDLVisualTest_InsertIntoActionQueue()
244 queue->front = newnode; in SDLVisualTest_InsertIntoActionQueue()
251 queue->rear->next = newnode; in SDLVisualTest_InsertIntoActionQueue()
252 newnode->next = NULL; in SDLVisualTest_InsertIntoActionQueue()
[all …]
|
| /third_party/toybox/toys/pending/ |
| D | tcpsvd.c | 92 struct list_pid *newnode = xmalloc(sizeof(struct list_pid)); in insert() local
93 newnode->pid = pid; in insert()
94 newnode->ip = addr; in insert()
95 newnode->next = NULL; in insert()
96 if (!*l) *l = newnode; in insert()
98 newnode->next = (*l); in insert()
99 *l = newnode; in insert()
270 struct list *head, *newnode; in tcpsvd_main() local
338 newnode = (struct list*)xzalloc(sizeof(struct list)); in tcpsvd_main()
339 newnode->d = addr; in tcpsvd_main()
[all …]
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | rbtree.h | 104 rb_replace_node(struct rb_node *victim, struct rb_node *newnode, in rb_replace_node() argument
112 p->rb_left = newnode; in rb_replace_node()
114 p->rb_right = newnode; in rb_replace_node()
116 root->rb_node = newnode; in rb_replace_node()
118 rb_set_parent(victim->rb_left, newnode); in rb_replace_node()
120 rb_set_parent(victim->rb_right, newnode); in rb_replace_node()
121 *newnode = *victim; in rb_replace_node()
|
| /third_party/libxml2/doc/tutorial/ |
| D | includeaddattribute.c | 14 xmlNodePtr newnode;
38 newnode = xmlNewTextChild (cur, NULL, "reference", NULL);
39 newattr = xmlNewProp (newnode, "uri", uri);
|
| /third_party/skia/third_party/externals/angle2/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()
|
| /third_party/vk-gl-cts/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()
|
| /third_party/f2fs-tools/fsck/ |
| D | dict.c | 1037 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key) in dict_load_next() argument
1042 dict_assert(!dnode_is_in_a_dict(newnode)); in dict_load_next()
1054 newnode->key = key; in dict_load_next()
1055 nil->right->left = newnode; in dict_load_next()
1056 nil->right = newnode; in dict_load_next()
1057 newnode->left = nil; in dict_load_next()
|
| /third_party/libfuse/lib/ |
| D | fuse.c | 1423 struct node *newnode; in rename_node() local
1428 newnode = lookup_node(f, newdir, newname); in rename_node()
1432 if (newnode != NULL) { in rename_node()
1438 unlink_node(f, newnode); in rename_node()
1459 struct node *newnode; in exchange_node() local
1464 newnode = lookup_node(f, newdir, newname); in exchange_node()
1468 if (newnode) in exchange_node()
1469 unhash_name(f, newnode); in exchange_node()
1476 if (newnode) { in exchange_node()
1477 if (hash_name(f, newnode, olddir, oldname) == -1) in exchange_node()
[all …]
|
| /third_party/ntfs-3g/libfuse-lite/ |
| D | fuse.c | 594 struct node *newnode; in rename_node() local
599 newnode = lookup_node(f, newdir, newname); in rename_node()
603 if (newnode != NULL) { in rename_node()
609 unhash_name(f, newnode); in rename_node()
1074 struct node *newnode; in hidden_name() local
1090 newnode = lookup_node(f, dir, newname); in hidden_name()
1091 } while(newnode); in hidden_name()
|