00001 /* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */ 00002 /* 00003 * Copyright (c) 1997 Regents of the University of California. 00004 * All rights reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 1. Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * 2. Redistributions in binary form must reproduce the above copyright 00012 * notice, this list of conditions and the following disclaimer in the 00013 * documentation and/or other materials provided with the distribution. 00014 * 3. All advertising materials mentioning features or use of this software 00015 * must display the following acknowledgement: 00016 * This product includes software developed by the Computer Systems 00017 * Engineering Group at Lawrence Berkeley Laboratory. 00018 * 4. Neither the name of the University nor of the Laboratory may be used 00019 * to endorse or promote products derived from this software without 00020 * specific prior written permission. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00023 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00024 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00025 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00026 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00027 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00028 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00029 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00031 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00032 * SUCH DAMAGE. 00033 */ 00034 /* Ported from CMU/Monarch's code*/ 00035 00036 /* -*- c++ -*- 00037 rexmit_queue.h 00038 $Id: rxmit_queue.h,v 1.4 2002/05/06 22:23:15 difa Exp $ 00039 */ 00040 00041 #ifndef imep_rexmit_queue_h 00042 #define imep_rexmit_queue_h 00043 00044 #include <packet.h> 00045 #include "lib/bsd-list.h" 00046 00047 typedef double Time; 00048 00049 struct rexent { 00050 double rexmit_at; 00051 int rexmits_left; 00052 Packet *p; 00053 LIST_ENTRY(struct rexent) next; 00054 }; 00055 00056 LIST_HEAD(rexent_head, rexent); 00057 00058 class ReXmitQ; 00059 00060 class ReXmitQIter { 00061 friend class ReXmitQ; 00062 00063 public: 00064 inline Packet * next() { 00065 if (0 == iter) return 0; 00066 struct rexent *t = iter; 00067 iter = iter->next.le_next; 00068 return t->p; 00069 } 00070 00071 private: 00072 ReXmitQIter(rexent *r) : iter(r) {}; 00073 struct rexent * iter; 00074 }; 00075 00076 class ReXmitQ { 00077 public: 00078 ReXmitQ(); 00079 00080 void insert(Time rxat, Packet *p, int num_rexmits); 00081 void peekHead(Time *rxat, Packet **pp, int *rexmits_left); 00082 void removeHead(); 00083 void remove(Packet *p); 00084 inline ReXmitQIter iter() { 00085 return ReXmitQIter(head.lh_first); 00086 } 00087 00088 private: 00089 rexent_head head; 00090 }; 00091 00092 #endif