// $Id$
//
-// Copyright (C) 2007
-// Fraunhofer Institute for Open Communication Systems (FOKUS)
-// Competence Center NETwork research (NET), St. Augustin, GERMANY
+// 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
\brief PacketImpl inline non-template implementation */
// Custom includes
-#include "PacketInterpreter.hh"
+#include "../Utils/senfassert.hh"
+// #include "PacketInterpreter.hh"
#define prefix_ inline
///////////////////////////////cci.p///////////////////////////////////////
// Memory management:
-//
+//
// * The PacketImpl destructor will *explicitly* clean-up the interpreters_ list by removing
// each element from the list and deleting it if it's (intrusive) refcount is 0
// * The PacketInterpreters use safe hooks -> they know wether they are part of a list or not
refcount_ += n;
}
-prefix_ void senf::detail::PacketImpl::release(refcount_t n)
-{
- BOOST_ASSERT(refcount_ >= n);
- // uah ... we need to be extremely careful here. If refcount_ is n, we want to commit suicide,
- // however the destructor will remove all PacketInterpreters from the list and will thereby
- // decrement refcount -> only decrenebt refcount_ when *not* caling delete
- if (refcount_ == n)
- delete this;
- else
- refcount_ -= n;
-}
-
prefix_ senf::detail::PacketImpl::refcount_t senf::detail::PacketImpl::refcount()
const
{
}
prefix_ senf::PacketInterpreterBase * senf::detail::PacketImpl::prev(PacketInterpreterBase * p)
-{
+{
interpreter_list::iterator i (interpreter_list::current(*p));
return (i == interpreters_.begin()) ? 0 : &*(--i);
}