summaryrefslogtreecommitdiff
path: root/src/queue.h
blob: 7352071c76a65bb87beb93a5f0ba644acc00b7b3 (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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*
 * RTVideoRec Realtime video recoder and encoder for Linux
 *
 * Copyright (C) 2004  Bent Bisballe
 * Copyright (C) 2004  B. Stultiens
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include <config.h>
#ifndef __RTVIDEOREC_QUEUE_H
#define __RTVIDEOREC_QUEUE_H

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <avformat.h>
#include <avcodec.h>

#include "util.h"

typedef struct __buf_t {
  struct __buf_t *next;
  struct __buf_t *prev;
  void *data;
} buf_t;


template<typename T>
class Queue {
 public:
  Queue(int glimit = 0);
  ~Queue();

  void push(T *t);
  T *pop();
  
 private:
  int limit;
  buf_t *head;
  buf_t *tail;
  int count;
  pthread_mutex_t mutex;
};

template<typename T>
Queue<T>::Queue(int glimit)
{
  limit = glimit;
  count = 0;
  head = NULL;
  tail = NULL;
}

template<typename T>
Queue<T>::~Queue()
{
  if(count != 0) {
    fprintf(stderr, "Queue not empty (%d)\n", count);
    while(T *t = pop()) delete t;
  }
}

template<typename T>
void Queue<T>::push(T *t)
{
  buf_t *b = (buf_t*)xmalloc(sizeof(*b));
  b->data = (void*)t;

  assert(b != NULL);
  
  if(limit && count > 0) {
    T* tmp = (T*)pop();
    delete tmp;
  }
  
  if(!head) {
    head = tail = b;
    b->next = b->prev = NULL;
    count = 1;
    return;
  }
  
  b->next = tail;
  b->prev = NULL;
  if(tail)
    tail->prev = b;
  tail = b;
  count++;
}

template<typename T>
T *Queue<T>::pop()
{
  T *d;
  buf_t *b;

  assert(count >= 0);
  
  if(count == 0)
    return NULL;
  
  b = head;
  if(b->prev)
    b->prev->next = NULL;
  head = b->prev;
  if(b == tail)
    tail = NULL;
  count--;
  
  d = (T*)b->data;
  free(b);
  return d;
}

#endif