author | unc0rr |
Wed, 30 May 2007 19:29:27 +0000 | |
changeset 532 | 8136a5363586 |
parent 394 | 4c017ae1226a |
child 534 | 92fb2b0d5117 |
permissions | -rw-r--r-- |
393 | 1 |
(* |
2 |
* Hedgewars, a worms-like game |
|
3 |
* Copyright (c) 2006, 2007 Andrey Korotaev <unC0Rr@gmail.com> |
|
4 |
* |
|
5 |
* This program is free software; you can redistribute it and/or modify |
|
6 |
* it under the terms of the GNU General Public License as published by |
|
7 |
* the Free Software Foundation; version 2 of the License |
|
8 |
* |
|
9 |
* This program is distributed in the hope that it will be useful, |
|
10 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
11 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
12 |
* GNU General Public License for more details. |
|
13 |
* |
|
14 |
* You should have received a copy of the GNU General Public License |
|
15 |
* along with this program; if not, write to the Free Software |
|
16 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA |
|
17 |
*) |
|
18 |
||
288 | 19 |
unit uAmmos; |
20 |
interface |
|
21 |
uses uConsts; |
|
22 |
{$INCLUDE options.inc} |
|
23 |
type PHHAmmo = ^THHAmmo; |
|
24 |
THHAmmo = array[0..cMaxSlotIndex, 0..cMaxSlotAmmoIndex] of TAmmo; |
|
25 |
||
26 |
procedure AddAmmoStore(s: shortstring); |
|
27 |
procedure AssignStores; |
|
295 | 28 |
procedure AddAmmo(Hedgehog: pointer; ammo: TAmmoType); |
29 |
function HHHasAmmo(Hedgehog: pointer; Ammo: TAmmoType): boolean; |
|
371 | 30 |
procedure PackAmmo(Ammo: PHHAmmo; Slot: LongInt); |
295 | 31 |
procedure OnUsedAmmo(Ammo: PHHAmmo); |
288 | 32 |
|
33 |
implementation |
|
295 | 34 |
uses uMisc, uTeams, uGears; |
35 |
type TAmmoCounts = array[TAmmoType] of Longword; |
|
288 | 36 |
var StoresList: array[0..Pred(cMaxHHs)] of PHHAmmo; |
37 |
StoreCnt: Longword = 0; |
|
38 |
||
295 | 39 |
procedure FillAmmoStore(Ammo: PHHAmmo; var cnts: TAmmoCounts); |
288 | 40 |
var mi: array[0..cMaxSlotIndex] of byte; |
41 |
a: TAmmoType; |
|
295 | 42 |
begin |
43 |
FillChar(mi, sizeof(mi), 0); |
|
44 |
FillChar(Ammo^, sizeof(Ammo^), 0); |
|
45 |
for a:= Low(TAmmoType) to High(TAmmoType) do |
|
46 |
if cnts[a] > 0 then |
|
47 |
begin |
|
48 |
TryDo(mi[Ammoz[a].Slot] <= cMaxSlotAmmoIndex, 'Ammo slot overflow', true); |
|
351 | 49 |
Ammo^[Ammoz[a].Slot, mi[Ammoz[a].Slot]]:= Ammoz[a].Ammo; |
50 |
Ammo^[Ammoz[a].Slot, mi[Ammoz[a].Slot]].Count:= cnts[a]; |
|
295 | 51 |
inc(mi[Ammoz[a].Slot]) |
52 |
end |
|
53 |
end; |
|
54 |
||
55 |
procedure AddAmmoStore(s: shortstring); |
|
56 |
var cnt: Longword; |
|
57 |
a: TAmmoType; |
|
58 |
ammos: TAmmoCounts; |
|
288 | 59 |
begin |
60 |
TryDo(byte(s[0]) = byte(ord(High(TAmmoType)) + 1), 'Invalid ammo scheme (incompatible frontend)', true); |
|
61 |
||
62 |
inc(StoreCnt); |
|
63 |
TryDo(StoreCnt <= cMaxHHs, 'Ammo stores overflow', true); |
|
64 |
||
65 |
new(StoresList[Pred(StoreCnt)]); |
|
66 |
||
67 |
for a:= Low(TAmmoType) to High(TAmmoType) do |
|
68 |
begin |
|
69 |
cnt:= byte(s[ord(a) + 1]) - byte('0'); |
|
295 | 70 |
if cnt = 9 then cnt:= AMMO_INFINITE; |
71 |
ammos[a]:= cnt |
|
288 | 72 |
end; |
295 | 73 |
|
74 |
FillAmmoStore(StoresList[Pred(StoreCnt)], ammos) |
|
288 | 75 |
end; |
76 |
||
77 |
function GetAmmoByNum(num: Longword): PHHAmmo; |
|
78 |
begin |
|
79 |
TryDo(num < StoreCnt, 'Invalid store number', true); |
|
351 | 80 |
exit(StoresList[num]) |
288 | 81 |
end; |
82 |
||
83 |
procedure AssignStores; |
|
84 |
var tteam: PTeam; |
|
85 |
i: Longword; |
|
86 |
begin |
|
87 |
tteam:= TeamsList; |
|
88 |
while tteam <> nil do |
|
89 |
begin |
|
90 |
for i:= 0 to cMaxHHIndex do |
|
351 | 91 |
if tteam^.Hedgehogs[i].Gear <> nil then |
92 |
tteam^.Hedgehogs[i].Ammo:= GetAmmoByNum(tteam^.Hedgehogs[i].AmmoStore); |
|
93 |
tteam:= tteam^.Next |
|
288 | 94 |
end |
95 |
end; |
|
96 |
||
295 | 97 |
procedure AddAmmo(Hedgehog: pointer; ammo: TAmmoType); |
98 |
var ammos: TAmmoCounts; |
|
371 | 99 |
slot, ami: LongInt; |
295 | 100 |
hhammo: PHHAmmo; |
101 |
begin |
|
102 |
FillChar(ammos, sizeof(ammos), 0); |
|
351 | 103 |
hhammo:= PHedgehog(Hedgehog)^.Ammo; |
295 | 104 |
|
105 |
for slot:= 0 to cMaxSlotIndex do |
|
106 |
for ami:= 0 to cMaxSlotAmmoIndex do |
|
351 | 107 |
if hhammo^[slot, ami].Count > 0 then |
108 |
ammos[hhammo^[slot, ami].AmmoType]:= hhammo^[slot, ami].Count; |
|
295 | 109 |
|
394
4c017ae1226a
- Implement hack to let ammo stores work without needed assistance of frontend
unc0rr
parents:
393
diff
changeset
|
110 |
if ammos[ammo] <> AMMO_INFINITE then inc(ammos[ammo], Ammoz[ammo].NumberInCase); |
295 | 111 |
FillAmmoStore(hhammo, ammos) |
112 |
end; |
|
113 |
||
371 | 114 |
procedure PackAmmo(Ammo: PHHAmmo; Slot: LongInt); |
115 |
var ami: LongInt; |
|
295 | 116 |
b: boolean; |
117 |
begin |
|
118 |
repeat |
|
119 |
b:= false; |
|
120 |
ami:= 0; |
|
121 |
while (not b) and (ami < cMaxSlotAmmoIndex) do |
|
351 | 122 |
if (Ammo^[Slot, ami].Count = 0) |
123 |
and (Ammo^[Slot, ami + 1].Count > 0) then b:= true |
|
295 | 124 |
else inc(ami); |
125 |
if b then // there's a free item in ammo stack |
|
126 |
begin |
|
351 | 127 |
Ammo^[Slot, ami]:= Ammo^[Slot, ami + 1]; |
128 |
Ammo^[Slot, ami + 1].Count:= 0 |
|
295 | 129 |
end; |
130 |
until not b; |
|
131 |
end; |
|
132 |
||
133 |
procedure OnUsedAmmo(Ammo: PHHAmmo); |
|
134 |
var s, a: Longword; |
|
135 |
begin |
|
351 | 136 |
with CurrentTeam^.Hedgehogs[CurrentTeam^.CurrHedgehog] do |
295 | 137 |
begin |
138 |
if CurAmmoGear = nil then begin s:= CurSlot; a:= CurAmmo end |
|
139 |
else begin s:= AltSlot; a:= AltAmmo end; |
|
351 | 140 |
with Ammo^[s, a] do |
295 | 141 |
if Count <> AMMO_INFINITE then |
142 |
begin |
|
143 |
dec(Count); |
|
144 |
if Count = 0 then PackAmmo(Ammo, CurSlot) |
|
145 |
end |
|
146 |
end |
|
147 |
end; |
|
148 |
||
149 |
function HHHasAmmo(Hedgehog: pointer; Ammo: TAmmoType): boolean; |
|
371 | 150 |
var slot, ami: LongInt; |
295 | 151 |
begin |
152 |
Slot:= Ammoz[Ammo].Slot; |
|
153 |
ami:= 0; |
|
351 | 154 |
while (ami <= cMaxSlotAmmoIndex) do |
295 | 155 |
begin |
351 | 156 |
with PHedgehog(Hedgehog)^.Ammo^[Slot, ami] do |
157 |
if (AmmoType = Ammo) and (Count > 0) then exit(true); |
|
295 | 158 |
inc(ami) |
351 | 159 |
end; |
160 |
HHHasAmmo:= false |
|
295 | 161 |
end; |
162 |
||
288 | 163 |
end. |