Node Struct Reference

#include <node.h>

Inheritance diagram for Node:

[legend]Collaboration diagram for Node:

[legend]List of all members.

Public Member Functions
	Node (void)
	~Node ()
int	address ()
int	nodeid ()
bool	exist_namchan () const
virtual int	command (int argc, const char *const *argv)
virtual void	namlog (const char *fmt,...)
NsObject *	intf_to_target (int32_t)
void	insert (struct node_head *head)
Node *	nextnode ()
const struct if_head &	ifhead () const
const struct linklist_head &	linklisthead () const
void	addNeighbor (Node *node)
void	route_notify (RoutingModule *rtm)
void	unreg_route_notify (RoutingModule *rtm)
void	add_route (char *dst, NsObject *target)
void	delete_route (char *dst, NsObject *nullagent)
void	set_table_size (int nn)
void	set_table_size (int level, int csize)
EnergyModel *	energy_model ()
Location *	location ()
	Node (void)
void	Update (void)
void	UpdateNeighbors (void)
void	Dump (void)
	Node (nodeid_t id)
	Node (const Node &n)
virtual	~Node ()
virtual const NodeWeight_t	NextAdj (const NodeWeight_t &)
virtual void	AddAdj (nodeid_t a, int w=1)
virtual NixPair_t	GetNix (nodeid_t)
virtual Nixl_t	GetNixl ()
virtual nodeid_t	GetNeighbor (Nix_t)
Static Public Member Functions
Node *	get_node_by_address (nsaddr_t)
Public Attributes
neighbor_list_node *	neighbor_list_
double	time_arrival
double	time_transition
int	route_changes
int	link_changes
Neighbor *	neighbor
EdgeVec_t	m_Adj
nodeid_t	m_id
Static Public Attributes
node_head	nodehead_
Protected Member Functions
	LIST_ENTRY (Node) entry
void	namdump ()
Protected Attributes
int	address_
int	nodeid_
Tcl_Channel	namChan_
if_head	ifhead_
linklist_head	linklisthead_
RoutingModule *	rtnotif_
EnergyModel *	energy_model_
Location *	location_
Static Protected Attributes
char	nwrk_ [NODE_NAMLOG_BUFSZ]
Private Member Functions
void	RandomPosition (void)
void	RandomDestination (void)
void	RandomSpeed (void)
	LIST_HEAD (traj, setdest) traj
Private Attributes
u_int32_t	index
vector	position
vector	destination
vector	direction
double	speed
double	time_update
Static Private Attributes
u_int32_t	NodeIndex = 0
Friends
void	ReadInMovementPattern (void)

---

Constructor & Destructor Documentation

Node::Node (  void   )

Definition at line 105 of file node.cc. References ifhead_, insert(), linklisthead_, LIST_INIT, neighbor_list_, NixRoutingUsed, and nodehead_. : address_(-1), nodeid_ (-1), namChan_(0), rtnotif_(NULL), #ifdef HAVE_STL nixnode_(NULL), #endif //HAVE_STL energy_model_(NULL), location_(NULL) { LIST_INIT(&ifhead_); LIST_INIT(&linklisthead_); insert(&(Node::nodehead_)); // insert self into static list of nodes #ifdef HAVE_STL // Mods for Nix-Vector routing if (NixRoutingUsed < 0) { // Find out if nix routing is in use Tcl& tcl = Tcl::instance(); tcl.evalf("Simulator set nix-routing"); tcl.resultAs(&NixRoutingUsed); } if (NixRoutingUsed) { // Create the NixNode pointer if(0)printf("Nix routing in use, creating NixNode\n"); nixnode_ = new NixNode(); } #endif //HAVE_STL neighbor_list_ = NULL; }

Here is the call graph for this function:

Node::~Node (   )

Definition at line 133 of file node.cc. References LIST_REMOVE. { LIST_REMOVE(this, entry); }

Node::Node (  void   )

Node::Node (  nodeid_t  id  )  [inline]

Definition at line 46 of file tnode.h. : RNode(id) { };

Node::Node (  const Node &  n  )  [inline]

Definition at line 47 of file tnode.h. References RNode::m_id. : RNode(n.m_id) { };

virtual Node::~Node (   )  [inline, virtual]

Definition at line 48 of file tnode.h. { };

---

Member Function Documentation

void Node::add_route (  char *  dst, NsObject *  target )  [virtual]

