• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

ArkScript-lang / Ark / 23047505077

13 Mar 2026 10:50AM UTC coverage: 93.686% (-0.09%) from 93.778%
23047505077

push

github

SuperFola
fix: when compiling code for the debugger, set is_result_unused to true

9526 of 10168 relevant lines covered (93.69%)

270558.68 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

84.94
/src/arkreactor/Compiler/BytecodeReader.cpp
1
#include <Ark/Compiler/BytecodeReader.hpp>
2

3
#include <Ark/Compiler/Instructions.hpp>
4
#include <Ark/Builtins/Builtins.hpp>
5

6
#include <unordered_map>
7
#include <Proxy/Picosha2.hpp>
8
#include <Ark/Compiler/Serialization/IEEE754Serializer.hpp>
9
#include <Ark/Compiler/Serialization/IntegerSerializer.hpp>
10
#include <fmt/core.h>
11
#include <fmt/color.h>
12

13
namespace Ark
14
{
15
    using namespace Ark::internal;
16

17
    void BytecodeReader::feed(const bytecode_t& bytecode)
691✔
18
    {
691✔
19
        m_bytecode = bytecode;
691✔
20
    }
691✔
21

22
    void BytecodeReader::feed(const std::string& file)
1✔
23
    {
1✔
24
        std::ifstream ifs(file, std::ios::binary | std::ios::ate);
1✔
25
        if (!ifs.good())
1✔
26
            throw std::runtime_error(fmt::format("[BytecodeReader] Couldn't open file '{}'", file));
×
27

28
        const auto pos = ifs.tellg();
1✔
29
        // reserve appropriate number of bytes
30
        std::vector<char> temp(static_cast<std::size_t>(pos));
1✔
31
        ifs.seekg(0, std::ios::beg);
1✔
32
        ifs.read(&temp[0], pos);
1✔
33
        ifs.close();
1✔
34

35
        m_bytecode = bytecode_t(static_cast<std::size_t>(pos));
1✔
36
        for (std::size_t i = 0; i < static_cast<std::size_t>(pos); ++i)
194✔
37
            m_bytecode[i] = static_cast<uint8_t>(temp[i]);
193✔
38
    }
1✔
39

40
    bool BytecodeReader::checkMagic() const
2,747✔
41
    {
2,747✔
42
        return m_bytecode.size() >= bytecode::Magic.size() &&
5,493✔
43
            m_bytecode[0] == bytecode::Magic[0] &&
2,746✔
44
            m_bytecode[1] == bytecode::Magic[1] &&
2,358✔
45
            m_bytecode[2] == bytecode::Magic[2] &&
4,716✔
46
            m_bytecode[3] == bytecode::Magic[3];
2,358✔
47
    }
×
48

49
    Version BytecodeReader::version() const
286✔
50
    {
286✔
51
        if (!checkMagic() || m_bytecode.size() < bytecode::Magic.size() + bytecode::Version.size())
286✔
52
            return Version { 0, 0, 0 };
×
53

54
        return Version {
1,144✔
55
            .major = static_cast<uint16_t>((m_bytecode[4] << 8) + m_bytecode[5]),
286✔
56
            .minor = static_cast<uint16_t>((m_bytecode[6] << 8) + m_bytecode[7]),
286✔
57
            .patch = static_cast<uint16_t>((m_bytecode[8] << 8) + m_bytecode[9])
286✔
58
        };
59
    }
286✔
60

61
    unsigned long long BytecodeReader::timestamp() const
2✔
62
    {
2✔
63
        // 4 (ark\0) + version (2 bytes / number) + timestamp = 18 bytes
64
        if (!checkMagic() || m_bytecode.size() < bytecode::HeaderSize)
2✔
65
            return 0;
×
66

67
        // reading the timestamp in big endian
68
        using timestamp_t = unsigned long long;
×
69
        return (static_cast<timestamp_t>(m_bytecode[10]) << 56) +
6✔
70
            (static_cast<timestamp_t>(m_bytecode[11]) << 48) +
4✔
71
            (static_cast<timestamp_t>(m_bytecode[12]) << 40) +
4✔
72
            (static_cast<timestamp_t>(m_bytecode[13]) << 32) +
4✔
73
            (static_cast<timestamp_t>(m_bytecode[14]) << 24) +
4✔
74
            (static_cast<timestamp_t>(m_bytecode[15]) << 16) +
4✔
75
            (static_cast<timestamp_t>(m_bytecode[16]) << 8) +
4✔
76
            static_cast<timestamp_t>(m_bytecode[17]);
2✔
77
    }
2✔
78

79
    std::vector<unsigned char> BytecodeReader::sha256() const
285✔
80
    {
285✔
81
        if (!checkMagic() || m_bytecode.size() < bytecode::HeaderSize + picosha2::k_digest_size)
285✔
82
            return {};
×
83

84
        std::vector<unsigned char> sha(picosha2::k_digest_size);
285✔
85
        for (std::size_t i = 0; i < picosha2::k_digest_size; ++i)
9,405✔
86
            sha[i] = m_bytecode[bytecode::HeaderSize + i];
9,120✔
87
        return sha;
285✔
88
    }
570✔
89

90
    Symbols BytecodeReader::symbols() const
301✔
91
    {
301✔
92
        if (!checkMagic() || m_bytecode.size() < bytecode::HeaderSize + picosha2::k_digest_size ||
602✔
93
            m_bytecode[bytecode::HeaderSize + picosha2::k_digest_size] != SYM_TABLE_START)
301✔
94
            return {};
×
95

96
        std::size_t i = bytecode::HeaderSize + picosha2::k_digest_size + 1;
301✔
97
        const uint16_t size = readNumber(i);
301✔
98
        i++;
301✔
99

100
        Symbols block;
301✔
101
        block.start = bytecode::HeaderSize + picosha2::k_digest_size;
301✔
102
        block.symbols.reserve(size);
301✔
103

104
        for (uint16_t j = 0; j < size; ++j)
8,032✔
105
        {
106
            std::string content;
7,731✔
107
            while (m_bytecode[i] != 0)
88,109✔
108
                content.push_back(static_cast<char>(m_bytecode[i++]));
80,378✔
109
            i++;
7,731✔
110

111
            block.symbols.push_back(content);
7,731✔
112
        }
7,731✔
113

114
        block.end = i;
301✔
115
        return block;
301✔
116
    }
301✔
117

118
    Values BytecodeReader::values(const Symbols& symbols) const
301✔
119
    {
301✔
120
        if (!checkMagic())
301✔
121
            return {};
×
122

123
        std::size_t i = symbols.end;
301✔
124
        if (m_bytecode[i] != VAL_TABLE_START)
301✔
125
            return {};
×
126
        i++;
301✔
127

128
        const uint16_t size = readNumber(i);
301✔
129
        i++;
301✔
130
        Values block;
301✔
131
        block.start = symbols.end;
301✔
132
        block.values.reserve(size);
301✔
133

134
        for (uint16_t j = 0; j < size; ++j)
9,075✔
135
        {
136
            const uint8_t type = m_bytecode[i];
8,774✔
137
            i++;
8,774✔
138

139
            if (type == NUMBER_TYPE)
8,774✔
140
            {
141
                auto exp = deserializeLE<decltype(ieee754::DecomposedDouble::exponent)>(
2,204✔
142
                    m_bytecode.begin() + static_cast<std::vector<uint8_t>::difference_type>(i), m_bytecode.end());
1,102✔
143
                i += sizeof(decltype(exp));
1,102✔
144
                auto mant = deserializeLE<decltype(ieee754::DecomposedDouble::mantissa)>(
2,204✔
145
                    m_bytecode.begin() + static_cast<std::vector<uint8_t>::difference_type>(i), m_bytecode.end());
1,102✔
146
                i += sizeof(decltype(mant));
1,102✔
147

148
                const ieee754::DecomposedDouble d { exp, mant };
1,102✔
149
                double val = ieee754::deserialize(d);
1,102✔
150
                block.values.emplace_back(val);
1,102✔
151
            }
1,102✔
152
            else if (type == STRING_TYPE)
7,672✔
153
            {
154
                std::string val;
3,699✔
155
                while (m_bytecode[i] != 0)
69,765✔
156
                    val.push_back(static_cast<char>(m_bytecode[i++]));
66,066✔
157
                block.values.emplace_back(val);
3,699✔
158
            }
3,699✔
159
            else if (type == FUNC_TYPE)
3,973✔
160
            {
161
                const uint16_t addr = readNumber(i);
3,973✔
162
                i++;
3,973✔
163
                block.values.emplace_back(addr);
3,973✔
164
            }
3,973✔
165
            else
166
                throw std::runtime_error(fmt::format("Unknown value type: {:x}", type));
×
167
            i++;
8,774✔
168
        }
8,774✔
169

170
        block.end = i;
301✔
171
        return block;
301✔
172
    }
301✔
173

174
    Filenames BytecodeReader::filenames(const Ark::Values& values) const
299✔
175
    {
299✔
176
        if (!checkMagic())
299✔
177
            return {};
×
178

179
        std::size_t i = values.end;
299✔
180
        if (m_bytecode[i] != FILENAMES_TABLE_START)
299✔
181
            return {};
×
182
        i++;
299✔
183

184
        const uint16_t size = readNumber(i);
299✔
185
        i++;
299✔
186

187
        Filenames block;
299✔
188
        block.start = values.end;
299✔
189
        block.filenames.reserve(size);
299✔
190

191
        for (uint16_t j = 0; j < size; ++j)
745✔
192
        {
193
            std::string val;
446✔
194
            while (m_bytecode[i] != 0)
34,889✔
195
                val.push_back(static_cast<char>(m_bytecode[i++]));
34,443✔
196
            block.filenames.emplace_back(val);
446✔
197
            i++;
446✔
198
        }
446✔
199

200
        block.end = i;
299✔
201
        return block;
299✔
202
    }
299✔
203

204
    InstLocations BytecodeReader::instLocations(const Ark::Filenames& filenames) const
299✔
205
    {
299✔
206
        if (!checkMagic())
299✔
207
            return {};
×
208

209
        std::size_t i = filenames.end;
299✔
210
        if (m_bytecode[i] != INST_LOC_TABLE_START)
299✔
211
            return {};
×
212
        i++;
299✔
213

214
        const uint16_t size = readNumber(i);
299✔
215
        i++;
299✔
216

217
        InstLocations block;
299✔
218
        block.start = filenames.end;
299✔
219
        block.locations.reserve(size);
299✔
220

221
        for (uint16_t j = 0; j < size; ++j)
33,273✔
222
        {
223
            auto pp = readNumber(i);
32,974✔
224
            i++;
32,974✔
225

226
            auto ip = readNumber(i);
32,974✔
227
            i++;
32,974✔
228

229
            auto file_id = readNumber(i);
32,974✔
230
            i++;
32,974✔
231

232
            auto line = deserializeBE<uint32_t>(
65,948✔
233
                m_bytecode.begin() + static_cast<std::vector<uint8_t>::difference_type>(i), m_bytecode.end());
32,974✔
234
            i += 4;
32,974✔
235

236
            block.locations.push_back(
32,974✔
237
                { .page_pointer = pp,
131,896✔
238
                  .inst_pointer = ip,
32,974✔
239
                  .filename_id = file_id,
32,974✔
240
                  .line = line });
32,974✔
241
        }
32,974✔
242

243
        block.end = i;
299✔
244
        return block;
299✔
245
    }
299✔
246

247
    Code BytecodeReader::code(const InstLocations& instLocations) const
299✔
248
    {
299✔
249
        if (!checkMagic())
299✔
250
            return {};
×
251

252
        std::size_t i = instLocations.end;
299✔
253

254
        Code block;
299✔
255
        block.start = i;
299✔
256

257
        while (m_bytecode[i] == CODE_SEGMENT_START)
4,265✔
258
        {
259
            i++;
4,265✔
260
            const std::size_t size = readNumber(i) * 4;
4,265✔
261
            i++;
4,265✔
262

263
            block.pages.emplace_back().reserve(size);
4,265✔
264
            for (std::size_t j = 0; j < size; ++j)
476,529✔
265
                block.pages.back().push_back(m_bytecode[i++]);
472,264✔
266

267
            if (i == m_bytecode.size())
4,265✔
268
                break;
299✔
269
        }
4,265✔
270

271
        return block;
299✔
272
    }
299✔
273

274
    std::optional<InstLoc> BytecodeReader::findSourceLocation(const std::vector<InstLoc>& inst_locations, const std::size_t ip, const std::size_t pp) const
15✔
275
    {
15✔
276
        std::optional<InstLoc> match = std::nullopt;
15✔
277

278
        for (const auto location : inst_locations)
14,660✔
279
        {
280
            if (location.page_pointer == pp && !match)
14,645✔
281
                match = location;
15✔
282

283
            // select the best match: we want to find the location that's nearest our instruction pointer,
284
            // but not equal to it as the IP will always be pointing to the next instruction,
285
            // not yet executed. Thus, the erroneous instruction is the previous one.
286
            if (location.page_pointer == pp && match && location.inst_pointer < ip / 4)
14,645✔
287
                match = location;
10✔
288

289
            // early exit because we won't find anything better, as inst locations are ordered by ascending (pp, ip)
290
            if (location.page_pointer > pp || (location.page_pointer == pp && location.inst_pointer >= ip / 4))
14,645✔
291
                break;
10✔
292
        }
14,645✔
293

294
        return match;
15✔
295
    }
296

297
    void BytecodeReader::display(const BytecodeSegment segment,
2✔
298
                                 const std::optional<uint16_t> sStart,
299
                                 const std::optional<uint16_t> sEnd,
300
                                 const std::optional<uint16_t> cPage) const
301
    {
2✔
302
        if (!checkMagic())
2✔
303
        {
304
            fmt::println("Invalid format");
×
305
            return;
×
306
        }
307

308
        if (segment == BytecodeSegment::All || segment == BytecodeSegment::HeadersOnly)
2✔
309
        {
310
            auto [major, minor, patch] = version();
2✔
311
            fmt::println("Version:   {}.{}.{}", major, minor, patch);
2✔
312
            fmt::println("Timestamp: {}", timestamp());
1✔
313
            fmt::print("SHA256:    ");
1✔
314
            for (const auto sha = sha256(); unsigned char h : sha)
33✔
315
                fmt::print("{:02x}", h);
32✔
316
            fmt::print("\n\n");
1✔
317
        }
1✔
318

319
        // reading the different tables, one after another
320

321
        if ((sStart.has_value() && !sEnd.has_value()) || (!sStart.has_value() && sEnd.has_value()))
2✔
322
        {
323
            fmt::print(fmt::fg(fmt::color::red), "Both start and end parameter need to be provided together\n");
×
324
            return;
×
325
        }
326
        if (sStart.has_value() && sEnd.has_value() && sStart.value() >= sEnd.value())
2✔
327
        {
328
            fmt::print(fmt::fg(fmt::color::red), "Invalid slice start and end arguments\n");
×
329
            return;
×
330
        }
331

332
        const auto syms = symbols();
2✔
333
        const auto vals = values(syms);
2✔
334
        const auto files = filenames(vals);
2✔
335
        const auto inst_locs = instLocations(files);
2✔
336
        const auto code_block = code(inst_locs);
2✔
337

338
        // symbols table
339
        {
340
            std::size_t size = syms.symbols.size();
2✔
341
            std::size_t sliceSize = size;
2✔
342
            bool showSym = (segment == BytecodeSegment::All || segment == BytecodeSegment::Symbols);
2✔
343

344
            if (showSym && sStart.has_value() && sEnd.has_value() && (sStart.value() > size || sEnd.value() > size))
2✔
345
                fmt::print(fmt::fg(fmt::color::red), "Slice start or end can't be greater than the segment size: {}\n", size);
×
346
            else if (showSym && sStart.has_value() && sEnd.has_value())
2✔
347
                sliceSize = sEnd.value() - sStart.value() + 1;
×
348

349
            if (showSym || segment == BytecodeSegment::HeadersOnly)
2✔
350
                fmt::println("{} (length: {})", fmt::styled("Symbols table", fmt::fg(fmt::color::cyan)), sliceSize);
1✔
351

352
            for (std::size_t j = 0; j < size; ++j)
396✔
353
            {
354
                if (auto start = sStart; auto end = sEnd)
394✔
355
                    showSym = showSym && (j >= start.value() && j <= end.value());
×
356

357
                if (showSym)
394✔
358
                    fmt::println("{}) {}", j, syms.symbols[j]);
×
359
            }
394✔
360

361
            if (showSym)
2✔
362
                fmt::print("\n");
1✔
363
            if (segment == BytecodeSegment::Symbols)
2✔
364
                return;
×
365
        }
2✔
366

367
        // values table
368
        {
369
            std::size_t size = vals.values.size();
2✔
370
            std::size_t sliceSize = size;
2✔
371

372
            bool showVal = (segment == BytecodeSegment::All || segment == BytecodeSegment::Values);
2✔
373
            if (showVal && sStart.has_value() && sEnd.has_value() && (sStart.value() > size || sEnd.value() > size))
2✔
374
                fmt::print(fmt::fg(fmt::color::red), "Slice start or end can't be greater than the segment size: {}\n", size);
×
375
            else if (showVal && sStart.has_value() && sEnd.has_value())
2✔
376
                sliceSize = sEnd.value() - sStart.value() + 1;
×
377

378
            if (showVal || segment == BytecodeSegment::HeadersOnly)
2✔
379
                fmt::println("{} (length: {})", fmt::styled("Constants table", fmt::fg(fmt::color::cyan)), sliceSize);
1✔
380

381
            for (std::size_t j = 0; j < size; ++j)
1,114✔
382
            {
383
                if (auto start = sStart; auto end = sEnd)
1,112✔
384
                    showVal = showVal && (j >= start.value() && j <= end.value());
×
385

386
                if (showVal)
1,112✔
387
                {
388
                    switch (const auto val = vals.values[j]; val.valueType())
1✔
389
                    {
×
390
                        case ValueType::Number:
391
                            fmt::println("{}) (Number) {}", j, val.number());
×
392
                            break;
1✔
393
                        case ValueType::String:
394
                            fmt::println("{}) (String) {}", j, val.string());
1✔
395
                            break;
1✔
396
                        case ValueType::PageAddr:
397
                            fmt::println("{}) (PageAddr) {}", j, val.pageAddr());
×
398
                            break;
×
399
                        default:
400
                            fmt::print(fmt::fg(fmt::color::red), "Value type not handled: {}\n", std::to_string(val.valueType()));
×
401
                            break;
×
402
                    }
1✔
403
                }
1✔
404
            }
1,112✔
405

406
            if (showVal)
2✔
407
                fmt::print("\n");
1✔
408
            if (segment == BytecodeSegment::Values)
2✔
409
                return;
×
410
        }
2✔
411

412
        // inst locs + file
413
        {
414
            std::size_t size = inst_locs.locations.size();
2✔
415
            std::size_t sliceSize = size;
2✔
416

417
            bool showVal = (segment == BytecodeSegment::All || segment == BytecodeSegment::InstructionLocation);
2✔
418
            if (showVal && sStart.has_value() && sEnd.has_value() && (sStart.value() > size || sEnd.value() > size))
2✔
419
                fmt::print(fmt::fg(fmt::color::red), "Slice start or end can't be greater than the segment size: {}\n", size);
×
420
            else if (showVal && sStart.has_value() && sEnd.has_value())
2✔
421
                sliceSize = sEnd.value() - sStart.value() + 1;
×
422

423
            if (showVal || segment == BytecodeSegment::HeadersOnly)
2✔
424
                fmt::println("{} (length: {})", fmt::styled("Instruction locations table", fmt::fg(fmt::color::cyan)), sliceSize);
1✔
425
            if (showVal && size > 0)
2✔
426
                fmt::println(" PP, IP");
1✔
427

428
            for (std::size_t j = 0; j < size; ++j)
4,405✔
429
            {
430
                if (auto start = sStart; auto end = sEnd)
4,403✔
431
                    showVal = showVal && (j >= start.value() && j <= end.value());
×
432

433
                const auto& location = inst_locs.locations[j];
4,403✔
434
                if (showVal)
4,403✔
435
                    fmt::println("{:>3},{:>3} -> {}:{}", location.page_pointer, location.inst_pointer, files.filenames[location.filename_id], location.line);
1✔
436
            }
4,403✔
437

438
            if (showVal)
2✔
439
                fmt::print("\n");
1✔
440
        }
2✔
441

442
        const auto stringify_value = [](const Value& val) -> std::string {
3✔
443
            switch (val.valueType())
1✔
444
            {
×
445
                case ValueType::Number:
446
                    return fmt::format("{} (Number)", val.number());
1✔
447
                case ValueType::String:
448
                    return fmt::format("{} (String)", val.string());
1✔
449
                case ValueType::PageAddr:
450
                    return fmt::format("{} (PageAddr)", val.pageAddr());
×
451
                default:
452
                    return "";
×
453
            }
454
        };
1✔
455

456
        enum class ArgKind
457
        {
458
            Symbol,
459
            Constant,
460
            Builtin,
461
            Raw,  ///< eg: Stack index, jump address, number
462
            ConstConst,
463
            ConstSym,
464
            SymConst,
465
            SymSym,
466
            BuiltinRaw,  ///< Builtin, number
467
            ConstRaw,    ///< Constant, number
468
            SymRaw,      ///< Symbol, number
469
            RawSym,      ///< Symbol index, symbol
470
            RawConst,    ///< Symbol index, constant
471
            RawRaw,      ///< Symbol index, symbol index
472
            RawRawRaw
473
        };
474

475
        struct Arg
476
        {
477
            ArgKind kind;
478
            uint8_t padding;
479
            uint16_t arg;
480

481
            [[nodiscard]] uint16_t primary() const
1✔
482
            {
1✔
483
                return arg & 0x0fff;
1✔
484
            }
485

486
            [[nodiscard]] uint16_t secondary() const
1✔
487
            {
1✔
488
                return static_cast<uint16_t>((padding << 4) | (arg & 0xf000) >> 12);
1✔
489
            }
490
        };
491

492
        const std::unordered_map<Instruction, ArgKind> arg_kinds = {
2✔
493
            { LOAD_FAST, ArgKind::Symbol },
494
            { LOAD_FAST_BY_INDEX, ArgKind::Raw },
495
            { LOAD_SYMBOL, ArgKind::Symbol },
496
            { LOAD_CONST, ArgKind::Constant },
497
            { POP_JUMP_IF_TRUE, ArgKind::Raw },
498
            { STORE, ArgKind::Symbol },
499
            { STORE_REF, ArgKind::Symbol },
500
            { SET_VAL, ArgKind::Symbol },
501
            { POP_JUMP_IF_FALSE, ArgKind::Raw },
502
            { JUMP, ArgKind::Raw },
503
            { CALL, ArgKind::Raw },
504
            { CAPTURE, ArgKind::Symbol },
505
            { RENAME_NEXT_CAPTURE, ArgKind::Symbol },
506
            { BUILTIN, ArgKind::Builtin },
507
            { DEL, ArgKind::Symbol },
508
            { MAKE_CLOSURE, ArgKind::Constant },
509
            { GET_FIELD, ArgKind::Symbol },
510
            { PLUGIN, ArgKind::Constant },
511
            { LIST, ArgKind::Raw },
512
            { APPEND, ArgKind::Raw },
513
            { CONCAT, ArgKind::Raw },
514
            { APPEND_IN_PLACE, ArgKind::Raw },
515
            { CONCAT_IN_PLACE, ArgKind::Raw },
516
            { POP_LIST, ArgKind::Raw },
517
            { POP_LIST_IN_PLACE, ArgKind::Raw },
518
            { SET_AT_INDEX, ArgKind::Raw },
519
            { SET_AT_2_INDEX, ArgKind::Raw },
520
            { RESET_SCOPE_JUMP, ArgKind::Raw },
521
            { GET_CURRENT_PAGE_ADDR, ArgKind::Symbol },
522
            { LOAD_CONST_LOAD_CONST, ArgKind::ConstConst },
523
            { LOAD_CONST_STORE, ArgKind::ConstSym },
524
            { LOAD_CONST_SET_VAL, ArgKind::ConstSym },
525
            { STORE_FROM, ArgKind::SymSym },
526
            { STORE_FROM_INDEX, ArgKind::RawSym },
527
            { SET_VAL_FROM, ArgKind::SymSym },
528
            { SET_VAL_FROM_INDEX, ArgKind::RawSym },
529
            { INCREMENT, ArgKind::SymRaw },
530
            { INCREMENT_BY_INDEX, ArgKind::RawRaw },
531
            { INCREMENT_STORE, ArgKind::RawRaw },
532
            { DECREMENT, ArgKind::SymRaw },
533
            { DECREMENT_BY_INDEX, ArgKind::RawRaw },
534
            { DECREMENT_STORE, ArgKind::SymRaw },
535
            { STORE_TAIL, ArgKind::SymSym },
536
            { STORE_TAIL_BY_INDEX, ArgKind::RawSym },
537
            { STORE_HEAD, ArgKind::SymSym },
538
            { STORE_HEAD_BY_INDEX, ArgKind::RawSym },
539
            { STORE_LIST, ArgKind::RawSym },
540
            { SET_VAL_TAIL, ArgKind::SymSym },
541
            { SET_VAL_TAIL_BY_INDEX, ArgKind::RawSym },
542
            { SET_VAL_HEAD, ArgKind::SymSym },
543
            { SET_VAL_HEAD_BY_INDEX, ArgKind::RawSym },
544
            { CALL_BUILTIN, ArgKind::BuiltinRaw },
545
            { CALL_BUILTIN_WITHOUT_RETURN_ADDRESS, ArgKind::BuiltinRaw },
546
            { LT_CONST_JUMP_IF_FALSE, ArgKind::ConstRaw },
547
            { LT_CONST_JUMP_IF_TRUE, ArgKind::ConstRaw },
548
            { LT_SYM_JUMP_IF_FALSE, ArgKind::SymRaw },
549
            { GT_CONST_JUMP_IF_TRUE, ArgKind::ConstRaw },
550
            { GT_CONST_JUMP_IF_FALSE, ArgKind::ConstRaw },
551
            { GT_SYM_JUMP_IF_FALSE, ArgKind::SymRaw },
552
            { EQ_CONST_JUMP_IF_TRUE, ArgKind::ConstRaw },
553
            { EQ_SYM_INDEX_JUMP_IF_TRUE, ArgKind::SymRaw },
554
            { NEQ_CONST_JUMP_IF_TRUE, ArgKind::ConstRaw },
555
            { NEQ_SYM_JUMP_IF_FALSE, ArgKind::SymRaw },
556
            { CALL_SYMBOL, ArgKind::SymRaw },
557
            { CALL_CURRENT_PAGE, ArgKind::SymRaw },
558
            { GET_FIELD_FROM_SYMBOL, ArgKind::SymSym },
559
            { GET_FIELD_FROM_SYMBOL_INDEX, ArgKind::RawSym },
560
            { AT_SYM_SYM, ArgKind::SymSym },
561
            { AT_SYM_INDEX_SYM_INDEX, ArgKind::RawRaw },
562
            { AT_SYM_INDEX_CONST, ArgKind::RawConst },
563
            { CHECK_TYPE_OF, ArgKind::SymConst },
564
            { CHECK_TYPE_OF_BY_INDEX, ArgKind::RawConst },
565
            { APPEND_IN_PLACE_SYM, ArgKind::SymRaw },
566
            { APPEND_IN_PLACE_SYM_INDEX, ArgKind::RawRaw },
567
            { STORE_LEN, ArgKind::RawSym },
568
            { LT_LEN_SYM_JUMP_IF_FALSE, ArgKind::SymRaw },
569
            { MUL_BY, ArgKind::RawRaw },
570
            { MUL_BY_INDEX, ArgKind::RawRaw },
571
            { MUL_SET_VAL, ArgKind::RawRaw },
572
            { FUSED_MATH, ArgKind::RawRawRaw }
573
        };
574

575
        const auto builtin_name = [](const uint16_t idx) {
4✔
576
            return Builtins::builtins[idx].first;
2✔
577
        };
578
        const auto value_str = [&stringify_value, &vals](const uint16_t idx) {
3✔
579
            return stringify_value(vals.values[idx]);
1✔
580
        };
581
        const auto symbol_name = [&syms](const uint16_t idx) {
5✔
582
            return syms.symbols[idx];
3✔
583
        };
584

585
        const auto color_print_inst = [=](const std::string& name, std::optional<Arg> arg = std::nullopt) {
17✔
586
            fmt::print("{}", fmt::styled(name, fmt::fg(fmt::color::gold)));
15✔
587
            if (arg.has_value())
15✔
588
            {
589
                constexpr auto sym_color = fmt::fg(fmt::color::green);
10✔
590
                constexpr auto const_color = fmt::fg(fmt::color::magenta);
10✔
591
                constexpr auto raw_color = fmt::fg(fmt::color::red);
10✔
592

593
                switch (auto [kind, _, idx] = arg.value(); kind)
15✔
594
                {
3✔
595
                    case ArgKind::Symbol:
596
                        fmt::print(sym_color, " {}\n", symbol_name(idx));
3✔
597
                        break;
4✔
598
                    case ArgKind::Constant:
599
                        fmt::print(const_color, " {}\n", value_str(idx));
1✔
600
                        break;
2✔
601
                    case ArgKind::Builtin:
602
                        fmt::print(" {}\n", builtin_name(idx));
1✔
603
                        break;
4✔
604
                    case ArgKind::Raw:
605
                        fmt::print(raw_color, " ({})\n", idx);
6✔
606
                        break;
3✔
607
                    case ArgKind::ConstConst:
608
                        fmt::print(" {}, {}\n", fmt::styled(value_str(arg->primary()), const_color), fmt::styled(value_str(arg->secondary()), const_color));
×
609
                        break;
×
610
                    case ArgKind::ConstSym:
611
                        fmt::print(" {}, {}\n", fmt::styled(value_str(arg->primary()), const_color), fmt::styled(symbol_name(arg->secondary()), sym_color));
×
612
                        break;
×
613
                    case ArgKind::SymConst:
614
                        fmt::print(" {}, {}\n", fmt::styled(symbol_name(arg->primary()), sym_color), fmt::styled(value_str(arg->secondary()), const_color));
×
615
                        break;
×
616
                    case ArgKind::SymSym:
617
                        fmt::print(" {}, {}\n", fmt::styled(symbol_name(arg->primary()), sym_color), fmt::styled(symbol_name(arg->secondary()), sym_color));
×
618
                        break;
1✔
619
                    case ArgKind::BuiltinRaw:
620
                        fmt::print(" {}, {}\n", builtin_name(arg->primary()), fmt::styled(arg->secondary(), raw_color));
1✔
621
                        break;
1✔
622
                    case ArgKind::ConstRaw:
623
                        fmt::print(" {}, {}\n", fmt::styled(value_str(arg->primary()), const_color), fmt::styled(arg->secondary(), raw_color));
×
624
                        break;
×
625
                    case ArgKind::SymRaw:
626
                        fmt::print(" {}, {}\n", fmt::styled(symbol_name(arg->primary()), sym_color), fmt::styled(arg->secondary(), raw_color));
×
627
                        break;
×
628
                    case ArgKind::RawSym:
629
                        fmt::print(" {}, {}\n", fmt::styled(arg->primary(), raw_color), fmt::styled(symbol_name(arg->secondary()), sym_color));
×
630
                        break;
×
631
                    case ArgKind::RawConst:
632
                        fmt::print(" {}, {}\n", fmt::styled(arg->primary(), raw_color), fmt::styled(value_str(arg->secondary()), const_color));
×
633
                        break;
×
634
                    case ArgKind::RawRaw:
635
                        fmt::print(" {}, {}\n", fmt::styled(arg->primary(), raw_color), fmt::styled(arg->secondary(), raw_color));
×
636
                        break;
1✔
637
                    case ArgKind::RawRawRaw:
638
                        fmt::print(" {}, {}, {}\n", fmt::styled(arg->padding, raw_color), fmt::styled((arg->arg & 0xff00) >> 8, raw_color), fmt::styled(arg->arg & 0x00ff, raw_color));
1✔
639
                        break;
1✔
640
                }
10✔
641
            }
10✔
642
            else
643
                fmt::print("\n");
5✔
644
        };
15✔
645

646
        if (segment == BytecodeSegment::All || segment == BytecodeSegment::Code || segment == BytecodeSegment::HeadersOnly)
2✔
647
        {
648
            uint16_t pp = 0;
2✔
649

650
            for (const auto& page : code_block.pages)
200✔
651
            {
652
                bool displayCode = true;
198✔
653

654
                if (auto wanted_page = cPage)
395✔
655
                    displayCode = pp == wanted_page.value();
197✔
656

657
                if (displayCode)
198✔
658
                    fmt::println(
2✔
659
                        "{} {} (length: {})",
2✔
660
                        fmt::styled("Code segment", fmt::fg(fmt::color::magenta)),
2✔
661
                        fmt::styled(pp, fmt::fg(fmt::color::magenta)),
2✔
662
                        page.size());
2✔
663

664
                if (page.empty())
198✔
665
                {
666
                    if (displayCode)
×
667
                        fmt::print("NOP");
×
668
                }
×
669
                else if (cPage.value_or(pp) == pp && segment != BytecodeSegment::HeadersOnly)
198✔
670
                {
671
                    if (sStart.has_value() && sEnd.has_value() && ((sStart.value() > page.size()) || (sEnd.value() > page.size())))
2✔
672
                    {
673
                        fmt::print(fmt::fg(fmt::color::red), "Slice start or end can't be greater than the segment size: {}\n", page.size());
×
674
                        return;
×
675
                    }
676

677
                    std::optional<InstLoc> previous_loc = std::nullopt;
2✔
678

679
                    for (std::size_t j = sStart.value_or(0), end = sEnd.value_or(page.size()); j < end; j += 4)
17✔
680
                    {
681
                        const uint8_t inst = page[j];
15✔
682
                        const uint8_t padding = page[j + 1];
15✔
683
                        const auto arg = static_cast<uint16_t>((page[j + 2] << 8) + page[j + 3]);
15✔
684

685
                        auto maybe_loc = findSourceLocation(inst_locs.locations, j, pp);
15✔
686

687
                        // location
688
                        // we want to print it only when it changed, either the file, the line, or both
689
                        if (maybe_loc && (!previous_loc || maybe_loc != previous_loc))
15✔
690
                        {
691
                            if (!previous_loc || previous_loc->filename_id != maybe_loc->filename_id)
2✔
692
                                fmt::println("{}", files.filenames[maybe_loc->filename_id]);
2✔
693
                            fmt::print("{:>4}", maybe_loc->line + 1);
2✔
694
                            previous_loc = maybe_loc;
2✔
695
                        }
2✔
696
                        else
697
                            fmt::print("    ");
13✔
698
                        // instruction number
699
                        fmt::print(fmt::fg(fmt::color::cyan), "{:>4}", j / 4);
15✔
700
                        // padding inst arg arg
701
                        fmt::print(" {:02x} {:02x} {:02x} {:02x} ", inst, padding, page[j + 2], page[j + 3]);
15✔
702

703
                        if (const auto idx = static_cast<std::size_t>(inst); idx < InstructionNames.size())
30✔
704
                        {
705
                            const auto inst_name = InstructionNames[idx];
15✔
706
                            if (const auto iinst = static_cast<Instruction>(inst); arg_kinds.contains(iinst))
30✔
707
                                color_print_inst(inst_name, Arg { arg_kinds.at(iinst), padding, arg });
10✔
708
                            else
709
                                color_print_inst(inst_name);
5✔
710
                        }
15✔
711
                        else
712
                            fmt::println("Unknown instruction");
×
713
                    }
15✔
714
                }
2✔
715
                if (displayCode && segment != BytecodeSegment::HeadersOnly)
198✔
716
                    fmt::print("\n");
2✔
717

718
                ++pp;
198✔
719
            }
198✔
720
        }
2✔
721
    }
2✔
722

723
    uint16_t BytecodeReader::readNumber(std::size_t& i) const
108,360✔
724
    {
108,360✔
725
        const auto x = static_cast<uint16_t>(m_bytecode[i] << 8);
108,360✔
726
        const uint16_t y = m_bytecode[++i];
108,360✔
727
        return x + y;
216,720✔
728
    }
108,360✔
729
}
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc