KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > gov > nasa > jpf > search > heuristic > GlobalBranchCoverage


1 //
2 // Copyright (C) 2005 United States Government as represented by the
3 // Administrator of the National Aeronautics and Space Administration
4 // (NASA). All Rights Reserved.
5 //
6 // This software is distributed under the NASA Open Source Agreement
7 // (NOSA), version 1.3. The NOSA has been approved by the Open Source
8 // Initiative. See the file NOSA-1.3-JPF at the top of the distribution
9 // directory tree for the complete NOSA document.
10 //
11 // THE SUBJECT SOFTWARE IS PROVIDED "AS IS" WITHOUT ANY WARRANTY OF ANY
12 // KIND, EITHER EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT
13 // LIMITED TO, ANY WARRANTY THAT THE SUBJECT SOFTWARE WILL CONFORM TO
14 // SPECIFICATIONS, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR
15 // A PARTICULAR PURPOSE, OR FREEDOM FROM INFRINGEMENT, ANY WARRANTY THAT
16 // THE SUBJECT SOFTWARE WILL BE ERROR FREE, OR ANY WARRANTY THAT
17 // DOCUMENTATION, IF PROVIDED, WILL CONFORM TO THE SUBJECT SOFTWARE.
18 //
19 package gov.nasa.jpf.search.heuristic;
20
21 import gov.nasa.jpf.Config;
22 import gov.nasa.jpf.util.CoverageManager;
23
24
25 /**
26  * heuristic state prioritizer that maximizes global branch coverage
27  */
28 public class GlobalBranchCoverage implements Heuristic {
29   
30   // this assumes that calc_branch_coverage is set to true
31
32   boolean count_early;
33   int branch_start;
34   int no_branch_return;
35   
36   public GlobalBranchCoverage (Config config) {
37     count_early = config.getBoolean("search.heuristic.branch.count_early");
38     branch_start = config.getInt("search.heuristic.branch.branch_start");
39     no_branch_return = config.getInt("search.heuristic.branch.no_branch_return");
40   }
41
42   public int heuristicValue () {
43     int li = CoverageManager.getLastIncrementedGlobal();
44
45     if (li >= branch_start) {
46       return li + 1;
47     } else if (li >= 0) {
48       if (count_early) {
49         return li;
50       } else {
51         return 0;
52       }
53     } else if (no_branch_return >= 0) {
54       return no_branch_return;
55     } else {
56       return branch_start;
57     }
58   }
59
60   public void processParent () {
61   }
62 }
63
Popular Tags