Menu

DuplicateChecker.h

Go to the documentation of this file.
00001 /*******************************************************************************
00002  *
00003  * Copyright (c) 2009-2010 Philipp Werner <philipp.werner@st.ovgu.de>
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  *
00010  *    * Redistributions of source code must retain the above copyright
00011  *      notice, this list of conditions and the following disclaimer.
00012  *
00013  *    * Redistributions in binary form must reproduce the above copyright
00014  *      notice, this list of conditions and the following disclaimer in
00015  *      the documentation and/or other materials provided with the
00016  *      distribution.
00017  *
00018  *    * Neither the name of the copyright holders nor the names of
00019  *      contributors may be used to endorse or promote products derived
00020  *      from this software without specific prior written permission.
00021  *
00022  *
00023  *    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
00024  *    IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
00025  *    TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
00026  *    PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
00027  *    OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00028  *    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
00029  *    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
00030  *    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
00031  *    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00032  *    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
00033  *    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00034  *
00035  *
00036  * $Id$
00037  *
00038  ******************************************************************************/
00039 
00040 
00041 #ifndef __DUPLICATECHECKER_H_D61F11F89E744A__
00042 #define __DUPLICATECHECKER_H_D61F11F89E744A__
00043 
00044 
00045 #include "debug.h"
00046 #include "mw/afp/defrag/detail/BitArray.h"
00047 
00048 
00049 namespace famouso {
00050     namespace mw {
00051         namespace afp {
00052             namespace defrag {
00053 
00054 
00062                 template <class DCP>
00063                 class DuplicateChecker {
00064 
00066                         detail::BitArray<DCP::max_fragments, typename DCP::Allocator> fragment_arrived;
00067 
00068                     public:
00069 
00075                         bool new_fragment(const Headers<DCP> & header) {
00076                             if (fragment_arrived.size() <= header.fseq) {
00077                                 // This will be called as rarely as reordering happens, because
00078                                 // fragments with highest fseq are sent first.
00079                                 if (!fragment_arrived.resize(header.fseq + 1)) {
00080                                     // Can not allocate memory for duplicate checking.
00081                                     // -> can not guarantee service
00082                                     // -> mark fragment as duplicate to drop it (avoid
00083                                     //    incorrect reassembly)
00084                                     ::logging::log::emit< ::logging::Warning>()
00085                                         << PROGMEMSTRING("AFP: Out of memory -> drop")
00086                                         << ::logging::log::endl;
00087                                     return false;
00088                                 }
00089                             }
00090 
00091                             detail::Bit fa = fragment_arrived[header.fseq];
00092                             if (fa.value() == true) {
00093                                 return false;
00094                             } else {
00095                                 fa.set();
00096                                 return true;
00097                             }
00098                         }
00099                 };
00100 
00101 
00102             } // namespace defrag
00103         } // namespace afp
00104     } // namespace mw
00105 } // namespace famouso
00106 
00107 
00108 #endif // __DUPLICATECHECKER_H_D61F11F89E744A__
00109