malloc内存分配字节对齐问题

最近看了一些开源的C/C++库，其中都对于内存分配这块做出了自己的一些优化和说明，也涉及到了一些内存分配字节对齐以及内存分页的问题。

对于内存分配的字节对齐问题，一直都是只知其事，不知其解，平时也很少关注这一块会带来的性能问题。但是要是放在一个高并发，快速以及资源最大化利用的系统里面，这一块往往是需要注意的，所以也就趁着这次机会，大概的了解一下。

我们先来看一下glibc里面malloc.c的定义

1100 /*
1101   -----------------------  Chunk representations -----------------------
1102 */
1103 
1104 
1105 /*
1106   This struct declaration is misleading (but accurate and necessary).
1107   It declares a "view" into memory allowing access to necessary
1108   fields at known offsets from a given base. See explanation below.
1109 */
1110 
1111 struct malloc_chunk {
1112 
1113   INTERNAL_SIZE_T      prev_size;  /* Size of previous chunk (if free).  */
1114   INTERNAL_SIZE_T      size;       /* Size in bytes, including overhead. */
1115 
1116   struct malloc_chunk* fd;         /* double links -- used only if free. */
1117   struct malloc_chunk* bk;
1118 
1119   /* Only used for large blocks: pointer to next larger size.  */
1120   struct malloc_chunk* fd_nextsize; /* double links -- used only if free. */
1121   struct malloc_chunk* bk_nextsize;
1122 };
1123 
1124 
1125 /*
1126    malloc_chunk details:
1127 
1128     (The following includes lightly edited explanations by Colin Plumb.)
1129 
1130     Chunks of memory are maintained using a `boundary tag' method as
1131     described in e.g., Knuth or Standish.  (See the paper by Paul
1132     Wilson ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a
1133     survey of such techniques.)  Sizes of free chunks are stored both
1134     in the front of each chunk and at the end.  This makes
1135     consolidating fragmented chunks into bigger chunks very fast.  The
1136     size fields also hold bits representing whether chunks are free or
1137     in use.
1138 
1139     An allocated chunk looks like this:
1140 
1141 
1142     chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-