fluencelabs/assemblyscript
1
0
Fork 0
mirror of https://github.com/fluencelabs/assemblyscript synced 2025-06-12 14:31:28 +00:00
Code Issues Projects Releases Wiki Activity

Revised implicit type conversions; Initial function expression compilation

Browse Source
This commit is contained in:
dcodeIO
2018-02-28 01:48:01 +01:00
parent bda6cb9792
commit d4c00eaba3
36 changed files with 940 additions and 1754 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
std/assembly/allocator/arena.ts
View File

@ -17,7 +17,7 @@ export function allocate_memory(size: usize): usize {
var off = (ptr + size + ALIGN_MASK) & ~ALIGN_MASK;
var avail = <usize>current_memory() << 16;
if (off > avail && grow_memory(
max(
<i32>max(
(((off + 0xffff) & ~0xffff) - avail) >> 16, // minimum required pages
avail >> 16 // at least double memory
)

20
std/assembly/array.ts
View File

@ -8,7 +8,7 @@ export class Array<T> {
assert(newCapacity > this.__capacity);
var newMemory = allocate_memory(<usize>newCapacity * sizeof<T>());
if (this.__memory) {
move_memory(newMemory, this.__memory, this.__capacity * sizeof<T>());
move_memory(newMemory, this.__memory, <usize>this.__capacity * sizeof<T>());
free_memory(this.__memory);
}
this.__memory = newMemory;
@ -63,7 +63,7 @@ export class Array<T> {
fromIndex = this.__length + fromIndex;
}
while (<u32>fromIndex < this.__length) {
if (load<T>(this.__memory + fromIndex * sizeof<T>()) == searchElement) {
if (load<T>(this.__memory + <usize>fromIndex * sizeof<T>()) == searchElement) {
return fromIndex;
}
++fromIndex;
@ -78,7 +78,7 @@ export class Array<T> {
fromIndex = this.__length - 1;
}
while (fromIndex >= 0) {
if (load<T>(this.__memory + fromIndex * sizeof<T>()) == searchElement) {
if (load<T>(this.__memory + <usize>fromIndex * sizeof<T>()) == searchElement) {
return fromIndex;
}
--fromIndex;
@ -90,7 +90,7 @@ export class Array<T> {
if (this.__length == this.__capacity) {
this.__grow(this.__capacity ? this.__capacity << 1 : 1);
}
store<T>(this.__memory + this.__length * sizeof<T>(), element);
store<T>(this.__memory + <usize>this.__length * sizeof<T>(), element);
return ++this.__length;
}
@ -98,7 +98,7 @@ export class Array<T> {
if (this.__length < 1) {
throw new RangeError("Array is empty"); // return changetype<T>(0) ?
}
return load<T>(this.__memory + --this.__length * sizeof<T>());
return load<T>(this.__memory + <usize>--this.__length * sizeof<T>());
}
shift(): T {
@ -109,10 +109,10 @@ export class Array<T> {
move_memory(
this.__memory,
this.__memory + sizeof<T>(),
(this.__capacity - 1) * sizeof<T>()
<usize>(this.__capacity - 1) * sizeof<T>()
);
set_memory(
this.__memory + (this.__capacity - 1) * sizeof<T>(),
this.__memory + <usize>(this.__capacity - 1) * sizeof<T>(),
0,
sizeof<T>()
);
@ -131,7 +131,7 @@ export class Array<T> {
move_memory(
newMemory + sizeof<T>(),
this.__memory,
oldCapacity * sizeof<T>()
<usize>oldCapacity * sizeof<T>()
);
free_memory(this.__memory);
}
@ -141,7 +141,7 @@ export class Array<T> {
move_memory(
this.__memory + sizeof<T>(),
this.__memory,
oldCapacity * sizeof<T>()
<usize>oldCapacity * sizeof<T>()
);
}
store<T>(this.__memory, element);
@ -196,7 +196,7 @@ export class Array<T> {
move_memory(
this.__memory + <usize>start * sizeof<T>(),
this.__memory + <usize>(start + deleteCount) * sizeof<T>(),
deleteCount * sizeof<T>()
<usize>deleteCount * sizeof<T>()
);
this.__length -= deleteCount;
}

4
std/assembly/builtins.ts
View File

@ -133,10 +133,10 @@ declare function isize(value: void): isize;
namespace isize {
export const MIN_VALUE: isize = sizeof<i32>() == sizeof<isize>()
? -2147483648
: <usize>-9223372036854775808;
: <isize>-9223372036854775808;
export const MAX_VALUE: isize = sizeof<i32>() == sizeof<isize>()
? 2147483647
: <usize>9223372036854775807;
: <isize>9223372036854775807;
}
export { isize };

6
std/assembly/set.ts
View File

@ -13,7 +13,7 @@ export class Set<T> {
}
get size(): i32 {
return this.__size;
return <i32>this.__size;
}
// FIXME: not a proper set implementation, just a filler
@ -52,11 +52,11 @@ export class Set<T> {
for (var index: usize = 0, limit: usize = this.__size; index < limit; ++index) {
if (load<T>(this.__memory + index * sizeof<T>()) == value) {
if (index + 1 < this.__size) {
if (index + 1 < limit) {
move_memory(
this.__memory + index * sizeof<T>(),
this.__memory + (index + 1) * sizeof<T>(),
this.__size - index - 1
limit - index - 1
);
}
--this.__size;