]>
cvs.zerfleddert.de Git - micropolis/blob - src/sim/s_traf.c
3 * Micropolis, Unix Version. This game was released for the Unix platform
4 * in or about 1990 and has been modified for inclusion in the One Laptop
5 * Per Child program. Copyright (C) 1989 - 2007 Electronic Arts Inc. If
6 * you need assistance with this program, you may contact:
7 * http://wiki.laptop.org/go/Micropolis or email micropolis@laptop.org.
9 * This program is free software: you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation, either version 3 of the License, or (at
12 * your option) any later version.
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details. You should have received a
18 * copy of the GNU General Public License along with this program. If
19 * not, see <http://www.gnu.org/licenses/>.
21 * ADDITIONAL TERMS per GNU GPL Section 7
23 * No trademark or publicity rights are granted. This license does NOT
24 * give you any right, title or interest in the trademark SimCity or any
25 * other Electronic Arts trademark. You may not distribute any
26 * modification of this program using the trademark SimCity or claim any
27 * affliation or association with Electronic Arts Inc. or its employees.
29 * Any propagation or conveyance of this program must include this
30 * copyright notice and these terms.
32 * If you convey this program (or any modifications of it) and assume
33 * contractual liability for the program to recipients of it, you agree
34 * to indemnify Electronic Arts for any liability that those contractual
35 * assumptions impose on Electronic Arts.
37 * You may not misrepresent the origins of this program; modified
38 * versions of the program must be marked as such and not identified as
39 * the original program.
41 * This disclaimer supplements the one included in the General Public
42 * License. TO THE FULLEST EXTENT PERMISSIBLE UNDER APPLICABLE LAW, THIS
43 * PROGRAM IS PROVIDED TO YOU "AS IS," WITH ALL FAULTS, WITHOUT WARRANTY
44 * OF ANY KIND, AND YOUR USE IS AT YOUR SOLE RISK. THE ENTIRE RISK OF
45 * SATISFACTORY QUALITY AND PERFORMANCE RESIDES WITH YOU. ELECTRONIC ARTS
46 * DISCLAIMS ANY AND ALL EXPRESS, IMPLIED OR STATUTORY WARRANTIES,
47 * INCLUDING IMPLIED WARRANTIES OF MERCHANTABILITY, SATISFACTORY QUALITY,
48 * FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT OF THIRD PARTY
49 * RIGHTS, AND WARRANTIES (IF ANY) ARISING FROM A COURSE OF DEALING,
50 * USAGE, OR TRADE PRACTICE. ELECTRONIC ARTS DOES NOT WARRANT AGAINST
51 * INTERFERENCE WITH YOUR ENJOYMENT OF THE PROGRAM; THAT THE PROGRAM WILL
52 * MEET YOUR REQUIREMENTS; THAT OPERATION OF THE PROGRAM WILL BE
53 * UNINTERRUPTED OR ERROR-FREE, OR THAT THE PROGRAM WILL BE COMPATIBLE
54 * WITH THIRD PARTY SOFTWARE OR THAT ANY ERRORS IN THE PROGRAM WILL BE
55 * CORRECTED. NO ORAL OR WRITTEN ADVICE PROVIDED BY ELECTRONIC ARTS OR
56 * ANY AUTHORIZED REPRESENTATIVE SHALL CREATE A WARRANTY. SOME
57 * JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF OR LIMITATIONS ON IMPLIED
58 * WARRANTIES OR THE LIMITATIONS ON THE APPLICABLE STATUTORY RIGHTS OF A
59 * CONSUMER, SO SOME OR ALL OF THE ABOVE EXCLUSIONS AND LIMITATIONS MAY
65 /* Traffic Generation */
70 short PosStackN
, SMapXStack
[MAXDIS
+1], SMapYStack
[MAXDIS
+1];
73 short TrafMaxX
, TrafMaxY
;
75 int GetFromMap(int x
);
80 void SetTrafMem(void);
84 /* comefrom: DoIndustrial DoCommercial DoResidential */
96 if ((!Rand(2)) && FindPTele()) {
97 /* printf("Telecommute!\n"); */
102 if (FindPRoad()) { /* look for road on zone perimeter */
103 if (TryDrive()) { /* attempt to drive somewhere */
104 SetTrafMem(); /* if sucessful, inc trafdensity */
107 return (TRUE
); /* traffic passed */
111 return (FALSE
); /* traffic failed */
113 else return (-1); /* no road found */
117 /* comefrom: MakeTraf */
123 for (x
= PosStackN
; x
> 0; x
--) {
125 if (TestBounds(SMapX
, SMapY
)) {
126 z
= Map
[SMapX
][SMapY
] & LOMASK
;
127 if ((z
>= ROADBASE
) && (z
< POWERBASE
)) {
131 z
= TrfDensity
[SMapX
>>1][SMapY
>>1];
136 TrafMaxX
= SMapX
<<4;
137 TrafMaxY
= SMapY
<<4;
138 if (((sprite
= GetSprite(COP
)) != NULL
) &&
139 (sprite
->control
== -1)) {
140 sprite
->dest_x
= TrafMaxX
;
141 sprite
->dest_y
= TrafMaxY
;
144 TrfDensity
[SMapX
>>1][SMapY
>>1] = z
;
151 /* comefrom: TryGo */
156 SMapXStack
[PosStackN
] = SMapX
;
157 SMapYStack
[PosStackN
] = SMapY
;
161 /* comefrom: SetTrafMem */
165 SMapX
= SMapXStack
[PosStackN
];
166 SMapY
= SMapYStack
[PosStackN
];
171 /* comefrom: DoSPZone MakeTraf */
173 FindPRoad(void) /* look for road on edges of zone */
175 static short PerimX
[12] = {-1, 0, 1, 2, 2, 2, 1, 0,-1,-2,-2,-2};
176 static short PerimY
[12] = {-2,-2,-2,-1, 0, 1, 2, 2, 2, 1, 0,-1};
177 register short tx
, ty
, z
;
179 for (z
= 0; z
< 12; z
++) {
180 tx
= SMapX
+ PerimX
[z
];
181 ty
= SMapY
+ PerimY
[z
];
182 if (TestBounds(tx
, ty
)) {
183 if (RoadTest(Map
[tx
][ty
])) {
195 FindPTele(void) /* look for telecommunication on edges of zone */
197 static short PerimX
[12] = {-1, 0, 1, 2, 2, 2, 1, 0,-1,-2,-2,-2};
198 static short PerimY
[12] = {-2,-2,-2,-1, 0, 1, 2, 2, 2, 1, 0,-1};
199 register short tx
, ty
, z
, tile
;
201 for (z
= 0; z
< 12; z
++) {
202 tx
= SMapX
+ PerimX
[z
];
203 ty
= SMapY
+ PerimY
[z
];
204 if (TestBounds(tx
, ty
)) {
205 tile
= Map
[tx
][ty
] & LOMASK
;
206 if ((tile
>= TELEBASE
) && (tile
<= TELELAST
)) {
215 /* comefrom: MakeTraf */
222 for (z
= 0; z
< MAXDIS
; z
++) { /* Maximum distance to try */
223 if (TryGo(z
)) { /* if it got a road */
224 if (DriveDone()) /* if destination is reached */
225 return (TRUE
); /* pass */
227 if (PosStackN
) { /* deadend , backup */
231 else return (FALSE
); /* give up at start */
234 return (FALSE
); /* gone maxdis */
238 /* comefrom: TryDrive */
242 short x
, rdir
, realdir
;
245 rdir
= Rand(3); /* XXX: Heaviest user of Rand */
249 for (x
= rdir
; x
< (rdir
+ 4); x
++) { /* for the 4 directions */
251 if (realdir
== LDir
) continue; /* skip last direction */
252 if (RoadTest(GetFromMap(realdir
))) {
254 LDir
= (realdir
+ 2) & 3;
255 if (z
& 1) /* save pos every other move */
264 /* comefrom: TryGo DriveDone */
271 return (Map
[SMapX
][SMapY
- 1] & LOMASK
);
274 if (SMapX
< (WORLD_X
- 1))
275 return (Map
[SMapX
+ 1][SMapY
] & LOMASK
);
278 if (SMapY
< (WORLD_Y
- 1))
279 return (Map
[SMapX
][SMapY
+ 1] & LOMASK
);
283 return (Map
[SMapX
- 1][SMapY
] & LOMASK
);
291 /* comefrom: TryDrive */
295 static short TARGL
[3] = {COMBASE
, LHTHR
, LHTHR
};
296 static short TARGH
[3] = {NUCLEAR
, PORT
, COMBASE
}; /* for destinations */
300 register short z
, l
, h
;
304 for (x
= 0; x
< 4; x
++) { /* R>C C>I I>R */
306 if ((z
>= TARGL
[Zsource
]) && (z
<= TARGH
[Zsource
]))
314 z
= Map
[SMapX
][SMapY
- 1] & LOMASK
;
315 if ((z
>= l
) && (z
<= h
))
318 if (SMapX
< (WORLD_X
- 1)) {
319 z
= Map
[SMapX
+ 1][SMapY
] & LOMASK
;
320 if ((z
>= l
) && (z
<= h
))
323 if (SMapY
< (WORLD_Y
- 1)) {
324 z
= Map
[SMapX
][SMapY
+ 1] & LOMASK
;
325 if ((z
>= l
) && (z
<= h
))
329 z
= Map
[SMapX
- 1][SMapY
] & LOMASK
;
330 if ((z
>= l
) && (z
<= h
))
339 /* comefrom: TryGo FindPRoad */
348 if ((x
>= POWERBASE
) && (x
< RAILHPOWERV
))