}
/* ensure all data is in LE format */
- util_endianswap(&code_header->version, 1, sizeof(code_header->version));
- util_endianswap(&code_header->crc16, 1, sizeof(code_header->crc16));
- util_endianswap(&code_header->statements.offset, 1, sizeof(code_header->statements.offset));
- util_endianswap(&code_header->statements.length, 1, sizeof(code_header->statements.length));
- util_endianswap(&code_header->defs.offset, 1, sizeof(code_header->defs.offset));
- util_endianswap(&code_header->defs.length, 1, sizeof(code_header->defs.length));
- util_endianswap(&code_header->fields.offset, 1, sizeof(code_header->fields.offset));
- util_endianswap(&code_header->fields.length, 1, sizeof(code_header->fields.length));
- util_endianswap(&code_header->functions.offset, 1, sizeof(code_header->functions.offset));
- util_endianswap(&code_header->functions.length, 1, sizeof(code_header->functions.length));
- util_endianswap(&code_header->strings.offset, 1, sizeof(code_header->strings.offset));
- util_endianswap(&code_header->strings.length, 1, sizeof(code_header->strings.length));
- util_endianswap(&code_header->globals.offset, 1, sizeof(code_header->globals.offset));
- util_endianswap(&code_header->globals.length, 1, sizeof(code_header->globals.length));
- util_endianswap(&code_header->entfield, 1, sizeof(code_header->entfield));
+ util_swap_header(code_header);
/*
* These are not part of the header but we ensure LE format here to save on duplicated
* code.
*/
- for (i = 0; i < vec_size(code->statements); ++i) {
- util_endianswap(&code->statements[i].opcode, 1, sizeof(code->statements[i].opcode));
- util_endianswap(&code->statements[i].o1, 1, sizeof(code->statements[i].o1));
- util_endianswap(&code->statements[i].o2, 1, sizeof(code->statements[i].o2));
- util_endianswap(&code->statements[i].o3, 1, sizeof(code->statements[i].o3));
- }
-
- for (i = 0; i < vec_size(code->defs); ++i) {
- util_endianswap(&code->defs[i].type, 1, sizeof(code->defs[i].type));
- util_endianswap(&code->defs[i].offset, 1, sizeof(code->defs[i].offset));
- util_endianswap(&code->defs[i].name, 1, sizeof(code->defs[i].name));
- }
-
- for (i = 0; i < vec_size(code->fields); ++i) {
- util_endianswap(&code->fields[i].type, 1, sizeof(code->fields[i].type));
- util_endianswap(&code->fields[i].offset, 1, sizeof(code->fields[i].offset));
- util_endianswap(&code->fields[i].name, 1, sizeof(code->fields[i].name));
- }
-
- for (i = 0; i < vec_size(code->functions); ++i) {
- util_endianswap(&code->functions[i].entry, 1, sizeof(code->functions[i].entry));
- util_endianswap(&code->functions[i].firstlocal, 1, sizeof(code->functions[i].firstlocal));
- util_endianswap(&code->functions[i].locals, 1, sizeof(code->functions[i].locals));
- util_endianswap(&code->functions[i].profile, 1, sizeof(code->functions[i].profile));
- util_endianswap(&code->functions[i].name, 1, sizeof(code->functions[i].name));
- util_endianswap(&code->functions[i].file, 1, sizeof(code->functions[i].file));
- util_endianswap(&code->functions[i].nargs, 1, sizeof(code->functions[i].nargs));
- /* Don't swap argsize[] - it's just a byte array, which Quake uses only as such. */
- }
-
- util_endianswap(code->globals, vec_size(code->globals), sizeof(int32_t));
-
+ util_swap_statements (code->statements);
+ util_swap_defs_fields(code->defs);
+ util_swap_defs_fields(code->fields);
+ util_swap_functions (code->functions);
+ util_swap_globals (code->globals);
if (!OPTS_OPTION_BOOL(OPTION_QUIET)) {
if (lnofile)
return NULL;
}
+ util_swap_header(&header);
+
if (!skipversion && header.version != 6) {
loaderror("header says this is a version %i progs, we need version 6\n", header.version);
fs_file_close(file);
read_data1(strings);
read_data2(globals, 2); /* reserve more in case a RETURN using with the global at "the end" exists */
+ util_swap_statements (prog->code);
+ util_swap_defs_fields(prog->defs);
+ util_swap_defs_fields(prog->fields);
+ util_swap_functions (prog->functions);
+ util_swap_globals (prog->globals);
+
fs_file_close(file);
/* profile counters */
return 0;
}
+static int qc_pow(qc_program_t *prog) {
+ qcany_t *base, *exp, out;
+ CheckArgs(2);
+ base = GetArg(0);
+ exp = GetArg(1);
+ out._float = powf(base->_float, exp->_float);
+ Return(out);
+ return 0;
+}
+
static prog_builtin_t qc_builtins[] = {
NULL,
&qc_print, /* 1 */
&qc_strcmp, /* 11 */
&qc_normalize, /* 12 */
&qc_sqrt, /* 13 */
- &qc_floor /* 14 */
+ &qc_floor, /* 14 */
+ &qc_pow /* 15 */
};
static const char *arg0 = NULL;
static GMQCC_INLINE ast_expression *fold_op_lshift(fold_t *fold, ast_value *a, ast_value *b) {
if (fold_can_2(a, b) && isfloats(a, b))
- return fold_constgen_float(fold, (qcfloat_t)(((qcuint_t)(floorf(fold_immvalue_float(a) * powf(2.0f, fold_immvalue_float(b))))) & 0xFFFFFF));
+ return fold_constgen_float(fold, (qcfloat_t)floorf(fold_immvalue_float(a) * powf(2.0f, fold_immvalue_float(b))));
return NULL;
}
static GMQCC_INLINE ast_expression *fold_op_rshift(fold_t *fold, ast_value *a, ast_value *b) {
if (fold_can_2(a, b) && isfloats(a, b))
- return fold_constgen_float(fold, (qcfloat_t)(((qcuint_t)(floorf(fold_immvalue_float(a) / powf(2.0f, fold_immvalue_float(b))))) & 0xFFFFFF));
+ return fold_constgen_float(fold, (qcfloat_t)floorf(fold_immvalue_float(a) / powf(2.0f, fold_immvalue_float(b))));
return NULL;
}
/* TODO: elide */
extern const char *util_instr_str[VINSTR_END];
+void util_swap_header (prog_header_t *code_header);
+void util_swap_statements (prog_section_statement_t *statements);
+void util_swap_defs_fields(prog_section_both_t *section);
+void util_swap_functions (prog_section_function_t *functions);
+void util_swap_globals (int32_t *globals);
typedef float qcfloat_t;
typedef int32_t qcint_t;
vector (vector) normalize = #12;
float (float) sqrt = #13;
float (float) floor = #14;
+float (float, float) pow = #15;
-float pow(float x, float y) {
- return __builtin_pow(x, y);
-}
-
void main() {
- float hundy = pow(10, 2); // 10^2 == 100
+ float hundy = __builtin_pow(10, 2); // 10^2 == 100
print(ftos(hundy), "\n"); // prints: 100
+ hundy = pow(10, 2);
+ print(ftos(hundy), "\n");
+
hundy -= 90; // 100-90 = 10
print(ftos(hundy ** 2), "\n"); // prints: 100
+ print(ftos(pow(hundy, 2)), "\n"); // prints: 100
hundy = 10.0f;
print(ftos(__builtin_exp(hundy)), "\n"); // prints: 22026.5
E: $null
M: 100
M: 100
+M: 100
+M: 100
M: 22026.5
}
*/
size_t i;
+ l *= 2;
for (i = 0; i < l; i += 2) {
uint32_t v1 = d[i];
d[i] = d[i+1];
}
#endif
-void util_endianswap(void *_data, size_t length, unsigned int typesize) {
+void util_endianswap(void *_data, size_t count, unsigned int typesize) {
# if PLATFORM_BYTE_ORDER == -1 /* runtime check */
if (*((char*)&typesize))
return;
#else
- /* prevent unused warnings */
- (void) _data;
- (void) length;
- (void) typesize;
# if PLATFORM_BYTE_ORDER == GMQCC_BYTE_ORDER_LITTLE
+ /* prevent unused warnings */
+ (void) _data;
+ (void) count;
+ (void) typesize;
return;
# else
switch (typesize) {
case 1: return;
case 2:
- util_swap16((uint16_t*)_data, length);
+ util_swap16((uint16_t*)_data, count);
return;
case 4:
- util_swap32((uint32_t*)_data, length);
+ util_swap32((uint32_t*)_data, count);
return;
case 8:
- util_swap64((uint32_t*)_data, length<<1); /* swap64 operates on 32 bit words, thus scale to that length. */
+ util_swap64((uint32_t*)_data, count);
return;
default:
#endif
}
+void util_swap_header(prog_header_t *code_header) {
+ util_endianswap(&code_header->version, 1, sizeof(code_header->version));
+ util_endianswap(&code_header->crc16, 1, sizeof(code_header->crc16));
+ util_endianswap(&code_header->statements.offset, 1, sizeof(code_header->statements.offset));
+ util_endianswap(&code_header->statements.length, 1, sizeof(code_header->statements.length));
+ util_endianswap(&code_header->defs.offset, 1, sizeof(code_header->defs.offset));
+ util_endianswap(&code_header->defs.length, 1, sizeof(code_header->defs.length));
+ util_endianswap(&code_header->fields.offset, 1, sizeof(code_header->fields.offset));
+ util_endianswap(&code_header->fields.length, 1, sizeof(code_header->fields.length));
+ util_endianswap(&code_header->functions.offset, 1, sizeof(code_header->functions.offset));
+ util_endianswap(&code_header->functions.length, 1, sizeof(code_header->functions.length));
+ util_endianswap(&code_header->strings.offset, 1, sizeof(code_header->strings.offset));
+ util_endianswap(&code_header->strings.length, 1, sizeof(code_header->strings.length));
+ util_endianswap(&code_header->globals.offset, 1, sizeof(code_header->globals.offset));
+ util_endianswap(&code_header->globals.length, 1, sizeof(code_header->globals.length));
+ util_endianswap(&code_header->entfield, 1, sizeof(code_header->entfield));
+}
+
+void util_swap_statements(prog_section_statement_t *statements) {
+ size_t i;
+
+ for (i = 0; i < vec_size(statements); ++i) {
+ util_endianswap(&statements[i].opcode, 1, sizeof(statements[i].opcode));
+ util_endianswap(&statements[i].o1, 1, sizeof(statements[i].o1));
+ util_endianswap(&statements[i].o2, 1, sizeof(statements[i].o2));
+ util_endianswap(&statements[i].o3, 1, sizeof(statements[i].o3));
+ }
+}
+
+void util_swap_defs_fields(prog_section_both_t *section) {
+ size_t i;
+
+ for (i = 0; i < vec_size(section); ++i) {
+ util_endianswap(§ion[i].type, 1, sizeof(section[i].type));
+ util_endianswap(§ion[i].offset, 1, sizeof(section[i].offset));
+ util_endianswap(§ion[i].name, 1, sizeof(section[i].name));
+ }
+}
+
+void util_swap_functions(prog_section_function_t *functions) {
+ size_t i;
+
+ for (i = 0; i < vec_size(functions); ++i) {
+ util_endianswap(&functions[i].entry, 1, sizeof(functions[i].entry));
+ util_endianswap(&functions[i].firstlocal, 1, sizeof(functions[i].firstlocal));
+ util_endianswap(&functions[i].locals, 1, sizeof(functions[i].locals));
+ util_endianswap(&functions[i].profile, 1, sizeof(functions[i].profile));
+ util_endianswap(&functions[i].name, 1, sizeof(functions[i].name));
+ util_endianswap(&functions[i].file, 1, sizeof(functions[i].file));
+ util_endianswap(&functions[i].nargs, 1, sizeof(functions[i].nargs));
+ /* Don't swap argsize[] - it's just a byte array, which Quake uses only as such. */
+ }
+}
+
+void util_swap_globals(int32_t *globals) {
+ util_endianswap(globals, vec_size(globals), sizeof(int32_t));
+}
+
/*
* Based On:
* Slicing-by-8 algorithms by Michael E.