Searched defs:prev (Results 1 - 5 of 5) sorted by relevance
/security/selinux/ss/ |
H A D | hashtab.c | 42 struct hashtab_node *prev, *cur, *newnode; local 50 prev = NULL; 53 prev = cur; 65 if (prev) { 66 newnode->next = prev->next; 67 prev->next = newnode;
|
H A D | sidtab.c | 36 struct sidtab_node *prev, *cur, *newnode; local 44 prev = NULL; 47 prev = cur; 68 if (prev) { 69 newnode->next = prev->next; 71 prev->next = newnode;
|
H A D | avtab.c | 37 struct avtab_node *prev, struct avtab_node *cur, 59 if (prev) { 60 newnode->next = prev->next; 61 prev->next = newnode; 74 struct avtab_node *prev, *cur, *newnode; local 81 for (prev = NULL, cur = h->htable[hvalue]; 83 prev = cur, cur = cur->next) { 103 newnode = avtab_insert_node(h, hvalue, prev, cur, key, datum); 118 struct avtab_node *prev, *cur; local 124 for (prev 36 avtab_insert_node(struct avtab *h, int hvalue, struct avtab_node *prev, struct avtab_node *cur, struct avtab_key *key, struct avtab_datum *datum) argument [all...] |
H A D | ebitmap.c | 51 struct ebitmap_node *n, *new, *prev; local 55 prev = NULL; 65 if (prev) 66 prev->next = new; 69 prev = new; 252 struct ebitmap_node *n, *prev, *new; local 254 prev = NULL; 275 if (prev) 276 e->highbit = prev->startbit 281 if (prev) [all...] |
H A D | mls.c | 37 int i, l, len, head, prev; local 52 prev = -2; 55 if (i - prev > 1) { 57 if (head != prev) { 58 nm = sym_name(&policydb, SYM_CATS, prev); 65 prev = i; 67 if (prev != head) { 68 nm = sym_name(&policydb, SYM_CATS, prev); 92 int i, l, head, prev; local 111 prev [all...] |
Completed in 85 milliseconds