Newer
Older
// Copyright (C) 2007
// Fraunhofer Institute for Open Communication Systems (FOKUS)
// Competence Center NETwork research (NET), St. Augustin, GERMANY
// Stefan Bund <g0dil@berlios.de>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the
// Free Software Foundation, Inc.,
// 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
/** \file
\brief PacketImpl non-inline non-template implementation */
//#include "PacketImpl.ih"
// Custom includes
#include <iterator>
#include "Packets.hh"
//#include "PacketImpl.mpp"
#define prefix_
///////////////////////////////cc.p////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////
// senf::detail::AnnotationIndexerBase
unsigned senf::detail::AnnotationIndexerBase::maxAnnotations (0);
prefix_ void senf::detail::AnnotationIndexerBase::dump(PacketImpl * p, std::ostream & os)
{
for(std::vector<AnnotationIndexerBase*>::const_iterator
i (registry().begin()), i_end (registry().end());
i != i_end; ++i)
(*i)->v_dump(p,os);
}
///////////////////////////////////////////////////////////////////////////
// senf::detail::PacketImpl
prefix_ senf::detail::PacketImpl::~PacketImpl()
{
// We increment refcount_ to ensure, release() won't call delete again
++refcount_;
eraseInterpreters(interpreters_.begin(), interpreters_.end());
Annotations::const_iterator i (annotations_.begin());
Annotations::const_iterator const i_end (annotations_.end());
std::vector<bool>::iterator small (AnnotationIndexerBase::small().begin());
for (; i != i_end; ++i, ++small)
}
// interpreter chain
prefix_ void senf::detail::PacketImpl::appendInterpreter(PacketInterpreterBase * p)
{
interpreters_.push_back(*p);
p->assignImpl(this);
}
prefix_ void senf::detail::PacketImpl::prependInterpreter(PacketInterpreterBase * p)
{
interpreters_.push_front(*p);
p->assignImpl(this);
}
// Data container
prefix_ void senf::detail::PacketImpl::clear(PacketData * self)
{
PacketInterpreterBase * n (next(static_cast<PacketInterpreterBase*>(self)));
if (n)
truncateInterpreters(n);
iterator first (boost::next(begin(),self->begin_));
data_.erase(first, boost::next(begin(),self->end_));
updateIterators(self,self->begin_,-self->size());
}
// private members
prefix_ void senf::detail::PacketImpl::eraseInterpreters(interpreter_list::iterator b,
interpreter_list::iterator e)
{
while (b!=e) {
interpreter_list::iterator i (b++);
PacketInterpreterBase * p (&(*i));
interpreters_.erase(i);
p->releaseImpl(); // might call PacketImpl::release and might delete p
}
}
prefix_ void senf::detail::PacketImpl::updateIterators(PacketData * self, difference_type pos,
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
difference_type n)
{
// I hate to change the PacketData representation from here, I would have preferred to let
// PacketData have authority over this but trying that just get's to convoluted so I choose the
// simple solution and made PacketImpl a friend of PacketData.
interpreter_list::iterator i (interpreters_.begin());
// There are three types of packets
// a) Those which come before 'self' in the interpreter chain
// b) 'self'
// c) Those that come afterwards
// For a), the change must be inside the packet since 'self' must be within those packets
// For b), the change must also be within since that's the packet we are changeing
// For c), the change must be outside the packet (we don't allow an upper packet to mess with
// the the data owned by a packet further down the chain). It can be before or after the
// packet.
// a)
for (; &(*i) != static_cast<PacketInterpreterBase*>(self); ++i) i->end_ += n;
// b)
i->end_ += n;
// c)
interpreter_list::iterator const i_end (interpreters_.end());
if (++i != i_end)
if (pos <= difference_type(i->begin_))
// pos is before the packet, it must then be before all futher packets ...
for (; i != i_end; ++i) {
i->begin_ += n;
i->end_ += n;
}
// else pos is after the packet and we don't need to change anything ...
}
///////////////////////////////cc.e////////////////////////////////////////
#undef prefix_
//#include "PacketImpl.mpp"
// Local Variables:
// mode: c++
// fill-column: 100
// c-file-style: "senf"
// indent-tabs-mode: nil
// ispell-local-dictionary: "american"
// compile-command: "scons -u test"
// comment-column: 40