Searched refs:BITS_PER_WORD (Results 1 – 4 of 4) sorted by relevance
76 unsigned k = BITS_PER_WORD; in set_first_derives()80 if (k >= BITS_PER_WORD) in set_first_derives()148 for (i = 0; i < BITS_PER_WORD; ++i) in closure()161 ruleno += BITS_PER_WORD; in closure()208 k = BITS_PER_WORD; in print_EFF()211 if (k >= BITS_PER_WORD) in print_EFF()238 k = BITS_PER_WORD; in print_first_derives()241 if (k >= BITS_PER_WORD) in print_first_derives()
69 #define BITS_PER_WORD ((int) sizeof (unsigned) * CHAR_BIT) macro70 #define WORDSIZE(n) (((n)+(BITS_PER_WORD-1))/BITS_PER_WORD)71 #define BIT(r, n) ((((r)[(n)/BITS_PER_WORD])>>((n)&(BITS_PER_WORD-1)))&1)72 #define SETBIT(r, n) ((r)[(n)/BITS_PER_WORD]|=((unsigned)1<<((n)&(BITS_PER_WORD-1))))
46 if (++i >= BITS_PER_WORD) in transitive_closure()74 if (++i >= BITS_PER_WORD) in reflexive_transitive_closure()
275 #define BITS_PER_WORD (8*sizeof(bpf_u_int32)) macro280 ((p)[(unsigned)(a) / BITS_PER_WORD] & ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD)))286 (p)[(unsigned)(a) / BITS_PER_WORD] |= ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))292 (p)[(unsigned)(a) / BITS_PER_WORD] &= ~((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))1760 k += i * BITS_PER_WORD; in opt_j()2566 opt_state->edgewords = opt_state->n_edges / BITS_PER_WORD + 1; in opt_init()2567 opt_state->nodewords = opt_state->n_blocks / BITS_PER_WORD + 1; in opt_init()