################################################
# CS:APP CMU 15213 Malloc Implementation
Name:  tkaboya
################################################

#Personal Implementation of Malloc Package
Reaches 80% Optimization in comparison to industry strength
malloc packages used. 

A sobering look at memory management as it is done in C

#HLD Description of my solution 
Given a huge block of memory, here are the techniques used
  1. Doubly linked Explicit List of all free blocks. Any allocated block
  is removed from list.  
  2. First Fit Search to determine free block in the list

***********
Main Files:
***********

mdriver
        Once you've run make, run ./mdriver to test your solution.

traces/
	Directory that contains the trace files that the driver uses
	to test your solution. Files corners.rep, short2.rep, and malloc.rep
	are tiny trace files that you can use for debugging correctness.

**********************************
Other support files for the driver
**********************************
config.h	Configures the malloc lab driver
fsecs.{c,h}	Wrapper function for the different timer packages
clock.{c,h}	Routines for accessing the x86-64 cycle counters
fcyc.{c,h}	Timer functions based on cycle counters
ftimer.{c,h}	Timer functions based on interval timers and gettimeofday()
memlib.{c,h}	Models the heap and sbrk function

***********************
Available malloc packages
***********************
mm.c            Working Explicit Free List Malloc Implementation
mm-naive.c      Fast but extremely memory-inefficient package
mm-textbook.c   Implicit list allocator based on CS:APP3e textbook
mm-impwchkheap.c This Explicit list version does not work. 
*******************************
Building and running the driver
*******************************
To build the driver, type "make" to the shell.

To run the driver on a tiny test trace:

	unix> ./mdriver -V -f traces/malloc.rep

To get a list of the driver flags:

	unix> ./mdriver -h

The -V option prints out helpful tracing information