@pkmn/engine 0.1.0-dev.f4ba6ebd → 0.1.0-dev.f6545544
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +5 -4
- package/build/pkg/addon/browser.d.ts +3 -0
- package/build/pkg/addon/browser.js +47 -0
- package/build/pkg/addon/browser.js.map +1 -0
- package/build/pkg/addon/node.d.ts +3 -0
- package/build/pkg/addon/node.js +110 -0
- package/build/pkg/addon/node.js.map +1 -0
- package/build/pkg/addon/wasm.d.ts +2 -0
- package/build/pkg/addon/wasm.js +53 -0
- package/build/pkg/addon/wasm.js.map +1 -0
- package/build/pkg/addon.d.ts +25 -3
- package/build/pkg/addon.js +34 -65
- package/build/pkg/addon.js.map +1 -1
- package/build/pkg/data/layout.json +15 -2
- package/build/pkg/data/protocol.json +23 -9
- package/build/pkg/data.d.ts +23 -1
- package/build/pkg/data.js.map +1 -1
- package/build/pkg/gen1.d.ts +15 -18
- package/build/pkg/gen1.js +28 -19
- package/build/pkg/gen1.js.map +1 -1
- package/build/pkg/index.d.ts +39 -89
- package/build/pkg/index.js +23 -70
- package/build/pkg/index.js.map +1 -1
- package/build/pkg/protocol.d.ts +20 -1
- package/build/pkg/protocol.js +105 -103
- package/build/pkg/protocol.js.map +1 -1
- package/build/tools/debug.js +52 -76
- package/build/tools/debug.js.map +1 -1
- package/build/tools/display/debug.jsx +152 -0
- package/build/tools/display/debug.jsx.map +1 -0
- package/build/tools/display/index.js +152 -0
- package/build/tools/display/index.js.map +1 -0
- package/build/tools/display/ui.jsx +359 -0
- package/build/tools/display/ui.jsx.map +1 -0
- package/build/tools/display/util.js +33 -0
- package/build/tools/display/util.js.map +1 -0
- package/build.zig +196 -84
- package/package.json +51 -135
- package/src/bin/install-pkmn-engine +3 -2
- package/src/bin/pkmn-debug +1 -1
- package/src/lib/bindings/c.zig +255 -0
- package/src/lib/bindings/node.zig +121 -0
- package/src/lib/bindings/wasm.zig +59 -0
- package/src/lib/common/array.zig +1 -1
- package/src/lib/common/debug.zig +39 -8
- package/src/lib/common/optional.zig +1 -1
- package/src/lib/common/options.zig +4 -0
- package/src/lib/common/protocol.zig +4 -8
- package/src/lib/common/rational.zig +7 -5
- package/src/lib/common/rng.zig +1 -3
- package/src/lib/common/util.zig +1 -1
- package/src/lib/gen1/calc.zig +208 -61
- package/src/lib/gen1/chance.zig +40 -22
- package/src/lib/gen1/data/moves.zig +2 -4
- package/src/lib/gen1/data/species.zig +1 -3
- package/src/lib/gen1/data/types.zig +1 -2
- package/src/lib/gen1/data.zig +9 -13
- package/src/lib/gen1/helpers.zig +5 -21
- package/src/lib/gen1/mechanics.zig +107 -82
- package/src/lib/gen2/calc.zig +9 -17
- package/src/lib/gen2/chance.zig +0 -3
- package/src/lib/gen2/data/items.zig +1 -3
- package/src/lib/gen2/data/moves.zig +2 -4
- package/src/lib/gen2/data/species.zig +1 -3
- package/src/lib/gen2/data/types.zig +1 -2
- package/src/lib/gen2/data.zig +11 -15
- package/src/lib/gen2/generated.zig +18 -23
- package/src/lib/gen2/helpers.zig +5 -16
- package/src/lib/gen2/mechanics.zig +41 -44
- package/src/lib/node.zig +3 -116
- package/src/lib/pkmn.zig +7 -2
- package/src/lib/wasm.zig +13 -9
- package/src/tools/display/dom.ts +95 -0
- package/src/tools/display/ui.css +354 -0
- package/build/test/display.js +0 -405
- package/build/test/display.js.map +0 -1
- package/src/test/display/pkmn.html.tmpl +0 -368
|
@@ -0,0 +1,255 @@
|
|
|
1
|
+
const pkmn = @import("../pkmn.zig");
|
|
2
|
+
const std = @import("std");
|
|
3
|
+
|
|
4
|
+
const assert = std.debug.assert;
|
|
5
|
+
|
|
6
|
+
const ERROR: u8 = 0b1100;
|
|
7
|
+
|
|
8
|
+
const Enum = if (@hasField(std.builtin.Type, "enum")) .@"enum" else .Enum;
|
|
9
|
+
const Strong = if (@hasField(std.builtin.GlobalLinkage, "strong")) .strong else .Strong;
|
|
10
|
+
|
|
11
|
+
pub const OPTIONS: extern struct {
|
|
12
|
+
showdown: bool,
|
|
13
|
+
log: bool,
|
|
14
|
+
chance: bool,
|
|
15
|
+
calc: bool,
|
|
16
|
+
} = .{
|
|
17
|
+
.showdown = pkmn.options.showdown,
|
|
18
|
+
.log = pkmn.options.log,
|
|
19
|
+
.chance = pkmn.options.chance,
|
|
20
|
+
.calc = pkmn.options.calc,
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
pub const MAX_CHOICES = pkmn.MAX_CHOICES;
|
|
24
|
+
pub const CHOICES_SIZE = pkmn.CHOICES_SIZE;
|
|
25
|
+
pub const MAX_LOGS = pkmn.MAX_LOGS;
|
|
26
|
+
pub const LOGS_SIZE = pkmn.LOGS_SIZE;
|
|
27
|
+
|
|
28
|
+
pub fn choice_init(choice: u8, data: u8) callconv(.C) u8 {
|
|
29
|
+
assert(choice <= @field(@typeInfo(pkmn.Choice.Type), @tagName(Enum)).fields.len);
|
|
30
|
+
assert(data <= 6);
|
|
31
|
+
return @bitCast(pkmn.Choice{ .type = @enumFromInt(choice), .data = @intCast(data) });
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
pub fn choice_type(choice: u8) callconv(.C) u8 {
|
|
35
|
+
return @intFromEnum(@as(pkmn.Choice, @bitCast(choice)).type);
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
pub fn choice_data(choice: u8) callconv(.C) u8 {
|
|
39
|
+
return @as(u8, @as(pkmn.Choice, @bitCast(choice)).data);
|
|
40
|
+
}
|
|
41
|
+
|
|
42
|
+
pub fn result_type(result: u8) callconv(.C) u8 {
|
|
43
|
+
return @intFromEnum(@as(pkmn.Result, @bitCast(result)).type);
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
pub fn result_p1(result: u8) callconv(.C) u8 {
|
|
47
|
+
assert(!err(result));
|
|
48
|
+
return @intFromEnum(@as(pkmn.Result, @bitCast(result)).p1);
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
pub fn result_p2(result: u8) callconv(.C) u8 {
|
|
52
|
+
assert(!err(result));
|
|
53
|
+
return @intFromEnum(@as(pkmn.Result, @bitCast(result)).p2);
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
pub fn err(result: u8) callconv(.C) bool {
|
|
57
|
+
return result == ERROR;
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
pub fn psrng_init(prng: *pkmn.PSRNG, seed: u64) callconv(.C) void {
|
|
61
|
+
prng.src = .{ .seed = seed };
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
pub fn psrng_next(prng: *pkmn.PSRNG) callconv(.C) u32 {
|
|
65
|
+
return prng.next();
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
pub fn rational_init(rational: *pkmn.Rational(f64)) callconv(.C) void {
|
|
69
|
+
rational.reset();
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
pub fn rational_reduce(rational: *pkmn.Rational(f64)) callconv(.C) void {
|
|
73
|
+
rational.reduce();
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
pub fn rational_numerator(rational: *const pkmn.Rational(f64)) callconv(.C) f64 {
|
|
77
|
+
return rational.p;
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
pub fn rational_denominator(rational: *const pkmn.Rational(f64)) callconv(.C) f64 {
|
|
81
|
+
return rational.q;
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
const log_options = extern struct {
|
|
85
|
+
buf: [*]u8,
|
|
86
|
+
len: usize,
|
|
87
|
+
};
|
|
88
|
+
|
|
89
|
+
pub fn gen(comptime num: comptime_int) type {
|
|
90
|
+
const g = @field(pkmn, "gen" ++ std.fmt.comptimePrint("{d}", .{num}));
|
|
91
|
+
|
|
92
|
+
return struct {
|
|
93
|
+
pub const MAX_CHOICES = g.MAX_CHOICES;
|
|
94
|
+
pub const CHOICES_SIZE = g.CHOICES_SIZE;
|
|
95
|
+
pub const MAX_LOGS = g.MAX_LOGS;
|
|
96
|
+
pub const LOGS_SIZE = g.LOGS_SIZE;
|
|
97
|
+
|
|
98
|
+
const chance_options = extern struct {
|
|
99
|
+
probability: pkmn.Rational(f64),
|
|
100
|
+
actions: g.chance.Actions,
|
|
101
|
+
durations: g.chance.Durations,
|
|
102
|
+
};
|
|
103
|
+
|
|
104
|
+
const calc_options = extern struct {
|
|
105
|
+
overrides: g.chance.Actions,
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
const battle_options = struct {
|
|
109
|
+
stream: pkmn.protocol.ByteStream,
|
|
110
|
+
log: pkmn.protocol.FixedLog,
|
|
111
|
+
chance: g.Chance(pkmn.Rational(f64)),
|
|
112
|
+
calc: g.Calc,
|
|
113
|
+
|
|
114
|
+
comptime {
|
|
115
|
+
assert(@sizeOf(battle_options) <= 128);
|
|
116
|
+
}
|
|
117
|
+
};
|
|
118
|
+
|
|
119
|
+
pub fn battle_options_set(
|
|
120
|
+
options: *battle_options,
|
|
121
|
+
log: ?*const log_options,
|
|
122
|
+
chance: ?*const chance_options,
|
|
123
|
+
calc: ?*const calc_options,
|
|
124
|
+
) callconv(.C) void {
|
|
125
|
+
if (pkmn.options.log) {
|
|
126
|
+
if (log) |l| {
|
|
127
|
+
options.stream = .{ .buffer = l.buf[0..l.len] };
|
|
128
|
+
options.log = .{ .writer = options.stream.writer() };
|
|
129
|
+
} else {
|
|
130
|
+
options.stream.reset();
|
|
131
|
+
}
|
|
132
|
+
}
|
|
133
|
+
if (pkmn.options.chance) {
|
|
134
|
+
if (chance) |c| {
|
|
135
|
+
options.chance = .{
|
|
136
|
+
.probability = c.probability,
|
|
137
|
+
.actions = c.actions,
|
|
138
|
+
.durations = c.durations,
|
|
139
|
+
};
|
|
140
|
+
} else {
|
|
141
|
+
options.chance.reset();
|
|
142
|
+
}
|
|
143
|
+
}
|
|
144
|
+
if (pkmn.options.calc) {
|
|
145
|
+
if (calc) |c| {
|
|
146
|
+
options.calc = .{ .overrides = c.overrides };
|
|
147
|
+
} else {
|
|
148
|
+
options.calc = .{};
|
|
149
|
+
}
|
|
150
|
+
}
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
pub fn battle_options_chance_probability(
|
|
154
|
+
options: *battle_options,
|
|
155
|
+
) callconv(.C) *pkmn.Rational(f64) {
|
|
156
|
+
return &options.chance.probability;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
pub fn battle_options_chance_actions(
|
|
160
|
+
options: *battle_options,
|
|
161
|
+
) callconv(.C) *g.chance.Actions {
|
|
162
|
+
return &options.chance.actions;
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
pub fn battle_options_chance_durations(
|
|
166
|
+
options: *battle_options,
|
|
167
|
+
) callconv(.C) *g.chance.Durations {
|
|
168
|
+
return &options.chance.durations;
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
pub fn battle_options_calc_summaries(
|
|
172
|
+
options: *battle_options,
|
|
173
|
+
) callconv(.C) *g.calc.Summaries {
|
|
174
|
+
return &options.calc.summaries;
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
pub fn battle_update(
|
|
178
|
+
battle: *g.Battle(g.PRNG),
|
|
179
|
+
c1: pkmn.Choice,
|
|
180
|
+
c2: pkmn.Choice,
|
|
181
|
+
opts: ?*battle_options,
|
|
182
|
+
) callconv(.C) pkmn.Result {
|
|
183
|
+
if ((pkmn.options.log or pkmn.options.chance or pkmn.options.calc) and opts != null) {
|
|
184
|
+
return battle.update(c1, c2, opts.?) catch return @bitCast(ERROR);
|
|
185
|
+
}
|
|
186
|
+
return battle.update(c1, c2, &g.NULL) catch unreachable;
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
pub fn battle_choices(
|
|
190
|
+
battle: *const g.Battle(g.PRNG),
|
|
191
|
+
player: u8,
|
|
192
|
+
request: u8,
|
|
193
|
+
out: [*]u8,
|
|
194
|
+
n: usize,
|
|
195
|
+
) callconv(.C) u8 {
|
|
196
|
+
assert(player <= @field(@typeInfo(pkmn.Player), @tagName(Enum)).fields.len);
|
|
197
|
+
assert(request <= @field(@typeInfo(pkmn.Choice.Type), @tagName(Enum)).fields.len);
|
|
198
|
+
|
|
199
|
+
assert(!pkmn.options.showdown or n > 0);
|
|
200
|
+
return battle.choices(@enumFromInt(player), @enumFromInt(request), @ptrCast(out[0..n]));
|
|
201
|
+
}
|
|
202
|
+
};
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
pub fn exports() type {
|
|
206
|
+
@export(choice_init, .{ .name = "pkmn_choice_init", .linkage = Strong });
|
|
207
|
+
@export(choice_type, .{ .name = "pkmn_choice_type", .linkage = Strong });
|
|
208
|
+
@export(choice_data, .{ .name = "pkmn_choice_data", .linkage = Strong });
|
|
209
|
+
|
|
210
|
+
@export(result_type, .{ .name = "pkmn_result_type", .linkage = Strong });
|
|
211
|
+
@export(result_p1, .{ .name = "pkmn_result_p1", .linkage = Strong });
|
|
212
|
+
@export(result_p2, .{ .name = "pkmn_result_p2", .linkage = Strong });
|
|
213
|
+
|
|
214
|
+
@export(err, .{ .name = "pkmn_error", .linkage = Strong });
|
|
215
|
+
|
|
216
|
+
@export(psrng_init, .{ .name = "pkmn_psrng_init", .linkage = Strong });
|
|
217
|
+
@export(psrng_next, .{ .name = "pkmn_psrng_next", .linkage = Strong });
|
|
218
|
+
|
|
219
|
+
@export(rational_init, .{ .name = "pkmn_rational_init", .linkage = Strong });
|
|
220
|
+
@export(rational_reduce, .{ .name = "pkmn_rational_reduce", .linkage = Strong });
|
|
221
|
+
@export(rational_numerator, .{ .name = "pkmn_rational_numerator", .linkage = Strong });
|
|
222
|
+
@export(rational_denominator, .{ .name = "pkmn_rational_denominator", .linkage = Strong });
|
|
223
|
+
|
|
224
|
+
@export(
|
|
225
|
+
gen(1).battle_options_set,
|
|
226
|
+
.{ .name = "pkmn_gen1_battle_options_set", .linkage = Strong },
|
|
227
|
+
);
|
|
228
|
+
@export(
|
|
229
|
+
gen(1).battle_options_chance_probability,
|
|
230
|
+
.{ .name = "pkmn_gen1_battle_options_chance_probability", .linkage = Strong },
|
|
231
|
+
);
|
|
232
|
+
@export(
|
|
233
|
+
gen(1).battle_options_chance_actions,
|
|
234
|
+
.{ .name = "pkmn_gen1_battle_options_chance_actions", .linkage = Strong },
|
|
235
|
+
);
|
|
236
|
+
@export(
|
|
237
|
+
gen(1).battle_options_chance_durations,
|
|
238
|
+
.{ .name = "pkmn_gen1_battle_options_chance_durations", .linkage = Strong },
|
|
239
|
+
);
|
|
240
|
+
@export(
|
|
241
|
+
gen(1).battle_options_calc_summaries,
|
|
242
|
+
.{ .name = "pkmn_gen1_battle_options_calc_summaries", .linkage = Strong },
|
|
243
|
+
);
|
|
244
|
+
|
|
245
|
+
@export(
|
|
246
|
+
gen(1).battle_update,
|
|
247
|
+
.{ .name = "pkmn_gen1_battle_update", .linkage = Strong },
|
|
248
|
+
);
|
|
249
|
+
@export(
|
|
250
|
+
gen(1).battle_choices,
|
|
251
|
+
.{ .name = "pkmn_gen1_battle_choices", .linkage = Strong },
|
|
252
|
+
);
|
|
253
|
+
|
|
254
|
+
return struct {};
|
|
255
|
+
}
|
|
@@ -0,0 +1,121 @@
|
|
|
1
|
+
const js = @import("../common/js.zig");
|
|
2
|
+
const pkmn = @import("../pkmn.zig");
|
|
3
|
+
const std = @import("std");
|
|
4
|
+
|
|
5
|
+
const assert = std.debug.assert;
|
|
6
|
+
|
|
7
|
+
const c = @cImport({
|
|
8
|
+
@cDefine("NAPI_VERSION", "8");
|
|
9
|
+
@cInclude("node_api.h");
|
|
10
|
+
});
|
|
11
|
+
|
|
12
|
+
pub fn register(env: c.napi_env) c.napi_value {
|
|
13
|
+
const object = js.Object.init(env);
|
|
14
|
+
const properties = [_]c.napi_property_descriptor{
|
|
15
|
+
js.Property.init("options", .{ .value = options(env) }),
|
|
16
|
+
js.Property.init("bindings", .{ .value = bindings(env) }),
|
|
17
|
+
};
|
|
18
|
+
assert(c.napi_define_properties(env, object, properties.len, &properties) == c.napi_ok);
|
|
19
|
+
return object;
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
fn options(env: c.napi_env) c.napi_value {
|
|
23
|
+
const object = js.Object.init(env);
|
|
24
|
+
const properties = [_]c.napi_property_descriptor{
|
|
25
|
+
js.Property.init("showdown", .{ .value = js.Boolean.init(env, pkmn.options.showdown) }),
|
|
26
|
+
js.Property.init("log", .{ .value = js.Boolean.init(env, pkmn.options.log) }),
|
|
27
|
+
js.Property.init("chance", .{ .value = js.Boolean.init(env, pkmn.options.chance) }),
|
|
28
|
+
js.Property.init("calc", .{ .value = js.Boolean.init(env, pkmn.options.calc) }),
|
|
29
|
+
};
|
|
30
|
+
assert(c.napi_define_properties(env, object, properties.len, &properties) == c.napi_ok);
|
|
31
|
+
return object;
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
fn bindings(env: c.napi_env) c.napi_value {
|
|
35
|
+
const array = js.Array.init(env, .{ .length = 1 });
|
|
36
|
+
js.Array.set(env, array, 0, bind(env, pkmn.gen1));
|
|
37
|
+
return array;
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
fn bind(env: c.napi_env, gen: anytype) c.napi_value {
|
|
41
|
+
const choices_size: u32 = @intCast(gen.CHOICES_SIZE);
|
|
42
|
+
const logs_size: u32 = @intCast(gen.LOGS_SIZE);
|
|
43
|
+
const object = js.Object.init(env);
|
|
44
|
+
const properties = [_]c.napi_property_descriptor{
|
|
45
|
+
js.Property.init("CHOICES_SIZE", .{ .value = js.Number.init(env, choices_size) }),
|
|
46
|
+
js.Property.init("LOGS_SIZE", .{ .value = js.Number.init(env, logs_size) }),
|
|
47
|
+
js.Property.init("update", .{ .method = update(gen) }),
|
|
48
|
+
js.Property.init("choices", .{ .method = choices(gen) }),
|
|
49
|
+
};
|
|
50
|
+
assert(c.napi_define_properties(env, object, properties.len, &properties) == c.napi_ok);
|
|
51
|
+
return object;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
fn update(gen: anytype) c.napi_callback {
|
|
55
|
+
return struct {
|
|
56
|
+
fn call(env: c.napi_env, info: c.napi_callback_info) callconv(.C) c.napi_value {
|
|
57
|
+
var argc: usize = 4;
|
|
58
|
+
var argv: [4]c.napi_value = undefined;
|
|
59
|
+
assert(c.napi_get_cb_info(env, info, &argc, &argv, null, null) == c.napi_ok);
|
|
60
|
+
assert(argc == 4);
|
|
61
|
+
|
|
62
|
+
var data: ?*anyopaque = undefined;
|
|
63
|
+
var len: usize = 0;
|
|
64
|
+
assert(c.napi_get_arraybuffer_info(env, argv[0], &data, &len) == c.napi_ok);
|
|
65
|
+
assert(len == @sizeOf(gen.Battle(gen.PRNG)));
|
|
66
|
+
|
|
67
|
+
var battle: *gen.Battle(gen.PRNG) = @alignCast(@ptrCast(data.?));
|
|
68
|
+
const c1: pkmn.Choice = @bitCast(js.Number.get(env, argv[1], u8));
|
|
69
|
+
const c2: pkmn.Choice = @bitCast(js.Number.get(env, argv[2], u8));
|
|
70
|
+
|
|
71
|
+
var vtype: c.napi_valuetype = undefined;
|
|
72
|
+
assert(c.napi_typeof(env, argv[3], &vtype) == c.napi_ok);
|
|
73
|
+
const result = switch (vtype) {
|
|
74
|
+
c.napi_undefined, c.napi_null => battle.update(c1, c2, &gen.NULL),
|
|
75
|
+
else => result: {
|
|
76
|
+
assert(c.napi_get_arraybuffer_info(env, argv[3], &data, &len) == c.napi_ok);
|
|
77
|
+
assert(len == gen.LOGS_SIZE);
|
|
78
|
+
|
|
79
|
+
const buf = @as([*]u8, @ptrCast(data.?))[0..gen.LOGS_SIZE];
|
|
80
|
+
var stream: pkmn.protocol.ByteStream = .{ .buffer = buf };
|
|
81
|
+
// TODO: extract out
|
|
82
|
+
var opts = pkmn.battle.options(
|
|
83
|
+
pkmn.protocol.FixedLog{ .writer = stream.writer() },
|
|
84
|
+
gen.chance.NULL,
|
|
85
|
+
gen.calc.NULL,
|
|
86
|
+
);
|
|
87
|
+
break :result battle.update(c1, c2, &opts);
|
|
88
|
+
},
|
|
89
|
+
} catch unreachable;
|
|
90
|
+
|
|
91
|
+
return js.Number.init(env, @as(u8, @bitCast(result)));
|
|
92
|
+
}
|
|
93
|
+
}.call;
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
fn choices(gen: anytype) c.napi_callback {
|
|
97
|
+
return struct {
|
|
98
|
+
fn call(env: c.napi_env, info: c.napi_callback_info) callconv(.C) c.napi_value {
|
|
99
|
+
var argc: usize = 4;
|
|
100
|
+
var argv: [4]c.napi_value = undefined;
|
|
101
|
+
assert(c.napi_get_cb_info(env, info, &argc, &argv, null, null) == c.napi_ok);
|
|
102
|
+
assert(argc == 4);
|
|
103
|
+
|
|
104
|
+
var data: ?*anyopaque = undefined;
|
|
105
|
+
var len: usize = 0;
|
|
106
|
+
assert(c.napi_get_arraybuffer_info(env, argv[0], &data, &len) == c.napi_ok);
|
|
107
|
+
assert(len == @sizeOf(gen.Battle(gen.PRNG)));
|
|
108
|
+
|
|
109
|
+
var battle: *gen.Battle(gen.PRNG) = @alignCast(@ptrCast(data.?));
|
|
110
|
+
const player: pkmn.Player = @enumFromInt(js.Number.get(env, argv[1], u8));
|
|
111
|
+
const request: pkmn.Choice.Type = @enumFromInt(js.Number.get(env, argv[2], u8));
|
|
112
|
+
|
|
113
|
+
assert(c.napi_get_arraybuffer_info(env, argv[3], &data, &len) == c.napi_ok);
|
|
114
|
+
assert(len == gen.CHOICES_SIZE);
|
|
115
|
+
|
|
116
|
+
const out = @as([*]pkmn.Choice, @ptrCast(data.?))[0..gen.CHOICES_SIZE];
|
|
117
|
+
const n = battle.choices(player, request, out);
|
|
118
|
+
return js.Number.init(env, @as(u8, @bitCast(n)));
|
|
119
|
+
}
|
|
120
|
+
}.call;
|
|
121
|
+
}
|
|
@@ -0,0 +1,59 @@
|
|
|
1
|
+
const pkmn = @import("../pkmn.zig");
|
|
2
|
+
const std = @import("std");
|
|
3
|
+
|
|
4
|
+
const assert = std.debug.assert;
|
|
5
|
+
|
|
6
|
+
const Enum = if (@hasField(std.builtin.Type, "enum")) .@"enum" else .Enum;
|
|
7
|
+
const Strong = if (@hasField(std.builtin.GlobalLinkage, "strong")) .strong else .Strong;
|
|
8
|
+
|
|
9
|
+
pub const options = pkmn.options;
|
|
10
|
+
|
|
11
|
+
pub fn gen(comptime num: comptime_int) type {
|
|
12
|
+
const g = @field(pkmn, "gen" ++ std.fmt.comptimePrint("{d}", .{num}));
|
|
13
|
+
return struct {
|
|
14
|
+
pub const CHOICES_SIZE = size(g.CHOICES_SIZE);
|
|
15
|
+
pub const LOGS_SIZE = size(g.LOGS_SIZE);
|
|
16
|
+
|
|
17
|
+
pub fn update(
|
|
18
|
+
battle: *g.Battle(g.PRNG),
|
|
19
|
+
c1: pkmn.Choice,
|
|
20
|
+
c2: pkmn.Choice,
|
|
21
|
+
options_: ?[*]u8,
|
|
22
|
+
) callconv(.C) pkmn.Result {
|
|
23
|
+
return (if (options_) |o| result: {
|
|
24
|
+
const buf = @as([*]u8, @ptrCast(o))[0..g.LOGS_SIZE];
|
|
25
|
+
var stream: pkmn.protocol.ByteStream = .{ .buffer = buf };
|
|
26
|
+
// TODO: extract out
|
|
27
|
+
var opts = pkmn.battle.options(
|
|
28
|
+
pkmn.protocol.FixedLog{ .writer = stream.writer() },
|
|
29
|
+
g.chance.NULL,
|
|
30
|
+
g.calc.NULL,
|
|
31
|
+
);
|
|
32
|
+
break :result battle.update(c1, c2, &opts);
|
|
33
|
+
} else battle.update(c1, c2, &g.NULL)) catch unreachable;
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
pub fn choices(
|
|
37
|
+
battle: *g.Battle(g.PRNG),
|
|
38
|
+
player: u8,
|
|
39
|
+
request: u8,
|
|
40
|
+
buf: [*]u8,
|
|
41
|
+
) callconv(.C) u8 {
|
|
42
|
+
assert(player <= @field(@typeInfo(pkmn.Player), @tagName(Enum)).fields.len);
|
|
43
|
+
assert(request <= @field(@typeInfo(pkmn.Choice.Type), @tagName(Enum)).fields.len);
|
|
44
|
+
|
|
45
|
+
const n = CHOICES_SIZE;
|
|
46
|
+
return battle.choices(@enumFromInt(player), @enumFromInt(request), @ptrCast(buf[0..n]));
|
|
47
|
+
}
|
|
48
|
+
};
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
pub fn exports() type {
|
|
52
|
+
@export(gen(1).update, .{ .name = "GEN1_update", .linkage = Strong });
|
|
53
|
+
@export(gen(1).choices, .{ .name = "GEN1_choices", .linkage = Strong });
|
|
54
|
+
return struct {};
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
fn size(n: usize) u32 {
|
|
58
|
+
return std.math.ceilPowerOfTwo(u32, @as(u32, @intCast(n))) catch unreachable;
|
|
59
|
+
}
|
package/src/lib/common/array.zig
CHANGED
|
@@ -11,7 +11,7 @@ const Enum = if (@hasField(std.builtin.Type, "enum")) .@"enum" else .Enum;
|
|
|
11
11
|
pub fn Array(comptime n: comptime_int, comptime U: type) type {
|
|
12
12
|
return struct {
|
|
13
13
|
const size = @bitSizeOf(U);
|
|
14
|
-
const options = .{ .signedness = .unsigned, .bits = size * n };
|
|
14
|
+
const options: std.builtin.Type.Int = .{ .signedness = .unsigned, .bits = size * n };
|
|
15
15
|
pub const T = @Type(if (@hasField(std.builtin.Type, "int"))
|
|
16
16
|
.{ .int = options }
|
|
17
17
|
else
|
package/src/lib/common/debug.zig
CHANGED
|
@@ -3,9 +3,19 @@ const std = @import("std");
|
|
|
3
3
|
const debug = std.debug;
|
|
4
4
|
const io = std.io;
|
|
5
5
|
|
|
6
|
+
const Array = if (@hasField(std.builtin.Type, "array")) .array else .Array;
|
|
7
|
+
const Enum = if (@hasField(std.builtin.Type, "enum")) .@"enum" else .Enum;
|
|
8
|
+
const Optional = if (@hasField(std.builtin.Type, "optional")) .optional else .Optional;
|
|
9
|
+
const Pointer = if (@hasField(std.builtin.Type, "pointer")) .pointer else .Pointer;
|
|
10
|
+
const Struct = if (@hasField(std.builtin.Type, "struct")) .@"struct" else .Struct;
|
|
11
|
+
const Union = if (@hasField(std.builtin.Type, "union")) .@"union" else .Union;
|
|
12
|
+
|
|
6
13
|
pub fn print(value: anytype) void {
|
|
7
|
-
debug.lockStdErr();
|
|
8
|
-
defer debug
|
|
14
|
+
if (@hasDecl(debug, "lockStdErr")) debug.lockStdErr() else debug.getStderrMutex().lock();
|
|
15
|
+
defer if (@hasDecl(debug, "unlockStdErr"))
|
|
16
|
+
debug.unlockStdErr()
|
|
17
|
+
else
|
|
18
|
+
debug.getStderrMutex().unlock();
|
|
9
19
|
const stderr = io.getStdErr().writer();
|
|
10
20
|
|
|
11
21
|
nosuspend {
|
|
@@ -19,7 +29,7 @@ pub fn print(value: anytype) void {
|
|
|
19
29
|
}) catch return;
|
|
20
30
|
} else {
|
|
21
31
|
switch (@typeInfo(@TypeOf(value))) {
|
|
22
|
-
|
|
32
|
+
Struct => |info| {
|
|
23
33
|
if (info.is_tuple) {
|
|
24
34
|
inline for (info.fields, 0..) |f, i| {
|
|
25
35
|
inspect(@field(value, f.name));
|
|
@@ -42,17 +52,17 @@ fn inspect(value: anytype) void {
|
|
|
42
52
|
nosuspend {
|
|
43
53
|
const err = "Unable to format type '" ++ @typeName(@TypeOf(value)) ++ "'";
|
|
44
54
|
switch (@typeInfo(@TypeOf(value))) {
|
|
45
|
-
|
|
55
|
+
Array => |info| {
|
|
46
56
|
if (info.child == u8) return stderr.print("{s}", .{value}) catch return;
|
|
47
57
|
@compileError(err);
|
|
48
58
|
},
|
|
49
|
-
|
|
59
|
+
Pointer => |ptr_info| switch (ptr_info.size) {
|
|
50
60
|
.One => switch (@typeInfo(ptr_info.child)) {
|
|
51
|
-
|
|
61
|
+
Array => |info| {
|
|
52
62
|
if (info.child == u8) return stderr.print("{s}", .{value}) catch return;
|
|
53
63
|
@compileError(err);
|
|
54
64
|
},
|
|
55
|
-
|
|
65
|
+
Enum, Union, Struct => return inspect(value.*),
|
|
56
66
|
else => @compileError(err),
|
|
57
67
|
},
|
|
58
68
|
.Many, .C => {
|
|
@@ -67,8 +77,29 @@ fn inspect(value: anytype) void {
|
|
|
67
77
|
@compileError(err);
|
|
68
78
|
},
|
|
69
79
|
},
|
|
70
|
-
|
|
80
|
+
Optional => stderr.print("{?}", .{value}) catch return,
|
|
71
81
|
else => stderr.print("{}", .{value}) catch return,
|
|
72
82
|
}
|
|
73
83
|
}
|
|
74
84
|
}
|
|
85
|
+
|
|
86
|
+
const showdown = @import("./options.zig").showdown;
|
|
87
|
+
const Result = @import("./data.zig").Result;
|
|
88
|
+
const Choice = @import("./data.zig").Choice;
|
|
89
|
+
|
|
90
|
+
pub fn dump(gen: u8, battle: anytype, frame: ?struct { Result, Choice, Choice }) void {
|
|
91
|
+
const file = std.fs.cwd().createFile("logs/dump.bin", .{}) catch return;
|
|
92
|
+
defer file.close();
|
|
93
|
+
var w = file.writer();
|
|
94
|
+
w.writeByte(@intFromBool(showdown)) catch return;
|
|
95
|
+
w.writeByte(gen) catch return;
|
|
96
|
+
w.writeInt(i16, 0, .little) catch return;
|
|
97
|
+
w.writeInt(i32, 0, .little) catch return;
|
|
98
|
+
w.writeStruct(battle) catch return;
|
|
99
|
+
w.writeStruct(battle) catch return;
|
|
100
|
+
if (frame) |f| {
|
|
101
|
+
w.writeStruct(f[0]) catch return;
|
|
102
|
+
w.writeStruct(f[1]) catch return;
|
|
103
|
+
w.writeStruct(f[2]) catch return;
|
|
104
|
+
}
|
|
105
|
+
}
|
|
@@ -7,10 +7,12 @@ pub const Options = struct {
|
|
|
7
7
|
log: ?bool = null,
|
|
8
8
|
chance: ?bool = null,
|
|
9
9
|
calc: ?bool = null,
|
|
10
|
+
mod: ?bool = null,
|
|
10
11
|
advance: ?bool = null,
|
|
11
12
|
ebc: ?bool = null,
|
|
12
13
|
key: ?bool = null,
|
|
13
14
|
miss: ?bool = null,
|
|
15
|
+
overwrite: ?bool = null,
|
|
14
16
|
internal: ?bool = null,
|
|
15
17
|
};
|
|
16
18
|
|
|
@@ -23,10 +25,12 @@ pub const chance = get("chance", false);
|
|
|
23
25
|
/// Whether or not damage calculator support is enabled.
|
|
24
26
|
pub const calc = get("calc", false);
|
|
25
27
|
|
|
28
|
+
pub const mod = showdown or get("mod", false);
|
|
26
29
|
pub const advance = get("advance", true);
|
|
27
30
|
pub const ebc = get("ebc", true);
|
|
28
31
|
pub const key = get("key", false);
|
|
29
32
|
pub const miss = get("miss", true);
|
|
33
|
+
pub const overwrite = get("overwrite", true);
|
|
30
34
|
pub const internal = get("internal", false);
|
|
31
35
|
|
|
32
36
|
fn get(comptime name: []const u8, default: bool) bool {
|
|
@@ -1,18 +1,14 @@
|
|
|
1
|
-
const std = @import("std");
|
|
2
1
|
const builtin = @import("builtin");
|
|
3
|
-
|
|
4
|
-
const pkmn = @import("../pkmn.zig");
|
|
5
|
-
|
|
6
2
|
const data = @import("data.zig");
|
|
7
3
|
const options = @import("options.zig");
|
|
4
|
+
const pkmn = @import("../pkmn.zig");
|
|
5
|
+
const std = @import("std");
|
|
8
6
|
|
|
9
7
|
const assert = std.debug.assert;
|
|
10
|
-
const print = std.debug.print;
|
|
11
|
-
|
|
12
8
|
const enabled = options.log;
|
|
13
|
-
|
|
14
|
-
const Player = data.Player;
|
|
15
9
|
const ID = data.ID;
|
|
10
|
+
const Player = data.Player;
|
|
11
|
+
const print = std.debug.print;
|
|
16
12
|
|
|
17
13
|
const endian = builtin.cpu.arch.endian();
|
|
18
14
|
const Endian = std.builtin.Endian;
|
|
@@ -15,7 +15,9 @@ const ComptimeFloat =
|
|
|
15
15
|
|
|
16
16
|
/// Specialization of a rational number used by the engine to compute probabilties.
|
|
17
17
|
/// For performance reasons the rational is only reduced lazily and thus `reduce` must be
|
|
18
|
-
/// invoked explicitly before reading.
|
|
18
|
+
/// invoked explicitly before reading. Note that this laziness means that this implementation
|
|
19
|
+
/// sometimes overflows in places where an eager reduced implementation would not - to achieve
|
|
20
|
+
/// the same behavior as an eager implementation simply call `reduce` after each operation.
|
|
19
21
|
pub fn Rational(comptime T: type) type {
|
|
20
22
|
return extern struct {
|
|
21
23
|
const Self = @This();
|
|
@@ -25,10 +27,10 @@ pub fn Rational(comptime T: type) type {
|
|
|
25
27
|
/// Denominator. Must always be >= 1. Not guaranteed to be reduced in all cases.
|
|
26
28
|
q: T = 1,
|
|
27
29
|
|
|
28
|
-
// With floats we can't rely on an overflow bit to let us know when to reduce, so we
|
|
29
|
-
// start reducing when we get sufficiently close to the limit of the mantissa
|
|
30
|
-
// we expect updates to involve numbers < 2**10, so we should be safe
|
|
31
|
-
// are 2**10 away from "overflowing" the mantissa)
|
|
30
|
+
// With floats we can't rely on an overflow bit to let us know when to reduce, so we
|
|
31
|
+
// instead start reducing when we get sufficiently close to the limit of the mantissa
|
|
32
|
+
// (in our domain we expect updates to involve numbers < 2**10, so we should be safe
|
|
33
|
+
// not reducing before we are 2**10 away from "overflowing" the mantissa)
|
|
32
34
|
const REDUCE = if (@typeInfo(T) == Float)
|
|
33
35
|
std.math.pow(T, 2, std.math.floatMantissaBits(T) - 10)
|
|
34
36
|
else
|
package/src/lib/common/rng.zig
CHANGED
|
@@ -1,10 +1,8 @@
|
|
|
1
|
-
const std = @import("std");
|
|
2
|
-
|
|
3
1
|
const options = @import("options.zig");
|
|
2
|
+
const std = @import("std");
|
|
4
3
|
|
|
5
4
|
const assert = std.debug.assert;
|
|
6
5
|
const expectEqual = std.testing.expectEqual;
|
|
7
|
-
|
|
8
6
|
const showdown = options.showdown;
|
|
9
7
|
|
|
10
8
|
pub fn PRNG(comptime gen: comptime_int) type {
|
package/src/lib/common/util.zig
CHANGED
|
@@ -44,7 +44,7 @@ fn CopyPtrAttrs(
|
|
|
44
44
|
comptime child: type,
|
|
45
45
|
) type {
|
|
46
46
|
const info = @field(@typeInfo(source), @tagName(Pointer));
|
|
47
|
-
const args = .{
|
|
47
|
+
const args: std.builtin.Type.Pointer = .{
|
|
48
48
|
.size = size,
|
|
49
49
|
.is_const = info.is_const,
|
|
50
50
|
.is_volatile = info.is_volatile,
|