Commit db1d582c by Benjamin Kosnik Committed by Benjamin Kosnik

Fixups for -fno-for-scope


2001-03-12  Benjamin Kosnik  <bkoz@redhat.com>

	Fixups for -fno-for-scope
	* include/bits/locale_facets.tcc (__match_parallel): Fixup.
	* src/valarray-inst.cc (__gslice_to_index): Same.

From-SVN: r40429
parent ba8afff6
2001-03-12 Benjamin Kosnik <bkoz@redhat.com>
Fixups for -fno-for-scope
* include/bits/locale_facets.tcc (__match_parallel): Fixup.
* src/valarray-inst.cc (__gslice_to_index): Same.
2001-03-12 Rodney Brown <RodneyBrown@mynd.com> 2001-03-12 Rodney Brown <RodneyBrown@mynd.com>
* src/gen-num-limits.cc (traps) [SPECIALIZE_TRAPPING]: Add fflush * src/gen-num-limits.cc (traps) [SPECIALIZE_TRAPPING]: Add fflush
......
...@@ -110,47 +110,44 @@ namespace std ...@@ -110,47 +110,44 @@ namespace std
size_t __pos = 0; size_t __pos = 0;
do do
{ {
{ int __ti = 0;
int __ti = 0; while (__ti < __remain && __pos == __targets[__matches[__ti]].size())
for (;__ti < __remain && ++__ti;
__pos == __targets[__matches[__ti]].size(); ++__ti) if (__ti == __remain)
{ } {
if (__ti == __remain) if (__pos == 0) __remain = 0;
{ return __s;
if (__pos == 0) __remain = 0; }
return __s;
}
}
if (__s == __end) if (__s == __end)
__eof = true; __eof = true;
bool __matched = false; bool __matched = false;
for (int __ti = 0; __ti < __remain; ) for (int __ti2 = 0; __ti2 < __remain; )
{ {
const __string_type& __target = __targets[__matches[__ti]]; const __string_type& __target = __targets[__matches[__ti2]];
if (__pos < __target.size()) if (__pos < __target.size())
{ {
if (__eof || __target[__pos] != *__s) if (__eof || __target[__pos] != *__s)
{ {
__matches[__ti] = __matches[--__remain]; __matches[__ti2] = __matches[--__remain];
continue; continue;
} }
__matched = true; __matched = true;
} }
++__ti; ++__ti2;
} }
if (__matched) if (__matched)
{ {
++__s; ++__s;
++__pos; ++__pos;
} }
for (int __ti = 0; __ti < __remain;) for (int __ti3 = 0; __ti3 < __remain;)
{ {
if (__pos > __targets[__matches[__ti]].size()) if (__pos > __targets[__matches[__ti3]].size())
{ {
__matches[__ti] = __matches[--__remain]; __matches[__ti3] = __matches[--__remain];
continue; continue;
} }
++__ti; ++__ti3;
} }
} }
while (__remain); while (__remain);
......
...@@ -96,13 +96,13 @@ namespace std ...@@ -96,13 +96,13 @@ namespace std
// Process the next multi-index. The loop ought to be // Process the next multi-index. The loop ought to be
// backward since we're making a lexicagraphical visit. // backward since we're making a lexicagraphical visit.
++__t[__n-1]; ++__t[__n - 1];
for (size_t __k=__n-1; __k; --__k) for (size_t __k2 = __n - 1; __k2; --__k2)
{ {
if (__t[__k] >= __l[__k]) if (__t[__k2] >= __l[__k2])
{ {
__t[__k] = 0; __t[__k2] = 0;
++__t[__k-1]; ++__t[__k2 - 1];
} }
} }
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment