HomeSort by relevance Sort by last modified time
    Searched defs:newnode (Results 1 - 13 of 13) sorted by null

  /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/epid-sdk/epid/member/src/
allowed_basenames.c 71 AllowedBasename* newnode = NULL; local
80 newnode = SAFE_ALLOC(sizeof(AllowedBasename) + (length - 1));
81 if (!newnode) {
85 newnode->next = NULL;
86 newnode->length = length;
88 if (0 != memcpy_S(newnode->name, length, basename, length)) {
89 SAFE_FREE(newnode);
94 basenames->data = newnode;
100 currentnode->next = newnode;
  /external/selinux/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/selinux/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/selinux/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 95 avtab_ptr_t newnode; local
98 newnode = (avtab_ptr_t) malloc(sizeof(struct avtab_node));
99 if (newnode == NULL)
101 memset(newnode, 0, sizeof(struct avtab_node));
102 newnode->key = *key;
107 free(newnode);
113 newnode->datum.xperms = xperms;
118 newnode->datum.data = datum->data;
120 newnode->datum = *datum;
124 newnode->next = prev->next
138 avtab_ptr_t prev, cur, newnode; local
183 avtab_ptr_t prev, cur, newnode; local
    [all...]
  /external/selinux/policycoreutils/newrole/
hashtab.c 48 hashtab_ptr_t prev, cur, newnode; local
64 newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));
65 if (newnode == NULL)
67 memset(newnode, 0, sizeof(struct hashtab_node));
68 newnode->key = key;
69 newnode->datum = datum;
71 newnode->next = prev->next;
72 prev->next = newnode;
74 newnode->next = h->htable[hvalue];
75 h->htable[hvalue] = newnode;
120 hashtab_ptr_t prev, cur, newnode; local
    [all...]
  /external/tensorflow/tensorflow/core/grappler/graph_analyzer/
subgraph.cc 100 auto newnode = newnode_ref.get(); local
102 full_to_new[node] = newnode;
  /external/toybox/toys/pending/
tcpsvd.c 92 struct list_pid *newnode = xmalloc(sizeof(struct list_pid)); local
93 newnode->pid = pid;
94 newnode->ip = addr;
95 newnode->next = NULL;
96 if (!*l) *l = newnode;
98 newnode->next = (*l);
99 *l = newnode;
270 struct list *head, *newnode; local
338 newnode = (struct list*)xzalloc(sizeof(struct list));
339 newnode->d = addr
    [all...]
  /external/iptables/iptables/
xtables-eb.c 668 struct ebt_match *newnode; local
686 newnode = calloc(1, sizeof(struct ebt_match));
687 if (newnode == NULL)
690 newnode->ismatch = true;
691 newnode->u.match = newm;
694 cs->match_list = newnode;
696 cs->match_list->next = newnode;
702 struct ebt_match *i, *newnode; local
713 newnode = calloc(1, sizeof(struct ebt_match));
714 if (newnode == NULL
    [all...]
  /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/icu/tools/srcgen/currysrc/libs/
org.eclipse.jdt.core_3.14.0.v20180528-0519.jar 

Completed in 1358 milliseconds