1 /* =============================================================================
5 * =============================================================================
7 * Copyright (C) Stanford University, 2006. All Rights Reserved.
10 * =============================================================================
12 * For the license of bayes/sort.h and bayes/sort.c, please see the header
15 * ------------------------------------------------------------------------
17 * For the license of kmeans, please see kmeans/LICENSE.kmeans
19 * ------------------------------------------------------------------------
21 * For the license of ssca2, please see ssca2/COPYRIGHT
23 * ------------------------------------------------------------------------
25 * For the license of lib/mt19937ar.c and lib/mt19937ar.h, please see the
26 * header of the files.
28 * ------------------------------------------------------------------------
30 * For the license of lib/rbtree.h and lib/rbtree.c, please see
31 * lib/LEGALNOTICE.rbtree and lib/LICENSE.rbtree
33 * ------------------------------------------------------------------------
35 * Unless otherwise noted, the following license applies to STAMP files:
37 * Copyright (c) 2007, Stanford University
38 * All rights reserved.
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions are
44 * * Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
47 * * Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in
49 * the documentation and/or other materials provided with the
52 * * Neither the name of Stanford University nor the names of its
53 * contributors may be used to endorse or promote products derived
54 * from this software without specific prior written permission.
56 * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
57 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
59 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
60 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
61 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
62 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
63 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
64 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
65 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
66 * THE POSSIBILITY OF SUCH DAMAGE.
68 * =============================================================================
71 public class Labyrinth extends Thread{
73 static String global_inputFile;
74 static boolean global_doPrint;
86 private void setDefaultParams() {
89 global_inputFile = null;
90 global_doPrint = false;
98 private void parseArg(String[] argv) {
101 boolean opterr = false;
105 while (i < args.length && argv[i].startswith("-")) {
109 if(arg.equals("-b")) {
110 bendCost = Integer.parseInt(argv[i++]);
112 else if(arg.equals("-x")) {
113 xCost = Integer.parseInt(argv[i++]);
115 else if(arg.equals("-y")) {
116 yCost = Integer.parseInt(argv[i++]);
118 else if(arg.equals("-z")) {
119 zCost = Integer.parseInt(argv[i++]);
121 else if(arg.equals("-t")) {
122 numThread = Integer.parseInt(argv[i++]);
124 else if(arg.equals("-i")) {
125 global_inputFile = argv[i++];
127 else if(arg.equals("-p")) {
128 global_doPrint = true;
131 System.err.println("Non-option argument: " + argv[i]);
142 public Labyrinth(String[] argv)
148 public Labyrinth(int myID,Router.Arg rArg)
156 Barrier.enterBarrier();
157 Router.solve(routerArg);
158 Barrier.enterBarrier();
162 public static void main(String[] argv)
167 Labyrinth labyrinth = new Labyrinth(argv);
169 Barrier.setBarrier(laybyrinth.numThread);
171 Maze mazePtr = Maze.alloc();
173 int numPathToRoute = mazePtr.read(global_inputFile);
175 Router routerPtr = Router.alloc(laybyrinth.xCost,laybyrinth.yCost,
176 laybyrinth.zCost,laybyrinth.bendCost);
178 List_t pathVectorListPtr = List_t.alloc(0); // list_t.alloc(null)
183 Solve_arg routerArg = new Solve_arg(routerPtr,mazePtr,pathVectorListPtr);
186 /* Create and start thread */
187 Layrinth[] lb = new Labyrinth[numThread];
189 for(int i = 1; i<numThread;i++) {
190 lb[i] = new Labyrinth(i,routerArg);
193 for(int i = 1; i<numThread;i++) {
199 int numPathRouted = 0;
200 List_Iter it = new List_Iter();
202 it.reset(pathVectorListPtr);
203 while(it.hasNext(pathVectorListPtr)) {
204 Vector_t pathVectorPtr = (Vector_t)it.next(pathVectorListPtr);
205 numPathRouted += pathVectorPtr.getSize();
208 System.out.println("Paths routed = " + numPaathRouted);
210 boolean stats = mazePtr.checkPaths(pathVectorListPtr,global_doPrint);
213 System.out.println("Verification not passed");
217 System.out.println("Verification passed.");
218 System.out.println("Finished");
222 /* =============================================================================
226 * =============================================================================