/***************************************************************************************************IBM Public License Version 1.0 **THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS IBM PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. **1. DEFINITIONS **"Contribution" means: **       a) in the case of International Business Machines Corporation ("IBM"), the Original Program, and **       b) in the case of each Contributor, **       i) changes to the Program, and**       ii) additions to the Program;**       where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it*       was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are*       separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program.**  "Contributor" means IBM and any other entity that distributes the Program. **  "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the*  Program. **  "Original Program" means the original version of the software accompanying this Agreement as released by IBM, including source code, object code and documentation, if*  any. **  "Program" means the Original Program and Contributions. **  "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. **  2. GRANT OF RIGHTS **       a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare*       derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code*       and object code form.**       b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to*       make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall*       apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes*       such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per*       se is licensed hereunder. **       c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that*       the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought*       by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each*       Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to*       allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program.**       d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this*       Agreement. **  3. REQUIREMENTS **  A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: **       a) it complies with the terms and conditions of this Agreement; and**       b) its license agreement:**       i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement,*       and implied warranties or conditions of merchantability and fitness for a particular purpose; **       ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost*       profits; **       iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and**       iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium*       customarily used for software exchange. **  When the Program is made available in source code form: **       a) it must be made available under this Agreement; and **       b) a copy of this Agreement must be included with each copy of the Program. **  Each Contributor must include the following in a conspicuous location in the Program: **       Copyright ?{date here}, International Business Machines Corporation and others. All Rights Reserved. **  In addition, each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator*  of the Contribution. **  4. COMMERCIAL DISTRIBUTION **  Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the*  commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability*  for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend*  and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal*  actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its*  distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual*  property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial*  Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in*  any such claim at its own expense. **  For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial*  Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's*  responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and*  warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. **  5. NO WARRANTY **  EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY*  KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT,*  MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the*  Program and assumes all risks associated with its exercise of rights under this Agreement, including but not limited to the risks and costs of program errors, compliance with*  applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. **  6. DISCLAIMER OF LIABILITY **  EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT,*  INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), 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 OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF*  SUCH DAMAGES. **  7. GENERAL **  If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this*  Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. **  If Recipient institutes patent litigation against a Contributor with respect to a patent applicable to software (including a cross-claim or counterclaim in a lawsuit), then any*  patent licenses granted by that Contributor to such Recipient under this Agreement shall terminate as of the date such litigation is filed. In addition, If Recipient institutes*  patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other*  software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. **  All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a*  reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and*  distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the*  Program shall continue and survive. **  IBM may publish new versions (including revisions) of this Agreement from time to time. Each new version of the Agreement will be given a distinguishing version number. The*  Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the*  Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. No one other than IBM has the right to modify this*  Agreement. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this*  Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. **  This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a*  legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. **********************************************************************************************************************//* Class Baseband: Simulates the following from the Bluetooth baseband specifications   (1) Frequency Hopping Kernel (79 hop)   (2) Error Model   (3) Inquiry and Paging procedures   (4) Transmission and reception of baseband packets   (5) Interference from other piconets (disabled in this version since only        single piconet considered) */#include "bt-core.h"#include "trace.h"int hdr_bt::offset_;int Baseband::firsttime_ = 1;#define HDR_BT(p)	(hdr_bt::access(p))static class BTHeaderClass : public PacketHeaderClass {public:	BTHeaderClass() : PacketHeaderClass("PacketHeader/BT", sizeof(hdr_bt)) {		bind_offset(&hdr_bt::offset_);	}} class_bthdr;static class BasebandClass : public TclClass {public:	BasebandClass() : TclClass("Baseband"){}	TclObject* create( int, const char*const*) {	 	return ( new Baseband );	}} class_baseband;Baseband::Baseband(): clkn_handler_(this), clk_handler_(this), recv_handler_(this), tx_handler_(this), tdd_handler_(this), int_recv_handler_(this), clkn_(0), clk_(0), clke_(0), clkf_(0), new_am_addr_(0){	bind("bd_addr_", &bd_addr_);		bind("giac_", &giac_);		bind("dac_", &dac_);		bind("masterIndex_", &masterIndex_);		bind("isOffset_", &isOffset_);	bind("seed_", &seed_);	bind("xpos_", &xpos_);	bind("ypos_", &ypos_);	bind("namTrace_", &namTrace_);	/* Create queues for simulating collisions */	interfererQ_ = new PacketQueue();	potinterfererQ_ = new PacketQueue();	requestQ_ = new queue<ConnectionRequest*>;	/* Initialize timers */	txTimer_ = 0;	inqTimer_ = inqscanTimer_ = inqbackoffTimer_ = inqrespTimer_ = 0;		pageTimer_ = pagescanTimer_ = pagerespTimer_ = newConnectionTimer_ = 0;	/* Initialize counters */	Nmr_ = Nsr_ = Nfhs_ = 0;	Nsr_incr_offset_ = 0;	numId_ = numTrainsSent_ = 0;	lastPaged_ = 0;	freeze_ = 0;	polled_ = 0;	am_addr_ = 0;	trainType_ = A;	state_ = STANDBY;	prev_state_ = STANDBY;	tddState_ = IDLE;	tx_clock_ = CLKN;	numACLlinks_ = 0;	linkq_ = new LMP*[7];		for (int i=0; i<8; i++)		active_list_[i] = 0;}// Instproc-likes for Baseband classint Baseband::command(int argc, const char*const* argv){	Tcl& tcl = Tcl::instance();	if (argc == 3) {		if (strcmp(argv[1], "bthost") == 0) {			bthost_ = (BTHost*)TclObject::lookup(argv[2]);		 	return (TCL_OK);		}	}	if (argc == 4) {		/*		 * $lm install-linkq $slot $linkq		 */		if (strcmp(argv[1], "install-linkq") == 0) {			int slot = atoi(argv[2]);			linkq_[slot] = (LMP*)TclObject::lookup(argv[3]);			return (TCL_OK);		}	}	return (BiConnector::command(argc, argv));}// Called by bthost when '$ns at time "$bthost start"' is executed in Tcl scriptvoidBaseband::start(){	Scheduler& s = Scheduler::instance();	if (!masterIndex_) {		inqscanTimer_ = -isOffset_;		pagescanTimer_ = inqscanTimer_ - 3500;			//Check	}	clkn_ = 0;    								//Check	s.schedule (&clkn_handler_, &clkn_ev_, ClockTick);}// Handles all the events synchronized with a CLKN tick (tick = 312.5usec)void CLKNHandler::handle (Event* e){	Scheduler& s = Scheduler::instance();	ConnectionRequest* cr; 	Packet* p;	// update clkn and clke (used in paging) if required	lm_->clkn_++;	if (lm_->clke_)		lm_->clke_++;	int clkmod4 = lm_->clkn_%4;		/* Handle timer events */	/* Timers common to master and slaves */	if (lm_->pagerespTimer_) {  		if (lm_->masterIndex_ && clkmod4 == 0) lm_->Nmr_++;		else if (lm_->masterIndex_ == 0) {			if (lm_->Nsr_ == 0) {				lm_->Nsr_ = 1;				lm_->Nsr_incr_offset_ = clkmod4;			}			else if (clkmod4 == lm_->Nsr_incr_offset_) 				lm_->Nsr_++;		}	}		/* Timers used by the master */	if (lm_->masterIndex_) {		/* Inquiry and page timouts */		if (lm_->state_ == INQUIRY && --(lm_->inqTimer_) == 0) {			lm_->initInqPageParam();			lm_->bthost_->HCI_Inquiry_Result(lm_->addr_vec_);			lm_->changeState(lm_->prev_state_);		}		if (lm_->state_ == PAGE && --(lm_->pageTimer_) == 0) {			lm_->initInqPageParam();			lm_->bthost_->HCI_Connection_Complete_Event(-1);			lm_->changeState(lm_->prev_state_);		}	} else {		/* Timers used by slaves */			/* Timeouts related to inquiry scan and page scan */			if (++(lm_->inqscanTimer_) == TwInqScan) {			lm_->inqscanTimer_ = -TinqScan;			if ((lm_->state_ == INQ_SCAN) && !(lm_->freeze_)) {				lm_->changeState(lm_->prev_state_);			}		}				if (++(lm_->pagescanTimer_) == TwPageScan) {			lm_->pagescanTimer_ = -TpageScan;			if (lm_->state_ == PAGE_SCAN)				lm_->changeState(lm_->prev_state_);		}				if (lm_->inqscanTimer_ == 0 && lm_->state_ == STANDBY && !(lm_->inqbackoffTimer_)) {			lm_->prev_state_ = lm_->state_;			lm_->changeState(INQ_SCAN);		}		if (lm_->pagescanTimer_ == 0 && (lm_->state_ == STANDBY)) {			lm_->prev_state_ = lm_->state_;			lm_->changeState(PAGE_SCAN);		}		/* Random backoff timeout in inquiry response procedure */		if (lm_->inqbackoffTimer_) { 			if (--(lm_->inqbackoffTimer_) == 0) {				lm_->prev_state_ = lm_->state_;				lm_->changeState(INQ_RESP);			}		}			}	/* Transmit timer */		if (lm_->txTimer_ && lm_->tx_clock_ == CLKN) {			if (--(lm_->txTimer_) == 0) 			lm_->tddState_ = IDLE;	}	/* Page response timeout */	if (lm_->pagerespTimer_ ) {		if (--(lm_->pagerespTimer_) == 0) {			if (lm_->masterIndex_ && lm_->pageTimer_) {				lm_->changeState(PAGE);				lm_->freeze_ = 0;				lm_->Nmr_ = 0;			}			else if (lm_->masterIndex_ == 0) {				lm_->changeState(lm_->prev_state_);				lm_->freeze_ = 0;				lm_->Nsr_ = 0;			}						}	}	/* Inquiry Response timeout */	if (lm_->inqrespTimer_) {		if (--(lm_->inqrespTimer_) == 0) 			lm_->handleInqRespTO();	}	/* New connection timer timeout */	if (lm_->newConnectionTimer_) {		if (--(lm_->newConnectionTimer_) == 0) {			if (lm_->masterIndex_) {				if (lm_->pageTimer_) 					lm_->changeState(PAGE);				else 					lm_->changeState(lm_->prev_state_);			}			else 				lm_->changeState(lm_->prev_state_);		}	}	/* If no packet is being transmitted or received try to transmit one*/	/* For master transmissions only since tx_clock_ = CLKN */	if (lm_->tddState_ == IDLE && lm_->tx_clock_ == CLKN) {		if (lm_->state_ == PAGE) {			/* Send two ID packets per even slot */			if (clkmod4 < 2) 				lm_->sendIDPacket(lm_->page_addr_);		}				/* Find if a Page request is pending */		else if ((lm_->state_ == CONNECTION || lm_->state_ == STANDBY) && !(lm_->requestQ_->empty())) {			if (lm_->numACLlinks_ < 7) { 				cr = lm_->requestQ_->front();				lm_->requestQ_->pop();				lm_->prev_state_ = lm_->state_;				lm_->changeState(PAGE);				lm_->pageTimer_ = PageTO;				lm_->clke_ =  lm_->clkn_ - cr->clock_offset;				lm_->page_addr_ = cr->bd_addr;				if (clkmod4 <2) 					lm_->sendIDPacket(lm_->page_addr_);			}		}			else if (lm_->state_ == INQUIRY) {			/* Send two ID packets per even slot */			if (clkmod4 < 2) 				lm_->sendIDPacket(lm_->giac_);		}		else if (lm_->state_ == MASTER_RESP && clkmod4 == 0) {			/* Follow master response page procedure */			if (!(lm_->pagerespTimer_)) {				lm_->Nmr_ = 1;				lm_->pagerespTimer_ = PageRespTO;			}			lm_->sendFHSPacket();		}		else if (lm_->newConnectionTimer_ && clkmod4 == 0) {			/* Send POLL packet to the new connection with a new am_addr */			if (lm_->new_am_addr_==0) lm_->getAM_ADDR();			if (lm_->new_am_addr_ < 8) 				lm_->sendPOLLPacket(lm_->new_am_addr_);		}				else if (lm_->state_ == CONNECTION && clkmod4 == 0) {			/* Call Scheduler's schedule_next() function to get next packet */			BT_DRRScheduler* sched = (BT_DRRScheduler*)(lm_->uptarget_);			Packet* pkt = sched->schedule_next();			if (pkt) 				lm_->sendPacket(pkt);		}	}		s.schedule (this, e, ClockTick);}		voidCLKHandler::handle(Event * e) {	Scheduler& s = Scheduler::instance();	Packet* p;	int clkmod4;	if (lm_->clk_) 			lm_->clk_++;	clkmod4 = lm_->clk_%4;		/* Handle timer events */	/* Transmit timer */		if (lm_->txTimer_ && lm_->tx_clock_ == CLK) {			if (--(lm_->txTimer_) == 0) 			lm_->tddState_ = IDLE;	}		/* If no packet is being transmitted or received try to transmit one */	/* Slave transmissions */	if (lm_->tddState_ == IDLE && lm_->tx_clock_ == CLK) {				/* Send inquiry reponse (FHS packet) */		if (lm_->state_ == INQ_RESP) {			lm_->sendFHSPacket();			lm_->changeState(INQ_SCAN);