HomeSort by: relevance | last modified time | path
    Searched defs:bpl (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/external/bsd/drm2/include/linux/
bitmap.h 50 const size_t bpl = NBBY * sizeof(*bitmap); local in function:bitmap_zero
51 size_t n = howmany(nbits, bpl);
65 const size_t bpl = NBBY * sizeof(*bitmap); local in function:bitmap_empty
67 for (; nbits >= bpl; nbits -= bpl) {
88 const size_t bpl = NBBY * sizeof(*bitmap); local in function:bitmap_weight
91 for (; nbits >= bpl; nbits -= bpl)
108 const size_t bpl = NBBY * sizeof(*bitmap); local in function:bitmap_set
109 unsigned long *p = bitmap + startbit/bpl;
143 const size_t bpl = NBBY * sizeof(*bitmap); local in function:bitmap_clear
178 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_copy
193 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_complement
211 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_and
229 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_andnot
247 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_or
257 const size_t bpl = NBBY * sizeof(unsigned long); local in function:bitmap_zalloc
    [all...]
  /src/sys/external/bsd/common/include/linux/
bitops.h 199 const size_t bpl = (CHAR_BIT * sizeof(*ptr)); local in function:__find_next_bit
200 const unsigned long *p = ptr + startbit/bpl;
201 size_t n = howmany(nbits, bpl);
213 if (startbit % bpl) {
217 /* Clear the low startbit%bpl bits. */
218 word &= (~0UL << (startbit % bpl));
244 result = bpl*(p - ptr);
  /src/sys/arch/amiga/amiga/
custom.h 150 unsigned short bpl; member in struct:Custom::__anonc33a4fd5050a::__anonc33a4fd50608
154 #define bplptl(n) _bplpt.bs[n].bpl

Completed in 12 milliseconds