mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 14:54:07 +10:00
Kayne Ruse
14653a303f
To help with storing strings within tables, I've replaced the unused '_padding' member of 'Toy_String' with 'cachedHash', which is set to zero on string allocation. The hash of a string isn't generated and stored until it's actually needed, as the rope pattern means not every string needs a hash - hopefully this will save unnecessarily wasted time. When a hash of a string is needed, the hashing function first checks to see if that string already has one, and if so, returns it. Again, less time wasted. When generating a new string hash, the hashing function takes the string's type into account, as node-based strings first need their contents assembled into a simple char buffer. Other changes include: * Changed 'TOY_VALUE_TO_*' to 'TOY_VALUE_FROM_*' * Changed 'TOY_VALUE_IS_EQUAL' to 'TOY_VALUES_ARE_EQUAL' * Added a missing '#pragma once' to 'toy_print.h'
46 lines
865 B
C
46 lines
865 B
C
#pragma once
|
|
|
|
typedef enum Toy_OpcodeType {
|
|
//variable instructions
|
|
TOY_OPCODE_READ,
|
|
TOY_OPCODE_LOAD,
|
|
TOY_OPCODE_LOAD_LONG, //corner case
|
|
TOY_OPCODE_DECLARE,
|
|
TOY_OPCODE_ASSIGN,
|
|
TOY_OPCODE_ACCESS,
|
|
|
|
//arithmetic instructions
|
|
TOY_OPCODE_ADD,
|
|
TOY_OPCODE_SUBTRACT,
|
|
TOY_OPCODE_MULTIPLY,
|
|
TOY_OPCODE_DIVIDE,
|
|
TOY_OPCODE_MODULO,
|
|
|
|
//comparison instructions
|
|
TOY_OPCODE_COMPARE_EQUAL,
|
|
// TOY_OPCODE_COMPARE_NOT,
|
|
TOY_OPCODE_COMPARE_LESS,
|
|
TOY_OPCODE_COMPARE_LESS_EQUAL,
|
|
TOY_OPCODE_COMPARE_GREATER,
|
|
TOY_OPCODE_COMPARE_GREATER_EQUAL,
|
|
|
|
//logical instructions
|
|
TOY_OPCODE_AND,
|
|
TOY_OPCODE_OR,
|
|
TOY_OPCODE_TRUTHY,
|
|
TOY_OPCODE_NEGATE,
|
|
|
|
//control instructions
|
|
TOY_OPCODE_RETURN,
|
|
|
|
//various action instructions
|
|
TOY_OPCODE_PRINT,
|
|
//TODO: clear the program stack
|
|
|
|
//meta instructions
|
|
TOY_OPCODE_PASS,
|
|
TOY_OPCODE_ERROR,
|
|
TOY_OPCODE_EOF = 255,
|
|
} Toy_OpcodeType;
|
|
|