update

wangzhengquan

2020-07-07 082633f08aae8eea19bd7050cbe4a75e5ed1ac6f

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#ifndef QFACTORY_H
#define QFACTORY_H  
#include "usg_common.h"
#include "mm.h"
#include "hashtable.h"
#include "lock_free_queue.h"
 
class QueueFactory{
private:
 
    static hashtable_t * getHashTable() {
        static hashtable_t *hashtable = NULL;
        int first;
          
        if(hashtable == NULL) {
            first = mm_init(sizeof(hashtable_t), (void **)&hashtable);
            if (first)
               hashtable_init(hashtable);
        }
        return hashtable;
        
    }
 
     
 
    template <typename T> static
    LockFreeQueue<T>* createArrayLockFreeQueue(int key, size_t size=16) {
         
        LockFreeQueue<T> *queue;
        hashtable_t *hashtable = getHashTable();
        //LockFreeQueue<int, 10000> q;
        if ((queue = (LockFreeQueue<T> *)hashtable_get(hashtable, key)) == NULL ) {
            queue = new LockFreeQueue<T>(size);
            hashtable_put(hashtable,  key, (void *)queue);
        }
 
        return queue;
    }
 
public:
 
    template <typename T> static
    LockFreeQueue<T>* createQueue(int key, size_t size = 16) {
        return QueueFactory::createArrayLockFreeQueue<T>(key, size);
    }
 
    /**
     * destroy queue
    */
    template <typename T> static
    void dropQueue(int key) {
        LockFreeQueue<T> *queue = QueueFactory::createQueue<T> (key);
        delete queue;
        hashtable_t *hashtable = getHashTable();
        hashtable_remove(hashtable, key);
    }
 
};
#endif