ACE_Message_Queue和spawn实现(生产者/消费者)(V2.00)

参考这里用到了线程管理,参考:http://blog.csdn.net/calmreason/article/details/36399697

下面的两个线程共享一个消息队列,一个用来放整数到队列,一个从队列里取消息出来。此程序在控制台不停的输出递增数字,主要是内存不会泄露

用到了多线程、ACE_Message_Queue、ACE_Message_Block、ACE_Thread_Manager::instance()->spawn等

#include <iostream>
using namespace std;
#include "boost/lexical_cast.hpp"
using namespace boost;
#include "ace/Thread_Manager.h" 
#include "ace/Message_Queue.h"

void* create_vairous_record(void* ace_message_queue);

void* get_vairous_record(void* ace_message_queue);

int ACE_TMAIN (int argc, ACE_TCHAR *argv[]) 
{

	ACE_Message_Queue<ACE_MT_SYNCH>* various_record_queue = new ACE_Message_Queue<ACE_MT_SYNCH>;

	ACE_Thread_Manager::instance()->spawn(
		ACE_THR_FUNC(create_vairous_record), 
		various_record_queue, 
		THR_NEW_LWP | THR_DETACHED);

	ACE_Thread_Manager::instance()->spawn(
		ACE_THR_FUNC(get_vairous_record), 
		various_record_queue, 
		THR_NEW_LWP | THR_DETACHED);

	ACE_Thread_Manager::instance()->wait();

	return 0;
}

void* create_vairous_record(void* ace_message_queue)
{

	ACE_Message_Queue<ACE_MT_SYNCH>* p_queue = (ACE_Message_Queue<ACE_MT_SYNCH>*)ace_message_queue;
	int i=0;
	while (i<10000000)
	{
		ACE_Message_Block* mbl = new ACE_Message_Block(10);//在这里创建消息
		string temp = lexical_cast<string>(++i);
		mbl->copy(temp.c_str());
		p_queue->enqueue_tail(mbl);//消息被放到队列中(用指针引用消息实体)
	}
	return nullptr;
}

void* get_vairous_record(void* ace_message_queue)
{

	ACE_Message_Queue<ACE_MT_SYNCH>* p_queue = (ACE_Message_Queue<ACE_MT_SYNCH>*)ace_message_queue;
	while (true)
	{
		ACE_Message_Block* mbl =nullptr;
		p_queue->dequeue_head(mbl);//消息出队,出队的消息应该在用完之后被释放
		if (mbl)
		{
			cout<<mbl->rd_ptr()<<endl;
			mbl->release();//消息已经用完,释放消息
		}
	}
	return nullptr;

}

下面的程序实现:多个线程将连续整数分批放到ACE_Message_Queue中,一个消费者线程负责从中取出,并验证数据是否完整无误

#include <iostream>
#include <bitset>
#include <vector>
#include <memory>
using namespace std;

#include "ace/Thread_Manager.h" 
#include "ace/Message_Queue.h"
#include "ace/Message_Block.h"
#include "ace/Task.h"
#include "ace/OS.h"

namespace global
{
    const int total_number = 1000000;
    int task_number = 2;
    typedef int number_type;
}

class Generator_Number : public ACE_Task<ACE_MT_SYNCH>
{
public:
    Generator_Number(ACE_Message_Queue<ACE_MT_SYNCH>* msgq,const int i);
    virtual int open(void *args  = 0 );
    ~Generator_Number(void);
protected:
    Generator_Number(const Generator_Number&);
    Generator_Number& operator=(const Generator_Number&);
private:
    int svc(void);
    int mod_i_;
};

Generator_Number::Generator_Number(ACE_Message_Queue<ACE_MT_SYNCH>* msgq,const int i):mod_i_(i)
{
    this->msg_queue(msgq);
    std::cout<<"Generator_Number(const int "<<i<<")"<<std::endl;
}

int Generator_Number::open(void *args )
{
    return this->activate(THR_NEW_LWP | THR_DETACHED);
}

int Generator_Number::svc(void)
{
    std::cout<<"Generator_Number("<<this->mod_i_<<")::svc()"<<std::endl;
    for (size_t i = this->mod_i_ ; i<global::total_number;i+=global::task_number)
    {
        ACE_Message_Block * blk = new ACE_Message_Block(20);
        blk->copy(reinterpret_cast<const char*>(&i),sizeof(global::number_type));
        this->msg_queue()->enqueue_tail(blk);
    }
    return 0;
}

Generator_Number::~Generator_Number(void)
{
    std::cout<<"~Generator_Number("<<this->mod_i_<<")"<<std::endl;
}

