/* memalloc.c: EECS111 exercise on memory allocation strategies */

#include <stdio.h>

#define NUM_HOLES 10
#define NUM_REQUESTS 10

int holes[NUM_HOLES] =
   {100,512,100,300,666,70,450,823,333,123};

int requests[NUM_REQUESTS] =
   {212,417,112,100,44,555,340,26,617,270};

int firstFit(int size)
{
  /* fill in code here */
  return -1;
}

int bestFit(int size)
{
  /* fill in code here */
  return -1;
}

int worstFit(int size)
{
  /* fill in code here */
  return -1;
}

void printHoles(void)
{
  int i;
  printf("Holes: ");
  for(i=0; i<NUM_HOLES; i++)
  {
    printf("%d ", holes[i]);
  }
  printf("\n");
}

int main()
{
  int i, h, n, request;

#ifdef FIRSTFIT
  printf("Using first-fit algorithm\n");
#else
#ifdef BESTFIT
  printf("Using best-fit algorithm\n");
#else
#ifdef WORSTFIT
  printf("Using worst-fit algorithm\n");
#else
#error "No allocation algorithm selected!"
#endif
#endif
#endif

  printHoles();

  n = 0;
  for(i=0; i<NUM_REQUESTS; i++)
   {
    request = requests[i];
    printf("Request for %d KB... ", request);
    #ifdef FIRSTFIT
    h = firstFit(request);
    #endif
    #ifdef BESTFIT
    h = bestFit(request);
    #endif
    #ifdef WORSTFIT
    h = worstFit(request);
    #endif
    if(h < 0)
    {
      printf("failed!\n");
    }
    else
    {
      printf("placed in hole %d.\n", h);
      n++;
    }
    printHoles();
   }
  printf("Satisfied %d out of %d requests.\n", n, NUM_REQUESTS);
  return 0;
}