File: route.cc

package info (click to toggle)
nam 1.15-5
  • links: PTS, VCS
  • area: main
  • in suites: buster, sid
  • size: 29,240 kB
  • sloc: cpp: 17,338; tcl: 10,655; sh: 2,997; ansic: 1,252; makefile: 139; perl: 66
file content (248 lines) | stat: -rw-r--r-- 6,586 bytes parent folder | download | duplicates (5)
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
/*
 * Copyright (c) 1997 University of Southern 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 Information Sciences
 *      Institute of the University of Southern California.
 * 4. Neither the name of the University nor of the Institute 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.
 *
 */

#ifdef WIN32
#include <windows.h>
#endif
#include "netview.h"
#include "psview.h"
#include "route.h"
#include "feature.h"
#include "agent.h"
#include "edge.h"
#include "node.h"
#include "monitor.h"
#include "paint.h"

Route::Route(Node *n, Edge *e, int group, int pktsrc, int negcache, int oif, 
	     double timer, double now) :
  Animation(0, 0),
  next_(0),
  edge_(e),
  node_(n),
  group_(group),
  pktsrc_(pktsrc),
  timeout_(timer),
  timeset_(now),
  anchor_(0),
  mark_(0)
{
  mode_=0;
  if (negcache==1)
    mode_|=NEG_CACHE;
  else
    mode_|=POS_CACHE;
  if (oif==1)
    mode_|=OIF;
  else
    mode_|=IIF;

  /*copy the transform matrix from the edge*/
  angle_ = e->angle();
  matrix_ = e->transform();
}

Route::~Route()
{
  if (monitor_!=NULL) {
    monitor_->delete_monitor_object(this);
  }
}

void Route::update_bb() 
{
  bb_.xmin = x_[0];
  bb_.xmax = x_[0];
  bb_.ymin = y_[0];
  bb_.ymax = y_[0];
  for(int i=1;i<npts_;i++)
    {
      if (bb_.xmin>x_[i]) bb_.xmin=x_[i];
      if (bb_.xmax<x_[i]) bb_.xmax=x_[i];
      if (bb_.ymin>y_[i]) bb_.ymin=y_[i];
      if (bb_.ymax<y_[i]) bb_.ymax=y_[i];
    }
}

// Moved to Animation::inside()
// int Route::inside(double /*now*/, float px, float py) const
// {
//   float minx, maxx, miny, maxy;
//   minx=x_[0];
//   maxx=x_[0];
//   miny=y_[0];
//   maxy=y_[0];
//   for(int i=1;i<npts_;i++)
//     {
//       if (minx>x_[i]) minx=x_[i];
//       if (maxx<x_[i]) maxx=x_[i];
//       if (miny>y_[i]) miny=y_[i];
//       if (maxy<y_[i]) maxy=y_[i];
//     }
//   return ((minx<=px)&&(maxx>=px)&&(miny<=py)&&(maxy>=py));
// }

void Route::place(double x0, double y0)
{
	int ctr = node_->no_of_routes(edge_)-1;
	place(x0,y0,ctr);
}

void Route::place(double x0, double y0, int ctr)
{

  float tx,ty;

  /*matrix was copied from the edge - don't need to set it up here*/
  //double size=edge_->size();
  double size = node_->size() * 0.2;
  double offset=size*2*(ctr);

  // XXX Make sure we have up-to-date information from the edge
  angle_ = edge_->angle();
  matrix_ = edge_->transform();

  matrix_.imap((float)x0,(float)y0, tx,ty);
  if ((mode_&POS_CACHE)>0)
    {
      if ((mode_&OIF)>0)
	{
	  matrix_.map((float)tx+offset, (float)(ty+size), x_[0], y_[0]);
	  matrix_.map((float)tx+offset, (float)(ty-size), x_[1], y_[1]);
	  matrix_.map((float)(tx+offset+size*3), (float)ty, x_[2], y_[2]);
	}
      if ((mode_&IIF)>0)
	{
	  matrix_.map((float)(tx+offset+size*2), (float)(ty+size), 
		      x_[0], y_[0]);
	  matrix_.map((float)(tx+offset+size*2), (float)(ty-size), 
		      x_[1], y_[1]);
	  matrix_.map((float)(tx+offset-size), (float)ty, x_[2], y_[2]);
	}
      npts_=3;
    }
  else
    {
      matrix_.map((float)(tx+offset), (float)(ty+size), x_[0], y_[0]);
      matrix_.map((float)(tx+offset+size), (float)(ty+size), x_[1], y_[1]);
      matrix_.map((float)(tx+offset+size), (float)(ty-size), x_[2], y_[2]);
      matrix_.map((float)(tx+offset), (float)(ty-size), x_[3], y_[3]);
      npts_=4;
    }
  update_bb(); 
}

int Route::matching_route(Edge *e, int group, int pktsrc, int oif) const
{
  if ((edge_==e)&&(group_==group)&&(pktsrc_==pktsrc))
    {
      if (((oif==1)&&((mode_&OIF)>0)) || ((oif==0)&&((mode_&IIF)>0)))
	return 1;
    }
  return 0;
}

const char* Route::info() const
{
        static char text[128];
	static char source[64];
	if (group_>=0)
	  {
	    if (pktsrc_<0)
	      strcpy(source, "*");
	    else
	      sprintf(source, "%d", pktsrc_);
	      
	    sprintf(text, 
		    "Multicast Route:\nSource:%s\nGroup:%d\nTimeout:%f",
		    source, group_, curtimeout_);
	    if ((mode_&NEG_CACHE)>0)
		strcat(text, "\nPrune Entry");
	    return (text);
	  }
	else
	  {
	    sprintf(text, "Unicast Route:\nDestination:%d\nTimeout:%f",
		    pktsrc_, curtimeout_);
	    return (text);
	  }
}

const char* Route::getname() const
{
  static char text[128];
  sprintf(text, "r");
  return (text);
}
void Route::monitor(Monitor *m, double /*now*/, char *result, int len) 
{
  monitor_=m;
  strncpy(result, info(), len);
}
 
MonState *Route::monitor_state()
{
  MonState *ms=new MonState;
  ms->type=MON_ROUTE;
  ms->route.src=pktsrc_;
  ms->route.group=group_;
  ms->route.node=node_;
  return ms;
}

void Route::draw(View *nv, double now) {
  nv->fill(x_, y_, npts_, paint_);  
  if (monitor_!=NULL)
    monitor_->draw(nv, (x_[0]+x_[2])/2, (y_[0]+y_[2])/2);
}

//void Route::draw(PSView *nv, double /*now*/) const
/*
{
  nv->fill(x_, y_, npts_, paint_);  
}
*/
void Route::update(double now)
{
  curtimeout_=timeout_+timeset_-now;
  if (curtimeout_<0) curtimeout_=0;
  /*XXX could make a zero timeout delete the route*/
  /* but this would make the tracefile unidirectional*/
}

void Route::reset(double /*now*/)
{
  node_->delete_route(this);
  delete this;
}