fix my code please"

heres my output:

About to dump the free list:

Node address: $0$x$7$f$8$a$7$acff$050$ Node size $($stored$)$: $3145648$ Node size $($actual$)3145664$ Nod e t $($ i $)$

No suitable block found for allocation

Error: Sixth allocation failed $74$

Failure in memory test one

main.c

int main$($int argc, char$**$ argv$)\{$

setlocale$($LC$\_$NUMERIC,""$)$;

if $(0!=$ memoryTestOne$())\{$

fprintf$($stderr$,$"Failure in memory test one"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

if $(0!=$ memoryTestTwo$())\{$

fprintf$($stderr$,$"Failure in memory test two"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

if $(0!=$ memoryTestThree$())\{$

fprintf$($stderr$,$"Failure in memory test three"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

printf$("$Tests Succeeded"$)$;

return $($EXIT$\_$SUCCESS$)$;

$\}$

int main$($int argc, char$**$ argv$)\{$

setlocale$($LC$\_$NUMERIC,""$)$;

if $(0!=$ memoryTestOne$())\{$

fprintf$($stderr$,$"Failure in memory test one"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

if $(0!=$ memoryTestTwo$())\{$

fprintf$($stderr$,$"Failure in memory test two"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

if $(0!=$ memoryTestThree$())\{$

fprintf$($stderr$,$"Failure in memory test three"$)$;

exit $($EXIT$\_$FAILURE$)$;

$\}$

printf$("$Tests Succeeded"$)$;

return $($EXIT$\_$SUCCESS$)$;

$\}$

$/*$ fscMalloc.c $*//*$ fscMalloc.c $*/$

#include "fscMalloc.h$"$

#include

#include

void$*$ fscMemorySetup$($memoryStructure$*$ m$,$ fscAllocationMethod am$,$ size$\_$t sizeInBytes$)\{$

if $($FIRST$\_$FIT$\_$RETURN$\_$FIRST $!=$ am$)\{$

fprintf$($stderr$,$ "This code only supports the FIRST$\_$FIT$\_$RETURN$\_$FIRST allocation method

$")$;

return NULL;

$\}$

$//$ Allocate memory using malloc

m$->$head $=$ malloc$($sizeInBytes$)$;

if $($m$->$head $==$ NULL$)\{$

fprintf$($stderr$,$ "Memory allocation failed

$")$;

return NULL;

$\}$

$//$ Initialize memory

m$->$head$->$size $=$ sizeInBytes $-$ sizeof$($fsc$\_$free$\_$node$\_$t$)$;

m$->$head$->$next $=$ NULL;

return m$->$head;

$\}$

void$*$ fscMalloc$($memoryStructure$*$ m$,$ size$\_$t requestedSizeInBytes$)\{$

$//$ Search for the first fit

fsc$\_$free$\_$node$\_$t$*$ current $=$ m$->$head;

fsc$\_$free$\_$node$\_$t$*$ prev $=$ NULL;

while $($current $!=$ NULL$)\{$

if $($current$->$size $>=$ requestedSizeInBytes$)\{$

$//$ Allocate memory

if $($current$->$size $>$ requestedSizeInBytes$)\{$

$//$ Split the block

fsc$\_$free$\_$node$\_$t$*$ newBlock $=($fsc$\_$free$\_$node$\_$t$*)(($char$*)$current $+$ requestedSizeInBytes $+$ sizeof$($fsc$\_$free$\_$node$\_$t$))$;

newBlock$->$size $=$ current$->$size $-$ requestedSizeInBytes $-$ sizeof$($fsc$\_$free$\_$node$\_$t$)$;

newBlock$->$next $=$ current$->$next;

current$->$next $=$ newBlock;

$\}$

$//$ Update current block size

current$->$size $=$ requestedSizeInBytes;

$//$ Remove current block from free list

if $($prev $==$ NULL$)\{$

m$->$head $=$ current$->$next;

$\}$ else $\{$

prev$->$next $=$ current$->$next;

$\}$

$//$ Return allocated memory

return $($void$*)($current $+1)$;

$\}$

prev $=$ current;

current $=$ current$->$next;

$\}$

$//$ No suitable block found

fprintf$($stderr$,"$No suitable block found for allocation

$")$;

return NULL;

$\}$

void fscFree$($memoryStructure$*$ m$,$ void $*$ returnedMemory$)\{$

$//$ Cast returnedMemory to free$\_$node$\_$t

fsc$\_$free$\_$node$\_$t$*$ block $=($fsc$\_$free$\_$node$\_$t$*)(($char$*)$returnedMemory $-$ sizeof$($fsc$\_$free$\_$node$\_$t$))$;

$//$ Add block to free list

block$->$next $=$ m$->$head;

m$->$head $=$ block;

$\}$

$/*$ Given a node, prints the list for you. $*/$

void printFreeList$($FILE $*$ out, fsc$\_$free$\_$node$\_$t$*$ head$)\{$

$/*$ given a node, prints the list. $*/$

fsc$\_$free$\_$node$\_$t$*$ current $=$ head;

fprintf$($out$,$ "About to dump the free list:

$")$;

while $($current $!=$ NULL$)\{$

fprintf$($out$,$ "Node address: $\%$p$\backslash$t Node size $($stored$)$: $\%$zu$\backslash$t Node size $($actual$)\%$zu$\backslash$t Node next:$\%$p

$",$

$($void$*)$current$,$

current$->$size,

current$->$size $+$ sizeof$($fsc$\_$free$\_$node$\_$t$),$

$($void$*)$current$->$next$)$;

current $=$ current$->$next;

$\}$

$\}$