forked from SerenityOS/serenity
-
Notifications
You must be signed in to change notification settings - Fork 0
/
stdio.cpp
1381 lines (1188 loc) Β· 33.7 KB
/
stdio.cpp
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
/*
* Copyright (c) 2018-2021, Andreas Kling <[email protected]>
* Copyright (c) 2020, Sergey Bugaev <[email protected]>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <AK/BuiltinWrappers.h>
#include <AK/Format.h>
#include <AK/PrintfImplementation.h>
#include <AK/ScopedValueRollback.h>
#include <AK/StdLibExtras.h>
#include <AK/String.h>
#include <LibC/bits/mutex_locker.h>
#include <LibC/bits/stdio_file_implementation.h>
#include <assert.h>
#include <errno.h>
#include <fcntl.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdio_ext.h>
#include <stdlib.h>
#include <string.h>
#include <sys/internals.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <syscall.h>
#include <unistd.h>
static constinit pthread_mutex_t s_open_streams_lock = __PTHREAD_MUTEX_INITIALIZER;
// The list of open files is initialized in __stdio_init.
// We cannot rely on global constructors to initialize it, because it must
// be initialized before other global constructors run. Similarly, we cannot
// allow global destructors to destruct it.
alignas(FILE::List) static u8 s_open_streams_storage[sizeof(FILE::List)];
static FILE::List* const s_open_streams = reinterpret_cast<FILE::List*>(s_open_streams_storage);
FILE::~FILE()
{
bool already_closed = m_fd == -1;
VERIFY(already_closed);
}
FILE* FILE::create(int fd, int mode)
{
void* file_location = calloc(1, sizeof(FILE));
if (file_location == nullptr)
return nullptr;
auto* file = new (file_location) FILE(fd, mode);
LibC::MutexLocker locker(s_open_streams_lock);
s_open_streams->append(*file);
return file;
}
bool FILE::close()
{
bool flush_ok = flush();
int rc = ::close(m_fd);
m_fd = -1;
if (!flush_ok) {
// Restore the original error from flush().
errno = m_error;
}
return flush_ok && rc == 0;
}
bool FILE::flush()
{
if (m_mode & O_WRONLY && m_buffer.may_use()) {
// When open for writing, write out all the buffered data.
while (m_buffer.is_not_empty()) {
bool ok = write_from_buffer();
if (!ok)
return false;
}
}
if (m_mode & O_RDONLY) {
// When open for reading, just drop the buffered data.
if constexpr (sizeof(size_t) >= sizeof(off_t))
VERIFY(m_buffer.buffered_size() <= NumericLimits<off_t>::max());
off_t had_buffered = static_cast<off_t>(m_buffer.buffered_size());
m_buffer.drop();
// Attempt to reset the underlying file position to what the user
// expects.
if (lseek(m_fd, -had_buffered, SEEK_CUR) < 0) {
if (errno == ESPIPE) {
// We can't set offset on this file; oh well, the user will just
// have to cope.
errno = 0;
} else {
return false;
}
}
}
return true;
}
void FILE::purge()
{
m_buffer.drop();
}
size_t FILE::pending()
{
if (m_mode & O_RDONLY) {
return 0;
}
// FIXME: Check if our buffer is a write buffer, and only count those bytes.
return m_buffer.buffered_size();
}
ssize_t FILE::do_read(u8* data, size_t size)
{
int nread = ::read(m_fd, data, size);
if (nread < 0) {
m_error = errno;
} else if (nread == 0) {
m_eof = true;
}
return nread;
}
ssize_t FILE::do_write(u8 const* data, size_t size)
{
int nwritten = ::write(m_fd, data, size);
if (nwritten < 0)
m_error = errno;
return nwritten;
}
bool FILE::read_into_buffer()
{
m_buffer.realize(m_fd);
size_t available_size;
u8* data = m_buffer.begin_enqueue(available_size);
// If we want to read, the buffer must have some space!
VERIFY(available_size);
ssize_t nread = do_read(data, available_size);
if (nread <= 0)
return false;
m_buffer.did_enqueue(nread);
return true;
}
bool FILE::write_from_buffer()
{
size_t size;
u8 const* data = m_buffer.begin_dequeue(size);
// If we want to write, the buffer must have something in it!
VERIFY(size);
ssize_t nwritten = do_write(data, size);
if (nwritten < 0)
return false;
m_buffer.did_dequeue(nwritten);
return true;
}
size_t FILE::read(u8* data, size_t size)
{
size_t total_read = 0;
m_flags |= Flags::LastRead;
m_flags &= ~Flags::LastWrite;
while (size > 0) {
size_t actual_size;
if (m_buffer.may_use()) {
// Let's see if the buffer has something queued for us.
size_t queued_size;
u8 const* queued_data = m_buffer.begin_dequeue(queued_size);
if (queued_size == 0) {
// Nothing buffered; we're going to have to read some.
bool read_some_more = read_into_buffer();
if (read_some_more) {
// Great, now try this again.
continue;
}
return total_read;
}
actual_size = min(size, queued_size);
memcpy(data, queued_data, actual_size);
m_buffer.did_dequeue(actual_size);
} else {
// Read directly into the user buffer.
ssize_t nread = do_read(data, size);
if (nread <= 0)
return total_read;
actual_size = nread;
}
total_read += actual_size;
data += actual_size;
size -= actual_size;
}
return total_read;
}
size_t FILE::write(u8 const* data, size_t size)
{
size_t total_written = 0;
m_flags &= ~Flags::LastRead;
m_flags |= Flags::LastWrite;
while (size > 0) {
size_t actual_size;
if (m_buffer.may_use()) {
m_buffer.realize(m_fd);
// Try writing into the buffer.
size_t available_size;
u8* buffer_data = m_buffer.begin_enqueue(available_size);
if (available_size == 0) {
// There's no space in the buffer; we're going to free some.
bool freed_some_space = write_from_buffer();
if (freed_some_space) {
// Great, now try this again.
continue;
}
return total_written;
}
actual_size = min(size, available_size);
memcpy(buffer_data, data, actual_size);
m_buffer.did_enqueue(actual_size);
// See if we have to flush it.
if (m_buffer.mode() == _IOLBF) {
bool includes_newline = memchr(data, '\n', actual_size);
if (includes_newline)
flush();
}
} else {
// Write directly from the user buffer.
ssize_t nwritten = do_write(data, size);
if (nwritten < 0)
return total_written;
actual_size = nwritten;
}
total_written += actual_size;
data += actual_size;
size -= actual_size;
}
return total_written;
}
template<typename T>
bool FILE::gets(T* data, size_t size)
{
// gets() is a lot like read(), but it is different enough in how it
// processes newlines and null-terminates the buffer that it deserves a
// separate implementation.
size_t total_read = 0;
if (size == 0)
return false;
m_flags |= Flags::LastRead;
m_flags &= ~Flags::LastWrite;
while (size > 1) {
if (m_buffer.may_use()) {
// Let's see if the buffer has something queued for us.
size_t queued_size;
const T* queued_data = bit_cast<const T*>(m_buffer.begin_dequeue(queued_size));
queued_size /= sizeof(T);
if (queued_size == 0) {
// Nothing buffered; we're going to have to read some.
bool read_some_more = read_into_buffer();
if (read_some_more) {
// Great, now try this again.
continue;
}
*data = 0;
return total_read > 0;
}
size_t actual_size = min(size - 1, queued_size);
T const* newline = nullptr;
for (size_t i = 0; i < actual_size; ++i) {
if (queued_data[i] != '\n')
continue;
newline = &queued_data[i];
actual_size = i + 1;
break;
}
memcpy(data, queued_data, actual_size * sizeof(T));
m_buffer.did_dequeue(actual_size * sizeof(T));
total_read += actual_size;
data += actual_size;
size -= actual_size;
if (newline)
break;
} else {
// Sadly, we have to actually read these characters one by one.
T value;
ssize_t nread = do_read(bit_cast<u8*>(&value), sizeof(T));
if (nread <= 0) {
*data = 0;
return total_read > 0;
}
VERIFY(nread == sizeof(T));
*data = value;
total_read++;
data++;
size--;
if (value == '\n')
break;
}
}
*data = 0;
return total_read > 0;
}
int FILE::seek(off_t offset, int whence)
{
bool ok = flush();
if (!ok)
return -1;
off_t off = lseek(m_fd, offset, whence);
if (off < 0) {
// Note: do not set m_error.
return off;
}
m_eof = false;
return 0;
}
off_t FILE::tell()
{
bool ok = flush();
if (!ok)
return -1;
return lseek(m_fd, 0, SEEK_CUR);
}
void FILE::reopen(int fd, int mode)
{
// Dr. POSIX says: "Failure to flush or close the file descriptor
// successfully shall be ignored"
// and so we ignore any failures these two might have.
flush();
close();
// Just in case flush() and close() didn't drop the buffer.
m_buffer.drop();
m_fd = fd;
m_mode = mode;
m_error = 0;
m_eof = false;
}
u8 const* FILE::readptr(size_t& available_size)
{
return m_buffer.begin_dequeue(available_size);
}
void FILE::readptr_increase(size_t increment)
{
m_buffer.did_dequeue(increment);
}
FILE::Buffer::~Buffer()
{
if (m_data_is_malloced)
free(m_data);
}
bool FILE::Buffer::may_use() const
{
return m_ungotten != 0u || m_mode != _IONBF;
}
void FILE::Buffer::realize(int fd)
{
if (m_mode == -1)
m_mode = isatty(fd) ? _IOLBF : _IOFBF;
if (m_mode != _IONBF && m_data == nullptr) {
m_data = reinterpret_cast<u8*>(malloc(m_capacity));
m_data_is_malloced = true;
}
}
void FILE::Buffer::setbuf(u8* data, int mode, size_t size)
{
drop();
m_mode = mode;
if (data != nullptr) {
m_data = data;
m_capacity = size;
}
}
void FILE::Buffer::drop()
{
if (m_data_is_malloced) {
free(m_data);
m_data = nullptr;
m_data_is_malloced = false;
}
m_begin = m_end = 0;
m_empty = true;
m_ungotten = 0u;
}
size_t FILE::Buffer::buffered_size() const
{
// Note: does not include the ungetc() buffer.
if (m_empty)
return 0;
if (m_begin < m_end)
return m_end - m_begin;
else
return m_capacity - (m_begin - m_end);
}
u8 const* FILE::Buffer::begin_dequeue(size_t& available_size) const
{
if (m_ungotten != 0u) {
auto available_bytes = count_trailing_zeroes(m_ungotten) + 1;
available_size = available_bytes;
return &m_unget_buffer[unget_buffer_size - available_bytes];
}
if (m_empty) {
available_size = 0;
return nullptr;
}
if (m_begin < m_end)
available_size = m_end - m_begin;
else
available_size = m_capacity - m_begin;
return &m_data[m_begin];
}
void FILE::Buffer::did_dequeue(size_t actual_size)
{
VERIFY(actual_size > 0);
if (m_ungotten != 0u) {
VERIFY(actual_size <= static_cast<size_t>(popcount(m_ungotten & ungotten_mask)));
auto available_bytes = count_trailing_zeroes(m_ungotten);
m_ungotten &= (0xffffffffu << (actual_size + available_bytes));
return;
}
m_begin += actual_size;
VERIFY(m_begin <= m_capacity);
if (m_begin == m_capacity) {
// Wrap around.
m_begin = 0;
}
if (m_begin == m_end) {
m_empty = true;
// As an optimization, move both pointers to the beginning of the
// buffer, so that more consecutive space is available next time.
m_begin = m_end = 0;
}
}
u8* FILE::Buffer::begin_enqueue(size_t& available_size) const
{
VERIFY(m_data != nullptr);
if (m_begin < m_end || m_empty)
available_size = m_capacity - m_end;
else
available_size = m_begin - m_end;
return const_cast<u8*>(&m_data[m_end]);
}
void FILE::Buffer::did_enqueue(size_t actual_size)
{
VERIFY(m_data != nullptr);
VERIFY(actual_size > 0);
m_end += actual_size;
VERIFY(m_end <= m_capacity);
if (m_end == m_capacity) {
// Wrap around.
m_end = 0;
}
m_empty = false;
}
bool FILE::Buffer::enqueue_front(u8 byte)
{
size_t placement_index;
if (m_ungotten == 0u) {
placement_index = 3u;
m_ungotten = 1u;
} else {
auto first_zero_index = count_trailing_zeroes(bit_cast<u32>(~m_ungotten)); // Thanks C.
if (first_zero_index >= unget_buffer_size) {
// Sorry, the place is already taken!
return false;
}
placement_index = unget_buffer_size - first_zero_index - 1;
m_ungotten |= (1 << first_zero_index);
}
m_unget_buffer[placement_index] = byte;
return true;
}
void FILE::lock()
{
__pthread_mutex_lock(&m_mutex);
}
void FILE::unlock()
{
__pthread_mutex_unlock(&m_mutex);
}
extern "C" {
alignas(FILE) static u8 default_streams[3][sizeof(FILE)];
FILE* stdin = reinterpret_cast<FILE*>(&default_streams[0]);
FILE* stdout = reinterpret_cast<FILE*>(&default_streams[1]);
FILE* stderr = reinterpret_cast<FILE*>(&default_streams[2]);
void __stdio_init()
{
new (s_open_streams) FILE::List();
new (stdin) FILE(0, O_RDONLY);
new (stdout) FILE(1, O_WRONLY);
new (stderr) FILE(2, O_WRONLY);
stderr->setbuf(nullptr, _IONBF, 0);
s_open_streams->append(*stdin);
s_open_streams->append(*stdout);
s_open_streams->append(*stderr);
__stdio_is_initialized = true;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/setvbuf.html
int setvbuf(FILE* stream, char* buf, int mode, size_t size)
{
VERIFY(stream);
ScopedFileLock lock(stream);
if (mode != _IONBF && mode != _IOLBF && mode != _IOFBF) {
errno = EINVAL;
return -1;
}
stream->setbuf(reinterpret_cast<u8*>(buf), mode, size);
return 0;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/setbuf.html
void setbuf(FILE* stream, char* buf)
{
setvbuf(stream, buf, buf ? _IOFBF : _IONBF, BUFSIZ);
}
void setlinebuf(FILE* stream)
{
setvbuf(stream, nullptr, _IOLBF, 0);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fileno.html
int fileno(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->fileno();
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/feof.html
int feof(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->eof();
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fflush.html
int fflush(FILE* stream)
{
if (!stream) {
int rc = 0;
LibC::MutexLocker locker(s_open_streams_lock);
for (auto& file : *s_open_streams) {
ScopedFileLock lock(&file);
rc = file.flush() ? rc : EOF;
}
return rc;
}
ScopedFileLock lock(stream);
return stream->flush() ? 0 : EOF;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fgets.html
char* fgets(char* buffer, int size, FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
bool ok = stream->gets(reinterpret_cast<u8*>(buffer), size);
return ok ? buffer : nullptr;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fgetc.html
int fgetc(FILE* stream)
{
VERIFY(stream);
char ch;
size_t nread = fread(&ch, sizeof(char), 1, stream);
if (nread == 1)
return ch;
return EOF;
}
int fgetc_unlocked(FILE* stream)
{
VERIFY(stream);
char ch;
size_t nread = fread_unlocked(&ch, sizeof(char), 1, stream);
if (nread == 1)
return ch;
return EOF;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/getc.html
int getc(FILE* stream)
{
return fgetc(stream);
}
int getc_unlocked(FILE* stream)
{
return fgetc_unlocked(stream);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/getchar.html
int getchar()
{
return getc(stdin);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/getdelim.html
ssize_t getdelim(char** lineptr, size_t* n, int delim, FILE* stream)
{
if (!lineptr || !n) {
errno = EINVAL;
return -1;
}
if (*lineptr == nullptr || *n == 0) {
*n = BUFSIZ;
if ((*lineptr = static_cast<char*>(malloc(*n))) == nullptr) {
return -1;
}
}
char* ptr;
char* eptr;
for (ptr = *lineptr, eptr = *lineptr + *n;;) {
int c = fgetc(stream);
if (c == -1) {
if (feof(stream)) {
*ptr = '\0';
return ptr == *lineptr ? -1 : ptr - *lineptr;
} else {
return -1;
}
}
*ptr++ = c;
if (c == delim) {
*ptr = '\0';
return ptr - *lineptr;
}
if (ptr + 2 >= eptr) {
char* nbuf;
size_t nbuf_sz = *n * 2;
ssize_t d = ptr - *lineptr;
if ((nbuf = static_cast<char*>(realloc(*lineptr, nbuf_sz))) == nullptr) {
return -1;
}
*lineptr = nbuf;
*n = nbuf_sz;
eptr = nbuf + nbuf_sz;
ptr = nbuf + d;
}
}
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/getline.html
ssize_t getline(char** lineptr, size_t* n, FILE* stream)
{
return getdelim(lineptr, n, '\n', stream);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/ungetc.html
int ungetc(int c, FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
bool ok = stream->ungetc(c);
return ok ? c : EOF;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fputc.html
int fputc(int ch, FILE* stream)
{
VERIFY(stream);
u8 byte = ch;
ScopedFileLock lock(stream);
size_t nwritten = stream->write(&byte, 1);
if (nwritten == 0)
return EOF;
VERIFY(nwritten == 1);
return byte;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/putc.html
int putc(int ch, FILE* stream)
{
return fputc(ch, stream);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/putchar.html
int putchar(int ch)
{
return putc(ch, stdout);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fputs.html
int fputs(char const* s, FILE* stream)
{
VERIFY(stream);
size_t len = strlen(s);
ScopedFileLock lock(stream);
size_t nwritten = stream->write(reinterpret_cast<u8 const*>(s), len);
if (nwritten < len)
return EOF;
return 1;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/puts.html
int puts(char const* s)
{
int rc = fputs(s, stdout);
if (rc == EOF)
return EOF;
return fputc('\n', stdout);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/clearerr.html
void clearerr(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
stream->clear_err();
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/ferror.html
int ferror(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->error();
}
size_t fread_unlocked(void* ptr, size_t size, size_t nmemb, FILE* stream)
{
VERIFY(stream);
VERIFY(!Checked<size_t>::multiplication_would_overflow(size, nmemb));
size_t nread = stream->read(reinterpret_cast<u8*>(ptr), size * nmemb);
if (!nread)
return 0;
return nread / size;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fread.html
size_t fread(void* ptr, size_t size, size_t nmemb, FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return fread_unlocked(ptr, size, nmemb, stream);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fwrite.html
size_t fwrite(void const* ptr, size_t size, size_t nmemb, FILE* stream)
{
VERIFY(stream);
VERIFY(!Checked<size_t>::multiplication_would_overflow(size, nmemb));
ScopedFileLock lock(stream);
size_t nwritten = stream->write(reinterpret_cast<u8 const*>(ptr), size * nmemb);
if (!nwritten)
return 0;
return nwritten / size;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fseek.html
int fseek(FILE* stream, long offset, int whence)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->seek(offset, whence);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fseeko.html
int fseeko(FILE* stream, off_t offset, int whence)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->seek(offset, whence);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/ftell.html
long ftell(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->tell();
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/ftello.html
off_t ftello(FILE* stream)
{
VERIFY(stream);
ScopedFileLock lock(stream);
return stream->tell();
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fgetpos.html
int fgetpos(FILE* stream, fpos_t* pos)
{
VERIFY(stream);
VERIFY(pos);
ScopedFileLock lock(stream);
off_t val = stream->tell();
if (val == -1L)
return 1;
*pos = val;
return 0;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fsetpos.html
int fsetpos(FILE* stream, fpos_t const* pos)
{
VERIFY(stream);
VERIFY(pos);
ScopedFileLock lock(stream);
return stream->seek(*pos, SEEK_SET);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/rewind.html
void rewind(FILE* stream)
{
fseek(stream, 0, SEEK_SET);
clearerr(stream);
}
ALWAYS_INLINE void stdout_putch(char*&, char ch)
{
putchar(ch);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/vfprintf.html
int vfprintf(FILE* stream, char const* fmt, va_list ap)
{
return printf_internal([stream](auto, char ch) { fputc(ch, stream); }, nullptr, fmt, ap);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/fprintf.html
int fprintf(FILE* stream, char const* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
int ret = vfprintf(stream, fmt, ap);
va_end(ap);
return ret;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/vprintf.html
int vprintf(char const* fmt, va_list ap)
{
return printf_internal(stdout_putch, nullptr, fmt, ap);
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
int printf(char const* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
int ret = vprintf(fmt, ap);
va_end(ap);
return ret;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/vasprintf.html
int vasprintf(char** strp, char const* fmt, va_list ap)
{
StringBuilder builder;
builder.appendvf(fmt, ap);
VERIFY(builder.length() <= NumericLimits<int>::max());
int length = builder.length();
*strp = strdup(builder.to_string().characters());
return length;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/asprintf.html
int asprintf(char** strp, char const* fmt, ...)
{
StringBuilder builder;
va_list ap;
va_start(ap, fmt);
builder.appendvf(fmt, ap);
va_end(ap);
VERIFY(builder.length() <= NumericLimits<int>::max());
int length = builder.length();
*strp = strdup(builder.to_string().characters());
return length;
}
static void buffer_putch(char*& bufptr, char ch)
{
*bufptr++ = ch;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/vsprintf.html
int vsprintf(char* buffer, char const* fmt, va_list ap)
{
int ret = printf_internal(buffer_putch, buffer, fmt, ap);
buffer[ret] = '\0';
return ret;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/sprintf.html
int sprintf(char* buffer, char const* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
int ret = vsprintf(buffer, fmt, ap);
va_end(ap);
return ret;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/vsnprintf.html
int vsnprintf(char* buffer, size_t size, char const* fmt, va_list ap)
{
size_t space_remaining = 0;
if (size) {
space_remaining = size - 1;
} else {
space_remaining = 0;
}
auto sized_buffer_putch = [&](char*& bufptr, char ch) {
if (space_remaining) {
*bufptr++ = ch;
--space_remaining;
}
};
int ret = printf_internal(sized_buffer_putch, buffer, fmt, ap);
if (space_remaining) {
buffer[ret] = '\0';
} else if (size > 0) {
buffer[size - 1] = '\0';
}
return ret;
}
// https://pubs.opengroup.org/onlinepubs/9699919799/functions/snprintf.html
int snprintf(char* buffer, size_t size, char const* fmt, ...)
{
va_list ap;