| /external/libcap-ng/libcap-ng-0.7/utils/ |
| proc-llist.c | 38 lnode* newnode; local
43 newnode = malloc(sizeof(lnode));
44 if (newnode == NULL)
47 newnode->ppid = node->ppid;
48 newnode->pid = node->pid;
49 newnode->uid = node->uid;
50 newnode->inode = node->inode;
52 newnode->cmd = node->cmd;
53 newnode->capabilities = node->capabilities;
54 newnode->bounds = node->bounds
[all...] |
| /external/checkpolicy/ |
| queue.c | 28 queue_node_ptr_t newnode; local
33 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node));
34 if (newnode == NULL)
37 newnode->element = e;
38 newnode->next = NULL;
41 q->head = q->tail = newnode;
43 q->tail->next = newnode;
44 q->tail = newnode;
52 queue_node_ptr_t newnode; local
57 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node))
[all...] |
| /external/libsepol/src/ |
| hashtab.c | 69 hashtab_ptr_t prev, cur, newnode; local
85 newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));
86 if (newnode == NULL)
88 memset(newnode, 0, sizeof(struct hashtab_node));
89 newnode->key = key;
90 newnode->datum = datum;
92 newnode->next = prev->next;
93 prev->next = newnode;
95 newnode->next = h->htable[hvalue];
96 h->htable[hvalue] = newnode;
141 hashtab_ptr_t prev, cur, newnode; local
[all...] |
| sidtab.c | 46 sidtab_node_t *prev, *cur, *newnode; local
64 newnode = (sidtab_node_t *) malloc(sizeof(sidtab_node_t));
65 if (newnode == NULL)
67 newnode->sid = sid;
68 if (context_cpy(&newnode->context, context)) {
69 free(newnode);
74 newnode->next = prev->next;
75 prev->next = newnode;
77 newnode->next = s->htable[hvalue];
78 s->htable[hvalue] = newnode;
[all...] |
| avtab.c | 62 avtab_ptr_t newnode; local
63 newnode = (avtab_ptr_t) malloc(sizeof(struct avtab_node));
64 if (newnode == NULL)
66 memset(newnode, 0, sizeof(struct avtab_node));
67 newnode->key = *key;
68 newnode->datum = *datum;
70 newnode->next = prev->next;
71 prev->next = newnode;
73 newnode->next = h->htable[hvalue];
74 h->htable[hvalue] = newnode;
84 avtab_ptr_t prev, cur, newnode; local
125 avtab_ptr_t prev, cur, newnode; local
[all...] |
| /external/libselinux/src/ |
| avc_sidtab.c | 52 struct sidtab_node *newnode; local
55 newnode = (struct sidtab_node *)avc_malloc(sizeof(*newnode));
56 if (!newnode) {
63 avc_free(newnode);
68 newnode->next = s->htable[hvalue];
69 newnode->sid_s.ctx = newctx;
70 newnode->sid_s.refcnt = 1; /* unused */
71 s->htable[hvalue] = newnode;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeProxy.java | 340 int newnode = dtm.getParent(node); local
342 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
353 int newnode = dtm.getParent(node); local
355 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
382 int newnode = dtm.getFirstChild(node); local
384 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
395 int newnode = dtm.getLastChild(node) local
408 int newnode = dtm.getPreviousSibling(node); local
425 int newnode = dtm.getNextSibling(node); local
1318 int newnode = dtm.getParent(node); local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| dict.c | 1057 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key)
1062 assert (!dnode_is_in_a_dict(newnode));
1074 newnode->key = key;
1075 nil->right->left = newnode;
1076 nil->right = newnode;
1077 newnode->left = nil;
[all...] |
| /external/chromium_org/third_party/cython/src/Cython/Compiler/ |
| 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:
|
| ParseTreeTransforms.py | [all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.pde.api.tools_1.0.202.v20100820_r361.jar | |
