/
node_fs.zig
6727 lines (5871 loc) · 248 KB
/
node_fs.zig
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// This file contains the underlying implementation for sync & async functions
// for interacting with the filesystem from JavaScript.
// The top-level functions assume the arguments are already validated
const std = @import("std");
const bun = @import("root").bun;
const strings = bun.strings;
const windows = bun.windows;
const string = bun.string;
const JSC = @import("root").bun.JSC;
const PathString = JSC.PathString;
const Environment = bun.Environment;
const C = bun.C;
const Flavor = JSC.Node.Flavor;
const system = std.os.system;
const Maybe = JSC.Maybe;
const Encoding = JSC.Node.Encoding;
const PosixToWinNormalizer = bun.path.PosixToWinNormalizer;
const FileDescriptor = bun.FileDescriptor;
const FDImpl = bun.FDImpl;
const Syscall = if (Environment.isWindows) bun.sys.sys_uv else bun.sys;
const Constants = @import("./node_fs_constant.zig").Constants;
const builtin = @import("builtin");
const os = @import("std").os;
const darwin = os.darwin;
const linux = os.linux;
const PathLike = JSC.Node.PathLike;
const PathOrFileDescriptor = JSC.Node.PathOrFileDescriptor;
const DirIterator = @import("./dir_iterator.zig");
const Path = @import("../../resolver/resolve_path.zig");
const FileSystem = @import("../../fs.zig").FileSystem;
const ArgumentsSlice = JSC.Node.ArgumentsSlice;
const TimeLike = JSC.Node.TimeLike;
const Mode = bun.Mode;
const uv = bun.windows.libuv;
const E = C.E;
const uid_t = if (Environment.isPosix) std.os.uid_t else bun.windows.libuv.uv_uid_t;
const gid_t = if (Environment.isPosix) std.os.gid_t else bun.windows.libuv.uv_gid_t;
/// u63 to allow one null bit
const ReadPosition = i64;
const Stats = JSC.Node.Stats;
const Dirent = JSC.Node.Dirent;
pub const default_permission = if (Environment.isPosix)
Syscall.S.IRUSR |
Syscall.S.IWUSR |
Syscall.S.IRGRP |
Syscall.S.IWGRP |
Syscall.S.IROTH |
Syscall.S.IWOTH
else
// TODO:
0;
const StringOrBuffer = JSC.Node.StringOrBuffer;
const ArrayBuffer = JSC.MarkedArrayBuffer;
const Buffer = JSC.Buffer;
const FileSystemFlags = JSC.Node.FileSystemFlags;
pub const Async = struct {
pub const access = NewAsyncFSTask(Return.Access, Arguments.Access, NodeFS.access);
pub const appendFile = NewAsyncFSTask(Return.AppendFile, Arguments.AppendFile, NodeFS.appendFile);
pub const chmod = NewAsyncFSTask(Return.Chmod, Arguments.Chmod, NodeFS.chmod);
pub const chown = NewAsyncFSTask(Return.Chown, Arguments.Chown, NodeFS.chown);
pub const close = NewAsyncFSTask(Return.Close, Arguments.Close, NodeFS.close);
pub const copyFile = NewAsyncFSTask(Return.CopyFile, Arguments.CopyFile, NodeFS.copyFile);
pub const exists = NewAsyncFSTask(Return.Exists, Arguments.Exists, NodeFS.exists);
pub const fchmod = NewAsyncFSTask(Return.Fchmod, Arguments.FChmod, NodeFS.fchmod);
pub const fchown = NewAsyncFSTask(Return.Fchown, Arguments.Fchown, NodeFS.fchown);
pub const fdatasync = NewAsyncFSTask(Return.Fdatasync, Arguments.FdataSync, NodeFS.fdatasync);
pub const fstat = NewAsyncFSTask(Return.Fstat, Arguments.Fstat, NodeFS.fstat);
pub const fsync = NewAsyncFSTask(Return.Fsync, Arguments.Fsync, NodeFS.fsync);
pub const ftruncate = NewAsyncFSTask(Return.Ftruncate, Arguments.FTruncate, NodeFS.ftruncate);
pub const futimes = NewAsyncFSTask(Return.Futimes, Arguments.Futimes, NodeFS.futimes);
pub const lchmod = NewAsyncFSTask(Return.Lchmod, Arguments.LCHmod, NodeFS.lchmod);
pub const lchown = NewAsyncFSTask(Return.Lchown, Arguments.LChown, NodeFS.lchown);
pub const link = NewAsyncFSTask(Return.Link, Arguments.Link, NodeFS.link);
pub const lstat = NewAsyncFSTask(Return.Stat, Arguments.Stat, NodeFS.lstat);
pub const lutimes = NewAsyncFSTask(Return.Lutimes, Arguments.Lutimes, NodeFS.lutimes);
pub const mkdir = NewAsyncFSTask(Return.Mkdir, Arguments.Mkdir, NodeFS.mkdir);
pub const mkdtemp = NewAsyncFSTask(Return.Mkdtemp, Arguments.MkdirTemp, NodeFS.mkdtemp);
pub const open = NewAsyncFSTask(Return.Open, Arguments.Open, NodeFS.open);
pub const read = NewAsyncFSTask(Return.Read, Arguments.Read, NodeFS.read);
pub const readdir = NewAsyncFSTask(Return.Readdir, Arguments.Readdir, NodeFS.readdir);
pub const readFile = NewAsyncFSTask(Return.ReadFile, Arguments.ReadFile, NodeFS.readFile);
pub const readlink = NewAsyncFSTask(Return.Readlink, Arguments.Readlink, NodeFS.readlink);
pub const readv = NewAsyncFSTask(Return.Readv, Arguments.Readv, NodeFS.readv);
pub const realpath = NewAsyncFSTask(Return.Realpath, Arguments.Realpath, NodeFS.realpath);
pub const rename = NewAsyncFSTask(Return.Rename, Arguments.Rename, NodeFS.rename);
pub const rm = NewAsyncFSTask(Return.Rm, Arguments.Rm, NodeFS.rm);
pub const rmdir = NewAsyncFSTask(Return.Rmdir, Arguments.RmDir, NodeFS.rmdir);
pub const stat = NewAsyncFSTask(Return.Stat, Arguments.Stat, NodeFS.stat);
pub const symlink = NewAsyncFSTask(Return.Symlink, Arguments.Symlink, NodeFS.symlink);
pub const truncate = NewAsyncFSTask(Return.Truncate, Arguments.Truncate, NodeFS.truncate);
pub const unlink = NewAsyncFSTask(Return.Unlink, Arguments.Unlink, NodeFS.unlink);
pub const utimes = NewAsyncFSTask(Return.Utimes, Arguments.Utimes, NodeFS.utimes);
pub const write = NewAsyncFSTask(Return.Write, Arguments.Write, NodeFS.write);
pub const writeFile = NewAsyncFSTask(Return.WriteFile, Arguments.WriteFile, NodeFS.writeFile);
pub const writev = NewAsyncFSTask(Return.Writev, Arguments.Writev, NodeFS.writev);
pub const cp = AsyncCpTask;
pub const readdir_recursive = AsyncReaddirRecursiveTask;
/// Used internally. Not from JavaScript.
pub const AsyncMkdirp = struct {
completion_ctx: *anyopaque,
completion: *const fn (*anyopaque, JSC.Maybe(void)) void,
/// Memory is not owned by this struct
path: []const u8,
task: JSC.WorkPoolTask = .{ .callback = &workPoolCallback },
pub usingnamespace bun.New(@This());
pub fn workPoolCallback(task: *JSC.WorkPoolTask) void {
var this: *AsyncMkdirp = @fieldParentPtr(AsyncMkdirp, "task", task);
var node_fs = NodeFS{};
const result = node_fs.mkdirRecursive(
Arguments.Mkdir{
.path = PathLike{ .string = PathString.init(this.path) },
.recursive = true,
},
.sync,
);
switch (result) {
.err => |err| {
this.completion(this.completion_ctx, .{ .err = err.withPath(bun.default_allocator.dupe(u8, err.path) catch bun.outOfMemory()) });
},
.result => {
this.completion(this.completion_ctx, JSC.Maybe(void).success);
},
}
}
pub fn schedule(this: *AsyncMkdirp) void {
JSC.WorkPool.schedule(&this.task);
}
};
fn NewAsyncFSTask(comptime ReturnType: type, comptime ArgumentType: type, comptime Function: anytype) type {
return struct {
promise: JSC.JSPromise.Strong,
args: ArgumentType,
globalObject: *JSC.JSGlobalObject,
task: JSC.WorkPoolTask = .{ .callback = &workPoolCallback },
result: JSC.Maybe(ReturnType),
ref: bun.Async.KeepAlive = .{},
tracker: JSC.AsyncTaskTracker,
pub const Task = @This();
pub const heap_label = "Async" ++ bun.meta.typeBaseName(@typeName(ArgumentType)) ++ "Task";
pub fn create(
globalObject: *JSC.JSGlobalObject,
args: ArgumentType,
vm: *JSC.VirtualMachine,
) JSC.JSValue {
var task = bun.new(
Task,
Task{
.promise = JSC.JSPromise.Strong.init(globalObject),
.args = args,
.result = undefined,
.globalObject = globalObject,
.tracker = JSC.AsyncTaskTracker.init(vm),
},
);
task.ref.ref(vm);
task.args.toThreadSafe();
task.tracker.didSchedule(globalObject);
JSC.WorkPool.schedule(&task.task);
return task.promise.value();
}
fn workPoolCallback(task: *JSC.WorkPoolTask) void {
var this: *Task = @fieldParentPtr(Task, "task", task);
var node_fs = NodeFS{};
this.result = Function(&node_fs, this.args, .promise);
if (this.result == .err) {
this.result.err.path = bun.default_allocator.dupe(u8, this.result.err.path) catch "";
std.mem.doNotOptimizeAway(&node_fs);
}
this.globalObject.bunVMConcurrently().eventLoop().enqueueTaskConcurrent(JSC.ConcurrentTask.create(JSC.Task.init(this)));
}
pub fn runFromJSThread(this: *Task) void {
const globalObject = this.globalObject;
var success = @as(JSC.Maybe(ReturnType).Tag, this.result) == .result;
const result = switch (this.result) {
.err => |err| err.toJSC(globalObject),
.result => |*res| brk: {
const out = globalObject.toJS(res, .temporary);
success = out != .zero;
break :brk out;
},
};
var promise_value = this.promise.value();
var promise = this.promise.get();
promise_value.ensureStillAlive();
const tracker = this.tracker;
tracker.willDispatch(globalObject);
defer tracker.didDispatch(globalObject);
this.deinit();
switch (success) {
false => {
promise.reject(globalObject, result);
},
true => {
promise.resolve(globalObject, result);
},
}
}
pub fn deinit(this: *Task) void {
if (this.result == .err) {
bun.default_allocator.free(this.result.err.path);
}
this.ref.unref(this.globalObject.bunVM());
if (@hasDecl(ArgumentType, "deinitAndUnprotect")) {
this.args.deinitAndUnprotect();
} else {
this.args.deinit();
}
this.promise.strong.deinit();
bun.destroy(this);
}
};
}
};
pub const AsyncCpTask = struct {
promise: JSC.JSPromise.Strong,
args: Arguments.Cp,
globalObject: *JSC.JSGlobalObject,
task: JSC.WorkPoolTask = .{ .callback = &workPoolCallback },
result: JSC.Maybe(Return.Cp),
ref: bun.Async.KeepAlive = .{},
arena: bun.ArenaAllocator,
tracker: JSC.AsyncTaskTracker,
has_result: std.atomic.Value(bool),
/// On each creation of a `AsyncCpSingleFileTask`, this is incremented.
/// When each task is finished, decrement.
/// The maintask thread starts this at 1 and decrements it at the end, to avoid the promise being resolved while new tasks may be added.
subtask_count: std.atomic.Value(usize),
pub fn create(
globalObject: *JSC.JSGlobalObject,
cp_args: Arguments.Cp,
vm: *JSC.VirtualMachine,
arena: bun.ArenaAllocator,
) JSC.JSValue {
var task = bun.new(
AsyncCpTask,
AsyncCpTask{
.promise = JSC.JSPromise.Strong.init(globalObject),
.args = cp_args,
.has_result = .{ .raw = false },
.result = undefined,
.globalObject = globalObject,
.tracker = JSC.AsyncTaskTracker.init(vm),
.arena = arena,
.subtask_count = .{ .raw = 1 },
},
);
task.ref.ref(vm);
task.args.src.toThreadSafe();
task.args.dest.toThreadSafe();
task.tracker.didSchedule(globalObject);
JSC.WorkPool.schedule(&task.task);
return task.promise.value();
}
fn workPoolCallback(task: *JSC.WorkPoolTask) void {
const this: *AsyncCpTask = @fieldParentPtr(AsyncCpTask, "task", task);
var node_fs = NodeFS{};
node_fs.cpAsync(this);
}
/// May be called from any thread (the subtasks)
fn finishConcurrently(this: *AsyncCpTask, result: Maybe(Return.Cp)) void {
if (this.has_result.cmpxchgStrong(false, true, .Monotonic, .Monotonic)) |_| {
return;
}
this.result = result;
if (this.result == .err) {
this.result.err.path = bun.default_allocator.dupe(u8, this.result.err.path) catch "";
}
this.globalObject.bunVMConcurrently().eventLoop().enqueueTaskConcurrent(JSC.ConcurrentTask.fromCallback(this, runFromJSThread));
}
fn runFromJSThread(this: *AsyncCpTask) void {
const globalObject = this.globalObject;
var success = @as(JSC.Maybe(Return.Cp).Tag, this.result) == .result;
const result = switch (this.result) {
.err => |err| err.toJSC(globalObject),
.result => |*res| brk: {
const out = globalObject.toJS(res, .temporary);
success = out != .zero;
break :brk out;
},
};
var promise_value = this.promise.value();
var promise = this.promise.get();
promise_value.ensureStillAlive();
const tracker = this.tracker;
tracker.willDispatch(globalObject);
defer tracker.didDispatch(globalObject);
this.deinit();
switch (success) {
false => {
promise.reject(globalObject, result);
},
true => {
promise.resolve(globalObject, result);
},
}
}
pub fn deinit(this: *AsyncCpTask) void {
this.ref.unref(this.globalObject.bunVM());
this.args.deinit();
this.promise.strong.deinit();
this.arena.deinit();
bun.destroy(this);
}
};
pub const AsyncReaddirRecursiveTask = struct {
promise: JSC.JSPromise.Strong,
args: Arguments.Readdir,
globalObject: *JSC.JSGlobalObject,
task: JSC.WorkPoolTask = .{ .callback = &workPoolCallback },
ref: bun.Async.KeepAlive = .{},
tracker: JSC.AsyncTaskTracker,
// It's not 100% clear this one is necessary
has_result: std.atomic.Value(bool),
subtask_count: std.atomic.Value(usize),
/// The final result list
result_list: ResultListEntry.Value = undefined,
/// When joining the result list, we use this to preallocate the joined array.
result_list_count: std.atomic.Value(usize) = std.atomic.Value(usize).init(0),
/// A lockless queue of result lists.
///
/// Using a lockless queue instead of mutex + joining the lists as we go was a meaningful performance improvement
result_list_queue: ResultListEntry.Queue = ResultListEntry.Queue{},
/// All the subtasks will use this fd to open files
root_fd: FileDescriptor = bun.invalid_fd,
/// This isued when joining the file paths for error messages
root_path: PathString = PathString.empty,
pending_err: ?Syscall.Error = null,
pending_err_mutex: bun.Lock = bun.Lock.init(),
pub usingnamespace bun.New(@This());
pub const ResultListEntry = struct {
pub const Value = union(Return.Readdir.Tag) {
with_file_types: std.ArrayList(Dirent),
buffers: std.ArrayList(Buffer),
files: std.ArrayList(bun.String),
pub fn deinit(this: *@This()) void {
switch (this.*) {
.with_file_types => |*res| {
for (res.items) |item| {
item.name.deref();
}
res.clearAndFree();
},
.buffers => |*res| {
for (res.items) |item| {
bun.default_allocator.free(item.buffer.byteSlice());
}
res.clearAndFree();
},
.files => |*res| {
for (res.items) |item| {
item.deref();
}
res.clearAndFree();
},
}
}
};
next: ?*ResultListEntry = null,
value: Value,
pub const Queue = bun.UnboundedQueue(ResultListEntry, .next);
};
pub const Subtask = struct {
readdir_task: *AsyncReaddirRecursiveTask,
basename: bun.PathString = bun.PathString.empty,
task: JSC.WorkPoolTask = .{ .callback = call },
pub usingnamespace bun.New(@This());
pub fn call(task: *JSC.WorkPoolTask) void {
var this: *Subtask = @fieldParentPtr(Subtask, "task", task);
defer {
bun.default_allocator.free(this.basename.sliceAssumeZ());
this.destroy();
}
var buf: [bun.MAX_PATH_BYTES]u8 = undefined;
this.readdir_task.performWork(this.basename.sliceAssumeZ(), &buf, false);
}
};
pub fn enqueue(
readdir_task: *AsyncReaddirRecursiveTask,
basename: [:0]const u8,
) void {
var task = Subtask.new(
.{
.readdir_task = readdir_task,
.basename = bun.PathString.init(bun.default_allocator.dupeZ(u8, basename) catch bun.outOfMemory()),
},
);
std.debug.assert(readdir_task.subtask_count.fetchAdd(1, .Monotonic) > 0);
JSC.WorkPool.schedule(&task.task);
}
pub fn create(
globalObject: *JSC.JSGlobalObject,
args: Arguments.Readdir,
vm: *JSC.VirtualMachine,
) JSC.JSValue {
var task = AsyncReaddirRecursiveTask.new(.{
.promise = JSC.JSPromise.Strong.init(globalObject),
.args = args,
.has_result = .{ .raw = false },
.globalObject = globalObject,
.tracker = JSC.AsyncTaskTracker.init(vm),
.subtask_count = .{ .raw = 1 },
.root_path = PathString.init(bun.default_allocator.dupeZ(u8, args.path.slice()) catch bun.outOfMemory()),
.result_list = switch (args.tag()) {
.files => .{ .files = std.ArrayList(bun.String).init(bun.default_allocator) },
.with_file_types => .{ .with_file_types = std.ArrayList(Dirent).init(bun.default_allocator) },
.buffers => .{ .buffers = std.ArrayList(Buffer).init(bun.default_allocator) },
},
});
task.ref.ref(vm);
task.args.toThreadSafe();
task.tracker.didSchedule(globalObject);
JSC.WorkPool.schedule(&task.task);
return task.promise.value();
}
pub fn performWork(this: *AsyncReaddirRecursiveTask, basename: [:0]const u8, buf: *[bun.MAX_PATH_BYTES]u8, comptime is_root: bool) void {
switch (this.args.tag()) {
inline else => |tag| {
const ResultType = comptime switch (tag) {
.files => bun.String,
.with_file_types => Dirent,
.buffers => Buffer,
};
var stack = std.heap.stackFallback(8192, bun.default_allocator);
// This is a stack-local copy to avoid resizing heap-allocated arrays in the common case of a small directory
var entries = std.ArrayList(ResultType).init(stack.get());
defer entries.deinit();
switch (NodeFS.readdirWithEntriesRecursiveAsync(
buf,
this.args,
this,
basename,
ResultType,
&entries,
is_root,
)) {
.err => |err| {
for (entries.items) |*item| {
switch (ResultType) {
bun.String => item.deref(),
Dirent => item.name.deref(),
Buffer => bun.default_allocator.free(item.buffer.byteSlice()),
else => @compileError("unreachable"),
}
}
{
this.pending_err_mutex.lock();
defer this.pending_err_mutex.unlock();
if (this.pending_err == null) {
const err_path = if (err.path.len > 0) err.path else this.args.path.slice();
this.pending_err = err.withPath(bun.default_allocator.dupe(u8, err_path) catch "");
}
}
if (this.subtask_count.fetchSub(1, .Monotonic) == 1) {
this.finishConcurrently();
}
},
.result => {
this.writeResults(ResultType, &entries);
},
}
},
}
}
fn workPoolCallback(task: *JSC.WorkPoolTask) void {
var this: *AsyncReaddirRecursiveTask = @fieldParentPtr(AsyncReaddirRecursiveTask, "task", task);
var buf: [bun.MAX_PATH_BYTES]u8 = undefined;
this.performWork(this.root_path.sliceAssumeZ(), &buf, true);
}
pub fn writeResults(this: *AsyncReaddirRecursiveTask, comptime ResultType: type, result: *std.ArrayList(ResultType)) void {
if (result.items.len > 0) {
const Field = switch (ResultType) {
bun.String => .files,
Dirent => .with_file_types,
Buffer => .buffers,
else => @compileError("unreachable"),
};
const list = bun.default_allocator.create(ResultListEntry) catch bun.outOfMemory();
errdefer {
bun.default_allocator.destroy(list);
}
var clone = std.ArrayList(ResultType).initCapacity(bun.default_allocator, result.items.len) catch bun.outOfMemory();
clone.appendSliceAssumeCapacity(result.items);
_ = this.result_list_count.fetchAdd(clone.items.len, .Monotonic);
list.* = ResultListEntry{ .next = null, .value = @unionInit(ResultListEntry.Value, @tagName(Field), clone) };
this.result_list_queue.push(list);
}
if (this.subtask_count.fetchSub(1, .Monotonic) == 1) {
this.finishConcurrently();
}
}
/// May be called from any thread (the subtasks)
pub fn finishConcurrently(this: *AsyncReaddirRecursiveTask) void {
if (this.has_result.cmpxchgStrong(false, true, .Monotonic, .Monotonic)) |_| {
return;
}
std.debug.assert(this.subtask_count.load(.Monotonic) == 0);
const root_fd = this.root_fd;
if (root_fd != bun.invalid_fd) {
this.root_fd = bun.invalid_fd;
_ = Syscall.close(root_fd);
bun.default_allocator.free(this.root_path.slice());
this.root_path = PathString.empty;
}
if (this.pending_err != null) {
this.clearResultList();
}
{
var list = this.result_list_queue.popBatch();
var iter = list.iterator();
// we have to free only the previous one because the next value will
// be read by the iterator.
var to_destroy: ?*ResultListEntry = null;
switch (this.args.tag()) {
inline else => |tag| {
var results = &@field(this.result_list, @tagName(tag));
results.ensureTotalCapacityPrecise(this.result_list_count.swap(0, .Monotonic)) catch bun.outOfMemory();
while (iter.next()) |val| {
if (to_destroy) |dest| {
bun.default_allocator.destroy(dest);
}
to_destroy = val;
var to_copy = &@field(val.value, @tagName(tag));
results.appendSliceAssumeCapacity(to_copy.items);
to_copy.clearAndFree();
}
if (to_destroy) |dest| {
bun.default_allocator.destroy(dest);
}
},
}
}
this.globalObject.bunVMConcurrently().enqueueTaskConcurrent(JSC.ConcurrentTask.create(JSC.Task.init(this)));
}
fn clearResultList(this: *AsyncReaddirRecursiveTask) void {
this.result_list.deinit();
var batch = this.result_list_queue.popBatch();
var iter = batch.iterator();
var to_destroy: ?*ResultListEntry = null;
while (iter.next()) |val| {
val.value.deinit();
if (to_destroy) |dest| {
bun.default_allocator.destroy(dest);
}
to_destroy = val;
}
if (to_destroy) |dest| {
bun.default_allocator.destroy(dest);
}
this.result_list_count.store(0, .Monotonic);
}
pub fn runFromJSThread(this: *AsyncReaddirRecursiveTask) void {
const globalObject = this.globalObject;
var success = this.pending_err == null;
const result = if (this.pending_err) |*err| err.toJSC(globalObject) else brk: {
const res = switch (this.result_list) {
.with_file_types => |*res| Return.Readdir{ .with_file_types = res.moveToUnmanaged().items },
.buffers => |*res| Return.Readdir{ .buffers = res.moveToUnmanaged().items },
.files => |*res| Return.Readdir{ .files = res.moveToUnmanaged().items },
};
const out = res.toJS(globalObject);
if (out == .zero) {
success = false;
}
break :brk out;
};
var promise_value = this.promise.value();
var promise = this.promise.get();
promise_value.ensureStillAlive();
const tracker = this.tracker;
tracker.willDispatch(globalObject);
defer tracker.didDispatch(globalObject);
this.deinit();
switch (success) {
false => {
promise.reject(globalObject, result);
},
true => {
promise.resolve(globalObject, result);
},
}
}
pub fn deinit(this: *AsyncReaddirRecursiveTask) void {
std.debug.assert(this.root_fd == bun.invalid_fd); // should already have closed it
if (this.pending_err) |*err| {
bun.default_allocator.free(err.path);
}
this.ref.unref(this.globalObject.bunVM());
this.args.deinit();
bun.default_allocator.free(this.root_path.slice());
this.clearResultList();
this.promise.strong.deinit();
this.destroy();
}
};
/// This task is used by `AsyncCpTask/fs.promises.cp` to copy a single file.
/// When clonefile cannot be used, this task is started once per file.
pub const AsyncCpSingleFileTask = struct {
cp_task: *AsyncCpTask,
src: bun.OSPathSliceZ,
dest: bun.OSPathSliceZ,
task: JSC.WorkPoolTask = .{ .callback = &workPoolCallback },
pub fn create(
parent: *AsyncCpTask,
src: bun.OSPathSliceZ,
dest: bun.OSPathSliceZ,
) void {
var task = bun.new(AsyncCpSingleFileTask, .{
.cp_task = parent,
.src = src,
.dest = dest,
});
JSC.WorkPool.schedule(&task.task);
}
fn workPoolCallback(task: *JSC.WorkPoolTask) void {
var this: *AsyncCpSingleFileTask = @fieldParentPtr(AsyncCpSingleFileTask, "task", task);
// TODO: error strings on node_fs will die
var node_fs = NodeFS{};
const args = this.cp_task.args;
const result = node_fs._copySingleFileSync(
this.src,
this.dest,
@enumFromInt((if (args.flags.errorOnExist or !args.flags.force) Constants.COPYFILE_EXCL else @as(u8, 0))),
null,
);
brk: {
switch (result) {
.err => |err| {
if (err.errno == @intFromEnum(E.EXIST) and !args.flags.errorOnExist) {
break :brk;
}
this.cp_task.finishConcurrently(result);
this.deinit();
return;
},
.result => {},
}
}
const old_count = this.cp_task.subtask_count.fetchSub(1, .Monotonic);
if (old_count == 1) {
this.cp_task.finishConcurrently(Maybe(Return.Cp).success);
}
this.deinit();
}
pub fn deinit(this: *AsyncCpSingleFileTask) void {
// There is only one path buffer for both paths. 2 extra bytes are the nulls at the end of each
bun.default_allocator.free(this.src.ptr[0 .. this.src.len + this.dest.len + 2]);
bun.destroy(this);
}
};
// TODO: to improve performance for all of these
// The tagged unions for each type should become regular unions
// and the tags should be passed in as comptime arguments to the functions performing the syscalls
// This would reduce stack size, at the cost of instruction cache misses
pub const Arguments = struct {
pub const Rename = struct {
old_path: PathLike,
new_path: PathLike,
pub fn deinit(this: @This()) void {
this.old_path.deinit();
this.new_path.deinit();
}
pub fn deinitAndUnprotect(this: @This()) void {
this.old_path.deinitAndUnprotect();
this.new_path.deinitAndUnprotect();
}
pub fn toThreadSafe(this: *@This()) void {
this.old_path.toThreadSafe();
this.new_path.toThreadSafe();
}
pub fn fromJS(ctx: JSC.C.JSContextRef, arguments: *ArgumentsSlice, exception: JSC.C.ExceptionRef) ?Rename {
const old_path = PathLike.fromJS(ctx, arguments, exception) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"oldPath must be a string or TypedArray",
.{},
ctx,
exception,
);
}
return null;
};
const new_path = PathLike.fromJS(ctx, arguments, exception) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"newPath must be a string or TypedArray",
.{},
ctx,
exception,
);
}
return null;
};
return Rename{ .old_path = old_path, .new_path = new_path };
}
};
pub const Truncate = struct {
/// Passing a file descriptor is deprecated and may result in an error being thrown in the future.
path: PathOrFileDescriptor,
len: JSC.WebCore.Blob.SizeType = 0,
flags: i32 = 0,
pub fn deinit(this: @This()) void {
this.path.deinit();
}
pub fn deinitAndUnprotect(this: *@This()) void {
this.path.deinitAndUnprotect();
}
pub fn toThreadSafe(this: *@This()) void {
this.path.toThreadSafe();
}
pub fn fromJS(ctx: JSC.C.JSContextRef, arguments: *ArgumentsSlice, exception: JSC.C.ExceptionRef) ?Truncate {
const path = PathOrFileDescriptor.fromJS(ctx, arguments, bun.default_allocator, exception) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"path must be a string or TypedArray",
.{},
ctx,
exception,
);
}
return null;
};
const len: JSC.WebCore.Blob.SizeType = brk: {
const len_value = arguments.next() orelse break :brk 0;
if (len_value.isNumber()) {
arguments.eat();
break :brk len_value.to(JSC.WebCore.Blob.SizeType);
}
break :brk 0;
};
return Truncate{ .path = path, .len = len };
}
};
pub const Writev = struct {
fd: FileDescriptor,
buffers: JSC.Node.VectorArrayBuffer,
position: ?u52 = 0,
pub fn deinit(_: *const @This()) void {}
pub fn deinitAndUnprotect(this: *const @This()) void {
this.buffers.value.unprotect();
this.buffers.buffers.deinit();
}
pub fn toThreadSafe(this: *@This()) void {
this.buffers.value.protect();
const clone = bun.default_allocator.dupe(bun.PlatformIOVec, this.buffers.buffers.items) catch @panic("out of memory");
this.buffers.buffers.deinit();
this.buffers.buffers.items = clone;
this.buffers.buffers.capacity = clone.len;
this.buffers.buffers.allocator = bun.default_allocator;
}
pub fn fromJS(ctx: JSC.C.JSContextRef, arguments: *ArgumentsSlice, exception: JSC.C.ExceptionRef) ?Writev {
const fd_value = arguments.nextEat() orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"file descriptor is required",
.{},
ctx,
exception,
);
}
return null;
};
const fd = JSC.Node.fileDescriptorFromJS(ctx, fd_value, exception) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"file descriptor must be a number",
.{},
ctx,
exception,
);
}
return null;
};
const buffers = JSC.Node.VectorArrayBuffer.fromJS(
ctx,
arguments.protectEatNext() orelse {
JSC.throwInvalidArguments("Expected an ArrayBufferView[]", .{}, ctx, exception);
return null;
},
exception,
arguments.arena.allocator(),
) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"buffers must be an array of TypedArray",
.{},
ctx,
exception,
);
}
return null;
};
var position: ?u52 = null;
if (arguments.nextEat()) |pos_value| {
if (!pos_value.isUndefinedOrNull()) {
if (pos_value.isNumber()) {
position = pos_value.to(u52);
} else {
JSC.throwInvalidArguments(
"position must be a number",
.{},
ctx,
exception,
);
return null;
}
}
}
return Writev{ .fd = fd, .buffers = buffers, .position = position };
}
};
pub const Readv = struct {
fd: FileDescriptor,
buffers: JSC.Node.VectorArrayBuffer,
position: ?u52 = 0,
pub fn deinit(this: *const @This()) void {
_ = this;
}
pub fn deinitAndUnprotect(this: *const @This()) void {
this.buffers.value.unprotect();
this.buffers.buffers.deinit();
}
pub fn toThreadSafe(this: *@This()) void {
this.buffers.value.protect();
const clone = bun.default_allocator.dupe(bun.PlatformIOVec, this.buffers.buffers.items) catch @panic("out of memory");
this.buffers.buffers.deinit();
this.buffers.buffers.items = clone;
this.buffers.buffers.capacity = clone.len;
this.buffers.buffers.allocator = bun.default_allocator;
}
pub fn fromJS(ctx: JSC.C.JSContextRef, arguments: *ArgumentsSlice, exception: JSC.C.ExceptionRef) ?Readv {
const fd_value = arguments.nextEat() orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"file descriptor is required",
.{},
ctx,
exception,
);
}
return null;
};
const fd = JSC.Node.fileDescriptorFromJS(ctx, fd_value, exception) orelse {
if (exception.* == null) {
JSC.throwInvalidArguments(
"file descriptor must be a number",
.{},
ctx,
exception,
);
}
return null;
};
const buffers = JSC.Node.VectorArrayBuffer.fromJS(
ctx,
arguments.protectEatNext() orelse {
JSC.throwInvalidArguments("Expected an ArrayBufferView[]", .{}, ctx, exception);
return null;
},
exception,
arguments.arena.allocator(),
) orelse {