198c976f7e
that passes signal map along. This mechanisms is also used for nonuser signals like SIGKMESS, SIGKSTOP, SIGKSIG. Revised comments of many system call handlers. Renamed setpriority to nice.
86 lines
2.3 KiB
C
Executable file
86 lines
2.3 KiB
C
Executable file
/* This file contains a collection of miscellaneous procedures:
|
|
* panic abort MINIX due to a fatal error
|
|
*/
|
|
|
|
#include "kernel.h"
|
|
#include "assert.h"
|
|
#include <unistd.h>
|
|
#include <minix/com.h>
|
|
|
|
|
|
|
|
/*===========================================================================*
|
|
* panic *
|
|
*===========================================================================*/
|
|
PUBLIC void panic(s,n)
|
|
_CONST char *s;
|
|
int n;
|
|
{
|
|
/* The system has run aground of a fatal kernel error. Terminate execution. */
|
|
static int panicking = 0;
|
|
if (panicking ++) return; /* prevent recursive panics */
|
|
|
|
if (s != NULL) {
|
|
kprintf("\nKernel panic: %s", karg(s));
|
|
if (n != NO_NUM) kprintf(" %d", n);
|
|
kprintf("\n",NO_NUM);
|
|
}
|
|
prepare_shutdown(RBT_PANIC);
|
|
}
|
|
|
|
|
|
|
|
#if TEMP_CODE
|
|
|
|
/*===========================================================================*
|
|
* free_bit *
|
|
*===========================================================================*/
|
|
PUBLIC void free_bit(bit_nr, bitmap, nr_bits)
|
|
bit_t bit_nr;
|
|
bitchunk_t *bitmap;
|
|
bit_t nr_bits;
|
|
{
|
|
bitchunk_t *chunk;
|
|
if (bit_nr >= nr_bits) {
|
|
kprintf("Warning, free_bit: %d illegal index\n", bit_nr);
|
|
return;
|
|
}
|
|
chunk = &bitmap[(bit_nr/BITCHUNK_BITS)];
|
|
*chunk &= ~(1 << (bit_nr % BITCHUNK_BITS));
|
|
}
|
|
|
|
/*===========================================================================*
|
|
* alloc_bit *
|
|
*===========================================================================*/
|
|
PUBLIC int alloc_bit(bitmap, nr_bits)
|
|
bitchunk_t *bitmap;
|
|
bit_t nr_bits;
|
|
{
|
|
bitchunk_t *chunk;
|
|
int nr_chunks;
|
|
int bit_nr;
|
|
int i;
|
|
|
|
/* Iterate over the words in block. */
|
|
nr_chunks = BITMAP_CHUNKS(nr_bits);
|
|
for (chunk = &bitmap[0]; chunk < &bitmap[nr_chunks]; chunk++) {
|
|
|
|
/* Does this chunk contain a free bit? */
|
|
if (*chunk == (bitchunk_t) ~0) continue;
|
|
|
|
/* Get bit number from the start of the bit map. */
|
|
for (i = 0; (*chunk & (1 << i)) != 0; ++i) {}
|
|
bit_nr = (chunk - &bitmap[0]) * BITCHUNK_BITS + i;
|
|
|
|
/* Don't allocate bits beyond the end of the map. */
|
|
if (bit_nr >= nr_bits) break;
|
|
|
|
*chunk |= 1 << bit_nr % BITCHUNK_BITS;
|
|
return(bit_nr);
|
|
|
|
}
|
|
return(-1);
|
|
}
|
|
|
|
#endif
|