void* out_put_queue(void* all_numbers_queue1)
{
    ACE_Message_Queue<ACE_MT_SYNCH>* all_numbers_queue = (ACE_Message_Queue<ACE_MT_SYNCH>*)all_numbers_queue1;
    bitset<global::total_number> all_number_bitset;
    size_t count_got_message=0;
    while(true)
    {
        if(!all_numbers_queue->is_empty())
        {
            ACE_Message_Block* blk = 0;
            all_numbers_queue->dequeue_head(blk);
            all_number_bitset.set(*reinterpret_cast<global::number_type*>(blk->rd_ptr()));
            blk->release();
            if(++count_got_message == global::total_number)
            {
                break;
            }
        }
        else
        {
            std::cout<<"now sleep 1"<<std::endl;
            ACE_Time_Value t(0,3000);
            ACE_OS::sleep(t);
        }
    }
    global::number_type check =0;
    bool wright_flag = true;
    for (size_t j=0; j!= global::total_number;++j)
    {
        if (0 == all_number_bitset[j])
        {
            wright_flag = false;
            break;
        }
    }
    std::cout<<std::endl;
    std::cout<<"check result:"<<wright_flag<<std::endl;
    return 0;
}
#include "boost/timer.hpp"
using namespace boost;

int ACE_TMAIN (int argc, ACE_TCHAR *argv[]) 
{
    cout<<"total_number:"<<global::total_number<<endl;
    timer t;
    ACE_Message_Queue<ACE_MT_SYNCH>* all_numbers_queue = new ACE_Message_Queue<ACE_MT_SYNCH>;

    vector<shared_ptr<Generator_Number>> gener_array;

    for (int i=0;i<global::task_number;++i)
    {
        gener_array.push_back(shared_ptr<Generator_Number>(new Generator_Number(all_numbers_queue,i)));
    }
    for (vector<shared_ptr<Generator_Number>>::const_iterator citer = gener_array.cbegin();
        citer!=gener_array.cend();
        ++citer)
    {
        (*citer)->open();
    }

    ACE_Thread_Manager::instance()->spawn(
        ACE_THR_FUNC(out_put_queue),   
        all_numbers_queue,   
        THR_NEW_LWP | THR_DETACHED);

    ACE_Thread_Manager::instance()->wait();
    cout<<t.elapsed()<<"s"<<endl;
    return 0;
}


输出如下:

total_number:1000000
Generator_Number(const int 0)
Generator_Number(const int 1)
Generator_Number(0)::svc()
Generator_Number(1now sleep 1
)::svc()
now sleep 1
now sleep 1
now sleep 1
now sleep 1
now sleep 1
now sleep 1
now sleep 1
now sleep 1
now sleep 1


check result:1
0.944s
~Generator_Number(0)
~Generator_Number(1)
请按任意键继续. . .

ACE_Message_Queue

高水位低水位

http://blog.163.com/ecy_fu/blog/static/4445126200964115620862/

注意事项

http://blog.chinaunix.net/uid-20453737-id-37118.html



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
以下是一个使用Java语言实现生产者/消费者模型的完整代码,实现了同步和互斥操作: ```java import java.util.LinkedList; import java.util.Queue; import javax.swing.JFrame; import javax.swing.JTextArea; public class ProducerConsumer extends JFrame { private JTextArea output; // 用于显示输出信息的文本区域 private Queue<Integer> buffer; // 缓冲区队列 private final int BUFFER_SIZE = 5; // 缓冲区大小 private final Object lock = new Object(); // 用于同步的锁对象 public ProducerConsumer() { super("Producer/Consumer Demo"); output = new JTextArea(); add(output); setSize(300, 300); setVisible(true); buffer = new LinkedList<Integer>(); new Producer().start(); new Consumer().start(); } public static void main(String[] args) { new ProducerConsumer(); } // 生产者线程 private class Producer extends Thread { public void run() { int item; while (true) { synchronized (lock) { // 如果缓冲区已满,则等待 while (buffer.size() == BUFFER_SIZE) { try { lock.wait(); } catch (InterruptedException e) { e.printStackTrace(); } } item = produceItem(); buffer.add(item); output.append("Produced item " + item + "\n"); // 唤醒等待的消费者线程 lock.notifyAll(); } // 生产完一个物品后随机休眠一段时间 try { Thread.sleep((int) (Math.random() * 3000)); } catch (InterruptedException e) { e.printStackTrace(); } } } // 生产一个物品 private int produceItem() { return (int) (Math.random() * 100); } } // 消费者线程 private class Consumer extends Thread { public void run() { int item; while (true) { synchronized (lock) { // 如果缓冲区为空,则等待 while (buffer.size() == 0) { try { lock.wait(); } catch (InterruptedException e) { e.printStackTrace(); } } item = buffer.remove(); output.append("Consumed item " + item + "\n"); // 唤醒等待的生产者线程 lock.notifyAll(); } // 消费完一个物品后随机休眠一段时间 try { Thread.sleep((int) (Math.random() * 3000)); } catch (InterruptedException e) { e.printStackTrace(); } } } } } ``` 在此代码中,我们使用了一个JTextArea对象来显示输出信息。缓冲区队列使用了Java集合框架中提供的LinkedList类,而同步和互斥操作则使用了Java中的synchronized关键字和wait()/notifyAll()方法。在程序运行时,我们创建了一个生产者线程和一个消费者线程,它们在同一个缓冲区队列上进行操作。当缓冲区已满时,生产者线程将等待,直到消费者线程取走一个物品,唤醒生产者线程;当缓冲区为空时,消费者线程将等待,直到生产者线程放入一个物品,唤醒消费者线程。通过这种方式,我们实现生产者/消费者模型中的同步和互斥操作。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

C++程序员Carea

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值