Reimplemented from ParentNode. Definition at line 241 of file node.cc. References RoutingModule::add_route(), and rtnotif_. { if (rtnotif_) rtnotif_->add_route(dst, target); }

Here is the call graph for this function:

virtual void Node::AddAdj (  nodeid_t  a, int  w = 1 )  [virtual]

Reimplemented from RNode.

void Node::addNeighbor (  Node *  node  )

Definition at line 262 of file node.cc. References neighbor_list_, neighbor_list_node::next, nodeid(), and neighbor_list_node::nodeid. Referenced by command(). { neighbor_list_node* nlistItem = (neighbor_list_node *)malloc(sizeof(neighbor_list_node)); nlistItem->nodeid = neighbor->nodeid(); nlistItem->next = neighbor_list_; neighbor_list_=nlistItem; }

Here is the call graph for this function:

int Node::address (   )  [inline, virtual]

Reimplemented from ParentNode. Definition at line 131 of file node.h. References address_. Referenced by ARPTable::arpinput(), ARPTable::arpresolve(), PushbackAgent::command(), God::command(), SatRouteObject::compute_topology(), GridKeeper::dump(), SatNode::dumpSats(), SatChannel::find_peer_mac_addr(), SatTrace::format(), GridKeeper::get_neighbors(), LinkHandoffMgr::get_peer_linkhead(), PositionHandler::handle(), GridHandler::handle(), SatLinkHandoffMgr::handoff(), TermLinkHandoffMgr::handoff(), WebTrafPool::launchReq(), EmpWebTrafSession::launchReq(), SatRouteObject::populate_routing_tables(), and EmpFtpTrafSession::sendFile(). { return address_;}

int Node::command (  int  argc, const char *const *  argv )  [virtual]

