God Class Reference

#include <god.h>

Inheritance diagram for God:

Collaboration diagram for God:

[legend]

---

Detailed Description

Definition at line 122 of file god.h.

Public Member Functions
void	AddSink (int dt, int skid)
void	AddSource (int dt, int srcid)
int	command (int argc, const char *const *argv)
void	ComputeNextHop ()
void	ComputeRoute ()
void	ComputeW ()
void	CountAliveNode ()
void	CountConnect ()
void	CountNewData (int *attr)
virtual void	debug (const char *fmt,...)
virtual int	delay_bind_dispatch (const char *varName, const char *localName, TclObject *tracer)
virtual void	delay_bind_init_all ()
NsObject *	downtarget ()
virtual void	drop (Packet *p)
void	Dump ()
void	DumpNodeStatus ()
void	DumpNumSend ()
bool	ExistSink ()
bool	ExistSource ()
void	Fill_for_Sink (int dt, int srcid)
void	Fill_for_Source (int dt, int skid)
void	floyd_warshall ()
void	getGrid (double *x, double *y, double *z)
int	getMyBottomGrid (double x, double y)
int	getMyGrid (double x, double y)
int	getMyGridSize ()
int	getMyLeftGrid (double x, double y)
int	getMyRightGrid (double x, double y)
int	getMyTopGrid (double x, double y)
	God ()
int	hops (int i, int j)
void	IncrRecv ()
int	initialized ()
int	isdebug () const
bool	IsNeighbor (int i, int j)
bool	IsPartition ()
bool	IsReachable (int i, int j)
int	load_grid (int, int, int)
int	NextHop (int from, int to)
int *	NextOIFs (int dt, int srcid, int curid, int *ret_num_oif)
int	nodes ()
virtual void	recv (Packet *p, const char *s)
void	recv (Packet *p, Handler *h)
virtual void	recvOnly (Packet *)
void	Rewrite_OIF_Map ()
void	stampPacket (Packet *p)
void	StopSimulation ()
void	UpdateNodeStatus ()
NsObject *	uptarget ()
Static Public Member Functions
static God *	instance ()
Data Fields
int	data_pkt_size
Data_Hash_Table	dtab
int	num_alive_node
int	num_compute
int	num_connect
int	num_data_types
int	num_recv
int *	num_send
double	prev_time
int *	sink_table
int **	source_table
Protected Member Functions
virtual void	drop (Packet *p, const char *s)
void	handle (Event *)
virtual void	reset ()
virtual void	sendDown (Packet *p, Handler *h)
virtual void	sendUp (Packet *p, Handler *h)
Protected Attributes
int	debug_
NsObject *	downtarget_
NsObject *	drop_
NsObject *	uptarget_
Private Attributes
bool	active
bool	allowTostop
int	gridsize_
int	gridX
int	gridY
int	maxX
int	maxY
MobileNode **	mb_node
int *	min_hops
int *	next_hop
NodeStatus *	node_status
int	num_nodes
Static Private Attributes
static God *	instance_

---

Constructor & Destructor Documentation

God::God (   )

Definition at line 71 of file god.cc. References active, allowTostop, data_pkt_size, mb_node, min_hops, next_hop, num_alive_node, num_compute, num_connect, num_data_types, num_nodes, num_recv, num_send, prev_time, sink_table, and source_table. { min_hops = 0; num_nodes = 0; data_pkt_size = 64; mb_node = 0; next_hop = 0; prev_time = -1.0; num_alive_node = 0; num_connect = 0; num_recv = 0; num_compute = 0; num_data_types = 0; source_table = 0; sink_table = 0; num_send = 0; active = false; allowTostop = false; }

---

Member Function Documentation

void God::AddSink (  int  dt, int  skid )

Definition at line 307 of file god.cc. References active, Fill_for_Source(), and SK_TAB. Referenced by command(), DiffusionProb::consider_new(), OmniMcastAgent::ConsiderNew(), FloodingAgent::ConsiderNew(), and DiffusionRate::InterestHandle(). { if (active == false) { return; } assert(num_data_types > 0); assert(num_nodes > 0); assert(dt >= 0 && dt < num_data_types); assert(skid >= 0 && skid < num_nodes); if (SK_TAB(dt,skid) == 1) return; SK_TAB(dt,skid) = 1; Fill_for_Source(dt, skid); } Here is the call graph for this function:

void God::AddSource (  int  dt, int  srcid )

