|
dvander@0
|
1 |
/* |
|
dvander@0
|
2 |
* Copyright (C) 2012 David Anderson |
|
dvander@0
|
3 |
* |
|
dvander@0
|
4 |
* This file is part of JITCraft. |
|
dvander@0
|
5 |
* |
|
dvander@0
|
6 |
* JITCraft is free software: you can redistribute it and/or modify it under |
|
dvander@0
|
7 |
* the terms of the GNU General Public License as published by the Free |
|
dvander@0
|
8 |
* Software Foundation, either version 3 of the License, or (at your option) |
|
dvander@0
|
9 |
* any later version. |
|
dvander@0
|
10 |
* |
|
dvander@0
|
11 |
* Foobar is distributed in the hope that it will be useful, but WITHOUT ANY |
|
dvander@0
|
12 |
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
|
dvander@0
|
13 |
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. |
|
dvander@0
|
14 |
* |
|
dvander@0
|
15 |
* You should have received a copy of the GNU General Public License along with |
|
dvander@0
|
16 |
* JITCraft. If not, see http://www.gnu.org/licenses/. |
|
dvander@0
|
17 |
*/ |
|
dvander@0
|
18 |
#include <stdlib.h> |
|
dvander@0
|
19 |
#include "BytecodeEmitter.h" |
|
dvander@0
|
20 |
#include "Utility.h" |
|
dvander@0
|
21 |
#include "Types.h" |
|
dvander@0
|
22 |
|
|
dvander@0
|
23 |
using namespace jc; |
|
dvander@0
|
24 |
|
|
dvander@0
|
25 |
BytecodeEmitter::BytecodeEmitter() |
|
dvander@0
|
26 |
: buffer_(inline_buffer_), |
|
dvander@0
|
27 |
buffer_pos_(buffer_), |
|
dvander@0
|
28 |
buffer_end_(buffer_pos_ + ARRAY_LENGTH(inline_buffer_)), |
|
dvander@0
|
29 |
oom_(false), |
|
dvander@0
|
30 |
stackDepth_(0), |
|
dvander@0
|
31 |
maxStackDepth_(0) |
|
dvander@0
|
32 |
{ |
|
dvander@0
|
33 |
} |
|
dvander@0
|
34 |
|
|
dvander@0
|
35 |
bool |
|
dvander@0
|
36 |
BytecodeEmitter::growBuffer(size_t nbytes) |
|
dvander@0
|
37 |
{ |
|
dvander@0
|
38 |
if (oom_) { |
|
dvander@0
|
39 |
buffer_pos_ = buffer_; |
|
dvander@0
|
40 |
return false; |
|
dvander@0
|
41 |
} |
|
dvander@0
|
42 |
|
|
dvander@0
|
43 |
size_t newSize = size_t((buffer_end_ - buffer_) * 2); |
|
dvander@0
|
44 |
if (newSize >= MAX_LENGTH) { |
|
dvander@0
|
45 |
oom_ = true; |
|
dvander@0
|
46 |
buffer_pos_ = buffer_; |
|
dvander@0
|
47 |
return false; |
|
dvander@0
|
48 |
} |
|
dvander@0
|
49 |
|
|
dvander@0
|
50 |
bytecode *newBuffer; |
|
dvander@0
|
51 |
if (buffer_ == inline_buffer_) |
|
dvander@0
|
52 |
newBuffer = (bytecode *)malloc(nbytes); |
|
dvander@0
|
53 |
else |
|
dvander@0
|
54 |
newBuffer = (bytecode *)realloc(buffer_, newSize); |
|
dvander@0
|
55 |
|
|
dvander@0
|
56 |
// If we can't allocate a buffer, reset the buffer to the start and set |
|
dvander@0
|
57 |
// a flag to indicate out-of-memory. |
|
dvander@0
|
58 |
if (!newBuffer) { |
|
dvander@0
|
59 |
oom_ = true; |
|
dvander@0
|
60 |
buffer_pos_ = buffer_; |
|
dvander@0
|
61 |
return false; |
|
dvander@0
|
62 |
} |
|
dvander@0
|
63 |
|
|
dvander@0
|
64 |
buffer_pos_ = newBuffer + size_t(buffer_pos_ - buffer_); |
|
dvander@0
|
65 |
buffer_ = newBuffer; |
|
dvander@0
|
66 |
buffer_end_ = buffer_ + newSize; |
|
dvander@0
|
67 |
return true; |
|
dvander@0
|
68 |
} |
|
dvander@0
|
69 |
|
|
dvander@0
|
70 |
void |
|
dvander@0
|
71 |
BytecodeEmitter::stackarray(Type *type) |
|
dvander@0
|
72 |
{ |
|
dvander@7
|
73 |
assert(type->innermost()->primitive() == PrimitiveType_Int32 || |
|
dvander@7
|
74 |
type->innermost()->primitive() == PrimitiveType_Float); |
|
dvander@0
|
75 |
|
|
dvander@0
|
76 |
ensure((sizeof(Opcode) * 3) + sizeof(unsigned) * Type::MAX_UNSAFE_ARRAY_DEPTH); |
|
dvander@0
|
77 |
writeOp(OP_STACKARRAY); |
|
dvander@0
|
78 |
writeUint8(sizeof(unsigned)); |
|
dvander@0
|
79 |
writeUint8(type->levels()); |
|
dvander@0
|
80 |
|
|
dvander@0
|
81 |
for (; type->isArray(); type = type->contained()) |
|
dvander@0
|
82 |
writeUint32(type->elements()); |
|
dvander@0
|
83 |
} |