-/*
+/*
This file is part of SXEmacs
SXEmacs is free software: you can redistribute it and/or modify
void
debug_gcpro6(char *file, int line, struct gcpro *gcpro1, struct gcpro *gcpro2,
struct gcpro *gcpro3, struct gcpro *gcpro4, struct gcpro *gcpro5,
- struct gcpro *gcpro6,
+ struct gcpro *gcpro6,
Lisp_Object * var1, Lisp_Object * var2, Lisp_Object * var3,
Lisp_Object * var4, Lisp_Object * var5, Lisp_Object * var6)
{
void
debug_gcpro7(char *file, int line, struct gcpro *gcpro1, struct gcpro *gcpro2,
struct gcpro *gcpro3, struct gcpro *gcpro4, struct gcpro *gcpro5,
- struct gcpro *gcpro6, struct gcpro *gcpro7,
+ struct gcpro *gcpro6, struct gcpro *gcpro7,
Lisp_Object * var1, Lisp_Object * var2, Lisp_Object * var3,
- Lisp_Object * var4, Lisp_Object * var5, Lisp_Object * var6,
- Lisp_Object * var7)
+ Lisp_Object * var4, Lisp_Object * var5, Lisp_Object * var6,
+ Lisp_Object * var7)
{
log_gcpro(file, line, gcpro5, gcpro5_type);
gcpro1->next = gcprolist;
void
debug_gcpro8(char *file, int line, struct gcpro *gcpro1, struct gcpro *gcpro2,
struct gcpro *gcpro3, struct gcpro *gcpro4, struct gcpro *gcpro5,
- struct gcpro *gcpro6, struct gcpro *gcpro7, struct gcpro *gcpro8,
+ struct gcpro *gcpro6, struct gcpro *gcpro7, struct gcpro *gcpro8,
Lisp_Object * var1, Lisp_Object * var2, Lisp_Object * var3,
- Lisp_Object * var4, Lisp_Object * var5, Lisp_Object * var6,
- Lisp_Object * var7, Lisp_Object * var8)
+ Lisp_Object * var4, Lisp_Object * var5, Lisp_Object * var6,
+ Lisp_Object * var7, Lisp_Object * var8)
{
log_gcpro(file, line, gcpro5, gcpro5_type);
gcpro1->next = gcprolist;
*
* Nov 1983, Mike@BRL, Added support for 4.1C/4.2 BSD.
*
- * This is a very fast storage allocator. It allocates blocks of a small
+ * This is a very fast storage allocator. It allocates blocks of a small
* number of different sizes, and keeps free lists of each size. Blocks
- * that don't exactly fit are passed up to the next larger size. In this
+ * that don't exactly fit are passed up to the next larger size. In this
* implementation, the available sizes are (2^n)-4 (or -16) bytes long.
* This is designed for use in a program that uses vast quantities of
* memory, but bombs when it runs out. To make it a little better, it
#define PAGE (getpagesize ())
#define ALIGNED(addr) (((unsigned long int) (addr) & (page_size - 1)) == 0)
#define ROUNDUP(size) (((unsigned long int) (size) + page_size - 1) \
- & ~(page_size - 1))
+ & ~(page_size - 1))
#define ROUND_TO_PAGE(addr) (addr & (~(page_size - 1)))
#define MEM_ALIGN sizeof(double)
/* Advance through heaps, marking them empty,
till we get to the one that B is in. */
while (heap) {
- if (heap->bloc_start <= b->data &&
+ if (heap->bloc_start <= b->data &&
b->data <= heap->end)
break;
heap = heap->next;
heap->free = heap->bloc_start;
} else {
/* ... and now abort if proven
- otherwise...
+ otherwise...
*/
abort();
}
dead_bloc = find_bloc(ptr);
if (dead_bloc == NIL_BLOC)
abort();
- else
+ else
free_bloc(dead_bloc);
*ptr = 0;