Home
last modified time | relevance | path

Searched refs:maps (Results 1 – 2 of 2) sorted by relevance

/security/selinux/ss/
A Debitmap.c38 !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) { in ebitmap_equal()
64 memcpy(new->maps, n->maps, EBITMAP_SIZE / 8); in ebitmap_cpy()
130 e_map = e_iter->maps[iter]; in ebitmap_netlbl_export()
198 e_iter->maps[idx] = bitmap; in ebitmap_netlbl_import()
235 for (i = EBITMAP_UNIT_NUMS - 1; (i >= 0) && !n2->maps[i];) in ebitmap_contains()
239 __fls(n2->maps[i]); in ebitmap_contains()
245 if ((n1->maps[i] & n2->maps[i]) != n2->maps[i]) in ebitmap_contains()
292 s = find_first_bit(n->maps, EBITMAP_SIZE); in ebitmap_set_bit()
459 n->maps[index++] = map & (-1UL); in ebitmap_read()
568 hash = jhash(node->maps, sizeof(node->maps), hash); in ebitmap_hash()
A Debitmap.h38 unsigned long maps[EBITMAP_UNIT_NUMS]; member
55 ofs = find_first_bit((*n)->maps, EBITMAP_SIZE); in ebitmap_start_positive()
72 ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1); in ebitmap_next_positive()
77 ofs = find_first_bit((*n)->maps, EBITMAP_SIZE); in ebitmap_next_positive()
95 if ((n->maps[index] & (EBITMAP_BIT << ofs))) in ebitmap_node_get_bit()
106 n->maps[index] |= (EBITMAP_BIT << ofs); in ebitmap_node_set_bit()
115 n->maps[index] &= ~(EBITMAP_BIT << ofs); in ebitmap_node_clr_bit()

Completed in 6 milliseconds