Mercurial > hg > Members > kono > jpf-core

comparison src/main/gov/nasa/jpf/vm/PriorityRunnablesSyncPolicy.java @ 0:61d41facf527

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
initial v8 import (history reset)
author Peter Mehlitz <Peter.C.Mehlitz@nasa.gov>
date Fri, 23 Jan 2015 10:14:01 -0800
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:61d41facf527
1 /*
2 * Copyright (C) 2014, United States Government, as represented by the
3 * Administrator of the National Aeronautics and Space Administration.
4 * All rights reserved.
5 *
6 * The Java Pathfinder core (jpf-core) platform is licensed under the
7 * Apache License, Version 2.0 (the "License"); you may not use this file except
8 * in compliance with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0.
11 *
12 * Unless required by applicable law or agreed to in writing, software
13 * distributed under the License is distributed on an "AS IS" BASIS,
14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 * See the License for the specific language governing permissions and
16 * limitations under the License.
17 */
18
19 package gov.nasa.jpf.vm;
20
21 import gov.nasa.jpf.Config;
22
23 /**
24 * a AllRunnablesSyncPolicy that only considers the runnables with the highest
25 * priority as choices
26 *
27 * 2do - it doesn't make much sense to compare priorities across process
28 * boundaries (unless we model distributed apps running on the same machine)
29 */
30 public class PriorityRunnablesSyncPolicy extends AllRunnablesSyncPolicy {
31
32 public PriorityRunnablesSyncPolicy(Config config) {
33 super(config);
34 }
35
36 @Override
37 protected ThreadInfo[] getTimeoutRunnables (ApplicationContext appCtx){
38 ThreadInfo[] allRunnables = super.getTimeoutRunnables(appCtx);
39
40 int maxPrio = Integer.MIN_VALUE;
41 int n=0;
42 for (int i=0; i<allRunnables.length; i++){
43 ThreadInfo ti = allRunnables[i];
44 if (ti != null){
45 int prio = ti.getPriority();
46
47 if (prio > maxPrio){
48 maxPrio = prio;
49 for (int j=0; j<i; j++){
50 allRunnables[j]= null;
51 }
52 n = 1;
53
54 } else if (prio < maxPrio){
55 allRunnables[i] = null;
56
57 } else { // prio == maxPrio
58 n++;
59 }
60 }
61 }
62
63 if (n < allRunnables.length){
64 ThreadInfo[] prioRunnables = new ThreadInfo[n];
65 for (int i=0, j=0; j<n; j++, i++){
66 if (allRunnables[i] != null){
67 prioRunnables[j++] = allRunnables[i];
68 }
69 }
70
71 return prioRunnables;
72
73 } else { // all runnables had the same prio
74 return allRunnables;
75 }
76 }
77 }