Skip to content

entrypoint: Optimize to reduce by a few CUs #9

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.

Sign up for GitHub

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

Merged
joncinque merged 1 commit into from
Nov 18, 2024
Merged

entrypoint: Optimize to reduce by a few CUs #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/account.zig
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -52,6 +52,10 @@ pub const Account = struct {

ptr: *Account.Data,

pub fn fromDataPtr(ptr: *Account.Data) Account {
return Account { .ptr = ptr };
}

pub fn id(self: Account) PublicKey {
return self.ptr.id;
}
Expand Down
28 changes: 13 additions & 15 deletions src/context.zig
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,44 +6,42 @@ const allocator = @import("allocator.zig").allocator;
const PublicKey = @import("public_key.zig").PublicKey;

pub const Context = struct {
num_accounts: usize,
num_accounts: u64,
accounts: [64]Account,
data: []const u8,
program_id: *align(1) PublicKey,

pub fn load(input: [*]u8) !Context {
var ptr: [*]u8 = input;

const num_accounts = std.mem.bytesToValue(usize, ptr[0..@sizeOf(usize)]);
ptr += @sizeOf(usize);
const num_accounts: *u64 = @ptrCast(@alignCast(ptr));
ptr += @sizeOf(u64);

var i: usize = 0;
var accounts: [64]Account = undefined;
while (i < num_accounts) {
const data: *align(1) Account.Data = @ptrCast(ptr);
while (i < num_accounts.*) {
const data: *Account.Data = @ptrCast(@alignCast(ptr));
if (data.duplicate_index != std.math.maxInt(u8)) {
ptr += @sizeOf(usize);
ptr += @sizeOf(u64);
accounts[i] = accounts[data.duplicate_index];
} else {
ptr += Account.DATA_HEADER;
ptr = @as([*]u8, @ptrFromInt(std.mem.alignForward(usize, @intFromPtr(ptr) + data.data_len + ACCOUNT_DATA_PADDING, @alignOf(usize))));
ptr += @sizeOf(u64);
accounts[i] = .{ .ptr = @as(*Account.Data, @ptrCast(@alignCast(data))) };
accounts[i] = Account.fromDataPtr(data);
ptr += Account.DATA_HEADER + data.data_len + ACCOUNT_DATA_PADDING + @sizeOf(u64);
ptr = @ptrFromInt(std.mem.alignForward(u64, @intFromPtr(ptr), @alignOf(u64)));
}
i += 1;
}

const data_len = std.math.cast(usize, std.mem.bytesToValue(u64, ptr[0..@sizeOf(u64)])) orelse return error.DataTooLarge;
const data_len: *u64 = @ptrCast(@alignCast(ptr));
ptr += @sizeOf(u64);

const data = ptr[0..data_len];
ptr += data_len;
const data = ptr[0..data_len.*];
ptr += data_len.*;

const program_id = @as(*align(1) PublicKey, @ptrCast(ptr));
ptr += @sizeOf(PublicKey);

return Context{
.num_accounts = num_accounts,
.num_accounts = num_accounts.*,
.accounts = accounts,
.data = data,
.program_id = program_id,
Expand Down