HelenOS sources
BITMAP_ELEMENT 62 common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 79 common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 81 common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 119 common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 120 common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 129 common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 141 common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 146 common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 148 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 154 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 173 common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 174 common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 183 common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 195 common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 200 common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 202 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 208 common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 229 common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 232 common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 233 common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 234 common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 236 common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 285 common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 298 common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 300 common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 323 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 62 kernel/generic/common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 79 kernel/generic/common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 81 kernel/generic/common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 119 kernel/generic/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 120 kernel/generic/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 129 kernel/generic/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 141 kernel/generic/common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 146 kernel/generic/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 148 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 154 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 173 kernel/generic/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 174 kernel/generic/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 183 kernel/generic/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 195 kernel/generic/common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 200 kernel/generic/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 202 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 208 kernel/generic/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 229 kernel/generic/common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 232 kernel/generic/common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 233 kernel/generic/common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 234 kernel/generic/common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 236 kernel/generic/common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 285 kernel/generic/common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 298 kernel/generic/common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 300 kernel/generic/common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 323 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 62 uspace/lib/c/common/adt/bitmap.c size_t byte = element / BITMAP_ELEMENT;
BITMAP_ELEMENT 79 uspace/lib/c/common/adt/bitmap.c size_t size = elements / BITMAP_ELEMENT;
BITMAP_ELEMENT 81 uspace/lib/c/common/adt/bitmap.c if ((elements % BITMAP_ELEMENT) != 0)
BITMAP_ELEMENT 119 uspace/lib/c/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 120 uspace/lib/c/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 129 uspace/lib/c/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 141 uspace/lib/c/common/adt/bitmap.c ~((1 << (BITMAP_ELEMENT - lub)) - 1);
BITMAP_ELEMENT 146 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 148 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 154 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] |=
BITMAP_ELEMENT 173 uspace/lib/c/common/adt/bitmap.c size_t start_byte = start / BITMAP_ELEMENT;
BITMAP_ELEMENT 174 uspace/lib/c/common/adt/bitmap.c size_t aligned_start = ALIGN_UP(start, BITMAP_ELEMENT);
BITMAP_ELEMENT 183 uspace/lib/c/common/adt/bitmap.c size_t tab = amb % BITMAP_ELEMENT;
BITMAP_ELEMENT 195 uspace/lib/c/common/adt/bitmap.c (1 << (BITMAP_ELEMENT - lub)) - 1;
BITMAP_ELEMENT 200 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < amb / BITMAP_ELEMENT; i++) {
BITMAP_ELEMENT 202 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] =
BITMAP_ELEMENT 208 uspace/lib/c/common/adt/bitmap.c bitmap->bits[aligned_start / BITMAP_ELEMENT + i] &=
BITMAP_ELEMENT 229 uspace/lib/c/common/adt/bitmap.c for (i = 0; i < count / BITMAP_ELEMENT; i++)
BITMAP_ELEMENT 232 uspace/lib/c/common/adt/bitmap.c if (count % BITMAP_ELEMENT) {
BITMAP_ELEMENT 233 uspace/lib/c/common/adt/bitmap.c bitmap_clear_range(dst, i * BITMAP_ELEMENT,
BITMAP_ELEMENT 234 uspace/lib/c/common/adt/bitmap.c count % BITMAP_ELEMENT);
BITMAP_ELEMENT 236 uspace/lib/c/common/adt/bitmap.c ((1 << (count % BITMAP_ELEMENT)) - 1);
BITMAP_ELEMENT 285 uspace/lib/c/common/adt/bitmap.c size_t prefered_fit = (prefered - base) / BITMAP_ELEMENT;
BITMAP_ELEMENT 298 uspace/lib/c/common/adt/bitmap.c size_t byte_bit = byte * BITMAP_ELEMENT;
BITMAP_ELEMENT 300 uspace/lib/c/common/adt/bitmap.c for (size_t bit = 0; bit < BITMAP_ELEMENT; bit++) {
BITMAP_ELEMENT 323 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