Definition at line 326 of file god.cc. References active, Fill_for_Sink(), and SRC_TAB. Referenced by command(), DiffusionRate::consider_new(), OmniMcastAgent::ConsiderNew(), and FloodingAgent::ConsiderNew(). { if (active == false) { return; } assert(num_data_types > 0); assert(num_nodes > 0); assert(dt >= 0 && dt < num_data_types); assert(srcid >= 0 && srcid < num_nodes); if (SRC_TAB(dt,srcid) != 0) return; SRC_TAB(dt,srcid) = new int[num_nodes * num_nodes]; bzero((char*) SRC_TAB(dt, srcid), sizeof(int) * num_nodes * num_nodes); Fill_for_Sink(dt, srcid); // Dump(); } Here is the call graph for this function:

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

Reimplemented from BiConnector. Definition at line 806 of file god.cc. References active, Node::address(), AddSink(), AddSource(), allowTostop, BiConnector::command(), ComputeRoute(), Dump(), DumpNumSend(), instance_, IsReachable(), load_grid(), mb_node, min_hops, next_hop, node_status, nodes(), NOW, num_data_types, num_send, prev_time, sink_table, source_table, and UpdateNodeStatus(). { Tcl& tcl = Tcl::instance(); if ((instance_ == 0) || (instance_ != this)) instance_ = this; if (argc == 2) { if(strcmp(argv[1], "update_node_status") == 0) { UpdateNodeStatus(); return TCL_OK; } if(strcmp(argv[1], "compute_route") == 0) { ComputeRoute(); return TCL_OK; } if(strcmp(argv[1], "dump") == 0) { Dump(); return TCL_OK; } if (strcmp(argv[1], "dump_num_send") == 0) { DumpNumSend(); return TCL_OK; } if (strcmp(argv[1], "on") == 0) { active = true; return TCL_OK; } if (strcmp(argv[1], "off") == 0) { active = false; return TCL_OK; } if (strcmp(argv[1], "allow_to_stop") == 0) { allowTostop = true; return TCL_OK; } if (strcmp(argv[1], "not_allow_to_stop") == 0) { allowTostop = false; return TCL_OK; } /* if(strcmp(argv[1], "dump") == 0) { int i, j; for(i = 1; i < num_nodes; i++) { fprintf(stdout, "%2d) ", i); for(j = 1; j < num_nodes; j++) fprintf(stdout, "%2d ", min_hops[i * num_nodes + j]); fprintf(stdout, "\n"); } return TCL_OK; } */ if(strcmp(argv[1], "num_nodes") == 0) { tcl.resultf("%d", nodes()); return TCL_OK; } } else if(argc == 3) { if (strcasecmp(argv[1], "is_source") == 0) { int node_id = atoi(argv[2]); if (node_status[node_id].is_source_ == true) { tcl.result("1"); } else { tcl.result("0"); } return TCL_OK; } if (strcasecmp(argv[1], "is_sink") == 0) { int node_id = atoi(argv[2]); if (node_status[node_id].is_sink_ == true) { tcl.result("1"); } else { tcl.result("0"); } return TCL_OK; } if (strcasecmp(argv[1], "is_on_trees") == 0) { int node_id = atoi(argv[2]); if (node_status[node_id].is_on_trees_ == true) { tcl.result("1"); } else { tcl.result("0"); } return TCL_OK; } if (strcasecmp(argv[1], "num_nodes") == 0) { assert(num_nodes == 0); // index always starts from 0 num_nodes = atoi(argv[2]); assert(num_nodes > 0); printf("num_nodes is set %d\n", num_nodes); min_hops = new int[num_nodes * num_nodes]; mb_node = new MobileNode*[num_nodes]; node_status = new NodeStatus[num_nodes]; next_hop = new int[num_nodes * num_nodes]; bzero((char*) min_hops, sizeof(int) * num_nodes * num_nodes); bzero((char*) mb_node, sizeof(MobileNode*) * num_nodes); bzero((char*) next_hop, sizeof(int) * num_nodes * num_nodes); instance_ = this; return TCL_OK; } if (strcasecmp(argv[1], "num_data_types") == 0) { assert(num_data_types == 0); num_data_types = atoi(argv[2]); assert(num_nodes > 0); assert(num_data_types > 0); source_table = new int*[num_data_types * num_nodes]; sink_table = new int[num_data_types * num_nodes]; num_send = new int[num_data_types]; bzero((char*) source_table, sizeof(int *) * num_data_types * num_nodes); bzero((char*) sink_table, sizeof(int) * num_data_types * num_nodes); bzero((char*) num_send, sizeof(int) * num_data_types); return TCL_OK; } if (strcasecmp(argv[1], "new_node") == 0) { assert(num_nodes > 0); MobileNode *obj = (MobileNode *)TclObject::lookup(argv[2]); assert(obj != 0); assert(obj->address() < num_nodes); mb_node[obj->address()] = obj; return TCL_OK; } /* if (strcasecmp(argv[1], "num_nodes") == 0) { assert(num_nodes == 0); // allow for 0 based to 1 based conversion num_nodes = atoi(argv[2]) + 1; min_hops = new int[num_nodes * num_nodes]; bzero((char*) min_hops, sizeof(int) * num_nodes * num_nodes); instance_ = this; return TCL_OK; } */ } else if (argc == 4) { if (strcasecmp(argv[1], "is_reachable") == 0) { int n1 = atoi(argv[2]); int n2 = atoi(argv[3]); if (IsReachable(n1,n2) == true) { tcl.result("1"); } else { tcl.result("0"); } return TCL_OK; } // We can add source from tcl script or call AddSource directly. if (strcasecmp(argv[1], "add_source") == 0) { int dt = atoi(argv[2]); int srcid = atoi(argv[3]); AddSource(dt, srcid); return TCL_OK; } // We can add sink from tcl script or call AddSink directly. if (strcasecmp(argv[1], "add_sink") == 0) { int dt = atoi(argv[2]); int skid = atoi(argv[3]); AddSink(dt, skid); return TCL_OK; } } else if(argc == 5) { /* load for grid-based adaptive fidelity */ if (strcmp(argv[1], "load_grid") == 0) { if(load_grid(atoi(argv[2]), atoi(argv[3]), atoi(argv[4]))) return TCL_ERROR; return TCL_OK; } if (strcasecmp(argv[1], "set-dist") == 0) { int i = atoi(argv[2]); int j = atoi(argv[3]); int d = atoi(argv[4]); assert(i >= 0 && i < num_nodes); assert(j >= 0 && j < num_nodes); if (active == true) { if (NOW > prev_time) { ComputeRoute(); } } else { min_hops[i*num_nodes+j] = d; min_hops[j*num_nodes+i] = d; } // The scenario file should set the node positions // before calling set-dist !! assert(min_hops[i * num_nodes + j] == d); assert(min_hops[j * num_nodes + i] == d); return TCL_OK; } /* if (strcasecmp(argv[1], "set-dist") == 0) { int i = atoi(argv[2]); int j = atoi(argv[3]); int d = atoi(argv[4]); assert(i >= 0 && i < num_nodes); assert(j >= 0 && j < num_nodes); min_hops[i * num_nodes + j] = d; min_hops[j * num_nodes + i] = d; return TCL_OK; } */ } return BiConnector::command(argc, argv); } Here is the call graph for this function:

void God::ComputeNextHop (   )

Definition at line 116 of file god.cc. References active, NEXT_HOP, num_nodes, and UNREACHABLE. Referenced by ComputeRoute(). { if (active == false) { return; } int from, to, neighbor; for (from=0; from<num_nodes; from++) { for (to=0; to<num_nodes; to++) { NEXT_HOP(from,to) = UNREACHABLE; if (from==to) { NEXT_HOP(from,to) = from; // next hop is itself. } if (MIN_HOPS(from, to) == UNREACHABLE) { continue; } for (neighbor=0; neighbor<num_nodes; neighbor++){ if ( MIN_HOPS(from, neighbor) != 1) { continue; } if ( MIN_HOPS(from, to) == (MIN_HOPS(neighbor,to) +1) ) { NEXT_HOP(from, to) = neighbor; break; } } } } }

void God::ComputeRoute (   )

Definition at line 571 of file god.cc. References active, allowTostop, ComputeNextHop(), CountAliveNode(), CountConnect(), ExistSink(), ExistSource(), floyd_warshall(), IsPartition(), NOW, num_compute, prev_time, Rewrite_OIF_Map(), and StopSimulation(). Referenced by MobileNode::command(), command(), EnergyModel::DecrIdleEnergy(), EnergyModel::DecrRcvEnergy(), EnergyModel::DecrSleepEnergy(), EnergyModel::DecrTransitionEnergy(), and EnergyModel::DecrTxEnergy(). { if (active == false) { return; } floyd_warshall(); ComputeNextHop(); Rewrite_OIF_Map(); CountConnect(); CountAliveNode(); prev_time = NOW; num_compute++; if (allowTostop == false) return; if ( ExistSink() == true && ExistSource() == true && IsPartition() == true) StopSimulation(); } Here is the call graph for this function:

void God::ComputeW (   )

Definition at line 623 of file god.cc. References INFINITY, IsNeighbor(), min_hops, and num_nodes. Referenced by floyd_warshall(). { int i, j; int *W = min_hops; memset(W, '\xff', sizeof(int) * num_nodes * num_nodes); for(i = 0; i < num_nodes; i++) { W[i*num_nodes + i] = 0; for(j = i+1; j < num_nodes; j++) { W[i*num_nodes + j] = W[j*num_nodes + i] = IsNeighbor(i,j) ? 1 : INFINITY; } } } Here is the call graph for this function:

void God::CountAliveNode (   )

Definition at line 503 of file god.cc. References mb_node, and num_alive_node. Referenced by ComputeRoute(). { int i; num_alive_node = 0; for (i=0; i<num_nodes; i++) { if (mb_node[i]->energy_model()->energy() > 0.0) { num_alive_node++; } } }

void God::CountConnect (   )

Definition at line 487 of file god.cc. References MIN_HOPS, num_connect, and UNREACHABLE. Referenced by ComputeRoute(). { int i,j; num_connect = 0; for (i=0; i<num_nodes; i++) { for (j=i+1; j<num_nodes; j++) { if (MIN_HOPS(i,j) != UNREACHABLE) { num_connect++; } } } }

void God::CountNewData (  int *  attr  )

Definition at line 593 of file god.cc. References dtab, Data_Hash_Table::GetHash(), num_send, and Data_Hash_Table::PutInHash(). Referenced by SinkAgent::sendpkt(). { if (dtab.GetHash(attr) == NULL) { num_send[attr[0]]++; dtab.PutInHash(attr); } } Here is the call graph for this function:

void NsObject::debug (  const char *  fmt,   ... )  [virtual, inherited]

Definition at line 102 of file object.cc. References NsObject::debug_. { if (!debug_) return; va_list ap; va_start(ap, fmt); vprintf(fmt, ap); }

int NsObject::delay_bind_dispatch (  const char *  varName, const char *  localName, TclObject *  tracer )  [virtual, inherited]

Reimplemented in BayFullTcpAgent, Agent, MPLSAddressClassifier, LDPAgent, HbAfterRtoSctpAgent, MfrHbAfterRtoSctpAgent, MfrTimestampSctpAgent, MultipleFastRtxSctpAgent, NewRenoSctpAgent, TimestampSctpAgent, SctpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, VegasTcpAgent, XcpAgent, and XcpSink. Definition at line 63 of file object.cc. References NsObject::debug_. Referenced by MPLSAddressClassifier::delay_bind_dispatch(), and Agent::delay_bind_dispatch(). { if (delay_bind_bool(varName, localName, "debug_", &debug_, tracer)) return TCL_OK; return TclObject::delay_bind_dispatch(varName, localName, tracer); }

void NsObject::delay_bind_init_all (   )  [virtual, inherited]

Reimplemented in BayFullTcpAgent, Agent, MPLSAddressClassifier, LDPAgent, HbAfterRtoSctpAgent, MfrHbAfterRtoSctpAgent, MfrTimestampSctpAgent, MultipleFastRtxSctpAgent, NewRenoSctpAgent, TimestampSctpAgent, SctpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, VegasTcpAgent, XcpAgent, and XcpSink. Definition at line 57 of file object.cc. Referenced by MPLSAddressClassifier::delay_bind_init_all(), and Agent::delay_bind_init_all(). { delay_bind_init_one("debug_"); }

NsObject* BiConnector::downtarget (   )  [inline, inherited]

Definition at line 49 of file bi-connector.h. References BiConnector::downtarget_. Referenced by SatLL::channel(). { return downtarget_; }

void BiConnector::drop (  Packet *  p, const char *  s )  [protected, virtual, inherited]

Definition at line 144 of file bi-connector.cc. References BiConnector::drop_, Packet::free(), and NsObject::recv(). { if (drop_ != 0) drop_->recv(p, s); else Packet::free(p); } Here is the call graph for this function:

void BiConnector::drop (  Packet *  p  )  [virtual, inherited]

Definition at line 135 of file bi-connector.cc. References BiConnector::drop_, Packet::free(), and NsObject::recv(). Referenced by Mac802_3::collision(), SMAC::drop_CTS(), SMAC::drop_DATA(), SMAC::drop_RTS(), SMAC::drop_SYNC(), UnslottedAlohaMac::end_of_contention(), Mac802_15_4::recv(), MacTdma::recvHandler(), MacSimple::recvHandler(), Phy802_15_4::recvOverHandler(), Mac::resume(), MacCsma::resume(), UnslottedAlohaMac::sendUp(), SatMac::sendUp(), Mac::sendUp(), MacTdma::TX_Time(), and Mac802_11::txtime(). { if (drop_ != 0) drop_->recv(p); else Packet::free(p); } Here is the call graph for this function:

void God::Dump (   )

Definition at line 224 of file god.cc. References min_hops. Referenced by command(). { int i, j, k, l; // Dump min_hops array fprintf(stdout,"Dump min_hops\n"); for(i = 0; i < num_nodes; i++) { fprintf(stdout, "%2d) ", i); for(j = 0; j < num_nodes; j++) fprintf(stdout, "%2d ", min_hops[i * num_nodes + j]); fprintf(stdout, "\n"); } // How many times the god compute routes ? fprintf(stdout, "God computes routes %d times.\n", num_compute); // The following information can be found only when god is active. if (active == false) { return; } // Dump next_hop array fprintf(stdout, "Dump next_hop\n"); for (i = 0; i < num_nodes; i++) { for (j = 0; j < num_nodes; j++) { fprintf(stdout,"NextHop(%d,%d):%d\n",i,j,NEXT_HOP(i,j)); } } // What is inside SRC_TAB ? fprintf(stdout, "Dump SRC_TAB\n"); for (i=0; i<num_data_types; i++) { fprintf(stdout,"%2d) ",i); for (j=0; j<num_nodes; j++) { fprintf(stdout,"%2d ", SRC_TAB(i,j) ? 1:0); } fprintf(stdout,"\n"); } // What is inside OIF_MAP ? int *oif_map; fprintf(stdout, "Dump OIF_MAP\n"); for (i=0; i<num_data_types; i++) { for (j=0; j<num_nodes; j++) { if (SRC_TAB(i,j)!=NULL) { oif_map = SRC_TAB(i,j); fprintf(stdout,"(%2d,%2d)\n",i,j); for (k=0; k<num_nodes; k++) { for (l=0; l<num_nodes; l++) { fprintf(stdout,"%2d ", oif_map[k*num_nodes +l]); } fprintf(stdout,"\n"); } } } } // What is inside SK_TAB ? fprintf(stdout, "Dump SK_TAB\n"); for (i=0; i<num_data_types; i++) { fprintf(stdout,"%2d) ",i); for (j=0; j<num_nodes; j++) { fprintf(stdout,"%2d ", SK_TAB(i,j)); } fprintf(stdout,"\n"); } }

void God::DumpNodeStatus (   )

Definition at line 205 of file god.cc. References node_status. { for (int i=0; i < num_nodes; i++) { printf("Node %d status (sink %d, source %d, on_tree %d)\n", i, node_status[i].is_sink_, node_status[i].is_source_, node_status[i].is_on_trees_); } }

void God::DumpNumSend (   )

Definition at line 214 of file god.cc. References num_send. Referenced by command(). { #ifdef DEBUG_OUTPUT for (int i=0; i < num_data_types; i++) { fprintf(stdout, "God: data type %d distinct events %d\n", i, num_send[i]); } #endif }

bool God::ExistSink (   )

Definition at line 533 of file god.cc. References SK_TAB. Referenced by ComputeRoute(). { int dtype, i; for (dtype = 0; dtype < num_data_types; dtype++) { for (i=0; i<num_nodes; i++) { if (SK_TAB(dtype, i) != 0) return true; } } return false; }

bool God::ExistSource (   )

Definition at line 518 of file god.cc. References SRC_TAB. Referenced by ComputeRoute(). { int dtype, i; for (dtype = 0; dtype < num_data_types; dtype++) { for (i=0; i<num_nodes; i++) { if (SRC_TAB(dtype, i) != 0) return true; } } return false; }

void God::Fill_for_Sink (  int  dt, int  srcid )

Definition at line 347 of file god.cc. References count, NextHop(), SK_TAB, SRC_TAB, and UNREACHABLE. Referenced by AddSource(), and Rewrite_OIF_Map(). { int sk, cur, count; int *oif_map = SRC_TAB(dt, srcid); assert(oif_map != NULL); for (sk = 0; sk < num_nodes; sk++) { if (SK_TAB(dt, sk) == 0) continue; cur = srcid; count = 0; while (cur != sk) { if (NextHop(cur, sk) == UNREACHABLE) break; assert(NextHop(cur,sk) >= 0 && NextHop(cur, sk) < num_nodes); oif_map[cur*num_nodes + NextHop(cur, sk)] = 1; cur = NextHop(cur, sk); count ++; assert(count < num_nodes); } } } Here is the call graph for this function:

void God::Fill_for_Source (  int  dt, int  skid )

Definition at line 374 of file god.cc. References count, NextHop(), SRC_TAB, and UNREACHABLE. Referenced by AddSink(). { int src, cur, count; int *oif_map; for (src = 0; src < num_nodes; src++) { if (SRC_TAB(dt, src) == 0) continue; oif_map = SRC_TAB(dt, src); cur = src; count = 0; while (cur != skid) { if (NextHop(cur, skid) == UNREACHABLE) break; assert(NextHop(cur,skid) >= 0 && NextHop(cur, skid) < num_nodes); oif_map[cur*num_nodes + NextHop(cur, skid)] = 1; cur = NextHop(cur, skid); count ++; assert(count < num_nodes); } } } Here is the call graph for this function:

void God::floyd_warshall (   )

Definition at line 639 of file god.cc. References ComputeW(), MIN, MIN_HOPS, and num_nodes. Referenced by ComputeRoute(). { int i, j, k; ComputeW(); // the connectivity matrix for(i = 0; i < num_nodes; i++) { for(j = 0; j < num_nodes; j++) { for(k = 0; k < num_nodes; k++) { MIN_HOPS(j,k) = MIN(MIN_HOPS(j,k), MIN_HOPS(j,i) + MIN_HOPS(i,k)); } } } #ifdef SANITY_CHECKS for(i = 0; i < num_nodes; i++) for(j = 0; j < num_nodes; j++) { assert(MIN_HOPS(i,j) == MIN_HOPS(j,i)); assert(MIN_HOPS(i,j) <= INFINITY); } #endif } Here is the call graph for this function:

void God::getGrid (  double *  x, double *  y, double *  z )  [inline]

Definition at line 139 of file god.h. References gridsize_, maxX, and maxY. { *x = maxX; *y = maxY; *z = gridsize_; }

int God::getMyBottomGrid (  double  x, double  y )

Definition at line 789 of file god.cc. References gridsize_, gridX, maxX, and maxY. { int xloc, yloc; if (x > maxX || y >maxY) return(-1); xloc = (int) x/gridsize_; yloc = (int) y/gridsize_; yloc--; // no top grid if (yloc < 0 ) return (-2); return(yloc*gridX+xloc); }

int God::getMyGrid (  double  x, double  y )

Definition at line 725 of file god.cc. References gridsize_, gridX, maxX, and maxY. Referenced by GAFAgent::duty_timeout(), GAFAgent::GAFAgent(), GAFAgent::processDiscoveryMsg(), and GAFAgent::send_discovery(). { int xloc, yloc; if (x > maxX || y >maxY) return(-1); xloc = (int) x/gridsize_; yloc = (int) y/gridsize_; return(yloc*gridX+xloc); }

int God::getMyGridSize (   )  [inline]

Definition at line 199 of file god.h. References gridsize_. Referenced by GAFAgent::makeUpDiscoveryMsg(). { return gridsize_; }

int God::getMyLeftGrid (  double  x, double  y )

Definition at line 738 of file god.cc. References gridsize_, gridX, maxX, and maxY. { int xloc, yloc; if (x > maxX || y >maxY) return(-1); xloc = (int) x/gridsize_; yloc = (int) y/gridsize_; xloc--; // no left grid if (xloc < 0) return (-2); return(yloc*gridX+xloc); }

int God::getMyRightGrid (  double  x, double  y )

Definition at line 755 of file god.cc. References gridsize_, gridX, maxX, and maxY. { int xloc, yloc; if (x > maxX || y >maxY) return(-1); xloc = (int) x/gridsize_; yloc = (int) y/gridsize_; xloc++; // no left grid if (xloc > gridX) return (-2); return(yloc*gridX+xloc); }

int God::getMyTopGrid (  double  x, double  y )

Definition at line 772 of file god.cc. References gridsize_, gridX, gridY, maxX, and maxY. { int xloc, yloc; if (x > maxX || y >maxY) return(-1); xloc = (int) x/gridsize_; yloc = (int) y/gridsize_; yloc++; // no top grid if (yloc > gridY) return (-2); return(yloc*gridX+xloc); }

void NsObject::handle (  Event *   )  [protected, virtual, inherited]

Implements Handler. Reimplemented in LinkDelay, LL, AckRecons, and Snoop. Definition at line 91 of file object.cc. References NsObject::recv(). { recv((Packet*)e); } Here is the call graph for this function:

int God::hops (  int  i, int  j )

Definition at line 669 of file god.cc. References min_hops. Referenced by AODV::log_link_del(), AODV::log_link_kept(), toraAgent::log_lnk_del(), and toraAgent::log_lnk_kept(). { return min_hops[i * num_nodes + j]; }

void God::IncrRecv (   )

Definition at line 602 of file god.cc. References num_recv. Referenced by SinkAgent::recv(). { num_recv++; // printf("God: num_connect %d, num_alive_node %d at recv pkt %d\n", // num_connect, num_alive_node, num_recv); }

int God::initialized (   )  [inline]

Definition at line 131 of file god.h. References min_hops, num_nodes, and BiConnector::uptarget_. { return num_nodes && min_hops && uptarget_; }

static God* God::instance (   )  [inline, static]

Definition at line 136 of file god.h. References instance_. Referenced by MobileNode::command(), SinkAgent::command(), DiffusionRate::consider_new(), DiffusionProb::consider_new(), OmniMcastAgent::ConsiderNew(), FloodingAgent::ConsiderNew(), EnergyModel::DecrIdleEnergy(), EnergyModel::DecrRcvEnergy(), EnergyModel::DecrSleepEnergy(), EnergyModel::DecrTransitionEnergy(), EnergyModel::DecrTxEnergy(), GAFAgent::duty_timeout(), GAFAgent::GAFAgent(), OmniMcastAgent::GodForwardData(), DiffusionRate::InterestHandle(), AODV::log_link_del(), AODV::log_link_kept(), toraAgent::log_lnk_del(), toraAgent::log_lnk_kept(), OmniMcastAgent::MACsend(), FloodingAgent::MACsend(), DiffusionAgent::MACsend(), GAFAgent::makeUpDiscoveryMsg(), GAFAgent::processDiscoveryMsg(), SinkAgent::recv(), CMUTrace::recv(), GAFAgent::send_discovery(), SinkAgent::sendpkt(), and LandmarkAgent::startUp(). { assert(instance_); return instance_; }

int NsObject::isdebug (   )  const [inline, inherited]

Definition at line 61 of file object.h. References NsObject::debug_. { return debug_; }

bool God::IsNeighbor (  int  i, int  j )

Definition at line 464 of file god.cc. References a, b, vector::length(), mb_node, and RANGE. Referenced by ComputeW(). { assert(i<num_nodes && j<num_nodes); //printf("i=%d, j=%d\n", i,j); if (mb_node[i]->energy_model()->node_on() == false || mb_node[j]->energy_model()->node_on() == false || mb_node[i]->energy_model()->energy() <= 0.0 || mb_node[j]->energy_model()->energy() <= 0.0 ) { return false; } vector a(mb_node[i]->X(), mb_node[i]->Y(), mb_node[i]->Z()); vector b(mb_node[j]->X(), mb_node[j]->Y(), mb_node[j]->Z()); vector d = a - b; if (d.length() < RANGE) return true; else return false; } Here is the call graph for this function:

bool God::IsPartition (   )

Definition at line 548 of file god.cc. References SRC_TAB. Referenced by ComputeRoute(). { int dtype, i, j, k; int *oif_map; for (dtype = 0; dtype < num_data_types; dtype ++) { for (i = 0; i < num_nodes; i++) { if (SRC_TAB(dtype,i) == NULL) continue; oif_map = SRC_TAB(dtype, i); for (j = 0; j < num_nodes; j++) { for (k = 0; k < num_nodes; k++) { if (oif_map[j*num_nodes + k] != 0) return false; } } } } return true; }

bool God::IsReachable (  int  i, int  j )

Definition at line 453 of file god.cc. References NextHop(), and UNREACHABLE. Referenced by command(). { // if (MIN_HOPS(i,j) < UNREACHABLE && MIN_HOPS(i,j) >= 0) if (NextHop(i,j) != UNREACHABLE) return true; else return false; } Here is the call graph for this function:

int God::load_grid (  int  , int  , int  )

Definition at line 700 of file god.cc. References gridsize_, gridX, gridY, maxX, and maxY. Referenced by command(). { maxX = x; maxY = y; gridsize_ = size; // how many gridx in X direction gridX = (int)maxX/size; if (gridX * size < maxX) gridX ++; // how many grid in Y direcion gridY = (int)maxY/size; if (gridY * size < maxY) gridY ++; printf("Grid info:%d %d %d (%d %d)\n",maxX,maxY,gridsize_, gridX, gridY); return 0; }

int God::NextHop (  int  from, int  to )

Definition at line 95 of file god.cc. References active, NEXT_HOP, and num_nodes. Referenced by Fill_for_Sink(), Fill_for_Source(), and IsReachable(). { if (active == false) { perror("God is off.\n"); exit(-1); } if (from >= num_nodes) { perror("index from higher than the maximum number of nodes.\n"); return -1; } if (to >= num_nodes) { perror("index to higher than the maximum number of nodes.\n"); return -1; } return NEXT_HOP(from,to); }

int * God::NextOIFs (  int  dt, int  srcid, int  curid, int *  ret_num_oif )

Definition at line 416 of file god.cc. References active, count, and SRC_TAB. Referenced by OmniMcastAgent::GodForwardData(). { if (active == false) { perror("God is inactive.\n"); exit(-1); } int *oif_map = SRC_TAB(dt, srcid); int count=0; int i; for (i=0; i<num_nodes; i++) { if (oif_map[curid*num_nodes +i] == 1) count++; } *ret_num_oif = count; if (count == 0) return NULL; int *next_oifs = new int[count]; int j=0; for (i=0; i<num_nodes; i++) { if (oif_map[curid*num_nodes +i] == 1) { next_oifs[j] = i; j++; } } return next_oifs; }

int God::nodes (   )  [inline]

Definition at line 137 of file god.h. References num_nodes. Referenced by command(). { return num_nodes; }

void NsObject::recv (  Packet *  p, const char *  s )  [virtual, inherited]

Reimplemented in CMUTrace. Definition at line 96 of file object.cc. References Packet::free(). { Packet::free(p); } Here is the call graph for this function:

void God::recv (  Packet *  p, Handler *  h )  [virtual]

Reimplemented from BiConnector. Definition at line 694 of file god.cc. References abort(). { abort(); } Here is the call graph for this function:

virtual void NsObject::recvOnly (  Packet *   )  [inline, virtual, inherited]

Reimplemented in Agent, and Trace. Definition at line 56 of file object.h. Referenced by Trace::recvOnly(). {};

void NsObject::reset (   )  [protected, virtual, inherited]

Reimplemented in BayFullTcpAgent, HashClassifier, IvsSource, dsREDQueue, DiffusionRate, SinkAgent, DiffusionAgent, FloodingAgent, OmniMcastAgent, LinkDelay, CBQueue, DropTail, ErrorModel, PIQueue, Queue< T >, RedPDQueue, REDQueue, REMQueue, RIOQueue, Snoop, FackTcpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, Sack1TcpAgent, TcpSink, DelAckSink, TcpAgent, VegasTcpAgent, toraAgent, Queue< T >, and XcpSink. Definition at line 70 of file object.cc. Referenced by NsObject::command(). { }

void God::Rewrite_OIF_Map (   )

Definition at line 402 of file god.cc. References Fill_for_Sink(), and SRC_TAB. Referenced by ComputeRoute(). { for (int dt = 0; dt < num_data_types; dt++) { for (int src = 0; src < num_nodes; src++) { if (SRC_TAB(dt, src) == NULL) continue; memset(SRC_TAB(dt,src),'\x00', sizeof(int) * num_nodes * num_nodes); Fill_for_Sink(dt, src); } } } Here is the call graph for this function:

virtual void BiConnector::sendDown (  Packet *  p, Handler *  h )  [inline, protected, virtual, inherited]

Reimplemented in Mac802_3, and Mac802_15_4. Definition at line 55 of file bi-connector.h. References BiConnector::downtarget_, and NsObject::recv(). Referenced by BiConnector::recv(). { downtarget_->recv(p, h); } Here is the call graph for this function:

virtual void BiConnector::sendUp (  Packet *  p, Handler *  h )  [inline, protected, virtual, inherited]

Reimplemented in Mac802_3. Definition at line 57 of file bi-connector.h. References NsObject::recv(), and BiConnector::uptarget_. Referenced by BiConnector::recv(). { uptarget_->recv(p, h); } Here is the call graph for this function:

void God::stampPacket (  Packet *  p  )

Definition at line 676 of file god.cc. References hdr_ip::daddr(), p_info::data_packet(), hdr_ip::dst(), HDR_CMN, HDR_IP, min_hops, hdr_cmn::opt_num_forwards(), packet_info, hdr_cmn::ptype(), hdr_ip::saddr(), and hdr_ip::src(). Referenced by CMUTrace::recv(). { hdr_cmn *ch = HDR_CMN(p); struct hdr_ip *ih = HDR_IP(p); nsaddr_t src = ih->saddr(); nsaddr_t dst = ih->daddr(); assert(min_hops); if (!packet_info.data_packet(ch->ptype())) return; if (dst > num_nodes || src > num_nodes) return; // broadcast pkt ch->opt_num_forwards() = min_hops[src * num_nodes + dst]; } Here is the call graph for this function:

void God::StopSimulation (   )

Definition at line 611 of file god.cc. References NOW. Referenced by ComputeRoute(). { Tcl& tcl=Tcl::instance(); printf("Network parition !! Exiting... at time %f\n", NOW); tcl.evalf("[Simulator instance] at %lf \"finish\"", (NOW)+0.000001); tcl.evalf("[Simulator instance] at %lf \"[Simulator instance] halt\"", (NOW)+0.000002); }

void God::UpdateNodeStatus (   )

Definition at line 153 of file god.cc. References count, node_status, num_data_types, and SRC_TAB. Referenced by command(). { int i,j; int count, cur, sk, srcid, dt; for (i=0; i<num_data_types; i++) { for (j=0; j<num_nodes; j++) { if (SRC_TAB(i,j) != NULL) { node_status[j].is_source_ = true; } } } for (i=0; i<num_data_types; i++) { for (j=0; j<num_nodes; j++) { if (SK_TAB(i,j) > 0) { node_status[j].is_sink_ = true; } } } for (dt=0; dt < num_data_types; dt++) { for (srcid=0; srcid < num_nodes; srcid++) { if (SRC_TAB(dt,srcid) == NULL) continue; for (sk = 0; sk < num_nodes; sk++) { if (SK_TAB(dt, sk) == 0) continue; cur = srcid; count = 0; node_status[cur].is_on_trees_ = true; while (cur != sk) { if (NextHop(cur, sk) == UNREACHABLE) break; assert(NextHop(cur,sk) >= 0 && NextHop(cur, sk) < num_nodes); cur = NextHop(cur, sk); node_status[cur].is_on_trees_ = true; count ++; assert(count < num_nodes); } } } } Dump(); DumpNodeStatus(); }

NsObject* BiConnector::uptarget (   )  [inline, inherited]

Definition at line 48 of file bi-connector.h. References BiConnector::uptarget_. { return uptarget_; }

---

Field Documentation

bool God::active [private]

Definition at line 216 of file god.h. Referenced by AddSink(), AddSource(), command(), ComputeNextHop(), ComputeRoute(), God(), NextHop(), and NextOIFs().

bool God::allowTostop [private]

Definition at line 217 of file god.h. Referenced by command(), ComputeRoute(), and God().

int God::data_pkt_size

Definition at line 146 of file god.h. Referenced by SinkAgent::command(), God(), OmniMcastAgent::MACsend(), FloodingAgent::MACsend(), and DiffusionAgent::MACsend().

int NsObject::debug_ [protected, inherited]

Reimplemented in FECModel, FloodAgent, and LandmarkAgent. Definition at line 66 of file object.h. Referenced by REDQueue::command(), RedPDQueue::command(), PushbackQueue::command(), NsObject::debug(), NsObject::delay_bind_dispatch(), PushbackQueue::enque(), NsObject::isdebug(), NsObject::NsObject(), TfrcAgent::recv(), PushbackQueue::reportDrop(), SctpAgent::Reset(), REDQueue::reset(), DropTail::shrink_queue(), and Delayer::try_send().

NsObject* BiConnector::downtarget_ [protected, inherited]

Definition at line 63 of file bi-connector.h. Referenced by Phy::command(), BiConnector::command(), BiConnector::downtarget(), WirelessPhy::initialized(), WiredPhy::initialized(), Mac::initialized(), FECModel::recv(), MacTdma::send(), UnslottedAlohaMac::sendDown(), SatMac::sendDown(), Mac::sendDown(), BiConnector::sendDown(), SMAC::transmit(), Mac802_11::transmit(), and MacSimple::waitHandler().

NsObject* BiConnector::drop_ [protected, inherited]

Definition at line 64 of file bi-connector.h. Referenced by BiConnector::command(), and BiConnector::drop().

Data_Hash_Table God::dtab

Definition at line 156 of file god.h. Referenced by CountNewData().

int God::gridsize_ [private]

Definition at line 227 of file god.h. Referenced by getGrid(), getMyBottomGrid(), getMyGrid(), getMyGridSize(), getMyLeftGrid(), getMyRightGrid(), getMyTopGrid(), and load_grid().

int God::gridX [private]

Definition at line 228 of file god.h. Referenced by getMyBottomGrid(), getMyGrid(), getMyLeftGrid(), getMyRightGrid(), getMyTopGrid(), and load_grid().

int God::gridY [private]

Definition at line 229 of file god.h. Referenced by getMyTopGrid(), and load_grid().

God * God::instance_ [static, private]

Definition at line 211 of file god.h. Referenced by command(), and instance().

int God::maxX [private]

Definition at line 225 of file god.h. Referenced by getGrid(), getMyBottomGrid(), getMyGrid(), getMyLeftGrid(), getMyRightGrid(), getMyTopGrid(), and load_grid().

int God::maxY [private]

Definition at line 226 of file god.h. Referenced by getGrid(), getMyBottomGrid(), getMyGrid(), getMyLeftGrid(), getMyRightGrid(), getMyTopGrid(), and load_grid().

MobileNode** God::mb_node [private]

Definition at line 218 of file god.h. Referenced by command(), CountAliveNode(), God(), and IsNeighbor().

int* God::min_hops [private]

Definition at line 208 of file god.h. Referenced by command(), ComputeW(), Dump(), God(), hops(), initialized(), and stampPacket().

int* God::next_hop [private]

Definition at line 221 of file god.h. Referenced by command(), and God().

NodeStatus* God::node_status [private]

Definition at line 220 of file god.h. Referenced by command(), DumpNodeStatus(), and UpdateNodeStatus().

int God::num_alive_node

Definition at line 147 of file god.h. Referenced by CountAliveNode(), and God().

int God::num_compute

Definition at line 150 of file god.h. Referenced by ComputeRoute(), and God().

int God::num_connect

Definition at line 148 of file god.h. Referenced by CountConnect(), and God().

int God::num_data_types

Definition at line 152 of file god.h. Referenced by command(), God(), and UpdateNodeStatus().

int God::num_nodes [private]

Definition at line 207 of file god.h. Referenced by ComputeNextHop(), ComputeW(), floyd_warshall(), God(), initialized(), NextHop(), and nodes().

int God::num_recv

Definition at line 149 of file god.h. Referenced by God(), and IncrRecv().

int* God::num_send

Definition at line 155 of file god.h. Referenced by command(), CountNewData(), DumpNumSend(), and God().

double God::prev_time

Definition at line 151 of file god.h. Referenced by command(), ComputeRoute(), and God().

int* God::sink_table

Definition at line 154 of file god.h. Referenced by command(), and God().

int** God::source_table

Definition at line 153 of file god.h. Referenced by command(), and God().

NsObject* BiConnector::uptarget_ [protected, inherited]

Definition at line 60 of file bi-connector.h. Referenced by BiConnector::command(), Phy::dump(), UnslottedAlohaMac::end_of_contention(), WirelessPhy::initialized(), WiredPhy::initialized(), Mac::initialized(), initialized(), Mac802_15_4::MCPS_DATA_indication(), Phy802_15_4::PD_DATA_indication(), RepeaterPhy::recv(), Phy::recv(), MacTdma::recvDATA(), SMAC::rxMsgDone(), SatMac::sendUp(), Mac::sendUp(), BiConnector::sendUp(), and BiConnector::uptarget().

---

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

• god.h
• god.cc

---