HelenOS sources
BITMAP_ELEMENT 61 common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 78 common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 80 common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 118 common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 119 common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 128 common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 140 common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 145 common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 147 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 153 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 172 common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 173 common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 182 common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 194 common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 199 common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 201 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 207 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 228 common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 231 common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 232 common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 233 common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 235 common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 284 common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 297 common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 299 common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 322 common/adt/bitmap.c bitmap->next_fit = i / BITMAP_ELEMENT;
BITMAP_ELEMENT 57 common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 73 common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 61 kernel/generic/common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 78 kernel/generic/common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 80 kernel/generic/common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 118 kernel/generic/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 119 kernel/generic/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 128 kernel/generic/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 140 kernel/generic/common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 145 kernel/generic/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 147 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 153 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 172 kernel/generic/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 173 kernel/generic/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 182 kernel/generic/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 194 kernel/generic/common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 199 kernel/generic/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 201 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 207 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 228 kernel/generic/common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 231 kernel/generic/common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 232 kernel/generic/common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 233 kernel/generic/common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 235 kernel/generic/common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 284 kernel/generic/common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 297 kernel/generic/common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 299 kernel/generic/common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 322 kernel/generic/common/adt/bitmap.c bitmap->next_fit = i / BITMAP_ELEMENT;
BITMAP_ELEMENT 57 kernel/generic/common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 73 kernel/generic/common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 61 uspace/lib/c/common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 78 uspace/lib/c/common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 80 uspace/lib/c/common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 118 uspace/lib/c/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 119 uspace/lib/c/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 128 uspace/lib/c/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 140 uspace/lib/c/common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 145 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 147 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 153 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 172 uspace/lib/c/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 173 uspace/lib/c/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 182 uspace/lib/c/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 194 uspace/lib/c/common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 199 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 201 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 207 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 228 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 231 uspace/lib/c/common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 232 uspace/lib/c/common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 233 uspace/lib/c/common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 235 uspace/lib/c/common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 284 uspace/lib/c/common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 297 uspace/lib/c/common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 299 uspace/lib/c/common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 322 uspace/lib/c/common/adt/bitmap.c bitmap->next_fit = i / BITMAP_ELEMENT;
BITMAP_ELEMENT 57 uspace/lib/c/common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 73 uspace/lib/c/common/include/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 57 uspace/lib/posix/include/common/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 73 uspace/lib/posix/include/common/adt/bitmap.h size_t byte = element / BITMAP_ELEMENT;
HelenOS homepage, sources at GitHub