Files
bun.sh/src/defines.zig
2024-11-13 18:19:12 -08:00

314 lines
12 KiB
Zig

const std = @import("std");
const js_ast = bun.JSAst;
const logger = bun.logger;
const js_lexer = bun.js_lexer;
const json_parser = bun.JSON;
const fs = @import("fs.zig");
const bun = @import("root").bun;
const string = bun.string;
const Output = bun.Output;
const Global = bun.Global;
const Environment = bun.Environment;
const strings = bun.strings;
const MutableString = bun.MutableString;
const stringZ = bun.stringZ;
const default_allocator = bun.default_allocator;
const C = bun.C;
const Ref = @import("ast/base.zig").Ref;
const GlobalDefinesKey = @import("./defines-table.zig").GlobalDefinesKey;
const table = @import("./defines-table.zig");
const Globals = struct {
pub const Undefined = js_ast.E.Undefined{};
pub const UndefinedPtr = &Globals.Undefined;
pub const NaN = js_ast.E.Number{ .value = std.math.nan(f64) };
pub const NanPtr = &Globals.NaN;
pub const Infinity = js_ast.E.Number{ .value = std.math.inf(f64) };
pub const InfinityPtr = &Globals.Infinity;
pub const UndefinedData = js_ast.Expr.Data{ .e_undefined = Globals.UndefinedPtr };
pub const NaNData = js_ast.Expr.Data{ .e_number = Globals.NanPtr };
pub const InfinityData = js_ast.Expr.Data{ .e_number = Globals.InfinityPtr };
};
const defines_path = fs.Path.initWithNamespace("defines.json", "internal");
pub const RawDefines = bun.StringArrayHashMap(string);
pub const UserDefines = bun.StringHashMap(DefineData);
pub const UserDefinesArray = bun.StringArrayHashMap(DefineData);
pub const DefineData = struct {
value: js_ast.Expr.Data,
valueless: bool = false,
original_name: ?string = null,
// True if accessing this value is known to not have any side effects. For
// example, a bare reference to "Object.create" can be removed because it
// does not have any observable side effects.
can_be_removed_if_unused: bool = false,
// True if a call to this value is known to not have any side effects. For
// example, a bare call to "Object()" can be removed because it does not
// have any observable side effects.
call_can_be_unwrapped_if_unused: bool = false,
method_call_must_be_replaced_with_undefined: bool = false,
pub fn isUndefined(self: *const DefineData) bool {
return self.valueless;
}
pub fn initBoolean(value: bool) DefineData {
return .{
.value = .{ .e_boolean = .{ .value = value } },
.can_be_removed_if_unused = true,
};
}
pub fn initStaticString(str: *const js_ast.E.String) DefineData {
return .{
.value = .{ .e_string = @constCast(str) },
.can_be_removed_if_unused = true,
};
}
pub fn merge(a: DefineData, b: DefineData) DefineData {
return DefineData{
.value = b.value,
.can_be_removed_if_unused = a.can_be_removed_if_unused,
.call_can_be_unwrapped_if_unused = a.call_can_be_unwrapped_if_unused,
.original_name = b.original_name,
.valueless = a.method_call_must_be_replaced_with_undefined or b.method_call_must_be_replaced_with_undefined,
.method_call_must_be_replaced_with_undefined = a.method_call_must_be_replaced_with_undefined or b.method_call_must_be_replaced_with_undefined,
};
}
pub fn fromMergeableInputEntry(user_defines: *UserDefines, key: []const u8, value_str: []const u8, value_is_undefined: bool, method_call_must_be_replaced_with_undefined: bool, log: *logger.Log, allocator: std.mem.Allocator) !void {
var keySplitter = std.mem.split(u8, key, ".");
while (keySplitter.next()) |part| {
if (!js_lexer.isIdentifier(part)) {
if (strings.eql(part, key)) {
try log.addErrorFmt(null, logger.Loc{}, allocator, "define key \"{s}\" must be a valid identifier", .{key});
} else {
try log.addErrorFmt(null, logger.Loc{}, allocator, "define key \"{s}\" contains invalid identifier \"{s}\"", .{ part, value_str });
}
break;
}
}
// check for nested identifiers
var valueSplitter = std.mem.split(u8, value_str, ".");
var isIdent = true;
while (valueSplitter.next()) |part| {
if (!js_lexer.isIdentifier(part) or js_lexer.Keywords.has(part)) {
isIdent = false;
break;
}
}
if (isIdent) {
// Special-case undefined. it's not an identifier here
// https://github.com/evanw/esbuild/issues/1407
const value = if (value_is_undefined or strings.eqlComptime(value_str, "undefined"))
js_ast.Expr.Data{ .e_undefined = js_ast.E.Undefined{} }
else
js_ast.Expr.Data{ .e_identifier = .{
.ref = Ref.None,
.can_be_removed_if_unused = true,
} };
user_defines.putAssumeCapacity(
key,
DefineData{
.value = value,
.original_name = value_str,
.can_be_removed_if_unused = true,
.valueless = value_is_undefined,
.method_call_must_be_replaced_with_undefined = method_call_must_be_replaced_with_undefined,
},
);
return;
}
const _log = log;
var source = logger.Source{
.contents = value_str,
.path = defines_path,
};
const expr = try json_parser.parseEnvJSON(&source, _log, allocator);
const cloned = try expr.data.deepClone(allocator);
user_defines.putAssumeCapacity(key, DefineData{
.value = cloned,
.can_be_removed_if_unused = expr.isPrimitiveLiteral(),
.valueless = value_is_undefined,
.method_call_must_be_replaced_with_undefined = method_call_must_be_replaced_with_undefined,
});
}
pub fn fromInput(defines: RawDefines, drop: []const []const u8, log: *logger.Log, allocator: std.mem.Allocator) !UserDefines {
var user_defines = UserDefines.init(allocator);
var iterator = defines.iterator();
try user_defines.ensureUnusedCapacity(@truncate(defines.count() + drop.len));
while (iterator.next()) |entry| {
try fromMergeableInputEntry(&user_defines, entry.key_ptr.*, entry.value_ptr.*, false, false, log, allocator);
}
for (drop) |drop_item| {
if (drop_item.len > 0) {
try fromMergeableInputEntry(&user_defines, drop_item, "", true, true, log, allocator);
}
}
return user_defines;
}
};
fn arePartsEqual(a: []const string, b: []const string) bool {
if (a.len != b.len) {
return false;
}
for (0..a.len) |i| {
if (!strings.eql(a[i], b[i])) {
return false;
}
}
return true;
}
pub const IdentifierDefine = DefineData;
pub const DotDefine = struct {
parts: []const string,
data: DefineData,
};
// var nan_val = try allocator.create(js_ast.E.Number);
const nan_val = js_ast.E.Number{ .value = std.math.nan(f64) };
const inf_val = js_ast.E.Number{ .value = std.math.inf(f64) };
pub const Define = struct {
identifiers: bun.StringHashMap(IdentifierDefine),
dots: bun.StringHashMap([]DotDefine),
drop_debugger: bool,
allocator: std.mem.Allocator,
pub const Data = DefineData;
pub fn forIdentifier(this: *const Define, name: []const u8) ?IdentifierDefine {
if (this.identifiers.get(name)) |data| {
return data;
}
return table.pure_global_identifier_map.get(name);
}
pub fn insertFromIterator(define: *Define, allocator: std.mem.Allocator, comptime Iterator: type, iter: Iterator) !void {
while (iter.next()) |user_define| {
try define.insert(allocator, user_define.key_ptr.*, user_define.value_ptr.*);
}
}
pub fn insert(define: *Define, allocator: std.mem.Allocator, key: []const u8, value: DefineData) !void {
// If it has a dot, then it's a DotDefine.
// e.g. process.env.NODE_ENV
if (strings.lastIndexOfChar(key, '.')) |last_dot| {
const tail = key[last_dot + 1 .. key.len];
const remainder = key[0..last_dot];
const count = std.mem.count(u8, remainder, ".") + 1;
var parts = try allocator.alloc(string, count + 1);
var splitter = std.mem.split(u8, remainder, ".");
var i: usize = 0;
while (splitter.next()) |split| : (i += 1) {
parts[i] = split;
}
parts[i] = tail;
var initial_values: []DotDefine = &([_]DotDefine{});
// "NODE_ENV"
const gpe_entry = try define.dots.getOrPut(tail);
if (gpe_entry.found_existing) {
for (gpe_entry.value_ptr.*) |*part| {
// ["process", "env"] === ["process", "env"] (if that actually worked)
if (arePartsEqual(part.parts, parts)) {
part.data = part.data.merge(value);
return;
}
}
initial_values = gpe_entry.value_ptr.*;
}
var list = try std.ArrayList(DotDefine).initCapacity(allocator, initial_values.len + 1);
if (initial_values.len > 0) {
list.appendSliceAssumeCapacity(initial_values);
}
list.appendAssumeCapacity(DotDefine{
.data = value,
// TODO: do we need to allocate this?
.parts = parts,
});
gpe_entry.value_ptr.* = try list.toOwnedSlice();
} else {
// e.g. IS_BROWSER
try define.identifiers.put(key, value);
}
}
pub fn init(allocator: std.mem.Allocator, _user_defines: ?UserDefines, string_defines: ?UserDefinesArray, drop_debugger: bool) bun.OOM!*@This() {
const define = try allocator.create(Define);
define.allocator = allocator;
define.identifiers = bun.StringHashMap(IdentifierDefine).init(allocator);
define.dots = bun.StringHashMap([]DotDefine).init(allocator);
define.drop_debugger = drop_debugger;
try define.dots.ensureTotalCapacity(124);
const value_define = DefineData{
.value = .{ .e_undefined = .{} },
.valueless = true,
.can_be_removed_if_unused = true,
};
// Step 1. Load the globals into the hash tables
for (GlobalDefinesKey) |global| {
const key = global[global.len - 1];
const gpe = try define.dots.getOrPut(key);
if (gpe.found_existing) {
var list = try std.ArrayList(DotDefine).initCapacity(allocator, gpe.value_ptr.*.len + 1);
list.appendSliceAssumeCapacity(gpe.value_ptr.*);
list.appendAssumeCapacity(DotDefine{
.parts = global[0..global.len],
.data = value_define,
});
gpe.value_ptr.* = try list.toOwnedSlice();
} else {
var list = try std.ArrayList(DotDefine).initCapacity(allocator, 1);
list.appendAssumeCapacity(DotDefine{
.parts = global[0..global.len],
.data = value_define,
});
gpe.value_ptr.* = try list.toOwnedSlice();
}
}
// Step 3. Load user data into hash tables
// At this stage, user data has already been validated.
if (_user_defines) |user_defines| {
var iter = user_defines.iterator();
try define.insertFromIterator(allocator, @TypeOf(&iter), &iter);
}
// Step 4. Load environment data into hash tables.
// These are only strings. We do not parse them as JSON.
if (string_defines) |string_defines_| {
var iter = string_defines_.iterator();
try define.insertFromIterator(allocator, @TypeOf(&iter), &iter);
}
return define;
}
};