1 /* @(#)initquad.c 8.1 (Berkeley) 5/31/93 */ 2 /* $NetBSD: initquad.c,v 1.7 2009/05/24 21:44:56 dholland Exp $ */ 3 4 /* 5 * Copyright (c) 1980, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 #include <stdio.h> 34 #include "trek.h" 35 36 /* 37 ** Paramize Quadrant Upon Entering 38 ** 39 ** A quadrant is initialized from the information held in the 40 ** Quad matrix. Basically, everything is just initialized 41 ** randomly, except for the starship, which goes into a fixed 42 ** sector. 43 ** 44 ** If there are Klingons in the quadrant, the captain is informed 45 ** that the condition is RED, and he is given a chance to put 46 ** his shields up if the computer is working. 47 ** 48 ** The flag `f' is set to disable the check for condition red. 49 ** This mode is used in situations where you know you are going 50 ** to be docked, i.e., abandon() and help(). 51 */ 52 53 void 54 initquad(int f) 55 { 56 int i, j; 57 int rx, ry; 58 int nbases, nstars; 59 struct quad *q; 60 int nholes; 61 62 q = &Quad[Ship.quadx][Ship.quady]; 63 64 /* ignored supernova'ed quadrants (this is checked again later anyway */ 65 if (q->stars < 0) 66 return; 67 Etc.nkling = q->klings; 68 nbases = q->bases; 69 nstars = q->stars; 70 nholes = q->holes; 71 72 /* have we blundered into a battle zone w/ shields down? */ 73 if (Etc.nkling > 0 && !f) { 74 printf("Condition RED\n"); 75 Ship.cond = RED; 76 if (!damaged(COMPUTER)) 77 shield(1); 78 } 79 80 /* clear out the quadrant */ 81 for (i = 0; i < NSECTS; i++) 82 for (j = 0; j < NSECTS; j++) 83 Sect[i][j] = EMPTY; 84 85 /* initialize Enterprise */ 86 Sect[Ship.sectx][Ship.secty] = Ship.ship; 87 88 /* initialize Klingons */ 89 for (i = 0; i < Etc.nkling; i++) { 90 sector(&rx, &ry); 91 Sect[rx][ry] = KLINGON; 92 Etc.klingon[i].x = rx; 93 Etc.klingon[i].y = ry; 94 Etc.klingon[i].power = Param.klingpwr; 95 Etc.klingon[i].srndreq = 0; 96 } 97 compkldist(1); 98 99 /* initialize star base */ 100 if (nbases > 0) { 101 sector(&rx, &ry); 102 Sect[rx][ry] = BASE; 103 Etc.starbase.x = rx; 104 Etc.starbase.y = ry; 105 } 106 107 /* initialize inhabited starsystem */ 108 if (q->qsystemname != 0) { 109 sector(&rx, &ry); 110 Sect[rx][ry] = INHABIT; 111 nstars -= 1; 112 } 113 114 /* initialize black holes */ 115 for (i = 0; i < nholes; i++) { 116 sector(&rx, &ry); 117 Sect[rx][ry] = HOLE; 118 } 119 120 /* initialize stars */ 121 for (i = 0; i < nstars; i++) { 122 sector(&rx, &ry); 123 Sect[rx][ry] = STAR; 124 } 125 Move.newquad = 1; 126 } 127 128 129 void 130 sector(int *x, int *y) 131 { 132 int i, j; 133 134 do { 135 i = ranf(NSECTS); 136 j = ranf(NSECTS); 137 } while (Sect[i][j] != EMPTY); 138 *x = i; 139 *y = j; 140 return; 141 } 142