c5ad1daa96
Reviewed-by: kvn, epavlova |
||
---|---|---|
.. | ||
hoist01 | ||
hoist02 | ||
hoist03 | ||
hoist04 | ||
README |
Copyright (c) 2002, 2018, Oracle and/or its affiliates. All rights reserved. DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. This code is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 only, as published by the Free Software Foundation. This code 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 version 2 for more details (a copy is included in the LICENSE file that accompanied this code). You should have received a copy of the GNU General Public License version 2 along with this work; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA or visit www.oracle.com if you need additional information or have any questions. LOOP INVARIANT COMPUTATIONS Loop-invariant is any part of a computation within a loop that does not depend on the loop variables and whose value does not change as long as control stays within the loop. Loop-invarians assignments may be moved out of the loop entirely. There may be some situations where you know the value won't vary, but the compiler is playing it safe in case of side-effects. "Computation" here doesn't mean just arithmetic; array indexing, calls to pure functions are all possible candidates for moving out of the loop.