stdio.cpp 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2020, Sergey Bugaev <bugaevc@serenityos.org>
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright notice, this
  10. * list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form must reproduce the above copyright notice,
  13. * this list of conditions and the following disclaimer in the documentation
  14. * and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  20. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. #include <AK/Format.h>
  28. #include <AK/PrintfImplementation.h>
  29. #include <AK/ScopedValueRollback.h>
  30. #include <AK/StdLibExtras.h>
  31. #include <AK/String.h>
  32. #include <assert.h>
  33. #include <errno.h>
  34. #include <fcntl.h>
  35. #include <stdarg.h>
  36. #include <stdio.h>
  37. #include <stdlib.h>
  38. #include <string.h>
  39. #include <sys/internals.h>
  40. #include <sys/types.h>
  41. #include <sys/wait.h>
  42. #include <syscall.h>
  43. #include <unistd.h>
  44. struct FILE {
  45. public:
  46. FILE(int fd, int mode)
  47. : m_fd(fd)
  48. , m_mode(mode)
  49. {
  50. }
  51. ~FILE();
  52. static FILE* create(int fd, int mode);
  53. void setbuf(u8* data, int mode, size_t size) { m_buffer.setbuf(data, mode, size); }
  54. bool flush();
  55. bool close();
  56. int fileno() const { return m_fd; }
  57. bool eof() const { return m_eof; }
  58. int error() const { return m_error; }
  59. void clear_err() { m_error = 0; }
  60. size_t read(u8*, size_t);
  61. size_t write(const u8*, size_t);
  62. bool gets(u8*, size_t);
  63. bool ungetc(u8 byte) { return m_buffer.enqueue_front(byte); }
  64. int seek(off_t offset, int whence);
  65. off_t tell();
  66. pid_t popen_child() { return m_popen_child; }
  67. void set_popen_child(pid_t child_pid) { m_popen_child = child_pid; }
  68. void reopen(int fd, int mode);
  69. private:
  70. struct Buffer {
  71. // A ringbuffer that also transparently implements ungetc().
  72. public:
  73. ~Buffer();
  74. int mode() const { return m_mode; }
  75. void setbuf(u8* data, int mode, size_t size);
  76. // Make sure to call realize() before enqueuing any data.
  77. // Dequeuing can be attempted without it.
  78. void realize(int fd);
  79. void drop();
  80. bool may_use() const { return m_ungotten || m_mode != _IONBF; }
  81. bool is_not_empty() const { return m_ungotten || !m_empty; }
  82. size_t buffered_size() const;
  83. const u8* begin_dequeue(size_t& available_size) const;
  84. void did_dequeue(size_t actual_size);
  85. u8* begin_enqueue(size_t& available_size) const;
  86. void did_enqueue(size_t actual_size);
  87. bool enqueue_front(u8 byte);
  88. private:
  89. // Note: the fields here are arranged this way
  90. // to make sizeof(Buffer) smaller.
  91. u8* m_data { nullptr };
  92. size_t m_capacity { BUFSIZ };
  93. size_t m_begin { 0 };
  94. size_t m_end { 0 };
  95. int m_mode { -1 };
  96. u8 m_unget_buffer { 0 };
  97. bool m_ungotten : 1 { false };
  98. bool m_data_is_malloced : 1 { false };
  99. // When m_begin == m_end, we want to distinguish whether
  100. // the buffer is full or empty.
  101. bool m_empty : 1 { true };
  102. };
  103. // Read or write using the underlying fd, bypassing the buffer.
  104. ssize_t do_read(u8*, size_t);
  105. ssize_t do_write(const u8*, size_t);
  106. // Read some data into the buffer.
  107. bool read_into_buffer();
  108. // Flush *some* data from the buffer.
  109. bool write_from_buffer();
  110. int m_fd { -1 };
  111. int m_mode { 0 };
  112. int m_error { 0 };
  113. bool m_eof { false };
  114. pid_t m_popen_child { -1 };
  115. Buffer m_buffer;
  116. };
  117. FILE::~FILE()
  118. {
  119. bool already_closed = m_fd == -1;
  120. VERIFY(already_closed);
  121. }
  122. FILE* FILE::create(int fd, int mode)
  123. {
  124. void* file = calloc(1, sizeof(FILE));
  125. new (file) FILE(fd, mode);
  126. return (FILE*)file;
  127. }
  128. bool FILE::close()
  129. {
  130. bool flush_ok = flush();
  131. int rc = ::close(m_fd);
  132. m_fd = -1;
  133. if (!flush_ok) {
  134. // Restore the original error from flush().
  135. errno = m_error;
  136. }
  137. return flush_ok && rc == 0;
  138. }
  139. bool FILE::flush()
  140. {
  141. if (m_mode & O_WRONLY && m_buffer.may_use()) {
  142. // When open for writing, write out all the buffered data.
  143. while (m_buffer.is_not_empty()) {
  144. bool ok = write_from_buffer();
  145. if (!ok)
  146. return false;
  147. }
  148. }
  149. if (m_mode & O_RDONLY) {
  150. // When open for reading, just drop the buffered data.
  151. VERIFY(m_buffer.buffered_size() <= NumericLimits<off_t>::max());
  152. off_t had_buffered = m_buffer.buffered_size();
  153. m_buffer.drop();
  154. // Attempt to reset the underlying file position to what the user
  155. // expects.
  156. if (lseek(m_fd, -had_buffered, SEEK_CUR) < 0) {
  157. if (errno == ESPIPE) {
  158. // We can't set offset on this file; oh well, the user will just
  159. // have to cope.
  160. errno = 0;
  161. } else {
  162. return false;
  163. }
  164. }
  165. }
  166. return true;
  167. }
  168. ssize_t FILE::do_read(u8* data, size_t size)
  169. {
  170. int nread = ::read(m_fd, data, size);
  171. if (nread < 0) {
  172. m_error = errno;
  173. } else if (nread == 0) {
  174. m_eof = true;
  175. }
  176. return nread;
  177. }
  178. ssize_t FILE::do_write(const u8* data, size_t size)
  179. {
  180. int nwritten = ::write(m_fd, data, size);
  181. if (nwritten < 0)
  182. m_error = errno;
  183. return nwritten;
  184. }
  185. bool FILE::read_into_buffer()
  186. {
  187. m_buffer.realize(m_fd);
  188. size_t available_size;
  189. u8* data = m_buffer.begin_enqueue(available_size);
  190. // If we want to read, the buffer must have some space!
  191. VERIFY(available_size);
  192. ssize_t nread = do_read(data, available_size);
  193. if (nread <= 0)
  194. return false;
  195. m_buffer.did_enqueue(nread);
  196. return true;
  197. }
  198. bool FILE::write_from_buffer()
  199. {
  200. size_t size;
  201. const u8* data = m_buffer.begin_dequeue(size);
  202. // If we want to write, the buffer must have something in it!
  203. VERIFY(size);
  204. ssize_t nwritten = do_write(data, size);
  205. if (nwritten < 0)
  206. return false;
  207. m_buffer.did_dequeue(nwritten);
  208. return true;
  209. }
  210. size_t FILE::read(u8* data, size_t size)
  211. {
  212. size_t total_read = 0;
  213. while (size > 0) {
  214. size_t actual_size;
  215. if (m_buffer.may_use()) {
  216. // Let's see if the buffer has something queued for us.
  217. size_t queued_size;
  218. const u8* queued_data = m_buffer.begin_dequeue(queued_size);
  219. if (queued_size == 0) {
  220. // Nothing buffered; we're going to have to read some.
  221. bool read_some_more = read_into_buffer();
  222. if (read_some_more) {
  223. // Great, now try this again.
  224. continue;
  225. }
  226. return total_read;
  227. }
  228. actual_size = min(size, queued_size);
  229. memcpy(data, queued_data, actual_size);
  230. m_buffer.did_dequeue(actual_size);
  231. } else {
  232. // Read directly into the user buffer.
  233. ssize_t nread = do_read(data, size);
  234. if (nread <= 0)
  235. return total_read;
  236. actual_size = nread;
  237. }
  238. total_read += actual_size;
  239. data += actual_size;
  240. size -= actual_size;
  241. }
  242. return total_read;
  243. }
  244. size_t FILE::write(const u8* data, size_t size)
  245. {
  246. size_t total_written = 0;
  247. while (size > 0) {
  248. size_t actual_size;
  249. if (m_buffer.may_use()) {
  250. m_buffer.realize(m_fd);
  251. // Try writing into the buffer.
  252. size_t available_size;
  253. u8* buffer_data = m_buffer.begin_enqueue(available_size);
  254. if (available_size == 0) {
  255. // There's no space in the buffer; we're going to free some.
  256. bool freed_some_space = write_from_buffer();
  257. if (freed_some_space) {
  258. // Great, now try this again.
  259. continue;
  260. }
  261. return total_written;
  262. }
  263. actual_size = min(size, available_size);
  264. memcpy(buffer_data, data, actual_size);
  265. m_buffer.did_enqueue(actual_size);
  266. // See if we have to flush it.
  267. if (m_buffer.mode() == _IOLBF) {
  268. bool includes_newline = memchr(data, '\n', actual_size);
  269. if (includes_newline)
  270. flush();
  271. }
  272. } else {
  273. // Write directly from the user buffer.
  274. ssize_t nwritten = do_write(data, size);
  275. if (nwritten < 0)
  276. return total_written;
  277. actual_size = nwritten;
  278. }
  279. total_written += actual_size;
  280. data += actual_size;
  281. size -= actual_size;
  282. }
  283. return total_written;
  284. }
  285. bool FILE::gets(u8* data, size_t size)
  286. {
  287. // gets() is a lot like read(), but it is different enough in how it
  288. // processes newlines and null-terminates the buffer that it deserves a
  289. // separate implementation.
  290. size_t total_read = 0;
  291. if (size == 0)
  292. return false;
  293. while (size > 1) {
  294. if (m_buffer.may_use()) {
  295. // Let's see if the buffer has something queued for us.
  296. size_t queued_size;
  297. const u8* queued_data = m_buffer.begin_dequeue(queued_size);
  298. if (queued_size == 0) {
  299. // Nothing buffered; we're going to have to read some.
  300. bool read_some_more = read_into_buffer();
  301. if (read_some_more) {
  302. // Great, now try this again.
  303. continue;
  304. }
  305. *data = 0;
  306. return total_read > 0;
  307. }
  308. size_t actual_size = min(size - 1, queued_size);
  309. u8* newline = reinterpret_cast<u8*>(memchr(queued_data, '\n', actual_size));
  310. if (newline)
  311. actual_size = newline - queued_data + 1;
  312. memcpy(data, queued_data, actual_size);
  313. m_buffer.did_dequeue(actual_size);
  314. total_read += actual_size;
  315. data += actual_size;
  316. size -= actual_size;
  317. if (newline)
  318. break;
  319. } else {
  320. // Sadly, we have to actually read these characters one by one.
  321. u8 byte;
  322. ssize_t nread = do_read(&byte, 1);
  323. if (nread <= 0) {
  324. *data = 0;
  325. return total_read > 0;
  326. }
  327. VERIFY(nread == 1);
  328. *data = byte;
  329. total_read++;
  330. data++;
  331. size--;
  332. if (byte == '\n')
  333. break;
  334. }
  335. }
  336. *data = 0;
  337. return total_read > 0;
  338. }
  339. int FILE::seek(off_t offset, int whence)
  340. {
  341. bool ok = flush();
  342. if (!ok)
  343. return -1;
  344. off_t off = lseek(m_fd, offset, whence);
  345. if (off < 0) {
  346. // Note: do not set m_error.
  347. return off;
  348. }
  349. m_eof = false;
  350. return 0;
  351. }
  352. off_t FILE::tell()
  353. {
  354. bool ok = flush();
  355. if (!ok)
  356. return -1;
  357. return lseek(m_fd, 0, SEEK_CUR);
  358. }
  359. void FILE::reopen(int fd, int mode)
  360. {
  361. // Dr. POSIX says: "Failure to flush or close the file descriptor
  362. // successfully shall be ignored"
  363. // and so we ignore any failures these two might have.
  364. flush();
  365. close();
  366. // Just in case flush() and close() didn't drop the buffer.
  367. m_buffer.drop();
  368. m_fd = fd;
  369. m_mode = mode;
  370. m_error = 0;
  371. m_eof = false;
  372. }
  373. FILE::Buffer::~Buffer()
  374. {
  375. if (m_data_is_malloced)
  376. free(m_data);
  377. }
  378. void FILE::Buffer::realize(int fd)
  379. {
  380. if (m_mode == -1)
  381. m_mode = isatty(fd) ? _IOLBF : _IOFBF;
  382. if (m_mode != _IONBF && m_data == nullptr) {
  383. m_data = reinterpret_cast<u8*>(malloc(m_capacity));
  384. m_data_is_malloced = true;
  385. }
  386. }
  387. void FILE::Buffer::setbuf(u8* data, int mode, size_t size)
  388. {
  389. drop();
  390. m_mode = mode;
  391. if (data != nullptr) {
  392. m_data = data;
  393. m_capacity = size;
  394. }
  395. }
  396. void FILE::Buffer::drop()
  397. {
  398. if (m_data_is_malloced) {
  399. free(m_data);
  400. m_data = nullptr;
  401. m_data_is_malloced = false;
  402. }
  403. m_begin = m_end = 0;
  404. m_empty = true;
  405. m_ungotten = false;
  406. }
  407. size_t FILE::Buffer::buffered_size() const
  408. {
  409. // Note: does not include the ungetc() buffer.
  410. if (m_empty)
  411. return 0;
  412. if (m_begin < m_end)
  413. return m_end - m_begin;
  414. else
  415. return m_capacity - (m_begin - m_end);
  416. }
  417. const u8* FILE::Buffer::begin_dequeue(size_t& available_size) const
  418. {
  419. if (m_ungotten) {
  420. available_size = 1;
  421. return &m_unget_buffer;
  422. }
  423. if (m_empty) {
  424. available_size = 0;
  425. return nullptr;
  426. }
  427. if (m_begin < m_end)
  428. available_size = m_end - m_begin;
  429. else
  430. available_size = m_capacity - m_begin;
  431. return &m_data[m_begin];
  432. }
  433. void FILE::Buffer::did_dequeue(size_t actual_size)
  434. {
  435. VERIFY(actual_size > 0);
  436. if (m_ungotten) {
  437. VERIFY(actual_size == 1);
  438. m_ungotten = false;
  439. return;
  440. }
  441. m_begin += actual_size;
  442. VERIFY(m_begin <= m_capacity);
  443. if (m_begin == m_capacity) {
  444. // Wrap around.
  445. m_begin = 0;
  446. }
  447. if (m_begin == m_end) {
  448. m_empty = true;
  449. // As an optimization, move both pointers to the beginning of the
  450. // buffer, so that more consecutive space is available next time.
  451. m_begin = m_end = 0;
  452. }
  453. }
  454. u8* FILE::Buffer::begin_enqueue(size_t& available_size) const
  455. {
  456. VERIFY(m_data != nullptr);
  457. if (m_begin < m_end || m_empty)
  458. available_size = m_capacity - m_end;
  459. else
  460. available_size = m_begin - m_end;
  461. return const_cast<u8*>(&m_data[m_end]);
  462. }
  463. void FILE::Buffer::did_enqueue(size_t actual_size)
  464. {
  465. VERIFY(m_data != nullptr);
  466. VERIFY(actual_size > 0);
  467. m_end += actual_size;
  468. VERIFY(m_end <= m_capacity);
  469. if (m_end == m_capacity) {
  470. // Wrap around.
  471. m_end = 0;
  472. }
  473. m_empty = false;
  474. }
  475. bool FILE::Buffer::enqueue_front(u8 byte)
  476. {
  477. if (m_ungotten) {
  478. // Sorry, the place is already taken!
  479. return false;
  480. }
  481. m_ungotten = true;
  482. m_unget_buffer = byte;
  483. return true;
  484. }
  485. extern "C" {
  486. static u8 default_streams[3][sizeof(FILE)];
  487. FILE* stdin = reinterpret_cast<FILE*>(&default_streams[0]);
  488. FILE* stdout = reinterpret_cast<FILE*>(&default_streams[1]);
  489. FILE* stderr = reinterpret_cast<FILE*>(&default_streams[2]);
  490. void __stdio_init()
  491. {
  492. new (stdin) FILE(0, O_RDONLY);
  493. new (stdout) FILE(1, O_WRONLY);
  494. new (stderr) FILE(2, O_WRONLY);
  495. stderr->setbuf(nullptr, _IONBF, 0);
  496. __stdio_is_initialized = true;
  497. }
  498. int setvbuf(FILE* stream, char* buf, int mode, size_t size)
  499. {
  500. VERIFY(stream);
  501. if (mode != _IONBF && mode != _IOLBF && mode != _IOFBF) {
  502. errno = EINVAL;
  503. return -1;
  504. }
  505. stream->setbuf(reinterpret_cast<u8*>(buf), mode, size);
  506. return 0;
  507. }
  508. void setbuf(FILE* stream, char* buf)
  509. {
  510. setvbuf(stream, buf, buf ? _IOFBF : _IONBF, BUFSIZ);
  511. }
  512. void setlinebuf(FILE* stream)
  513. {
  514. setvbuf(stream, nullptr, _IOLBF, 0);
  515. }
  516. int fileno(FILE* stream)
  517. {
  518. VERIFY(stream);
  519. return stream->fileno();
  520. }
  521. int feof(FILE* stream)
  522. {
  523. VERIFY(stream);
  524. return stream->eof();
  525. }
  526. int fflush(FILE* stream)
  527. {
  528. if (!stream) {
  529. dbgln("FIXME: fflush(nullptr) should flush all open streams");
  530. return 0;
  531. }
  532. return stream->flush() ? 0 : EOF;
  533. }
  534. char* fgets(char* buffer, int size, FILE* stream)
  535. {
  536. VERIFY(stream);
  537. bool ok = stream->gets(reinterpret_cast<u8*>(buffer), size);
  538. return ok ? buffer : nullptr;
  539. }
  540. int fgetc(FILE* stream)
  541. {
  542. VERIFY(stream);
  543. char ch;
  544. size_t nread = fread(&ch, sizeof(char), 1, stream);
  545. if (nread == 1)
  546. return ch;
  547. return EOF;
  548. }
  549. int getc(FILE* stream)
  550. {
  551. return fgetc(stream);
  552. }
  553. int getc_unlocked(FILE* stream)
  554. {
  555. return fgetc(stream);
  556. }
  557. int getchar()
  558. {
  559. return getc(stdin);
  560. }
  561. ssize_t getdelim(char** lineptr, size_t* n, int delim, FILE* stream)
  562. {
  563. if (!lineptr || !n) {
  564. errno = EINVAL;
  565. return -1;
  566. }
  567. if (*lineptr == nullptr || *n == 0) {
  568. *n = BUFSIZ;
  569. if ((*lineptr = static_cast<char*>(malloc(*n))) == nullptr) {
  570. return -1;
  571. }
  572. }
  573. char* ptr;
  574. char* eptr;
  575. for (ptr = *lineptr, eptr = *lineptr + *n;;) {
  576. int c = fgetc(stream);
  577. if (c == -1) {
  578. if (feof(stream)) {
  579. *ptr = '\0';
  580. return ptr == *lineptr ? -1 : ptr - *lineptr;
  581. } else {
  582. return -1;
  583. }
  584. }
  585. *ptr++ = c;
  586. if (c == delim) {
  587. *ptr = '\0';
  588. return ptr - *lineptr;
  589. }
  590. if (ptr + 2 >= eptr) {
  591. char* nbuf;
  592. size_t nbuf_sz = *n * 2;
  593. ssize_t d = ptr - *lineptr;
  594. if ((nbuf = static_cast<char*>(realloc(*lineptr, nbuf_sz))) == nullptr) {
  595. return -1;
  596. }
  597. *lineptr = nbuf;
  598. *n = nbuf_sz;
  599. eptr = nbuf + nbuf_sz;
  600. ptr = nbuf + d;
  601. }
  602. }
  603. }
  604. ssize_t getline(char** lineptr, size_t* n, FILE* stream)
  605. {
  606. return getdelim(lineptr, n, '\n', stream);
  607. }
  608. int ungetc(int c, FILE* stream)
  609. {
  610. VERIFY(stream);
  611. bool ok = stream->ungetc(c);
  612. return ok ? c : EOF;
  613. }
  614. int fputc(int ch, FILE* stream)
  615. {
  616. VERIFY(stream);
  617. u8 byte = ch;
  618. size_t nwritten = stream->write(&byte, 1);
  619. if (nwritten == 0)
  620. return EOF;
  621. VERIFY(nwritten == 1);
  622. return byte;
  623. }
  624. int putc(int ch, FILE* stream)
  625. {
  626. return fputc(ch, stream);
  627. }
  628. int putchar(int ch)
  629. {
  630. return putc(ch, stdout);
  631. }
  632. int fputs(const char* s, FILE* stream)
  633. {
  634. VERIFY(stream);
  635. size_t len = strlen(s);
  636. size_t nwritten = stream->write(reinterpret_cast<const u8*>(s), len);
  637. if (nwritten < len)
  638. return EOF;
  639. return 1;
  640. }
  641. int puts(const char* s)
  642. {
  643. int rc = fputs(s, stdout);
  644. if (rc == EOF)
  645. return EOF;
  646. return fputc('\n', stdout);
  647. }
  648. void clearerr(FILE* stream)
  649. {
  650. VERIFY(stream);
  651. stream->clear_err();
  652. }
  653. int ferror(FILE* stream)
  654. {
  655. VERIFY(stream);
  656. return stream->error();
  657. }
  658. size_t fread(void* ptr, size_t size, size_t nmemb, FILE* stream)
  659. {
  660. VERIFY(stream);
  661. VERIFY(!Checked<size_t>::multiplication_would_overflow(size, nmemb));
  662. size_t nread = stream->read(reinterpret_cast<u8*>(ptr), size * nmemb);
  663. if (!nread)
  664. return 0;
  665. return nread / size;
  666. }
  667. size_t fwrite(const void* ptr, size_t size, size_t nmemb, FILE* stream)
  668. {
  669. VERIFY(stream);
  670. VERIFY(!Checked<size_t>::multiplication_would_overflow(size, nmemb));
  671. size_t nwritten = stream->write(reinterpret_cast<const u8*>(ptr), size * nmemb);
  672. if (!nwritten)
  673. return 0;
  674. return nwritten / size;
  675. }
  676. int fseek(FILE* stream, long offset, int whence)
  677. {
  678. VERIFY(stream);
  679. return stream->seek(offset, whence);
  680. }
  681. int fseeko(FILE* stream, off_t offset, int whence)
  682. {
  683. VERIFY(stream);
  684. return stream->seek(offset, whence);
  685. }
  686. long ftell(FILE* stream)
  687. {
  688. VERIFY(stream);
  689. return stream->tell();
  690. }
  691. off_t ftello(FILE* stream)
  692. {
  693. VERIFY(stream);
  694. return stream->tell();
  695. }
  696. int fgetpos(FILE* stream, fpos_t* pos)
  697. {
  698. VERIFY(stream);
  699. VERIFY(pos);
  700. off_t val = stream->tell();
  701. if (val == -1L)
  702. return 1;
  703. *pos = val;
  704. return 0;
  705. }
  706. int fsetpos(FILE* stream, const fpos_t* pos)
  707. {
  708. VERIFY(stream);
  709. VERIFY(pos);
  710. return stream->seek(*pos, SEEK_SET);
  711. }
  712. void rewind(FILE* stream)
  713. {
  714. VERIFY(stream);
  715. int rc = stream->seek(0, SEEK_SET);
  716. VERIFY(rc == 0);
  717. }
  718. ALWAYS_INLINE void stdout_putch(char*&, char ch)
  719. {
  720. putchar(ch);
  721. }
  722. static FILE* __current_stream = nullptr;
  723. ALWAYS_INLINE static void stream_putch(char*&, char ch)
  724. {
  725. fputc(ch, __current_stream);
  726. }
  727. int vfprintf(FILE* stream, const char* fmt, va_list ap)
  728. {
  729. __current_stream = stream;
  730. return printf_internal(stream_putch, nullptr, fmt, ap);
  731. }
  732. int fprintf(FILE* stream, const char* fmt, ...)
  733. {
  734. va_list ap;
  735. va_start(ap, fmt);
  736. int ret = vfprintf(stream, fmt, ap);
  737. va_end(ap);
  738. return ret;
  739. }
  740. int vprintf(const char* fmt, va_list ap)
  741. {
  742. return printf_internal(stdout_putch, nullptr, fmt, ap);
  743. }
  744. int printf(const char* fmt, ...)
  745. {
  746. va_list ap;
  747. va_start(ap, fmt);
  748. int ret = vprintf(fmt, ap);
  749. va_end(ap);
  750. return ret;
  751. }
  752. int vasprintf(char** strp, const char* fmt, va_list ap)
  753. {
  754. StringBuilder builder;
  755. builder.appendvf(fmt, ap);
  756. VERIFY(builder.length() <= NumericLimits<int>::max());
  757. int length = builder.length();
  758. *strp = strdup(builder.to_string().characters());
  759. return length;
  760. }
  761. int asprintf(char** strp, const char* fmt, ...)
  762. {
  763. StringBuilder builder;
  764. va_list ap;
  765. va_start(ap, fmt);
  766. builder.appendvf(fmt, ap);
  767. va_end(ap);
  768. VERIFY(builder.length() <= NumericLimits<int>::max());
  769. int length = builder.length();
  770. *strp = strdup(builder.to_string().characters());
  771. return length;
  772. }
  773. static void buffer_putch(char*& bufptr, char ch)
  774. {
  775. *bufptr++ = ch;
  776. }
  777. int vsprintf(char* buffer, const char* fmt, va_list ap)
  778. {
  779. int ret = printf_internal(buffer_putch, buffer, fmt, ap);
  780. buffer[ret] = '\0';
  781. return ret;
  782. }
  783. int sprintf(char* buffer, const char* fmt, ...)
  784. {
  785. va_list ap;
  786. va_start(ap, fmt);
  787. int ret = vsprintf(buffer, fmt, ap);
  788. va_end(ap);
  789. return ret;
  790. }
  791. static size_t __vsnprintf_space_remaining;
  792. ALWAYS_INLINE void sized_buffer_putch(char*& bufptr, char ch)
  793. {
  794. if (__vsnprintf_space_remaining) {
  795. *bufptr++ = ch;
  796. --__vsnprintf_space_remaining;
  797. }
  798. }
  799. int vsnprintf(char* buffer, size_t size, const char* fmt, va_list ap)
  800. {
  801. if (size) {
  802. __vsnprintf_space_remaining = size - 1;
  803. } else {
  804. __vsnprintf_space_remaining = 0;
  805. }
  806. int ret = printf_internal(sized_buffer_putch, buffer, fmt, ap);
  807. if (__vsnprintf_space_remaining) {
  808. buffer[ret] = '\0';
  809. } else if (size > 0) {
  810. buffer[size - 1] = '\0';
  811. }
  812. return ret;
  813. }
  814. int snprintf(char* buffer, size_t size, const char* fmt, ...)
  815. {
  816. va_list ap;
  817. va_start(ap, fmt);
  818. int ret = vsnprintf(buffer, size, fmt, ap);
  819. va_end(ap);
  820. return ret;
  821. }
  822. void perror(const char* s)
  823. {
  824. int saved_errno = errno;
  825. dbgln("perror(): {}: {}", s, strerror(saved_errno));
  826. warnln("{}: {}", s, strerror(saved_errno));
  827. }
  828. static int parse_mode(const char* mode)
  829. {
  830. int flags = 0;
  831. // NOTE: rt is a non-standard mode which opens a file for read, explicitly
  832. // specifying that it's a text file
  833. for (auto* ptr = mode; *ptr; ++ptr) {
  834. switch (*ptr) {
  835. case 'r':
  836. flags |= O_RDONLY;
  837. break;
  838. case 'w':
  839. flags |= O_WRONLY | O_CREAT | O_TRUNC;
  840. break;
  841. case 'a':
  842. flags |= O_WRONLY | O_APPEND | O_CREAT;
  843. break;
  844. case '+':
  845. flags |= O_RDWR;
  846. break;
  847. case 'e':
  848. flags |= O_CLOEXEC;
  849. break;
  850. case 'b':
  851. // Ok...
  852. break;
  853. case 't':
  854. // Ok...
  855. break;
  856. default:
  857. dbgln("Potentially unsupported fopen mode _{}_ (because of '{}')", mode, *ptr);
  858. }
  859. }
  860. return flags;
  861. }
  862. FILE* fopen(const char* pathname, const char* mode)
  863. {
  864. int flags = parse_mode(mode);
  865. int fd = open(pathname, flags, 0666);
  866. if (fd < 0)
  867. return nullptr;
  868. return FILE::create(fd, flags);
  869. }
  870. FILE* freopen(const char* pathname, const char* mode, FILE* stream)
  871. {
  872. VERIFY(stream);
  873. if (!pathname) {
  874. // FIXME: Someone should probably implement this path.
  875. TODO();
  876. }
  877. int flags = parse_mode(mode);
  878. int fd = open(pathname, flags, 0666);
  879. if (fd < 0)
  880. return nullptr;
  881. stream->reopen(fd, flags);
  882. return stream;
  883. }
  884. FILE* fdopen(int fd, const char* mode)
  885. {
  886. int flags = parse_mode(mode);
  887. // FIXME: Verify that the mode matches how fd is already open.
  888. if (fd < 0)
  889. return nullptr;
  890. return FILE::create(fd, flags);
  891. }
  892. static inline bool is_default_stream(FILE* stream)
  893. {
  894. return stream == stdin || stream == stdout || stream == stderr;
  895. }
  896. int fclose(FILE* stream)
  897. {
  898. VERIFY(stream);
  899. bool ok = stream->close();
  900. ScopedValueRollback errno_restorer(errno);
  901. stream->~FILE();
  902. if (!is_default_stream(stream))
  903. free(stream);
  904. return ok ? 0 : EOF;
  905. }
  906. int rename(const char* oldpath, const char* newpath)
  907. {
  908. if (!oldpath || !newpath) {
  909. errno = EFAULT;
  910. return -1;
  911. }
  912. Syscall::SC_rename_params params { { oldpath, strlen(oldpath) }, { newpath, strlen(newpath) } };
  913. int rc = syscall(SC_rename, &params);
  914. __RETURN_WITH_ERRNO(rc, rc, -1);
  915. }
  916. void dbgputch(char ch)
  917. {
  918. syscall(SC_dbgputch, ch);
  919. }
  920. void dbgputstr(const char* characters, size_t length)
  921. {
  922. syscall(SC_dbgputstr, characters, length);
  923. }
  924. char* tmpnam(char*)
  925. {
  926. dbgln("FIXME: Implement tmpnam()");
  927. TODO();
  928. }
  929. FILE* popen(const char* command, const char* type)
  930. {
  931. if (!type || (*type != 'r' && *type != 'w')) {
  932. errno = EINVAL;
  933. return nullptr;
  934. }
  935. int pipe_fds[2];
  936. int rc = pipe(pipe_fds);
  937. if (rc < 0) {
  938. ScopedValueRollback rollback(errno);
  939. perror("pipe");
  940. return nullptr;
  941. }
  942. pid_t child_pid = fork();
  943. if (child_pid < 0) {
  944. ScopedValueRollback rollback(errno);
  945. perror("fork");
  946. close(pipe_fds[0]);
  947. close(pipe_fds[1]);
  948. return nullptr;
  949. } else if (child_pid == 0) {
  950. if (*type == 'r') {
  951. int rc = dup2(pipe_fds[1], STDOUT_FILENO);
  952. if (rc < 0) {
  953. perror("dup2");
  954. exit(1);
  955. }
  956. close(pipe_fds[0]);
  957. close(pipe_fds[1]);
  958. } else if (*type == 'w') {
  959. int rc = dup2(pipe_fds[0], STDIN_FILENO);
  960. if (rc < 0) {
  961. perror("dup2");
  962. exit(1);
  963. }
  964. close(pipe_fds[0]);
  965. close(pipe_fds[1]);
  966. }
  967. int rc = execl("/bin/sh", "sh", "-c", command, nullptr);
  968. if (rc < 0)
  969. perror("execl");
  970. exit(1);
  971. }
  972. FILE* file = nullptr;
  973. if (*type == 'r') {
  974. file = FILE::create(pipe_fds[0], O_RDONLY);
  975. close(pipe_fds[1]);
  976. } else if (*type == 'w') {
  977. file = FILE::create(pipe_fds[1], O_WRONLY);
  978. close(pipe_fds[0]);
  979. }
  980. file->set_popen_child(child_pid);
  981. return file;
  982. }
  983. int pclose(FILE* stream)
  984. {
  985. VERIFY(stream);
  986. VERIFY(stream->popen_child() != 0);
  987. int wstatus = 0;
  988. int rc = waitpid(stream->popen_child(), &wstatus, 0);
  989. if (rc < 0)
  990. return rc;
  991. return wstatus;
  992. }
  993. int remove(const char* pathname)
  994. {
  995. int rc = unlink(pathname);
  996. if (rc < 0 && errno == EISDIR)
  997. return rmdir(pathname);
  998. return rc;
  999. }
  1000. int scanf(const char* fmt, ...)
  1001. {
  1002. va_list ap;
  1003. va_start(ap, fmt);
  1004. int count = vfscanf(stdin, fmt, ap);
  1005. va_end(ap);
  1006. return count;
  1007. }
  1008. int fscanf(FILE* stream, const char* fmt, ...)
  1009. {
  1010. va_list ap;
  1011. va_start(ap, fmt);
  1012. int count = vfscanf(stream, fmt, ap);
  1013. va_end(ap);
  1014. return count;
  1015. }
  1016. int sscanf(const char* buffer, const char* fmt, ...)
  1017. {
  1018. va_list ap;
  1019. va_start(ap, fmt);
  1020. int count = vsscanf(buffer, fmt, ap);
  1021. va_end(ap);
  1022. return count;
  1023. }
  1024. int vfscanf(FILE* stream, const char* fmt, va_list ap)
  1025. {
  1026. char buffer[BUFSIZ];
  1027. if (!fgets(buffer, sizeof(buffer) - 1, stream))
  1028. return -1;
  1029. return vsscanf(buffer, fmt, ap);
  1030. }
  1031. void flockfile([[maybe_unused]] FILE* filehandle)
  1032. {
  1033. dbgln("FIXME: Implement flockfile()");
  1034. }
  1035. void funlockfile([[maybe_unused]] FILE* filehandle)
  1036. {
  1037. dbgln("FIXME: Implement funlockfile()");
  1038. }
  1039. FILE* tmpfile()
  1040. {
  1041. char tmp_path[] = "/tmp/XXXXXX";
  1042. int fd = mkstemp(tmp_path);
  1043. if (fd < 0)
  1044. return nullptr;
  1045. // FIXME: instead of using this hack, implement with O_TMPFILE or similar
  1046. unlink(tmp_path);
  1047. return fdopen(fd, "rw");
  1048. }
  1049. }