Package: libstlport5.1-dev Version: 5.1.5-3 Severity: normal
Hi, new g++ gives warnings about for loops w/o body and w/o a space before the ;. I fixed the warnings I got when compiling my app and grepped for a few more, but there might be more hidden (especially multi-line for loops). I hope you can apply the patch and/or send upstream. Best, Norbert -- System Information: Debian Release: lenny/sid APT prefers unstable APT policy: (500, 'unstable') Architecture: amd64 (x86_64) Kernel: Linux 2.6.25-2-amd64 (SMP w/8 CPU cores) Locale: LANG=en_US.UTF-8, LC_CTYPE=en_US.UTF-8 (charmap=UTF-8) Shell: /bin/sh linked to /bin/bash Versions of packages libstlport5.1-dev depends on: ii g++ [c++-compiler] 4:4.3.0-8 The GNU C++ compiler ii g++-4.2 [c++-compiler] 4.2.4-2 The GNU C++ compiler ii g++-4.3 [c++-compiler] 4.3.1-1 The GNU C++ compiler ii libstlport5.1ldbl 5.1.5-3 STLport C++ class library libstlport5.1-dev recommends no packages. -- no debconf information
diff -r -u stlport-orig/stl/debug/_debug.c stlport/stl/debug/_debug.c --- stlport-orig/stl/debug/_debug.c 2006-05-30 12:58:55.000000000 -0700 +++ stlport/stl/debug/_debug.c 2008-06-09 22:30:06.000000000 -0700 @@ -59,7 +59,7 @@ #endif const _Iterator& __last, const forward_iterator_tag &) { _Iterator1 __i(__first); - for (; __i != __last && __i != __it; ++__i); + for (; __i != __last && __i != __it; ++__i) ; return (__i != __last); } @@ -69,7 +69,7 @@ __in_range_aux(const _Iterator1& __it, const _Iterator& __first, const _Iterator& __last, const bidirectional_iterator_tag &) { _Iterator1 __i(__first); - for (; __i != __last && __i != __it; ++__i); + for (; __i != __last && __i != __it; ++__i) ; return (__i != __last); } #endif diff -r -u stlport-orig/stl/debug/_list.h stlport/stl/debug/_list.h --- stlport-orig/stl/debug/_list.h 2006-07-11 13:09:46.000000000 -0700 +++ stlport/stl/debug/_list.h 2008-06-09 22:31:16.000000000 -0700 @@ -280,7 +280,7 @@ #endif /*_STLP_DONT_SUP_DFLT_PARAM*/ _Base_iterator __i = _M_non_dbg_impl.begin(); size_type __len = 0; - for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len); + for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len) ; if (__len == __new_size) erase(iterator(&_M_iter_list, __i), end()); diff -r -u stlport-orig/stl/_hashtable.c stlport/stl/_hashtable.c --- stlport-orig/stl/_hashtable.c 2006-09-11 12:04:33.000000000 -0700 +++ stlport/stl/_hashtable.c 2008-06-09 17:34:38.000000000 -0700 @@ -144,12 +144,12 @@ typename _BucketVector::const_iterator __bcur(__bpos); _BucketType *__pos_node = __pos._M_node; - for (--__bcur; __pos_node == *__bcur; --__bcur); + for (--__bcur; __pos_node == *__bcur; --__bcur) ; __n = __bcur - __buckets.begin() + 1; _ElemsIte __cur(*__bcur); _ElemsIte __prev = __cur++; - for (; __cur != __pos; ++__prev, ++__cur); + for (; __cur != __pos; ++__prev, ++__cur) ; return __prev; } @@ -332,7 +332,7 @@ else { _ElemsIte __last(_M_buckets[++__f_bucket]); __prev = __cur++; - for (; (__cur != __last) && (__cur != __first._M_ite); ++__prev, ++__cur); + for (; (__cur != __last) && (__cur != __first._M_ite); ++__prev, ++__cur) ; } //We do not use the slist::erase_after method taking a range to count the //number of erased elements: @@ -389,7 +389,7 @@ _ElemsIte __ite(__cur), __before_ite(__cur); for (++__ite; __ite != __last && _M_equals(_M_get_key(*__cur), _M_get_key(*__ite)); - ++__ite, ++__before_ite); + ++__ite, ++__before_ite) ; size_type __prev_bucket = __new_bucket; _ElemsIte __prev = _S_before_begin(__tmp_elems, __tmp, __prev_bucket)._M_ite; __tmp_elems.splice_after(__prev, _M_elems, _M_elems.before_begin(), __before_ite); diff -r -u stlport-orig/stl/_hashtable.h stlport/stl/_hashtable.h --- stlport-orig/stl/_hashtable.h 2006-07-13 12:21:13.000000000 -0700 +++ stlport/stl/_hashtable.h 2008-06-09 17:31:49.000000000 -0700 @@ -527,7 +527,7 @@ size_type __n = _M_bkt_num_key(__key); _ElemsIte __first(_M_buckets[__n]); _ElemsIte __last(_M_buckets[__n + 1]); - for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first); + for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first) ; if (__first != __last) return __first; else @@ -551,7 +551,7 @@ size_type __result = 1; for (++__cur; __cur != __last && _M_equals(_M_get_key(*__cur), __key); - ++__result, ++__cur); + ++__result, ++__cur) ; return __result; } } @@ -567,7 +567,7 @@ __first != __last; ++__first) { if (_M_equals(_M_get_key(*__first), __key)) { _ElemsIte __cur(__first); - for (++__cur; (__cur != __last) && _M_equals(_M_get_key(*__cur), __key); ++__cur); + for (++__cur; (__cur != __last) && _M_equals(_M_get_key(*__cur), __key); ++__cur) ; return _Pii(__first, __cur); } } @@ -583,7 +583,7 @@ __first != __last; ++__first) { if (_M_equals(_M_get_key(*__first), __key)) { _ElemsIte __cur(__first); - for (++__cur; (__cur != __last) && _M_equals(_M_get_key(*__cur), __key); ++__cur); + for (++__cur; (__cur != __last) && _M_equals(_M_get_key(*__cur), __key); ++__cur) ; return _Pii(__first, __cur); } } diff -r -u stlport-orig/stl/_list.c stlport/stl/_list.c --- stlport-orig/stl/_list.c 2006-02-07 12:48:19.000000000 -0800 +++ stlport/stl/_list.c 2008-06-09 17:36:09.000000000 -0700 @@ -91,7 +91,7 @@ void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) { iterator __i = begin(); size_type __len = 0; - for ( ; __i != end() && __len < __new_size; ++__i, ++__len); + for ( ; __i != end() && __len < __new_size; ++__i, ++__len) ; if (__len == __new_size) erase(__i, end());