X-Git-Url: http://g0dil.de/git?a=blobdiff_plain;f=senf%2FPackets%2FDefaultBundle%2FListOptionTypeParser.cti;h=48b16510e0bdaa971dbe5e33393fbd1541374f8e;hb=HEAD;hp=7c0e324e0b328eb669fd83d7e03a47ca057b65a0;hpb=3e7160dbb6e67038c78594c85c48d25b6c787d5f;p=senf.git diff --git a/senf/Packets/DefaultBundle/ListOptionTypeParser.cti b/senf/Packets/DefaultBundle/ListOptionTypeParser.cti index 7c0e324..48b1651 100644 --- a/senf/Packets/DefaultBundle/ListOptionTypeParser.cti +++ b/senf/Packets/DefaultBundle/ListOptionTypeParser.cti @@ -1,24 +1,29 @@ -// $Id: ListOptionTypeParser.cti 869 2008-06-09 13:57:27Z pug $ +// $Id$ // // Copyright (C) 2009 // Fraunhofer Institute for Open Communication Systems (FOKUS) -// Competence Center NETwork research (NET), St. Augustin, GERMANY -// Philipp.Batroff@fokus.fraunhofer.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. +// The contents of this file are subject to the Fraunhofer FOKUS Public License +// Version 1.0 (the "License"); you may not use this file except in compliance +// with the License. You may obtain a copy of the License at +// http://senf.berlios.de/license.html // -// 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. +// The Fraunhofer FOKUS Public License Version 1.0 is based on, +// but modifies the Mozilla Public License Version 1.1. +// See the full license text for the amendments. // -// 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. +// Software distributed under the License is distributed on an "AS IS" basis, +// WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License +// for the specific language governing rights and limitations under the License. +// +// The Original Code is Fraunhofer FOKUS code. +// +// The Initial Developer of the Original Code is Fraunhofer-Gesellschaft e.V. +// (registered association), Hansastraße 27 c, 80686 Munich, Germany. +// All Rights Reserved. +// +// Contributor(s): +// Philipp Batroff /** \file \brief ListOptionTypeParser inline template implementation */ @@ -28,9 +33,9 @@ // Custom includes #define prefix_ inline -///////////////////////////////cti.p/////////////////////////////////////// +//-///////////////////////////////////////////////////////////////////////////////////////////////// -/////////////////////////////////////////////////////////////////////////// +//-///////////////////////////////////////////////////////////////////////////////////////////////// // senf::detail::ListOptionTypeParser_Policy template @@ -44,7 +49,7 @@ template prefix_ senf::detail::ListOptionTypeParser_Policy:: ListOptionTypeParser_Policy(Arg const & arg) - : AuxPolicy(arg) + : AuxPolicy(arg) {} template @@ -80,7 +85,7 @@ senf::detail::ListOptionTypeParser_Policy::init(data_it AuxPolicy::aux(0, i, s); } -/////////////////////////////////////////////////////////////////////////// +//-///////////////////////////////////////////////////////////////////////////////////////////////// // senf::detail::ListOptionTypeParser_Policy //constructor @@ -88,7 +93,7 @@ template prefix_ senf::detail::ListOptionTypeParser_Policy::container_policy:: container_policy(parser_policy const & p) - : AuxPolicy(p) + : AuxPolicy(p) {} //destructor @@ -108,12 +113,16 @@ construct(container_type & c) realAux_ = (AuxPolicy::aux(i, c.state()) * 8) + 6; safe_data_iterator e = i + realAux_; for (n_ = 0; i != e;) { - unsigned int elByte = senf::bytes(ElementParser(i, c.state())); + size_type elByte; + if (i[0] == 0u) + elByte = 1; + else + elByte = senf::bytes(ElementParser(i, c.state())); if (((i + elByte) == e) && (i[0] == 0u || i[0] == 1u)) { //check weather last element is padding or not realAux_ -= std::distance(i, e); c.data().erase(i, e); //delete padding e = i; //set end iterator - } else{ + } else { ++n_; std::advance(i, elByte); } @@ -133,7 +142,7 @@ destruct(container_type & c) unsigned int padBytes = 0; if (realAux_ == 0) //if list is empty, 6 padding bytes required! padBytes = 6; - else{ + else { padBytes = ( (realAux_+2) % 8); if (padBytes != 0) padBytes = 8 - padBytes; @@ -221,7 +230,7 @@ update(container_type const & c) return; data_iterator i(AuxPolicy::adjust(c.i(), c.state())); data_iterator j(i); - for (size_type n(n_); n; --n, std::advance(j, senf::bytes(ElementParser(j,c.state())))); + for (size_type n(n_); n; --n, std::advance(j, senf::bytes(ElementParser(j,c.state())))) { ; } realAux_ = std::distance(i, j); container_size_ = c.data().size(); } @@ -278,7 +287,7 @@ raw(container_type const & c, iterator_data const & d) return container_type::iterator::get(d).i(); } -///////////////////////////////cti.e/////////////////////////////////////// +//-///////////////////////////////////////////////////////////////////////////////////////////////// #undef prefix_