| /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/srec/seti/sltsEngine/src/ |
| D | linklist_impl.c | 125 LNode *newnode = AllocNode(); in Insert() local
126 if(newnode == NULL){ in Insert()
129 newnode->data = data; in Insert()
133 list->head = newnode; in Insert()
151 newnode->prev = list->curr; in Insert()
152 newnode->next = NULL; in Insert()
153 (list->curr)->next = newnode; in Insert()
156 list->curr = newnode; in Insert()
157 list->tail = newnode; in Insert()
162 newnode->next = list->head; in Insert()
[all …]
|
| /external/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/libsepol/src/ |
| D | hashtab.c | 69 hashtab_ptr_t prev, cur, newnode; in hashtab_insert() local
85 newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t)); in hashtab_insert()
86 if (newnode == NULL) in hashtab_insert()
88 memset(newnode, 0, sizeof(struct hashtab_node)); in hashtab_insert()
89 newnode->key = key; in hashtab_insert()
90 newnode->datum = datum; in hashtab_insert()
92 newnode->next = prev->next; in hashtab_insert()
93 prev->next = newnode; in hashtab_insert()
95 newnode->next = h->htable[hvalue]; in hashtab_insert()
96 h->htable[hvalue] = newnode; in hashtab_insert()
[all …]
|
| D | avtab.c | 62 avtab_ptr_t newnode; in avtab_insert_node() local
63 newnode = (avtab_ptr_t) malloc(sizeof(struct avtab_node)); in avtab_insert_node()
64 if (newnode == NULL) in avtab_insert_node()
66 memset(newnode, 0, sizeof(struct avtab_node)); in avtab_insert_node()
67 newnode->key = *key; in avtab_insert_node()
68 newnode->datum = *datum; in avtab_insert_node()
70 newnode->next = prev->next; in avtab_insert_node()
71 prev->next = newnode; in avtab_insert_node()
73 newnode->next = h->htable[hvalue]; in avtab_insert_node()
74 h->htable[hvalue] = newnode; in avtab_insert_node()
[all …]
|
| D | sidtab.c | 46 sidtab_node_t *prev, *cur, *newnode; in sepol_sidtab_insert() local
64 newnode = (sidtab_node_t *) malloc(sizeof(sidtab_node_t)); in sepol_sidtab_insert()
65 if (newnode == NULL) in sepol_sidtab_insert()
67 newnode->sid = sid; in sepol_sidtab_insert()
68 if (context_cpy(&newnode->context, context)) { in sepol_sidtab_insert()
69 free(newnode); in sepol_sidtab_insert()
74 newnode->next = prev->next; in sepol_sidtab_insert()
75 prev->next = newnode; in sepol_sidtab_insert()
77 newnode->next = s->htable[hvalue]; in sepol_sidtab_insert()
78 s->htable[hvalue] = newnode; in sepol_sidtab_insert()
|
| /external/libselinux/src/ |
| D | avc_sidtab.c | 52 struct sidtab_node *newnode; in sidtab_insert() local
55 newnode = (struct sidtab_node *)avc_malloc(sizeof(*newnode)); in sidtab_insert()
56 if (!newnode) { in sidtab_insert()
63 avc_free(newnode); in sidtab_insert()
68 newnode->next = s->htable[hvalue]; in sidtab_insert()
69 newnode->sid_s.ctx = newctx; in sidtab_insert()
70 newnode->sid_s.refcnt = 1; /* unused */ in sidtab_insert()
71 s->htable[hvalue] = newnode; in sidtab_insert()
|
| /external/qemu/distrib/libselinux/src/ |
| D | avc_sidtab.c | 52 struct sidtab_node *newnode; in sidtab_insert() local
55 newnode = (struct sidtab_node *)avc_malloc(sizeof(*newnode)); in sidtab_insert()
56 if (!newnode) { in sidtab_insert()
63 avc_free(newnode); in sidtab_insert()
68 newnode->next = s->htable[hvalue]; in sidtab_insert()
69 newnode->sid_s.ctx = newctx; in sidtab_insert()
70 newnode->sid_s.refcnt = 1; /* unused */ in sidtab_insert()
71 s->htable[hvalue] = newnode; in sidtab_insert()
|
| /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/chromium_org/third_party/cython/src/Cython/Compiler/ |
| D | Visitor.py | 239 for attr, newnode in result.iteritems():
240 if type(newnode) is not list:
241 setattr(parent, attr, newnode)
245 for x in newnode:
|
| D | ParseTreeTransforms.py | 1145 newnode = self.visit(node.manager)
1147 if isinstance(newnode, Nodes.ParallelWithBlockNode):
1156 newnode.body = body
1157 return newnode
|
| /external/e2fsprogs/e2fsck/ |
| D | dict.c | 1057 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key) in dict_load_next() argument
1062 assert (!dnode_is_in_a_dict(newnode)); in dict_load_next()
1074 newnode->key = key; in dict_load_next()
1075 nil->right->left = newnode; in dict_load_next()
1076 nil->right = newnode; in dict_load_next()
1077 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/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ACBTree.m | 184 // newnode.lnodeid = tnew.btNodes[0].nodeid;
|