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
|
/*
* Copyright (c) 1991,1993 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Computer Systems
* Engineering Group at Lawrence Berkeley Laboratory.
* 4. Neither the name of the University nor of the Laboratory may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#) $Header: /cvsroot/nsnam/nam-1/queue.h,v 1.11 2002/10/15 18:06:08 difa Exp $ (LBL)
*/
#ifndef nam_queue_h
#define nam_queue_h
#include "animation.h"
class View;
//class PSView;
class Drop;
class Queue;
class Monitor;
class QueueItem : public Animation {
friend class Queue;
public:
QueueItem(const PacketAttr&, double, long);
~QueueItem();
virtual float distance(float x, float y) const;
void position(float&, float&);
virtual void draw(View* nv, double time);
// virtual void draw(PSView*, double) const;
virtual void update_bb();
void locate(float x, float y, float dx, float dy);
//virtual int inside(double now, float px, float py) const;
virtual const char* info() const;
virtual const char* getname() const;
void monitor(Monitor *m, double now, char *result, int len);
MonState *monitor_state();
inline int id() const { return pkt_.id; }
inline int size() const { return pkt_.size; }
inline const char* type() const { return (pkt_.type); }
inline const char* convid() const { return (pkt_.convid); }
private:
QueueItem* qnext_;
float px_[4];
float py_[4];
PacketAttr pkt_;
};
#define QUEUE_HEAD 1
#define QUEUE_TAIL 2
class Queue {
public:
Queue(float angle);
virtual int classid() const { return ClassQueueItemID; }
virtual void reset(double);
QueueItem* remove(const PacketAttr& p, int& position);
QueueItem* remove(const PacketAttr& p) { int d; return remove(p, d); }
inline int size() const { return (cnt_); }
void enque(QueueItem*, int mode);
void relocate();
void place(double psize, double x, double y);
inline QueueItem *head() const { return head_; }
Queue* next_;
private:
int cnt_; /* current size of queue */
QueueItem* head_;
QueueItem** tail_;
/*XXX get rid of this */
float psize_; /* packet size */
int nb_; /* aggregate bytes in queue */
float angle_;
float qx_, qy_; /* coord of head of queue */
float dx_, dy_; /* space between packets */
float px_, py_; /* size of each packet */
};
#endif
|
