summaryrefslogtreecommitdiffstats
path: root/src/pal/linux/CRing.h
blob: cf69422eee78484d884150d2747a73eaaef874aa (plain)
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#ifndef C_RING_H
#define C_RING_H
/*
 Hanoh Haim
 Cisco Systems, Inc.
*/

/*
Copyright (c) 2015-2015 Cisco Systems, Inc.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/


#include <assert.h>
#include <stdint.h>
#include <string>
#include <queue> 



typedef std::queue<void *>  my_stl_queue_t;
               
class CRingSp {
public:
    CRingSp(){
        m_queue=0;
    }

    bool Create(std::string name, 
                uint16_t cnt,
                int socket_id){
        m_queue = new my_stl_queue_t();
        assert(m_queue);
        return(true);
    }

    void Delete(void){
        if (m_queue) {
            delete m_queue ;
            m_queue=0;
        }
    }

    int Enqueue(void *obj){
        m_queue->push(obj);
        return (0);
    }

    int Dequeue(void * & obj){
        if ( !m_queue->empty() ){
            obj=  m_queue->front();
            m_queue->pop();
            return (0);
        }else{
            return (1);
        }
    }

    bool isFull(void){
        return (false);
    }

    bool isEmpty(void){
        return ( m_queue->empty() ?true:false); 
    }

private:
    my_stl_queue_t * m_queue;
};

template <class T>
class CTRingSp : public CRingSp {
public:
    int Enqueue(T *obj){
        return ( CRingSp::Enqueue((void*)obj) );
    }

    int Dequeue(T * & obj){
        return (CRingSp::Dequeue(*((void **)&obj)));
    }
};




#endif