-
Notifications
You must be signed in to change notification settings - Fork 241
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat(avm): tagged memory #4213
Merged
Merged
feat(avm): tagged memory #4213
Changes from all commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
64d0fdb
WIP prototyping memory types interfaces
fcarreiro 7ff4eb6
WIP tagged memory
fcarreiro 2af730c
fix tests
fcarreiro dbc296f
format
fcarreiro f4f3945
more fixing and formatting
fcarreiro 4d5ba0a
format
fcarreiro 051eec1
remove comment
fcarreiro b35ced1
Merge branch 'master' into fc/01-24-tagged-memory
Maddiaa0 bbc10d4
fix: compilation error
Maddiaa0 File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
22 changes: 22 additions & 0 deletions
22
yarn-project/acir-simulator/src/avm/avm_memory_types.test.ts
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
import { Field, Uint8 } from './avm_memory_types.js'; | ||
|
||
// TODO: complete | ||
describe('Uint8', () => { | ||
it('Unsigned 8 max value', () => { | ||
expect(new Uint8(255).toBigInt()).toEqual(255n); | ||
}); | ||
|
||
it('Unsigned 8 bit add', () => { | ||
expect(new Uint8(50).add(new Uint8(20))).toEqual(new Uint8(70)); | ||
}); | ||
|
||
it('Unsigned 8 bit add wraps', () => { | ||
expect(new Uint8(200).add(new Uint8(100))).toEqual(new Uint8(44)); | ||
}); | ||
}); | ||
|
||
describe('Field', () => { | ||
it('Add correctly without wrapping', () => { | ||
expect(new Field(27).add(new Field(48))).toEqual(new Field(75)); | ||
}); | ||
}); |
276 changes: 276 additions & 0 deletions
276
yarn-project/acir-simulator/src/avm/avm_memory_types.ts
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,276 @@ | ||
import { Fr } from '@aztec/foundation/fields'; | ||
|
||
import { strict as assert } from 'assert'; | ||
|
||
export interface MemoryValue { | ||
add(rhs: MemoryValue): MemoryValue; | ||
sub(rhs: MemoryValue): MemoryValue; | ||
mul(rhs: MemoryValue): MemoryValue; | ||
div(rhs: MemoryValue): MemoryValue; | ||
|
||
// Use sparingly. | ||
toBigInt(): bigint; | ||
} | ||
|
||
export interface IntegralValue extends MemoryValue { | ||
shl(rhs: IntegralValue): IntegralValue; | ||
shr(rhs: IntegralValue): IntegralValue; | ||
and(rhs: IntegralValue): IntegralValue; | ||
or(rhs: IntegralValue): IntegralValue; | ||
xor(rhs: IntegralValue): IntegralValue; | ||
not(): IntegralValue; | ||
} | ||
|
||
// TODO: Optimize calculation of mod, etc. Can only do once per class? | ||
abstract class UnsignedInteger implements IntegralValue { | ||
private readonly bitmask: bigint; | ||
private readonly mod: bigint; | ||
|
||
protected constructor(private n: bigint, private bits: bigint) { | ||
assert(bits > 0); | ||
// x % 2^n == x & (2^n - 1) | ||
this.mod = 1n << bits; | ||
fcarreiro marked this conversation as resolved.
Show resolved
Hide resolved
|
||
this.bitmask = this.mod - 1n; | ||
assert(n < this.mod); | ||
} | ||
|
||
// We need this to be able to build an instance of the subclass | ||
// and not of type UnsignedInteger. | ||
protected abstract build(n: bigint): UnsignedInteger; | ||
|
||
public add(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build((this.n + rhs.n) & this.bitmask); | ||
} | ||
|
||
public sub(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
const res: bigint = this.n - rhs.n; | ||
return this.build(res >= 0 ? res : res + this.mod); | ||
} | ||
|
||
public mul(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build((this.n * rhs.n) & this.bitmask); | ||
} | ||
|
||
public div(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build(this.n / rhs.n); | ||
} | ||
|
||
// No sign extension. | ||
public shr(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
// Note that this.n is > 0 by class invariant. | ||
return this.build(this.n >> rhs.n); | ||
} | ||
|
||
public shl(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build((this.n << rhs.n) & this.bitmask); | ||
} | ||
|
||
public and(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build(this.n & rhs.n); | ||
} | ||
|
||
public or(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build(this.n | rhs.n); | ||
} | ||
|
||
public xor(rhs: UnsignedInteger): UnsignedInteger { | ||
assert(this.bits == rhs.bits); | ||
return this.build(this.n ^ rhs.n); | ||
} | ||
|
||
public not(): UnsignedInteger { | ||
return this.build(~this.n & this.bitmask); | ||
} | ||
|
||
public toBigInt(): bigint { | ||
return this.n; | ||
} | ||
|
||
public equals(rhs: UnsignedInteger) { | ||
return this.bits == rhs.bits && this.toBigInt() == rhs.toBigInt(); | ||
} | ||
} | ||
|
||
export class Uint8 extends UnsignedInteger { | ||
constructor(n: number | bigint) { | ||
super(BigInt(n), 8n); | ||
} | ||
|
||
protected build(n: bigint): Uint8 { | ||
return new Uint8(n); | ||
} | ||
} | ||
|
||
export class Uint16 extends UnsignedInteger { | ||
constructor(n: number | bigint) { | ||
super(BigInt(n), 16n); | ||
} | ||
|
||
protected build(n: bigint): Uint16 { | ||
return new Uint16(n); | ||
} | ||
} | ||
|
||
export class Uint32 extends UnsignedInteger { | ||
constructor(n: number | bigint) { | ||
super(BigInt(n), 32n); | ||
} | ||
|
||
protected build(n: bigint): Uint32 { | ||
return new Uint32(n); | ||
} | ||
} | ||
|
||
export class Uint64 extends UnsignedInteger { | ||
constructor(n: number | bigint) { | ||
super(BigInt(n), 64n); | ||
} | ||
|
||
protected build(n: bigint): Uint64 { | ||
return new Uint64(n); | ||
} | ||
} | ||
|
||
export class Uint128 extends UnsignedInteger { | ||
constructor(n: number | bigint) { | ||
super(BigInt(n), 128n); | ||
} | ||
|
||
protected build(n: bigint): Uint128 { | ||
return new Uint128(n); | ||
} | ||
} | ||
|
||
export class Field implements MemoryValue { | ||
public static readonly MODULUS: bigint = Fr.MODULUS; | ||
private readonly rep: Fr; | ||
|
||
constructor(v: number | bigint | Fr) { | ||
this.rep = new Fr(v); | ||
} | ||
|
||
public add(rhs: Field): Field { | ||
return new Field(this.rep.add(rhs.rep)); | ||
} | ||
|
||
public sub(rhs: Field): Field { | ||
return new Field(this.rep.sub(rhs.rep)); | ||
} | ||
|
||
public mul(rhs: Field): Field { | ||
return new Field(this.rep.mul(rhs.rep)); | ||
} | ||
|
||
public div(rhs: Field): Field { | ||
return new Field(this.rep.div(rhs.rep)); | ||
} | ||
|
||
public toBigInt(): bigint { | ||
return this.rep.toBigInt(); | ||
} | ||
} | ||
|
||
export enum TypeTag { | ||
UNINITIALIZED, | ||
UINT8, | ||
UINT16, | ||
UINT32, | ||
UINT64, | ||
UINT128, | ||
FIELD, | ||
INVALID, | ||
} | ||
|
||
// TODO: Consider automatic conversion when getting undefined values. | ||
export class TaggedMemory { | ||
static readonly MAX_MEMORY_SIZE = 1n << 32n; | ||
private _mem: MemoryValue[]; | ||
|
||
constructor() { | ||
this._mem = []; | ||
} | ||
|
||
public get(offset: number): MemoryValue { | ||
return this.getAs<MemoryValue>(offset); | ||
} | ||
|
||
public getAs<T>(offset: number): T { | ||
assert(offset < TaggedMemory.MAX_MEMORY_SIZE); | ||
const e = this._mem[offset]; | ||
return <T>e; | ||
} | ||
|
||
public getSlice(offset: number, size: number): MemoryValue[] { | ||
assert(offset < TaggedMemory.MAX_MEMORY_SIZE); | ||
return this._mem.slice(offset, offset + size); | ||
} | ||
|
||
public getSliceTags(offset: number, size: number): TypeTag[] { | ||
assert(offset < TaggedMemory.MAX_MEMORY_SIZE); | ||
return this._mem.slice(offset, offset + size).map(TaggedMemory.getTag); | ||
} | ||
|
||
public set(offset: number, v: MemoryValue) { | ||
assert(offset < TaggedMemory.MAX_MEMORY_SIZE); | ||
this._mem[offset] = v; | ||
} | ||
|
||
public setSlice(offset: number, vs: MemoryValue[]) { | ||
assert(offset < TaggedMemory.MAX_MEMORY_SIZE); | ||
this._mem.splice(offset, vs.length, ...vs); | ||
} | ||
|
||
public getTag(offset: number): TypeTag { | ||
return TaggedMemory.getTag(this._mem[offset]); | ||
} | ||
|
||
// TODO: this might be slow, but I don't want to have the types know of their tags. | ||
// It might be possible to have a map<Prototype, TypeTag>. | ||
public static getTag(v: MemoryValue | undefined): TypeTag { | ||
let tag = TypeTag.INVALID; | ||
|
||
if (v === undefined) { | ||
tag = TypeTag.UNINITIALIZED; | ||
} else if (v instanceof Field) { | ||
tag = TypeTag.FIELD; | ||
} else if (v instanceof Uint8) { | ||
tag = TypeTag.UINT8; | ||
} else if (v instanceof Uint16) { | ||
tag = TypeTag.UINT16; | ||
} else if (v instanceof Uint32) { | ||
tag = TypeTag.UINT32; | ||
} else if (v instanceof Uint64) { | ||
tag = TypeTag.UINT64; | ||
} else if (v instanceof Uint128) { | ||
tag = TypeTag.UINT128; | ||
} | ||
|
||
return tag; | ||
} | ||
|
||
// Truncates the value to fit the type. | ||
public static integralFromTag(v: bigint, tag: TypeTag): IntegralValue { | ||
switch (tag) { | ||
case TypeTag.UINT8: | ||
return new Uint8(v & ((1n << 8n) - 1n)); | ||
case TypeTag.UINT16: | ||
return new Uint16(v & ((1n << 16n) - 1n)); | ||
case TypeTag.UINT32: | ||
return new Uint32(v & ((1n << 32n) - 1n)); | ||
case TypeTag.UINT64: | ||
return new Uint64(v & ((1n << 64n) - 1n)); | ||
case TypeTag.UINT128: | ||
return new Uint128(v & ((1n << 128n) - 1n)); | ||
default: | ||
throw new Error(`${TypeTag[tag]} is not a valid integral type.`); | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I assume more tests are coming for this?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes (but not in this PR! lmk if you feel strongly). I'm thinking if it makes sense to test everything here (for the types) AND in the arithmetic+bitwise opcodes, or if there's a less verbose way. (note that there will be massive duplication).
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Sounds good i can wait until later!