1.1 --- a/vmalloc.c	Sat Feb 11 21:43:43 2012 -0800
     1.2 +++ b/vmalloc.c	Sun Feb 12 01:49:33 2012 -0800
     1.3 @@ -13,7 +13,7 @@
     1.4  #include <stdio.h>
     1.5  
     1.6  #include "VMS.h"
     1.7 -#include "Histogram/Histogram.h"
     1.8 +#include "../../C_Libraries/Histogram/Histogram.h"
     1.9  
    1.10  /*Helper function
    1.11   *Insert a newly generated free chunk into the first spot on the free list.
    1.12 @@ -45,9 +45,8 @@
    1.13   *Shave off the extra and make it into a new free-list element, hook it in
    1.14   * then return the address of the found element plus size of prolog.
    1.15   *
    1.16 - *Will find a
    1.17   */
    1.18 -void *VMS__malloc( size_t sizeRequested )
    1.19 +void *VMS_int__malloc( size_t sizeRequested )
    1.20   { MallocProlog *foundElem = NULL, *currElem, *newElem;
    1.21     ssize_t        amountExtra, sizeConsumed,sizeOfFound;
    1.22     uint32        foundElemIsTopOfHeap;
    1.23 @@ -139,7 +138,7 @@
    1.24   * aligned and padded to the size of a CACHE_LINE. Thus creating a new chunk
    1.25   * before the aligned chunk.
    1.26   */
    1.27 -void *VMS__malloc_aligned( size_t sizeRequested )
    1.28 +void *VMS_int__malloc_aligned( size_t sizeRequested )
    1.29   { MallocProlog *foundElem = NULL, *currElem, *newElem;
    1.30     ssize_t        amountExtra, sizeConsumed,sizeOfFound,prevAmount;
    1.31     uint32        foundElemIsTopOfHeap;
    1.32 @@ -266,7 +265,7 @@
    1.33   * add this one to free-list.
    1.34   */
    1.35  void
    1.36 -VMS__free( void *ptrToFree )
    1.37 +VMS_int__free( void *ptrToFree )
    1.38   { MallocProlog *elemToFree, *nextLowerElem, *nextHigherElem;
    1.39     size_t         sizeOfElem;
    1.40     uint32         lowerExistsAndIsFree, higherExistsAndIsFree;