Skip to content

Commit

Permalink
use correct identifier casing
Browse files Browse the repository at this point in the history
  • Loading branch information
Vexu committed Sep 8, 2024
1 parent ce09ccf commit adfd13c
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
4 changes: 2 additions & 2 deletions src/aro/Driver.zig
Original file line number Diff line number Diff line change
Expand Up @@ -758,8 +758,8 @@ fn processSource(
defer obj.deinit();

// If it's used, name_buf will either hold a filename or `/tmp/<12 random bytes with base-64 encoding>.<extension>`
// both of which should fit into MAX_NAME_BYTES for all systems
var name_buf: [std.fs.MAX_NAME_BYTES]u8 = undefined;
// both of which should fit into max_name_bytes for all systems
var name_buf: [std.fs.max_name_bytes]u8 = undefined;

const out_file_name = if (d.only_compile) blk: {
const fmt_template = "{s}{s}";
Expand Down
4 changes: 2 additions & 2 deletions src/aro/Preprocessor.zig
Original file line number Diff line number Diff line change
Expand Up @@ -270,13 +270,13 @@ fn clearBuffers(pp: *Preprocessor) void {

pub fn expansionSlice(pp: *Preprocessor, tok: Tree.TokenIndex) []Source.Location {
const S = struct {
fn order_token_index(context: Tree.TokenIndex, item: Tree.TokenIndex) std.math.Order {
fn orderTokenIndex(context: Tree.TokenIndex, item: Tree.TokenIndex) std.math.Order {
return std.math.order(item, context);
}
};

const indices = pp.expansion_entries.items(.idx);
const idx = std.sort.binarySearch(Tree.TokenIndex, indices, tok, S.order_token_index) orelse return &.{};
const idx = std.sort.binarySearch(Tree.TokenIndex, indices, tok, S.orderTokenIndex) orelse return &.{};
const locs = pp.expansion_entries.items(.locs)[idx];
var i: usize = 0;
while (locs[i].id != .unused) : (i += 1) {}
Expand Down

0 comments on commit adfd13c

Please sign in to comment.