You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
45 lines
1.2 KiB
45 lines
1.2 KiB
/*
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
package codetoanalyze.java.performance;
|
|
|
|
public class Break {
|
|
/* t is also in control variables but once we have invariant analysis, it shouldn't be */
|
|
private static int break_loop(int p, int t) {
|
|
for (int i = 0; i < p; i++) {
|
|
// do something
|
|
if (t < 0) break;
|
|
// do something
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* calling break_loop with a negative t should give constant
|
|
cost. Currently, this doesn't work because parameters are removed
|
|
when computing the env size :( */
|
|
private static int break_constant(int p) {
|
|
return break_loop(p, -1);
|
|
}
|
|
|
|
/*
|
|
If maxI >= 1 and maxJ >= 1 and maxI + maxJ > 8 then Infinite loop
|
|
(but the CFG constraints never finds infinite loops)
|
|
Otherwise, O(maxI * maxJ)
|
|
*/
|
|
private static void break_outer_loop_MaybeInfinite(int maxI, int maxJ) {
|
|
int i = 0;
|
|
outerloop:
|
|
while (i < maxI) {
|
|
int j = 0;
|
|
while (j < maxJ) {
|
|
if (i + j > 10) break outerloop;
|
|
j++;
|
|
}
|
|
i++;
|
|
}
|
|
}
|
|
}
|