ACE:使用令牌作为递归互斥锁

令牌的特性:

它可以被最初获得它的线程进行多次的重新获取，而且确保所有试图获得它的线程严格按照先进先出的顺序排序。运行下面程序，观察不同线程请求令牌与获得令牌的顺序。

#include <stdio.h>
#include <stdlib.h>


#include "ace/Token.h"
#include "ace/Thread.h"
#include "ace/Log_Msg.h"


struct Args{


public:
Args(int iterations):_token("My token"),
iterations(iterations){}
ACE_Token _token;
int iterations;
};


static void* worker(void* arguments)
{
struct Args *args = (Args *)arguments;

for(int i = 0;i<args->iterations;i++)
{
ACE_DEBUG((LM_DEBUG,"(%t) Tring to get a hold of this iterations\n"));
args->_token.acquire();
ACE_DEBUG((LM_DEBUG,"(%t) get the hold of iterations [%d]\n",i));
ACE_OS::sleep(2);
args->_token.release();
}

return 0;

}


int main(int argc,char* argv[])
{
int thread_num = 0;

if(argc<3)
{
ACE_OS::printf("Usage:%s <number of threads>\
<number of iterations>\n",argv[0]);

ACE_OS::exit(1);

}


thread_num = ACE_OS::atoi(argv[1]);
struct Args args(thread_num);

ACE_thread_t *thread_id = new ACE_thread_t[thread_num+1];
ACE_hthread_t *thread_handles = new ACE_hthread_t[thread_num+1];

if(ACE_Thread::spawn_n(thread_id,thread_num,(ACE_THR_FUNC)worker,
&args,THR_JOINABLE|THR_NEW_LWP,ACE_DEFAULT_THREAD_PRIORITY,
0,0,thread_handles)==-1)
{
ACE_DEBUG((LM_DEBUG,"Error in spawn threads\n"));
}

for(int i=0;i<thread_num;i++)
{
ACE_Thread::join(thread_handles[i]);
}

return 0;
}