X-Git-Url: https://oss.titaniummirror.com/gitweb/?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Fsrc%2Fvalarray-inst.cc;h=821dafcf9ce5e320724c789e1185e0d0a8a58dac;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=b56a911dcd92ba37148120c21b579ecdaafa651f;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git diff --git a/libstdc++-v3/src/valarray-inst.cc b/libstdc++-v3/src/valarray-inst.cc index b56a911d..821dafcf 100644 --- a/libstdc++-v3/src/valarray-inst.cc +++ b/libstdc++-v3/src/valarray-inst.cc @@ -1,11 +1,12 @@ // Explicit instantiation file. -// Copyright (C) 2001 Free Software Foundation, Inc. +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library 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, or (at your option) +// Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, @@ -13,19 +14,14 @@ // 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 library; see the file COPYING. If not, write to the Free -// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -// USA. +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. -// As a special exception, you may use this file as part of a free software -// library without restriction. Specifically, if other files instantiate -// templates or use macros or inline functions from this file, or you compile -// this file and link it with other files to produce an executable, this -// file does not by itself cause the resulting executable to be covered by -// the GNU General Public License. This exception does not however -// invalidate any other reasons why the executable file might be covered by -// the GNU General Public License. +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . // // ISO C++ 14882: @@ -33,9 +29,9 @@ #include -namespace std -{ - // Some explicit instanciations. +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Some explicit instantiations. template void __valarray_fill(size_t* __restrict__, size_t, const size_t&); @@ -48,7 +44,6 @@ namespace std template size_t valarray::size() const; template size_t& valarray::operator[](size_t); - inline size_t __valarray_product(const valarray& __a) { @@ -69,50 +64,43 @@ namespace std __gslice_to_index(size_t __o, const valarray& __l, const valarray& __s, valarray& __i) { - // There are as much as dimensions as there are strides. - size_t __n = __l.size(); + // There are as many dimensions as there are strides. + const size_t __n = __l.size(); - // Get a buffer to hold current multi-index as we go through - // the gslice for the purpose of computing its linear-image. - size_t* const __t = static_cast - (__builtin_alloca(__n * sizeof (size_t))); - __valarray_fill(__t, __n, size_t(0)); + // Holds current multi-index as we go through the gslice for the + // purpose of computing its linear-image. + valarray __t(__l); // Note that this should match the product of all numbers appearing // in __l which describes the multidimensional sizes of the - // the generalized slice. + // generalized slice. const size_t __z = __i.size(); - + for (size_t __j = 0; __j < __z; ++__j) { - // Compute the linear-index image of (t_0, ... t_{n-1}). - // Normaly, we should use inner_product<>(), but we do it the - // the hard way here to avoid link-time can of worms. - size_t __a = __o; - for (size_t __k = 0; __k < __n; ++__k) - __a += __s[__k] * __t[__k]; + // Compute the linear-index image of (t_0, ... t_{n-1}). + __i[__j] = __o; - __i[__j] = __a; + --__t[__n - 1]; + __o += __s[__n - 1]; // Process the next multi-index. The loop ought to be - // backward since we're making a lexicagraphical visit. - ++__t[__n - 1]; - for (size_t __k2 = __n - 1; __k2; --__k2) + // backward since we're making a lexicographical visit. + for (size_t __k2 = __n - 1; __k2 && !__t[__k2]; --__k2) { - if (__t[__k2] >= __l[__k2]) - { - __t[__k2] = 0; - ++__t[__k2 - 1]; - } + __o -= __s[__k2] * __l[__k2]; + __t[__k2] = __l[__k2]; + + --__t[__k2 - 1]; + __o += __s[__k2 - 1]; } } } gslice::_Indexer::_Indexer(size_t __o, const valarray& __l, const valarray& __s) - : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), - _M_index(__l.size() == 0 ? 0 : __valarray_product(__l)) - { __gslice_to_index(__o, __l, __s, _M_index); } - -} // namespace std + : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), + _M_index(__l.size() == 0 ? 0 : __valarray_product(__l)) + { __gslice_to_index(__o, __l, __s, _M_index); } +_GLIBCXX_END_NAMESPACE