comparison: src/mediastreamer/msqueue.c
src/mediastreamer/msqueue.c
- branch
- gaim
- changeset 20470
- 77693555855f
- parent 13071
- b98e72d4089a
- parent 20469
- b2836a24d81e
- child 20471
- 1966704b3e42
equal
deleted
inserted
replaced
| 13071:b98e72d4089a | 20470:77693555855f |
|---|---|
| 1 /* | |
| 2 The mediastreamer library aims at providing modular media processing and I/O | |
| 3 for linphone, but also for any telephony application. | |
| 4 Copyright (C) 2001 Simon MORLAT simon.morlat@linphone.org | |
| 5 | |
| 6 This library is free software; you can redistribute it and/or | |
| 7 modify it under the terms of the GNU Lesser General Public | |
| 8 License as published by the Free Software Foundation; either | |
| 9 version 2.1 of the License, or (at your option) any later version. | |
| 10 | |
| 11 This library is distributed in the hope that it will be useful, | |
| 12 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 14 Lesser General Public License for more details. | |
| 15 | |
| 16 You should have received a copy of the GNU Lesser General Public | |
| 17 License along with this library; if not, write to the Free Software | |
| 18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
| 19 */ | |
| 20 | |
| 21 #include "msqueue.h" | |
| 22 #include <string.h> | |
| 23 | |
| 24 MSQueue * ms_queue_new() | |
| 25 { | |
| 26 MSQueue *q=g_malloc(sizeof(MSQueue)); | |
| 27 memset(q,0,sizeof(MSQueue)); | |
| 28 return q; | |
| 29 } | |
| 30 | |
| 31 MSMessage *ms_queue_get(MSQueue *q) | |
| 32 { | |
| 33 MSMessage *b=q->last; | |
| 34 if (b==NULL) return NULL; | |
| 35 q->last=b->prev; | |
| 36 if (b->prev==NULL) q->first=NULL; /* it was the only element of the queue*/ | |
| 37 q->size--; | |
| 38 b->next=b->prev=NULL; | |
| 39 return(b); | |
| 40 } | |
| 41 | |
| 42 void ms_queue_put(MSQueue *q, MSMessage *m) | |
| 43 { | |
| 44 MSMessage *mtmp=q->first; | |
| 45 g_return_if_fail(m!=NULL); | |
| 46 q->first=m; | |
| 47 m->next=mtmp; | |
| 48 if (mtmp!=NULL) | |
| 49 { | |
| 50 mtmp->prev=m; | |
| 51 } | |
| 52 else q->last=m; /* it was the first element of the q */ | |
| 53 q->size++; | |
| 54 } | |
| 55 | |
| 56 |