Reimplemented in MobileNode, and SatNode. Definition at line 139 of file node.cc. References addNeighbor(), address_, energy_model_, LinkHead::insertlink(), Address::instance(), linklisthead_, namChan_, nodeid_, and Address::str2addr(). Referenced by SatNode::command(), and MobileNode::command(). { Tcl& tcl = Tcl::instance(); if (argc == 2) { #ifdef HAVE_STL // Mods for Nix-Vector Routing if(strcmp(argv[1], "populate-objects") == 0) { if (nixnode_) { nixnode_->PopulateObjects(); } return TCL_OK; } // End mods for Nix-Vector routing #endif // HAVE_STL if(strcmp(argv[1], "address?") == 0) { tcl.resultf("%d", address_); return TCL_OK; } } else if (argc == 3) { #ifdef HAVE_STL // Mods for Nix-Vector Routing if (strcmp(argv[1], "get-nix-vector") == 0) { if (nixnode_) { nixnode_->GetNixVector(atol(argv[2])); } return TCL_OK; } #endif //HAVE_STL if (strcmp(argv[1], "set-neighbor") == 0) { #ifdef HAVE_STL if (nixnode_) { nixnode_->AddAdj(atol(argv[2])); } #endif //HAVE_STL return(TCL_OK); } if (strcmp(argv[1], "addr") == 0) { address_ = Address::instance().str2addr(argv[2]); #ifdef HAVE_STL if (nixnode_) { nixnode_->Id(address_); } #endif //HAVE_STL return TCL_OK; // End mods for Nix-Vector routing } else if (strcmp(argv[1], "nodeid") == 0) { nodeid_ = atoi(argv[2]); return TCL_OK; } else if(strcmp(argv[1], "addlinkhead") == 0) { LinkHead* slhp = (LinkHead*)TclObject::lookup(argv[2]); if (slhp == 0) return TCL_ERROR; slhp->insertlink(&linklisthead_); return TCL_OK; } else if (strcmp(argv[1], "addenergymodel") == 0) { energy_model_=(EnergyModel*)TclObject::lookup(argv[2]); if(!energy_model_) return TCL_ERROR; return TCL_OK; } else if (strcmp(argv[1], "namattach") == 0) { int mode; namChan_ = Tcl_GetChannel(tcl.interp(), (char*)argv[2], &mode); if (namChan_ == 0) { tcl.resultf("node: can't attach %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "add-neighbor") == 0) { Node * node = (Node *)TclObject::lookup(argv[2]); if (node == 0) { tcl.resultf("Invalid node %s", argv[2]); return (TCL_ERROR); } addNeighbor(node); return TCL_OK; } } return ParentNode::command(argc,argv); }

Here is the call graph for this function:

void Node::delete_route (  char *  dst, NsObject *  nullagent )  [virtual]

Reimplemented from ParentNode. Definition at line 247 of file node.cc. References RoutingModule::delete_route(), and rtnotif_. { if (rtnotif_) rtnotif_->delete_route(dst, nullagent); }

Here is the call graph for this function:

void Node::Dump (  void   )

Definition at line 624 of file calcdest.cc. References destination, direction, Neighbor::index, index, neighbor, NODES, position, Neighbor::reachable, speed, time_arrival, time_transition, time_update, u_int32_t, vector::X, vector::Y, and vector::Z. Referenced by dumpall(). { Neighbor *m; u_int32_t i; fprintf(stdout, "Node: %d\tpos: (%.2f, %.2f, %.2f) dst: (%.2f, %.2f, %.2f)\n", index, position.X, position.Y, position.Z, destination.X, destination.Y, destination.Z); fprintf(stdout, "\tdir: (%.2f, %.2f, %.2f) speed: %.2f\n", direction.X, direction.Y, direction.Z, speed); fprintf(stdout, "\tArrival: %.2f, Update: %.2f, Transition: %.2f\n", time_arrival, time_update, time_transition); for(i = 1; i < NODES; i++) { m = &neighbor[i]; fprintf(stdout, "\tNeighbor: %d (%x), Reachable: %d, Transition Time: %.2f\n", m->index, (int) m, m->reachable, m->time_transition); } }

EnergyModel* Node::energy_model (   )  [inline]

Definition at line 192 of file node.h. References energy_model_. Referenced by MobileNode::command(), God::CountAliveNode(), WirelessPhy::em(), EnergyTimer::EnergyTimer(), EnergyTimer::expire(), CMUTrace::format_mac(), CMUTrace::format_rtp(), God::IsNeighbor(), GAFAgent::myttl(), CMUTrace::nam_format(), CMUTrace::node_energy(), GAFAgent::node_off(), GAFAgent::node_on(), MacTdma::radioSwitch(), Mac802_11::recv_timer(), Mac802_11::send(), OmniMcastAgent::Terminate(), FloodingAgent::Terminate(), and DiffusionAgent::Terminate(). { return energy_model_; }

bool Node::exist_namchan (   )  const [inline]

Definition at line 133 of file node.h. References namChan_. Referenced by EnergyModel::set_node_sleep(). { return (namChan_ != 0); }

Node * Node::get_node_by_address (  nsaddr_t   )  [static]

Definition at line 315 of file node.cc. References address_, and nextnode(). Referenced by CMUTrace::format_mac(), CMUTrace::format_rtp(), GAFAgent::GAFAgent(), CMUTrace::nam_format(), and CMUTrace::node_energy(). { Node * tnode = nodehead_.lh_first; for (; tnode; tnode = tnode->nextnode()) { if (tnode->address_ == id ) { return (tnode); } } return NULL; }

Here is the call graph for this function:

virtual nodeid_t RNode::GetNeighbor (  Nix_t   )  [virtual, inherited]

virtual NixPair_t Node::GetNix (  nodeid_t   )  [virtual]

Reimplemented from RNode.

virtual Nixl_t RNode::GetNixl (   )  [virtual, inherited]

Reimplemented in NixNode.

const struct if_head& Node::ifhead (   )  const [inline]

Definition at line 148 of file node.h. References ifhead_. Referenced by GAFAgent::myttl(), GAFAgent::node_off(), GAFAgent::node_on(), and Channel::sendUp(). { return ifhead_; }

void Node::insert (  struct node_head *  head  )  [inline]

Definition at line 141 of file node.h. References LIST_INSERT_HEAD. Referenced by Node(). { LIST_INSERT_HEAD(head, this, entry); }

NsObject * Node::intf_to_target (  int32_t   )

Definition at line 305 of file node.cc. References LinkHead::label(), linklisthead_, and LinkHead::nextlinkhead(). { LinkHead *lhp = linklisthead_.lh_first; for (; lhp; lhp = lhp->nextlinkhead()) if (label == lhp->label()) return ((NsObject*) lhp); return NULL; }

Here is the call graph for this function:

const struct linklist_head& Node::linklisthead (   )  const [inline]

Definition at line 149 of file node.h. References linklisthead_. Referenced by SatRouteObject::compute_topology(), LinkHandoffMgr::get_peer_next_linkhead(), SatLinkHandoffMgr::handoff(), and TermLinkHandoffMgr::handoff(). { return linklisthead_; }

Node::LIST_ENTRY (  Node   )  [protected]

Node::LIST_HEAD (  traj  , setdest  )  [private]

Location* Node::location (   )  [inline]

Definition at line 193 of file node.h. References location_. { return location_; }

void Node::namdump (   )  [protected]

Definition at line 281 of file node.cc. References abort(), namChan_, NODE_NAMLOG_BUFSZ, and nwrk_. Referenced by namlog(), and MobileNode::set_destination(). { int n = 0; /* Otherwise nwrk_ isn't initialized */ n = strlen(nwrk_); if (n >= NODE_NAMLOG_BUFSZ-1) { fprintf(stderr, "Node::namdump() exceeds buffer size. Bail out.\n"); abort(); } if (n > 0) { /* * tack on a newline (temporarily) instead * of doing two writes */ nwrk_[n] = '\n'; nwrk_[n + 1] = 0; (void)Tcl_Write(namChan_, nwrk_, n + 1); nwrk_[n] = 0; } }

Here is the call graph for this function:

void Node::namlog (  const char *  fmt, ...  )  [virtual]

Definition at line 270 of file node.cc. References namChan_, namdump(), and nwrk_. { // Don't do anything if we don't have a log file. if (namChan_ == 0) return; va_list ap; va_start(ap, fmt); vsprintf(nwrk_, fmt, ap); namdump(); }

Here is the call graph for this function:

virtual const NodeWeight_t Node::NextAdj (  const NodeWeight_t &   )  [virtual]

Reimplemented from RNode.

Node* Node::nextnode (   )  [inline]

Reimplemented in MobileNode. Definition at line 144 of file node.h. Referenced by SatRouteObject::compute_topology(), SatNode::dumpSats(), SatTrace::format(), get_node_by_address(), TermLinkHandoffMgr::handoff(), and SatRouteObject::populate_routing_tables(). { return entry.le_next; }

int Node::nodeid (   )  [inline, virtual]

Reimplemented from ParentNode. Definition at line 132 of file node.h. References nodeid_. Referenced by addNeighbor(), PushbackAgent::calculateLowerBound(), WebTrafPool::command(), PushbackAgent::command(), CMUTrace::format_mac(), WebServer::get_nid(), PushbackAgent::getQID(), PushbackAgent::identifyAggregate(), LoggingDataStruct::LoggingDataStruct(), CMUTrace::nam_format(), PushbackAgent::printMsg(), PushbackAgent::processPushbackStatus(), PushbackAgent::pushbackCancel(), PushbackAgent::pushbackCheck(), PushbackAgent::pushbackRefresh(), PushbackAgent::pushbackStatus(), PushbackAgent::refreshUpstreamLimits(), and PushbackQueue::timeout(). { return nodeid_;}

void Node::RandomDestination (  void   )  [private]

Definition at line 409 of file calcdest.cc. References destination, MAXX, MAXY, position, uniform(), vector::X, vector::Y, and vector::Z. { destination.X = uniform() * MAXX; destination.Y = uniform() * MAXY; destination.Z = 0.0; assert(destination != position); }

Here is the call graph for this function:

void Node::RandomPosition (  void   )  [private]

Definition at line 400 of file calcdest.cc. References MAXX, MAXY, position, uniform(), vector::X, vector::Y, and vector::Z. { position.X = uniform() * MAXX; position.Y = uniform() * MAXY; position.Z = 0.0; }

Here is the call graph for this function:

void Node::RandomSpeed (  void   )  [private]

Definition at line 418 of file calcdest.cc. References MAXSPEED, speed, and uniform(). { speed = uniform() * MAXSPEED; assert(speed != 0.0); }

Here is the call graph for this function:

void Node::route_notify (  RoutingModule *  rtm  )

Definition at line 222 of file node.cc. References RoutingModule::route_notify(), and rtnotif_. Referenced by VcRoutingModule::command(), ManualRoutingModule::command(), HierRoutingModule::command(), McastRoutingModule::command(), QSRoutingModule::command(), SourceRoutingModule::command(), BaseRoutingModule::command(), and MPLSModule::command(). { if (rtnotif_ == NULL) rtnotif_ = rtm; else rtnotif_->route_notify(rtm); }

Here is the call graph for this function:

void Node::set_table_size (  int  level, int  csize )  [virtual]

Reimplemented from ParentNode. Definition at line 257 of file node.cc. References rtnotif_, and RoutingModule::set_table_size(). { if (rtnotif_) rtnotif_->set_table_size(level, csize); }

Here is the call graph for this function:

void Node::set_table_size (  int  nn  )  [virtual]

Reimplemented from ParentNode. Definition at line 252 of file node.cc. References rtnotif_, and RoutingModule::set_table_size(). { if (rtnotif_) rtnotif_->set_table_size(nn); }

Here is the call graph for this function:

void Node::unreg_route_notify (  RoutingModule *  rtm  )

Definition at line 229 of file node.cc. References RoutingModule::next_rtm_, rtnotif_, and RoutingModule::unreg_route_notify(). Referenced by VcRoutingModule::command(), ManualRoutingModule::command(), HierRoutingModule::command(), McastRoutingModule::command(), QSRoutingModule::command(), SourceRoutingModule::command(), BaseRoutingModule::command(), and MPLSModule::command(). { if (rtnotif_) { if (rtnotif_ == rtm) { //RoutingModule *tmp = rtnotif_; rtnotif_= rtnotif_->next_rtm_; //free (tmp); } else rtnotif_->unreg_route_notify(rtm); } }

Here is the call graph for this function:

void Node::Update (  void   )

Definition at line 427 of file calcdest.cc. References destination, direction, vector::length(), LIST_NEXT, LIST_REMOVE, MAXTIME, position, speed, TIME, time_arrival, time_transition, time_update, vector::X, vector::Y, and vector::Z. Referenced by main(). { struct setdest *setdest = traj.lh_first; position += (speed * (TIME - time_update)) * direction; if(TIME == time_arrival) { if (NULL == setdest) { destination = position; direction.X = direction.Y = direction.Z = 0.0; speed = 0.0; time_arrival = MAXTIME + 1; } else { vector v; destination.X = setdest->X; destination.Y = setdest->Y; speed = setdest->speed; if (0.0 == speed) { // it's a pause at the current location if (LIST_NEXT(setdest,traj)) time_arrival = LIST_NEXT(setdest,traj)->time; else time_arrival = MAXTIME + 1; } else { // we're moving somewhere, when do we get there? v = destination - position; direction = v / v.length(); time_arrival = TIME + v.length() / speed; } LIST_REMOVE(setdest,traj); free(setdest); } } time_update = TIME; time_transition = 0.0; }

Here is the call graph for this function:

void Node::UpdateNeighbors (  void   )

Definition at line 472 of file calcdest.cc. References direction, Neighbor::index, index, vector::length(), link_changes, LinkChangeCount, max, min, neighbor, NodeList, NODES, position, RANGE, Neighbor::reachable, ROUND_ERROR, speed, t1, TIME, time_transition, Neighbor::time_transition, u_int32_t, vector::X, vector::Y, and vector::Z. Referenced by main(). { static Node *n2; static Neighbor *m1, *m2; static vector D, B, v1, v2; static double a, b, c, t1, t2, Q; static u_int32_t i, reachable; v1 = speed * direction; /* * Only need to go from INDEX --> N for each one since links * are symmetric. */ for(i = index+1; i < NODES; i++) { m1 = &neighbor[i]; n2 = &NodeList[i]; m2 = &n2->neighbor[index]; assert(i == m1->index); assert(m1->index == n2->index); assert(index == m2->index); assert(m1->reachable == m2->reachable); reachable = m1->reachable; /* ================================================== Determine Reachability ================================================== */ { vector d = position - n2->position; if(d.length() < RANGE) { #ifdef SANITY_CHECKS if(TIME > 0.0 && m1->reachable == 0) assert(RANGE - d.length() < ROUND_ERROR); #endif m1->reachable = m2->reachable = 1; } // Boundary condition handled below. else { #ifdef SANITY_CHECKS if(TIME > 0.0 && m1->reachable == 1) assert(d.length() - RANGE < ROUND_ERROR); #endif m1->reachable = m2->reachable = 0; } #ifdef DEBUG fprintf(stdout, "# %.6f (%d, %d) %.2fm\n", TIME, index, m1->index, d.length()); #endif } /* ================================================== Determine Next Event Time ================================================== */ v2 = n2->speed * n2->direction; D = v2 - v1; B = n2->position - position; a = (D.X * D.X) + (D.Y * D.Y) + (D.Z * D.Z); b = 2 * ((D.X * B.X) + (D.Y * B.Y) + (D.Z * B.Z)); c = (B.X * B.X) + (B.Y * B.Y) + (B.Z * B.Z) - (RANGE * RANGE); if(a == 0.0) { /* * No Finite Solution */ m1->time_transition= 0.0; m2->time_transition= 0.0; goto next; } Q = b * b - 4 * a * c; if(Q < 0.0) { /* * No real roots. */ m1->time_transition = 0.0; m2->time_transition = 0.0; goto next; } Q = sqrt(Q); t1 = (-b + Q) / (2 * a); t2 = (-b - Q) / (2 * a); // Stupid Rounding/Boundary Cases if(t1 > 0.0 && t1 < ROUND_ERROR) t1 = 0.0; if(t1 < 0.0 && -t1 < ROUND_ERROR) t1 = 0.0; if(t2 > 0.0 && t2 < ROUND_ERROR) t2 = 0.0; if(t2 < 0.0 && -t2 < ROUND_ERROR) t2 = 0.0; if(t1 < 0.0 && t2 < 0.0) { /* * No "future" time solution. */ m1->time_transition = 0.0; m2->time_transition = 0.0; goto next; } /* * Boundary conditions. */ if((t1 == 0.0 && t2 > 0.0) || (t2 == 0.0 && t1 > 0.0)) { m1->reachable = m2->reachable = 1; m1->time_transition = m2->time_transition = TIME + max(t1, t2); } else if((t1 == 0.0 && t2 < 0.0) || (t2 == 0.0 && t1 < 0.0)) { m1->reachable = m2->reachable = 0; m1->time_transition = m2->time_transition = 0.0; } /* * Non-boundary conditions. */ else if(t1 > 0.0 && t2 > 0.0) { m1->time_transition = TIME + min(t1, t2); m2->time_transition = TIME + min(t1, t2); } else if(t1 > 0.0) { m1->time_transition = TIME + t1; m2->time_transition = TIME + t1; } else { m1->time_transition = TIME + t2; m2->time_transition = TIME + t2; } /* ================================================== Update the transition times for both NODEs. ================================================== */ if(time_transition == 0.0 || (m1->time_transition && time_transition > m1->time_transition)) { time_transition = m1->time_transition; } if(n2->time_transition == 0.0 || (m2->time_transition && n2->time_transition > m2->time_transition)) { n2->time_transition = m2->time_transition; } next: if(reachable != m1->reachable && TIME > 0.0) { LinkChangeCount++; link_changes++; n2->link_changes++; } } }

Here is the call graph for this function:

---

Friends And Related Function Documentation

void ReadInMovementPattern (  void   )  [friend]

Definition at line 176 of file calcdest.cc. { char buf[256]; u_int n; double x,y,z,t,s; struct setdest *setdest; while (!feof(in_file)) { fgets(buf, sizeof(buf), in_file); fprintf(out_file, "%s", buf); if (*buf == '#') continue; if (*buf == '\n') continue; /* check to see if we need data from the line */ if (2 == sscanf(buf,"$node_(%d) set Z_ %lf", &n, &z)) { assert(n < NODES); NodeList[n].position.Z = z; } else if (2 == sscanf(buf,"$node_(%d) set X_ %lf", &n, &x)) { assert(n < NODES); NodeList[n].position.X = x; } else if (2 == sscanf(buf,"$node_(%d) set Y_ %lf", &n, &y)) { assert(n < NODES); NodeList[n].position.Y = y; } else if (5 == sscanf(buf,"$ns_ at %lf \"$node_(%d) setdest %lf %lf %lf\"", &t, &n, &x, &y, &s)) { assert(n < NODES); assert(t <= MAXTIME); setdest = (struct setdest *)malloc(sizeof(*setdest)); assert(setdest); setdest->X = x; setdest->Y = y; setdest->Z = 0; setdest->time = t; setdest->speed = s; if (NodeList[n].traj.lh_first && t > NodeList[n].traj.lh_first->time) { printf("setdest's must be in anti-chronological order in input file!\n"); printf("failed on node %d\n",n); exit(-1); } LIST_INSERT_HEAD(&NodeList[n].traj,setdest,traj); } else { printf("unparsable line: '%s'", buf); continue; } } fflush(out_file); }

---

Member Data Documentation

int Node::address_ [protected]

Reimplemented from ParentNode. Definition at line 169 of file node.h. Referenced by address(), MobileNode::bound_position(), command(), MobileNode::command(), MobileNode::dump(), get_node_by_address(), PositionHandler::handle(), MobileNode::log_energy(), MobileNode::log_movement(), MobileNode::random_destination(), MobileNode::set_destination(), MobileNode::start(), and MobileNode::update_position().

vector Node::destination [private]

Definition at line 96 of file setdest.h. Referenced by Dump(), RandomDestination(), and Update().

vector Node::direction [private]

Definition at line 97 of file setdest.h. Referenced by Dump(), Update(), and UpdateNeighbors().

EnergyModel* Node::energy_model_ [protected]

Definition at line 195 of file node.h. Referenced by command(), energy_model(), and MobileNode::log_energy().

struct if_head Node::ifhead_ [protected]

Definition at line 179 of file node.h. Referenced by SatNode::command(), MobileNode::command(), MobileNode::dump(), ifhead(), MobileNode::MobileNode(), and Node().

u_int32_t Node::index [private]

Definition at line 93 of file setdest.h. Referenced by Dump(), and UpdateNeighbors().

int Node::link_changes

Definition at line 86 of file setdest.h. Referenced by UpdateNeighbors().

struct linklist_head Node::linklisthead_ [protected]

Definition at line 180 of file node.h. Referenced by command(), SatNode::dumpSats(), intf_to_target(), linklisthead(), and Node().

Location* Node::location_ [protected]

Definition at line 199 of file node.h. Referenced by location().

EdgeVec_t Node::m_Adj

Definition at line 53 of file tnode.h.

nodeid_t RNode::m_id [inherited]

Definition at line 42 of file rnode.h. Referenced by NixNode::Id(), and Node().

Tcl_Channel Node::namChan_ [protected]

Definition at line 173 of file node.h. Referenced by command(), exist_namchan(), namdump(), namlog(), and MobileNode::set_destination().

Neighbor* Node::neighbor

Definition at line 108 of file setdest.h. Referenced by ComputeW(), Dump(), and UpdateNeighbors().

neighbor_list_node* Node::neighbor_list_

Definition at line 154 of file node.h. Referenced by addNeighbor(), LoggingDataStruct::LoggingDataStruct(), and Node().

struct node_head Node::nodehead_ [static]

Definition at line 140 of file node.h. Referenced by SatRouteObject::compute_topology(), SatNode::dumpSats(), SatTrace::format(), TermLinkHandoffMgr::handoff(), Node(), and SatRouteObject::populate_routing_tables().

int Node::nodeid_ [protected]

Reimplemented from ParentNode. Definition at line 170 of file node.h. Referenced by command(), nodeid(), and MobileNode::set_destination().

u_int32_t Node::NodeIndex = 0 [static, private]

Definition at line 262 of file setdest2.cc.

char Node::nwrk_ [static, protected]

Definition at line 100 of file node.cc. Referenced by namdump(), namlog(), and MobileNode::set_destination().

vector Node::position [private]

Definition at line 95 of file setdest.h. Referenced by Dump(), RandomDestination(), RandomPosition(), ReadInMovementPattern(), Update(), and UpdateNeighbors().

int Node::route_changes

Definition at line 85 of file setdest.h. Referenced by show_diffs().

RoutingModule* Node::rtnotif_ [protected]

Definition at line 183 of file node.h. Referenced by add_route(), delete_route(), route_notify(), set_table_size(), and unreg_route_notify().

double Node::speed [private]

Definition at line 99 of file setdest.h. Referenced by Dump(), RandomSpeed(), Update(), and UpdateNeighbors().

double Node::time_arrival

Definition at line 81 of file setdest.h. Referenced by Dump(), main(), and Update().

double Node::time_transition

Definition at line 82 of file setdest.h. Referenced by Dump(), main(), Update(), and UpdateNeighbors().

double Node::time_update [private]

Definition at line 100 of file setdest.h. Referenced by Dump(), and Update().

---

The documentation for this struct was generated from the following files:

• node.cc
• node.h
• setdest.h
• tnode.h
• calcdest.cc
• setdest.cc
• setdest2.cc

---