/*
?*?mm.c
?*
?*?Main?Idea:
?*?data?structure?:?seglist
?*?I?applied?20?lists?here?with?same?length?from?[2^i2^（i+1）]
?*?
?*?for?each?block?if?it?is?allocated?store?its?head?and?foot;
?*?if?it?is?freed?aside?its?head?and?foot?also?store?*prev?and?*next
?*?（will?explain?more?about?this?later）
?*
?*?fit?method?:?traverse?every?list?and?find?the?first?fit?free?block
?*?and?search?each?list?by?its?address?since?they?are?in?address?increasing?
?*?order?when?they?are?inserted
?*
?*?coalesce?method?:?use?bounday?tag?to?help?coalesce?and?coalesce?immediately
?*
?*?
?*
*/
#include?
#include?
#include?
#include?
#include?

#include?“mm.h“
#include?“memlib.h“

/*?If?you?want?debugging?output?use?the?following?macro.