titaniumtown/os161-assignments
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

clang-format

Browse Source
This commit is contained in:
Simon Gardling
2024-09-10 13:03:02 -04:00
parent 53c617d779
commit d66450e427
381 changed files with 28864 additions and 34170 deletions
Download Patch File Download Diff File Expand all files Collapse all files

199
kern/lib/bitmap.c
View File

@@ -43,134 +43,113 @@
* bitmap data saved on disk becomes endian-dependent, which is a
* severe nuisance.
*/
#define BITS_PER_WORD (CHAR_BIT)
#define WORD_TYPE unsigned char
#define WORD_ALLBITS (0xff)
#define BITS_PER_WORD (CHAR_BIT)
#define WORD_TYPE unsigned char
#define WORD_ALLBITS (0xff)
struct bitmap {
unsigned nbits;
WORD_TYPE *v;
unsigned nbits;
WORD_TYPE *v;
};
struct bitmap *bitmap_create(unsigned nbits) {
struct bitmap *b;
unsigned words;
struct bitmap *
bitmap_create(unsigned nbits)
{
struct bitmap *b;
unsigned words;
words = DIVROUNDUP(nbits, BITS_PER_WORD);
b = kmalloc(sizeof(struct bitmap));
if (b == NULL) {
return NULL;
}
b->v = kmalloc(words * sizeof(WORD_TYPE));
if (b->v == NULL) {
kfree(b);
return NULL;
}
words = DIVROUNDUP(nbits, BITS_PER_WORD);
b = kmalloc(sizeof(struct bitmap));
if (b == NULL) {
return NULL;
bzero(b->v, words * sizeof(WORD_TYPE));
b->nbits = nbits;
/* Mark any leftover bits at the end in use */
if (words > nbits / BITS_PER_WORD) {
unsigned j, ix = words - 1;
unsigned overbits = nbits - ix * BITS_PER_WORD;
KASSERT(nbits / BITS_PER_WORD == words - 1);
KASSERT(overbits > 0 && overbits < BITS_PER_WORD);
for (j = overbits; j < BITS_PER_WORD; j++) {
b->v[ix] |= ((WORD_TYPE)1 << j);
}
}
return b;
}
void *bitmap_getdata(struct bitmap *b) { return b->v; }
int bitmap_alloc(struct bitmap *b, unsigned *index) {
unsigned ix;
unsigned maxix = DIVROUNDUP(b->nbits, BITS_PER_WORD);
unsigned offset;
for (ix = 0; ix < maxix; ix++) {
if (b->v[ix] != WORD_ALLBITS) {
for (offset = 0; offset < BITS_PER_WORD; offset++) {
WORD_TYPE mask = ((WORD_TYPE)1) << offset;
if ((b->v[ix] & mask) == 0) {
b->v[ix] |= mask;
*index = (ix * BITS_PER_WORD) + offset;
KASSERT(*index < b->nbits);
return 0;
}
b->v = kmalloc(words*sizeof(WORD_TYPE));
if (b->v == NULL) {
kfree(b);
return NULL;
}
bzero(b->v, words*sizeof(WORD_TYPE));
b->nbits = nbits;
/* Mark any leftover bits at the end in use */
if (words > nbits / BITS_PER_WORD) {
unsigned j, ix = words-1;
unsigned overbits = nbits - ix*BITS_PER_WORD;
KASSERT(nbits / BITS_PER_WORD == words-1);
KASSERT(overbits > 0 && overbits < BITS_PER_WORD);
for (j=overbits; j<BITS_PER_WORD; j++) {
b->v[ix] |= ((WORD_TYPE)1 << j);
}
}
return b;
}
KASSERT(0);
}
}
return ENOSPC;
}
void *
bitmap_getdata(struct bitmap *b)
{
return b->v;
static inline void bitmap_translate(unsigned bitno, unsigned *ix,
WORD_TYPE *mask) {
unsigned offset;
*ix = bitno / BITS_PER_WORD;
offset = bitno % BITS_PER_WORD;
*mask = ((WORD_TYPE)1) << offset;
}
int
bitmap_alloc(struct bitmap *b, unsigned *index)
{
unsigned ix;
unsigned maxix = DIVROUNDUP(b->nbits, BITS_PER_WORD);
unsigned offset;
void bitmap_mark(struct bitmap *b, unsigned index) {
unsigned ix;
WORD_TYPE mask;
for (ix=0; ix<maxix; ix++) {
if (b->v[ix]!=WORD_ALLBITS) {
for (offset = 0; offset < BITS_PER_WORD; offset++) {
WORD_TYPE mask = ((WORD_TYPE)1) << offset;
KASSERT(index < b->nbits);
bitmap_translate(index, &ix, &mask);
if ((b->v[ix] & mask)==0) {
b->v[ix] |= mask;
*index = (ix*BITS_PER_WORD)+offset;
KASSERT(*index < b->nbits);
return 0;
}
}
KASSERT(0);
}
}
return ENOSPC;
KASSERT((b->v[ix] & mask) == 0);
b->v[ix] |= mask;
}
static
inline
void
bitmap_translate(unsigned bitno, unsigned *ix, WORD_TYPE *mask)
{
unsigned offset;
*ix = bitno / BITS_PER_WORD;
offset = bitno % BITS_PER_WORD;
*mask = ((WORD_TYPE)1) << offset;
void bitmap_unmark(struct bitmap *b, unsigned index) {
unsigned ix;
WORD_TYPE mask;
KASSERT(index < b->nbits);
bitmap_translate(index, &ix, &mask);
KASSERT((b->v[ix] & mask) != 0);
b->v[ix] &= ~mask;
}
void
bitmap_mark(struct bitmap *b, unsigned index)
{
unsigned ix;
WORD_TYPE mask;
int bitmap_isset(struct bitmap *b, unsigned index) {
unsigned ix;
WORD_TYPE mask;
KASSERT(index < b->nbits);
bitmap_translate(index, &ix, &mask);
KASSERT((b->v[ix] & mask)==0);
b->v[ix] |= mask;
bitmap_translate(index, &ix, &mask);
return (b->v[ix] & mask);
}
void
bitmap_unmark(struct bitmap *b, unsigned index)
{
unsigned ix;
WORD_TYPE mask;
KASSERT(index < b->nbits);
bitmap_translate(index, &ix, &mask);
KASSERT((b->v[ix] & mask)!=0);
b->v[ix] &= ~mask;
}
int
bitmap_isset(struct bitmap *b, unsigned index)
{
unsigned ix;
WORD_TYPE mask;
bitmap_translate(index, &ix, &mask);
return (b->v[ix] & mask);
}
void
bitmap_destroy(struct bitmap *b)
{
kfree(b->v);
kfree(b);
void bitmap_destroy(struct bitmap *b) {
kfree(b->v);
kfree(b);
}