dr_5.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)dr_5.c 5.4 (Berkeley) 6/1/90";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include "externs.h"
39 1.1 cgd
40 1.1 cgd subtract(from, totalfrom, crewfrom, fromcap, pcfrom)
41 1.1 cgd struct ship *from, *fromcap;
42 1.1 cgd int pcfrom;
43 1.1 cgd register int totalfrom, crewfrom[3];
44 1.1 cgd {
45 1.1 cgd register int n;
46 1.1 cgd
47 1.1 cgd if (fromcap == from && totalfrom) { /* if not captured */
48 1.1 cgd for (n = 0; n < 3; n++) {
49 1.1 cgd if (totalfrom > crewfrom[n]) {
50 1.1 cgd totalfrom -= crewfrom[n];
51 1.1 cgd crewfrom[n] = 0;
52 1.1 cgd } else {
53 1.1 cgd crewfrom[n] -= totalfrom;
54 1.1 cgd totalfrom = 0;
55 1.1 cgd }
56 1.1 cgd }
57 1.1 cgd Write(W_CREW, from, 0, crewfrom[0], crewfrom[1], crewfrom[2], 0);
58 1.1 cgd } else if (totalfrom) {
59 1.1 cgd pcfrom -= totalfrom;
60 1.1 cgd pcfrom = pcfrom < 0 ? 0 : pcfrom;
61 1.1 cgd Write(W_PCREW, from, 0, pcfrom, 0, 0, 0);
62 1.1 cgd }
63 1.1 cgd }
64 1.1 cgd
65 1.1 cgd mensent(from, to, crew, captured, pc, isdefense)
66 1.1 cgd struct ship *from, *to, **captured;
67 1.1 cgd int crew[3], *pc;
68 1.1 cgd char isdefense;
69 1.1 cgd { /* returns # of crew squares sent */
70 1.1 cgd int men = 0;
71 1.1 cgd register int n;
72 1.1 cgd int c1, c2, c3;
73 1.1 cgd register struct BP *bp;
74 1.1 cgd
75 1.1 cgd *pc = from->file->pcrew;
76 1.1 cgd *captured = from->file->captured;
77 1.1 cgd crew[0] = from->specs->crew1;
78 1.1 cgd crew[1] = from->specs->crew2;
79 1.1 cgd crew[2] = from->specs->crew3;
80 1.1 cgd bp = isdefense ? from->file->DBP : from->file->OBP;
81 1.1 cgd for (n=0; n < NBP; n++, bp++) {
82 1.1 cgd if (bp->turnsent && bp->toship == to)
83 1.1 cgd men += bp->mensent;
84 1.1 cgd }
85 1.1 cgd if (men) {
86 1.1 cgd c1 = men/100 ? crew[0] : 0;
87 1.1 cgd c2 = (men%100)/10 ? crew[1] : 0;
88 1.1 cgd c3 = men/10 ? crew[2] : 0;
89 1.1 cgd c3 = *captured == 0 ? crew[2] : *pc;
90 1.1 cgd } else
91 1.1 cgd c1 = c2 = c3 = 0;
92 1.1 cgd return(c1 + c2 + c3);
93 1.1 cgd }
94