我爱电脑技术论坛 » 编程语言 » 为C++标准库容器写自己的内存分配程序

bbs23 发表于 2008-3-29 10:55

为C++标准库容器写自己的内存分配程序

　根据sgi 的STL源码的二级分配算法改写的内存池分配程序，只要稍微修改就可以实现共享内存方式管理，使用C++标准库容器中的map，set，multimap，multiset测试通过，vector测试通不过，原因是在内存回收的时候考虑的比较简单，vector每次分配内存个数不固定，回收也不固定，这样的话，程序还需要继续完善。o0c(pZ(l&S*ENu8I
io!]'] ]3`
　　内存池管理程序源码如下：
)aq6C6V9C5qeh
~FxmO2n9hO^df 以下是引用片段：
!Ca3AKvfxW(G #ifndef MY_ALLOCATOR_H_
E\+El
A(p #define MY_ALLOCATOR_H_ k"au!o!l#K ?}
#include "stdafx.h"
d8O OXXs #include <limits> ~uQ_}
#include <iostream>
[vzT$P7~ namespace happyever  
3\j#oh,wfu*W'` { l-x![+F:U
  enum { NODENUMS = 2 }; [
VzUWHw [x~A
  union _Obj  
%oj5W ?"j%u.^+{Jf   { w{E:]"p w?6Q
    union _Obj* M_free_list_link; IP/I6xJ
NSq
    char M_client_data[1];     
Zc,hw2@R\.~   } ; 3z5rD6G-d]9S*f
  typedef union _Obj Obj; .X~f-{ z Yy
  struct _Cookie
D,ju?7Sc5u M   {
t,^Km.IK-X     int iShmKey;        /* 共享内存键值 */
yaR(}k"fS`     int iShmID;         /* iShmKey对应的shmid */
_8vWU8I)f/R'{     int iSemKey;        /* 锁信号键值 */ G4o*nK,yD{7Hu}
    int iSemID;         /* 锁信号标识 */ 3z7c&h0@Cz
K
    int iTotalsize;    /* 容器总容量 */
^b*GY&cee     void* pStartall;   /* 共享内存自身地址 */
Z^,y6d4sB l     char* pStartfree;  /* 自由空间的开始地址*/ Lc4wap0B(H
    char* pEndfree;    /* 自由空间的结束地址*/
nz4?;rXH:s1TM3}     int iUseNum[NODENUMS];
ue1X6o6BU)k{ e"Z#@6Z     /*用来存放free_list中节点的size*/
3g9}V_
@t&] L Z     short sFreelistIndex[NODENUMS];
[2p+f,~lj     /*存放分配内存节点的链表*/ zK&{
Yo
    Obj* uFreelist[NODENUMS]; Pw e#Qn$d9F L
  };
R7I6lN(f9O:{8Q   typedef struct _Cookie Cookie;
,DyPY t^^S;y)d&@   //Obj;
4e bS+qVvLmh   //Cookie; 'q(iF%C1iw
  static Cookie *pHead = NULL; ;I2O2y(vS$`K$`,]
  template <class T>
*GnCc8xi_vna   class MyAlloc  
+Z4yXjB*h,s   { (u?*FN@/C.w |
  private:
!b"t4z}^ b     static const int ALIGN = sizeof(Obj); k5Q^)y j b:f
    int round_up(int bytes);
MCi3E&Kxt'A5o     int freelist_index(int bytes);
J5HapR     int freelist_getindex(int bytes);
D#D:wj']!J]&sL     char* chunk_alloc(int size, int *nobjs); ;{!e3S(F7YN*d
    void* refill(int num,int n); d;jZ ~%z\
  public: fc2Fp@O|
    // type definitions
(_%O4G`]}Y     typedef T        value_type;
}Ct;U(]C@&bs     typedef T*       pointer; 'W.T;hT&u z
    typedef const T* const_pointer; Gq+Mu z'V:V
    typedef T&       reference;
4`]?-gJ     typedef const T& const_reference;
0N.e"wPT)@Eh     typedef std::size_t    size_type;
p s_ eB3RV*{ZM&}+A&[     typedef std::ptrdiff_t difference_type;
4L(x&si9Z     template <class U>
+A&FmqF3` ^x     struct rebind  
1_E
v(T+o+~     {
bGf*GPT~       typedef MyAlloc<U> other;
6~cQ0\#p;w     };
[2qgq/]#_     pointer address (reference value) const  S E0o3zg6]
    {
&X'a'e!l9@$pH       return &value; 4U2qZo7iw'F b
    }
yAw%KC,Ue     const_pointer address (const_reference value) const  b4G @"~P.W
    { 9^r
vaJf
      return &value;
h,pS'{t] {3V\&{     }
Yj:S/V
Ho3G     MyAlloc() throw()  *CyZ p%ZgpFf
    {
Ba&mO!A-Ob0@       std::cout<<"MyAlloc"<<std::endl;
8FL1b/P5O+j     } %^5~X(G$SO|1C4]
    MyAlloc(const MyAlloc& x) throw()  U,Wf/? ECs
    {
Z8`X7e5v       std::cout<<"const MyAlloc"<<std::endl;
`(M!i)a1in     } U3\o!Aw-W\|A3w'A
    template <class U>
hsQo/Pz*K2in     MyAlloc (const MyAlloc<U>& x) throw()
A+pM]R:V\[     {

k^,}d%pq%|       std::cout<<"const MyAlloc<U>"<<std::endl; .z,a5m!t6vJH k
    }
~:kxhc`\_+O     ~MyAlloc() throw()  
C[DEn0U(M6J7ql"s,}     {
"Y:P/Y&ZJ^8f'Ef(sA       std::cout<<"~MyAlloc"<<std::endl; ;G7~ {pX5JD9p
    }
*M%VXp$Ry     size_type max_size () const throw()  
&y3al P@&y     { m:M4z"Y'Ljz
      return std::numeric_limits<std::size_t>::max() / sizeof(T);
'a5m2x,rl ~     } yo.h,h"o W]b
    //void PrintFreelistAndCookie();
@:d$H$r z*~n j5d,N0^     pointer allocate (size_type num, const void* = 0)  
Eh0vuwn*h o2^1l     { )r;n*V*q"q
r.{a#P
      pointer ret = 0;
\H:xb/m5H ]:t!G       Obj** my_free_list; qiO}eke
      Obj* result; I^c(zD(E
      int index;
3gj|T8Np       // print message and allocate memory with global new L"I1|7@:V6p
      std::cerr << "allocate " << num << " element(s)"
#pikG
ee1G#o jL
Tv         << " of size " << sizeof(T) << std::endl; 5P3w9m/E'}4n'wY|r
      index = freelist_index(sizeof(T));
t'Q:\L
b       if(index >= NODENUMS)
l|b+{c\j}       {
\7}8zo.b:j         return NULL; 6mQ(n-d:a!q
      }
z'p\auPLPB6Ru       my_free_list = pHead->uFreelist + index; LwfE7mF
Q
      //Lock(semid,LOCK_NUM); (g:G8J+}"j vn0P4h
      result = *my_free_list;
'rl.IY*Td PAi       if (result == 0)
8^]l3]@S\1fIn       { y:`;ZA$W6WH
        ret = (pointer)refill((int)num, round_up(sizeof(T))); 7^m xo[E2Lg
      }
#A2B!{/F;n       else
\+vQj'i%m       { 0thtp @~+[R
        *my_free_list = result->M_free_list_link; 7kz
X$r8G,`1}y
        ret = (pointer)result; GOo t;k$o{/o
      } w0lvN`uyb%}jY
      //UnLock(semid,LOCK_NUM); w M#n/y1?e%VG
      pHead->iUseNum[index] = pHead->iUseNum[index] + (int)num; P\.h]%K$L+jv
      if(0 == ret) 2Z(^'cj0p&},O
      {
0j*~n9]XD.f
]         std::cerr << "alloc memory fail!" << std::endl;
_ lyT:^"KtiN         exit(1);

apV UV
te       } "~ @-w~C$zu$[&S
      std::cerr << " allocated at: " << (void*)ret << std::endl;
]`\ e1XY9L       PrintFreelistAndCookie(); K6j/B]p'gt8Td
      return ret; jZnp8v,EZ9Q
    }
/\4KF5X^     void construct (pointer p, const T& value)   Z*~yh0zzT$Z
    { :Q HeRo:Q
      // initialize memory with placement new Q@H)`_4{T
      new((void*)p)T(value);
vi'~C]`     } ZO2Ot&dnLOU
    void destroy (pointer p)  
!Z] j"N!K*`     { fYV)f%_n
      // destroy objects by calling their destructor
)|C7VR5asjX       p->~T();
#x4r:p:i'kA|8\     }
9z zahl|\+E,VX     void deallocate (pointer p, size_type num)  O2wC gnb0_+D
    { l(Dk9FQ-qe
v@T1r
      Obj** my_free_list; (?8XXp*O!J5pZTF
      Obj* q ;
$K7o7~8?n)p J!IU       int index;
*sz
[Se.T%R4L8j c       index = freelist_getindex(sizeof(T));
c
C/eh+GZ H,l6Vg7|       if(index >= NODENUMS) AU.\D;o}&Hm
      { !eII5^\ o~~0T'q
        std::cerr << "deallocate memory fail!" << std::endl; "S? a4`6H"F8x%B
        exit(1); iV9wl*c{
      }
%S ?o%Jo!L%T       my_free_list = pHead->uFreelist + index; {Pt8Rza
      q = (Obj*) p; 8N!G-D@n}
      //Lock(semid,LOCK_NUM); (R9^;znw4e'P\ S
      /*这个地方可能会有问题*/ TY0[2L$AdBz
      //for(int i=0 ;i<(int)num ; i++)
0_}j x$|KKhnG       { 4_I*k6`K_
        q->M_free_list_link = *my_free_list;
i_cez'},~/l!?Ry[         *my_free_list = q;
o;S9s4w-FY N `z       }
-}2z,r&x"R;u#Vu"O       //UnLock(semid,LOCK_NUM); c0S.mj:N(|
`tY
      pHead->iUseNum[index] = pHead->iUseNum[index] - (int)num;
YC G%JPdx       
]/[AW?%e.aA kYx       std::cerr << "deallocate " << num << " element(s)"
2|.t3A P|z$]F         << " of size " << sizeof(T) ]2@4lDjfM
        << " at: " << (void*)p << std::endl;

m+G1s u7UL&|}c       PrintFreelistAndCookie(); R+W:]\e3G#F
    }
3Jkw%B|y3NHn;p   };
DC@V:H8J%z6J"}   template <class T> lO8y'a @P@ _ d
  int MyAlloc<T>::round_up(int bytes)
2E j*V2K~Ml8l
o   {
Xw$|@^P;phk7T"N     int i;
K,^aU+F     i = bytes;
%h Jt2j+D0d/K ~!~     if(bytes < ALIGN)
Ah8trq-vo C;OM:W7^&O     { w8y
]SZ6[ gM
      i = ALIGN;
7q3F$p&?R     }
:NcMt(} P     std::cout<<"round_up:bytes="<<bytes<<" , return="<<i<<std::endl;
(lL?:PW-D4f     return i;
u`9u e^T3F   };
w7[.`h9O3]   template <class T>
6O2eWtX3O1?-J   int MyAlloc<T>::freelist_index(int bytes) 4YuJY9K+uf#F
  {
'@ _2^ D g"?e     int i;
1}#A(Xl0Ie*ue l(m'l     for(i=0 ; i< NODENUMS ; i++)
u)~5s rnN&f&N9l4w(~     {
-~M MxB0`Io1C\       if(pHead->sFreelistIndex[i] == bytes)
+XC L^u^*wM         break; U:j^p"R9IL
    } A&wK]*ZuF
    if(i >= NODENUMS) ,|_]#r7n
    { #Dp!m
W:sR[
      for(i=0 ; i< NODENUMS ; i++) Or^MR r)A/^
      { ,vbL#l]%i[@'M)vE
        if(pHead->sFreelistIndex[i] == 0)
:O$qA|$v         { 4ID*M+Lk,s0X)X
          pHead->sFreelistIndex[i] = bytes;

bbs23 发表于 2008-3-29 10:55

std::cout<<"freelist_index:bytes="<<bytes<<" , return="<<i<<std::endl; 'H#Q F@}C*x
          return i;
$]2I0St2QA1~         }
-L{)^(V.lp(uWgj       }
S-D4us b
t X)T     } $p O|9Z-t\
    std::cout<<"freelist_index:bytes="<<bytes<<" , return="<<i<<std::endl; fvX{(ZVz
    return i;
%z mv#L9y_$n   }; 4K3` o b_E)J0A3~A
  template <class T> nL!\pSp
  int MyAlloc<T>::freelist_getindex(int bytes)
;@7XD5IT.Iz   { 7\6B3k)k3D7}"bf
    int i; 7vEm1^;\
e8x^ `
    for(i=0 ; i< NODENUMS ; i++) x
P'U:u~1g7r
    {
.D1}!AR#X Kc6_-v       if(pHead->sFreelistIndex[i] == bytes) 3}/kO8R
VS$b
        break;
-T)F/RFqQ?A     } XcX RXE7uR
    std::cout<<"freelist_getindex:bytes="<<bytes<<" , return="<<i<<std::endl;
RLnq f+sH \LT     return i; N ZQ3Z k[\"U@Jm
  }; B8C!nF2s5Mge4U
  template <class T> K8oV`(y0z)LE
  char* MyAlloc<T>::chunk_alloc(int size, int *nobjs) dH7^ MM!s
  {
N_/Lb{     char* result;
w7T'Q&\wlBQ)u?7u     int counts = *nobjs; m
]bCP5YMWp
    int total_bytes = size * counts;
}By.u)Re!f i     int bytes_left = int(pHead->pEndfree - pHead->pStartfree); nd$c {@Ws}%TI&n/d@
    std::cout<<"chunk_alloc:total_bytes = "<<total_bytes
R;DWX$[9`~u8S$|       <<",bytes_left = "<<bytes_left<<std::endl;
MY};Rk)J1s*}"B     if (bytes_left >= total_bytes) _5Y0s{*G/I
    {
5K[n%h"Hk$AC       result = pHead->pStartfree;
,Mqo3i7Sz*j,W       pHead->pStartfree += total_bytes; f`3?Y C
      std::cout<<"chunk_alloc:total_bytes = "<<total_bytes
[o5P?+w^         <<",result = "<<*result<<",start_free = "<<&(pHead->pStartfree)<<std::endl; s,i4c6jX8{;q`
    }
7OlD-Tyj![ ke3N ],h     else if (bytes_left >= size) Xi9ck
o8l5tF(O
    { %m$r2~.m!S.n}
      counts = bytes_left/size;
$M9]2T`/l9FK       total_bytes = size * counts;
g|1v`-b#K#w       result = pHead->pStartfree; B
@2N%ES'^
      pHead->pStartfree += total_bytes;
Z,a"Gae:]|       *nobjs = counts;
c2v)A DR"GV
q       std::cout<<"chunk_alloc:total_bytes = "<<total_bytes<<",nobjs = "<<nobjs f^[ ~2OaG|
        <<",result = "<<*result<<",start_free = "<<&(pHead->pStartfree)<<std::endl;
@w"jP P%Kx     } i*e:F&hA
    else
P Ez"gA a7\%^
L     { #H0|$t%a"h Bd
      /*还需要处理回收其他空闲freelist里面的空间*/
o^*~@l+s0c       result = NULL;
4E/a7V[(z3B5o TjV;]$o     }
"sXF'c)E_G_ QE|     return(result); O8c6zY R8H"QN5H/{mB^
  }; :cvVQ!a4a
  template <class T> }U|TU7O@D
  void* MyAlloc<T>::refill(int num,int n)
3\3H$`1fl:np   { eSy6x3`K
    int counts = num;
In-k.a\ |$N     int *nobjs = &counts; 8Ts t~m
A Jc
    char* chunk; !RI4dI])M7[
    Obj** my_free_list;
w_ w}9f     Obj* result; bBzI SW$w]/v
    Obj* current_obj; {9{(gBFfp
    Obj* next_obj;
q9J^{+Fe     int i;
V;C5N9PnP4DXT/}8C     chunk = chunk_alloc(n, nobjs); 3^N N-}*suht
    if(chunk == NULL)
i @ R4q#o*TsoI.H i     {
m@ OUvf|t       return(chunk);
MJ;\"FuuP     }
5H kI ~-I`I}     counts = *nobjs;
Ti,[/@
G"?E     if (1 == counts)
M+}0D:J`-Rr*q2?     { Pe7Xtw l%o8TFV
      return(chunk);
w,o)a%|W9fM\o     } }V{/pHN S
    my_free_list = pHead->uFreelist + freelist_index(n);
{&~h;sT     result = (Obj*)chunk; 8[zD.D0J
    *my_free_list = next_obj = (Obj*)(chunk + n*num); }f[ v
r0g\]0E4p~
    for (i = 1; ; i++) (h0oq7H2sBd
    { b.v,f]I0n5P
      current_obj = next_obj;
k(x%{7Oo X0~C       next_obj = (Obj*)((char*)next_obj + n); $T J
r"p^3_9_P8G
      if (counts - 1 == i)
cU t$Tf{       {
fEwJ Ex]wQ
        current_obj->M_free_list_link = 0; (yz^W\S
        break;
1e,rh&?2f.\!t$e3C       }
8b"c.DmA3Szi(i       else
E1{5Nz:p(Kpi       { .H0r2x GI_
        current_obj->M_free_list_link = next_obj; /I)D:J8p]0MS.w R
      } 'h8\;px#l|8|
    }
!Qt%H'fw*r)v0H1I     return(result);
xN [k;@#xL1?;^   };

}0XdOP.{`,C'z /*这个函数可以改写成自己的共享内存分配函数*/   +Mn6GU.b!y
static void InitShm()
O4X IQS}]   { *Y3lH4s1s1]Ta
    int i,size=1000;
Qy0n(}p1F8t4Wzx-^     pHead = (Cookie*)malloc(sizeof(Cookie)+size);
1`];}6bb     pHead->iTotalsize = sizeof(Cookie)+size;
}pY`o     pHead->pStartall  = pHead;
l"bH$r;wcg ^     pHead->pStartfree = (char*)pHead + sizeof(Cookie); 6x/w:e`fHO^uG
    pHead->pEndfree   = (char*)pHead + pHead->iTotalsize;
l;z4nRR(EM]     for(i=0 ; i <NODENUMS ; i++) I-cBP3x_1u8? [
    {
*XE"N%?9r`       pHead->sFreelistIndex[i]=0;
gG%JO?CKy"E       pHead->uFreelist[i]=0; .Ar'fqVn@RA&h
      pHead->iUseNum[i]=0; *O c)nBq#p1qW4wV
    } _d;wH6DB3J
  }
XYY5lPmcBhX$_4d   static void PrintFreelistAndCookie() 0?v~4P r)v[
  {
O?2hSgt-w     int i,j; B)OcnaY!}r$in
    Obj* my_free_list;
Zzif3Zv     std::cout<<"Cookie info :"<<std::endl;
Q-@5l5mT
l3R'p     std::cout<<"sizeof(struct Cookie) = "<<sizeof(Cookie)<<std::endl;
4@Tom'k4JbM B     std::cout<<"Totalsize     = "<<pHead->iTotalsize<<std::endl; 2?
E*C
Y5w EIq
    std::cout<<"UsedSize      = "<<int(pHead->pStartfree-(char*)pHead)<<std::endl; V9m O,d |{V3E9N I
    std::cout<<"FreepoolSize  = "<<int(pHead->pEndfree - pHead->pStartfree)<<std::endl; g\/HJm
    std::cout<<"Startall      = "<<&(pHead->pStartall)<<std::endl;
]|
p _o     std::cout<<"Startfree     = "<<&(pHead->pStartfree)<<std::endl; ,L"i/X'WP&se` ?
    std::cout<<"Endfree       = "<<&(pHead->pEndfree)<<std::endl;
s)GQ:HD5O8B     std::cout<<"nFreelist info :"<<std::endl; 'w;l ?h*Uc:t1];`P3N
    for(i=0 ; i<NODENUMS ; i++) N @'@2chBQ
    {
Z5H$h7E1SOOS$a;qA       j=0;
'f"`/}m7IuGOp       std::cout<<"iUseNum["<<i<<"] = "<<pHead->iUseNum[i]<<std::endl; V:m!M3Z.b3V3J%a5}
      std::cout<<"FreelistIndex["<<i<<"] = "<<pHead->sFreelistIndex[i]<<std::endl; sq4B'h&~lI X
      my_free_list = pHead->uFreelist[i];
~P#K ~*h-v$|({FT
?       if(my_free_list->M_client_data != 0)
RM"Qa;y] W       { 1T!W1YVHC*wa Q"v$}
        while(my_free_list->M_client_data != 0)
8JO6?;ud@g         { [-x/].oP n#p
          j++; 6G Zg;S.DE7H
g/jST&J
          my_free_list = my_free_list->M_free_list_link;
B2p?2N&k&d[
        } oZP9w#n@
        std::cout<<"free_list["<<i<<"]; node counts="<<j<<std::endl;
\^
\%K{6O       } :E|ih@VR+X$n%G
    } 4[/K@)dOXqg
  }
f Y9La+T1i*ZQix[I   template <class T1, class T2>
ePoBR   bool operator== (const MyAlloc<T1>&,const MyAlloc<T2>&) throw()  }~Gne
  { &SR.j
d
V[
    return true;
Y;Y.a:Vl   }
*P-Q/I6j*C^zCmc/a.~   template <class T1, class T2> +yN$u8@2Q
  bool operator!= (const MyAlloc<T1>&,const MyAlloc<T2>&) throw()  ] }I9yz*a-Wy
  { &r`|vNd
    return false; 7Tn@8fWj
  } l mp"V!t;G:\
?J
I-c
} [zJ-H3XEN/v
#endif /*MY_ALLOCATOR_H_*/ :C6E._J EF7d$P
测试程序的源码如下： (G9Kh*a@zM(Qr
|0e"wfu U"`2y
// MyStl.cpp : 定义控制台应用程序的入口点。 IAf(Z
@f.Z7bAQ
//

^`+X*wy #include "stdafx.h"
;^gP;|5Gjh.K8p(o@ #include <map> i1ZM oSc
#include <vector> *QY$`VN(x1k
#include <string> MuAO%`)`{$E
#include <utility> e.zKDk
t)k(K
#include <iostream>
Y;v\6J$k+w #include "MyAlloc.h"
3f}8N tC6r using namespace std; iE3@?1VK"x
int _tmain(int argc, _TCHAR* argv[])
uh:b3N x"sv8DI { 3gZ$J(e,r
  happyever ::InitShm(); &m@ QW3]#J.qF
  multimap<string,int,less<string>,happyever ::MyAlloc<string> > m; -{ \!F5x}:z]Q
  m.insert(make_pair(string("Harry"), 32)); ,uW.\V6yA$\` xv
  m.insert(make_pair(string("Mary"), 59)); ![(r*fJ)n"|"PP*?
  m.insert(make_pair(string("Roger"), 18));
'{Fn:D7h   m.insert(make_pair(string("Nancy"), 37)); :u+w+Pe:ULsBC
  m.insert(make_pair(string("Mary"), 23));
'Y)IJ%J^.uW    
(j{${$l*v:}T2k#BC   typedef multimap<string,int,less<string>,happyever ::MyAlloc<string> >::iterator Iter; 8e eIF2~"Z6xM/Y]xM
  for (Iter p = m.begin(); p != m.end(); p++) N{Uc#W&O;u;UN)Hm
  { bn
PiP4y
    cout << p->first << "," << p->second << endl; )APw#?_J[.vB
eR/^
  } ^%]&LI PWz
  Iter p = m.find("Harry");
#p2xnn})Z4t+Jja   m.erase(p);
5k[et N K[   /*p = m.find("Harry");
i&kH/h5d l$@0r   cout << "Harry is: " << p->second << "." << endl;*/
)}*{"cWG {ZE
O.q` Lb-k$] g;\   for (Iter p = m.begin(); p != m.end(); p++)
OXB)nwL   {
{c:a{k1`     cout << p->first << "," << p->second << endl;
(Uv@ [AJD   }
^M5le1Bw    
OM q!~Ej&W)]   return 0; 'h;g_ u;@8Q1Sv(y
} :VH4n%ur)}
以上程序在vs2005，vc6上测试通过。使用MinGW编译的时候只需要去掉vc的预编译头文件 7xKvh]oW
#include "stdafx.h"
0H(G r;b?4?{H E2M'S yhxBpW0}2~

qMKt:E 　　即可。;?_9}3T'Vi3?_/n
xv cus i9m
　　以上程序只要稍微修改，就可以实现共享内存的管理，可以方便的使用标准库提供的容器。加上信号量的锁机制。8mcFq~:]C/\ q

~Y+m5Bk 　　以上为了学习而改写的SGI的stl二级分配算法实现的。以上代码存在一定的局限性。我另外完整实现了共享内存管理的STL标准的alloctor程序，使用posix信号量加锁。目前应用在aix的xlC编译环境下。因为源码涉及公司的商业秘密，所以不能公开。但基本上以上源码已经体现了自己管理内存的完整思路，供这方面需求的朋友一起学习研究用。

查看完整版本: 为C++标准库容器写自己的内存分配程序