Task.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887
  1. #include "types.h"
  2. #include "Task.h"
  3. #include "kmalloc.h"
  4. #include "VGA.h"
  5. #include "StdLib.h"
  6. #include "i386.h"
  7. #include "system.h"
  8. #include <VirtualFileSystem/FileHandle.h>
  9. #include <VirtualFileSystem/VirtualFileSystem.h>
  10. #include <ELFLoader/ExecSpace.h>
  11. #include "MemoryManager.h"
  12. #include "errno.h"
  13. #include "i8253.h"
  14. #include "RTC.h"
  15. #include "ProcFileSystem.h"
  16. //#define DEBUG_IO
  17. //#define TASK_DEBUG
  18. static const DWORD defaultStackSize = 16384;
  19. Task* current;
  20. Task* s_kernelTask;
  21. static pid_t next_pid;
  22. static InlineLinkedList<Task>* s_tasks;
  23. static InlineLinkedList<Task>* s_deadTasks;
  24. static String* s_hostname;
  25. static String& hostnameStorage(InterruptDisabler&)
  26. {
  27. ASSERT(s_hostname);
  28. return *s_hostname;
  29. }
  30. static String getHostname()
  31. {
  32. InterruptDisabler disabler;
  33. return hostnameStorage(disabler).isolatedCopy();
  34. }
  35. static bool contextSwitch(Task*);
  36. static void redoKernelTaskTSS()
  37. {
  38. if (!s_kernelTask->selector())
  39. s_kernelTask->setSelector(allocateGDTEntry());
  40. auto& tssDescriptor = getGDTEntry(s_kernelTask->selector());
  41. tssDescriptor.setBase(&s_kernelTask->tss());
  42. tssDescriptor.setLimit(0xffff);
  43. tssDescriptor.dpl = 0;
  44. tssDescriptor.segment_present = 1;
  45. tssDescriptor.granularity = 1;
  46. tssDescriptor.zero = 0;
  47. tssDescriptor.operation_size = 1;
  48. tssDescriptor.descriptor_type = 0;
  49. tssDescriptor.type = 9;
  50. flushGDT();
  51. }
  52. void Task::prepForIRETToNewTask()
  53. {
  54. redoKernelTaskTSS();
  55. s_kernelTask->tss().backlink = current->selector();
  56. loadTaskRegister(s_kernelTask->selector());
  57. }
  58. void Task::initialize()
  59. {
  60. current = nullptr;
  61. next_pid = 0;
  62. s_tasks = new InlineLinkedList<Task>;
  63. s_deadTasks = new InlineLinkedList<Task>;
  64. s_kernelTask = Task::createKernelTask(nullptr, "colonel");
  65. s_hostname = new String("birx");
  66. redoKernelTaskTSS();
  67. loadTaskRegister(s_kernelTask->selector());
  68. }
  69. #ifdef TASK_SANITY_CHECKS
  70. void Task::checkSanity(const char* msg)
  71. {
  72. char ch = current->name()[0];
  73. kprintf("<%p> %s{%u}%b [%d] :%b: sanity check <%s>\n",
  74. current->name().characters(),
  75. current->name().characters(),
  76. current->name().length(),
  77. current->name()[current->name().length() - 1],
  78. current->pid(), ch, msg ? msg : "");
  79. ASSERT((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'));
  80. }
  81. #endif
  82. void Task::allocateLDT()
  83. {
  84. ASSERT(!m_tss.ldt);
  85. static const WORD numLDTEntries = 4;
  86. WORD newLDTSelector = allocateGDTEntry();
  87. m_ldtEntries = new Descriptor[numLDTEntries];
  88. #if 0
  89. kprintf("new ldt selector = %x\n", newLDTSelector);
  90. kprintf("new ldt table at = %p\n", m_ldtEntries);
  91. kprintf("new ldt table size = %u\n", (numLDTEntries * 8) - 1);
  92. #endif
  93. Descriptor& ldt = getGDTEntry(newLDTSelector);
  94. ldt.setBase(m_ldtEntries);
  95. ldt.setLimit(numLDTEntries * 8 - 1);
  96. ldt.dpl = 0;
  97. ldt.segment_present = 1;
  98. ldt.granularity = 0;
  99. ldt.zero = 0;
  100. ldt.operation_size = 1;
  101. ldt.descriptor_type = 0;
  102. ldt.type = Descriptor::LDT;
  103. m_tss.ldt = newLDTSelector;
  104. }
  105. Vector<Task*> Task::allTasks()
  106. {
  107. InterruptDisabler disabler;
  108. Vector<Task*> tasks;
  109. tasks.ensureCapacity(s_tasks->sizeSlow());
  110. for (auto* task = s_tasks->head(); task; task = task->next())
  111. tasks.append(task);
  112. return tasks;
  113. }
  114. Task::Region* Task::allocateRegion(size_t size, String&& name)
  115. {
  116. // FIXME: This needs sanity checks. What if this overlaps existing regions?
  117. auto zone = MemoryManager::the().createZone(size);
  118. ASSERT(zone);
  119. m_regions.append(make<Region>(m_nextRegion, size, move(zone), move(name)));
  120. m_nextRegion = m_nextRegion.offset(size).offset(16384);
  121. return m_regions.last().ptr();
  122. }
  123. bool Task::deallocateRegion(Region& region)
  124. {
  125. for (size_t i = 0; i < m_regions.size(); ++i) {
  126. if (m_regions[i].ptr() == &region) {
  127. // FIXME: This seems racy.
  128. MemoryManager::the().unmapRegion(*this, region);
  129. m_regions.remove(i);
  130. return true;
  131. }
  132. }
  133. return false;
  134. }
  135. Task::Region* Task::regionFromRange(LinearAddress laddr, size_t size)
  136. {
  137. for (auto& region : m_regions) {
  138. if (region->linearAddress == laddr && region->size == size)
  139. return region.ptr();
  140. }
  141. return nullptr;
  142. }
  143. void* Task::sys$mmap(void* addr, size_t size)
  144. {
  145. // FIXME: Implement mapping at a client-preferred address.
  146. ASSERT(addr == nullptr);
  147. auto* region = allocateRegion(size, "mmap");
  148. if (!region)
  149. return (void*)-1;
  150. MemoryManager::the().mapRegion(*this, *region);
  151. return (void*)region->linearAddress.get();
  152. }
  153. int Task::sys$munmap(void* addr, size_t size)
  154. {
  155. auto* region = regionFromRange(LinearAddress((dword)addr), size);
  156. if (!region)
  157. return -1;
  158. if (!deallocateRegion(*region))
  159. return -1;
  160. return 0;
  161. }
  162. int Task::sys$gethostname(char* buffer, size_t size)
  163. {
  164. auto hostname = getHostname();
  165. if (size < (hostname.length() + 1))
  166. return -ENAMETOOLONG;
  167. memcpy(buffer, hostname.characters(), size);
  168. return 0;
  169. }
  170. int Task::sys$spawn(const char* path, const char** args)
  171. {
  172. int error = 0;
  173. auto* child = Task::createUserTask(path, m_uid, m_gid, m_pid, error, args);
  174. if (child)
  175. return child->pid();
  176. return error;
  177. }
  178. Task* Task::createUserTask(const String& path, uid_t uid, gid_t gid, pid_t parentPID, int& error, const char** args)
  179. {
  180. auto parts = path.split('/');
  181. if (parts.isEmpty()) {
  182. error = -ENOENT;
  183. return nullptr;
  184. }
  185. RetainPtr<VirtualFileSystem::Node> cwd;
  186. {
  187. InterruptDisabler disabler;
  188. if (auto* parentTask = Task::fromPID(parentPID))
  189. cwd = parentTask->m_cwd.copyRef();
  190. }
  191. auto handle = VirtualFileSystem::the().open(path, cwd.ptr());
  192. if (!handle) {
  193. error = -ENOENT; // FIXME: Get a more detailed error from VFS.
  194. return nullptr;
  195. }
  196. auto elfData = handle->readEntireFile();
  197. if (!elfData) {
  198. error = -EIO; // FIXME: Get a more detailed error from VFS.
  199. return nullptr;
  200. }
  201. Vector<String> taskArguments;
  202. if (args) {
  203. for (size_t i = 0; args[i]; ++i) {
  204. taskArguments.append(args[i]);
  205. }
  206. } else {
  207. taskArguments.append(parts.last());
  208. }
  209. InterruptDisabler disabler; // FIXME: Get rid of this, jesus christ. This "critical" section is HUGE.
  210. Task* t = new Task(parts.takeLast(), uid, gid, parentPID, Ring3);
  211. t->m_arguments = move(taskArguments);
  212. ExecSpace space;
  213. space.hookableAlloc = [&] (const String& name, size_t size) {
  214. if (!size)
  215. return (void*)nullptr;
  216. size = ((size / 4096) + 1) * 4096;
  217. Region* region = t->allocateRegion(size, String(name));
  218. ASSERT(region);
  219. MemoryManager::the().mapRegion(*t, *region);
  220. return (void*)region->linearAddress.asPtr();
  221. };
  222. bool success = space.loadELF(move(elfData));
  223. if (!success) {
  224. // FIXME: This is ugly. If we need to do this, it should be at a different level.
  225. MemoryManager::the().unmapRegionsForTask(*t);
  226. MemoryManager::the().mapRegionsForTask(*current);
  227. delete t;
  228. kprintf("Failure loading ELF %s\n", path.characters());
  229. error = -ENOEXEC;
  230. return nullptr;
  231. }
  232. t->m_tss.eip = (dword)space.symbolPtr("_start");
  233. if (!t->m_tss.eip) {
  234. // FIXME: This is ugly. If we need to do this, it should be at a different level.
  235. MemoryManager::the().unmapRegionsForTask(*t);
  236. MemoryManager::the().mapRegionsForTask(*current);
  237. delete t;
  238. error = -ENOEXEC;
  239. return nullptr;
  240. }
  241. // FIXME: This is ugly. If we need to do this, it should be at a different level.
  242. MemoryManager::the().unmapRegionsForTask(*t);
  243. MemoryManager::the().mapRegionsForTask(*current);
  244. s_tasks->prepend(t);
  245. system.nprocess++;
  246. #ifdef TASK_DEBUG
  247. kprintf("Task %u (%s) spawned @ %p\n", t->pid(), t->name().characters(), t->m_tss.eip);
  248. #endif
  249. error = 0;
  250. return t;
  251. }
  252. int Task::sys$get_arguments(int* argc, char*** argv)
  253. {
  254. auto* region = allocateRegion(4096, "argv");
  255. if (!region)
  256. return -ENOMEM;
  257. MemoryManager::the().mapRegion(*this, *region);
  258. char* argpage = (char*)region->linearAddress.get();
  259. *argc = m_arguments.size();
  260. *argv = (char**)argpage;
  261. char* bufptr = argpage + (sizeof(char*) * m_arguments.size());
  262. for (size_t i = 0; i < m_arguments.size(); ++i) {
  263. (*argv)[i] = bufptr;
  264. memcpy(bufptr, m_arguments[i].characters(), m_arguments[i].length());
  265. bufptr += m_arguments[i].length();
  266. *(bufptr++) = '\0';
  267. }
  268. return 0;
  269. }
  270. Task* Task::createKernelTask(void (*e)(), String&& name)
  271. {
  272. Task* task = new Task(move(name), (uid_t)0, (gid_t)0, (pid_t)0, Ring0);
  273. task->m_tss.eip = (dword)e;
  274. if (task->pid() != 0) {
  275. InterruptDisabler disabler;
  276. s_tasks->prepend(task);
  277. system.nprocess++;
  278. #ifdef TASK_DEBUG
  279. kprintf("Kernel task %u (%s) spawned @ %p\n", task->pid(), task->name().characters(), task->m_tss.eip);
  280. #endif
  281. }
  282. return task;
  283. }
  284. Task::Task(String&& name, uid_t uid, gid_t gid, pid_t parentPID, RingLevel ring)
  285. : m_name(move(name))
  286. , m_pid(next_pid++)
  287. , m_uid(uid)
  288. , m_gid(gid)
  289. , m_state(Runnable)
  290. , m_ring(ring)
  291. , m_parentPID(parentPID)
  292. {
  293. m_fileHandles.append(nullptr); // stdin
  294. m_fileHandles.append(nullptr); // stdout
  295. m_fileHandles.append(nullptr); // stderr
  296. auto* parentTask = Task::fromPID(parentPID);
  297. if (parentTask)
  298. m_cwd = parentTask->m_cwd.copyRef();
  299. else
  300. m_cwd = nullptr;
  301. m_nextRegion = LinearAddress(0x600000);
  302. memset(&m_tss, 0, sizeof(m_tss));
  303. if (isRing3()) {
  304. memset(&m_ldtEntries, 0, sizeof(m_ldtEntries));
  305. allocateLDT();
  306. }
  307. // Only IF is set when a task boots.
  308. m_tss.eflags = 0x0202;
  309. word cs, ds, ss;
  310. if (isRing0()) {
  311. cs = 0x08;
  312. ds = 0x10;
  313. ss = 0x10;
  314. } else {
  315. cs = 0x1b;
  316. ds = 0x23;
  317. ss = 0x23;
  318. }
  319. m_tss.ds = ds;
  320. m_tss.es = ds;
  321. m_tss.fs = ds;
  322. m_tss.gs = ds;
  323. m_tss.ss = ss;
  324. m_tss.cs = cs;
  325. m_tss.cr3 = MemoryManager::the().pageDirectoryBase().get();
  326. if (isRing0()) {
  327. // FIXME: This memory is leaked.
  328. // But uh, there's also no kernel task termination, so I guess it's not technically leaked...
  329. dword stackBottom = (dword)kmalloc(defaultStackSize);
  330. m_stackTop = (stackBottom + defaultStackSize) & 0xffffff8;
  331. m_tss.esp = m_stackTop;
  332. } else {
  333. auto* region = allocateRegion(defaultStackSize, "stack");
  334. ASSERT(region);
  335. m_stackTop = region->linearAddress.offset(defaultStackSize).get() & 0xfffffff8;
  336. }
  337. m_tss.esp = m_stackTop;
  338. if (isRing3()) {
  339. // Ring3 tasks need a separate stack for Ring0.
  340. m_kernelStack = kmalloc(defaultStackSize);
  341. DWORD ring0StackTop = ((DWORD)m_kernelStack + defaultStackSize) & 0xffffff8;
  342. m_tss.ss0 = 0x10;
  343. m_tss.esp0 = ring0StackTop;
  344. }
  345. // HACK: Ring2 SS in the TSS is the current PID.
  346. m_tss.ss2 = m_pid;
  347. m_farPtr.offset = 0x98765432;
  348. ProcFileSystem::the().addProcess(*this);
  349. }
  350. Task::~Task()
  351. {
  352. InterruptDisabler disabler;
  353. ProcFileSystem::the().removeProcess(*this);
  354. system.nprocess--;
  355. delete [] m_ldtEntries;
  356. m_ldtEntries = nullptr;
  357. if (m_kernelStack) {
  358. kfree(m_kernelStack);
  359. m_kernelStack = nullptr;
  360. }
  361. }
  362. void Task::dumpRegions()
  363. {
  364. kprintf("Task %s(%u) regions:\n", name().characters(), pid());
  365. kprintf("BEGIN END SIZE NAME\n");
  366. for (auto& region : m_regions) {
  367. kprintf("%x -- %x %x %s\n",
  368. region->linearAddress.get(),
  369. region->linearAddress.offset(region->size - 1).get(),
  370. region->size,
  371. region->name.characters());
  372. }
  373. }
  374. void Task::sys$exit(int status)
  375. {
  376. cli();
  377. #ifdef TASK_DEBUG
  378. kprintf("sys$exit: %s(%u) exit with status %d\n", name().characters(), pid(), status);
  379. #endif
  380. setState(Exiting);
  381. MemoryManager::the().unmapRegionsForTask(*this);
  382. s_tasks->remove(this);
  383. if (!scheduleNewTask()) {
  384. kprintf("Task::taskDidCrash: Failed to schedule a new task :(\n");
  385. HANG;
  386. }
  387. s_deadTasks->append(this);
  388. switchNow();
  389. }
  390. void Task::taskDidCrash(Task* crashedTask)
  391. {
  392. ASSERT_INTERRUPTS_DISABLED();
  393. crashedTask->setState(Crashing);
  394. crashedTask->dumpRegions();
  395. s_tasks->remove(crashedTask);
  396. MemoryManager::the().unmapRegionsForTask(*crashedTask);
  397. if (!scheduleNewTask()) {
  398. kprintf("Task::taskDidCrash: Failed to schedule a new task :(\n");
  399. HANG;
  400. }
  401. s_deadTasks->append(crashedTask);
  402. switchNow();
  403. }
  404. void Task::doHouseKeeping()
  405. {
  406. InterruptDisabler disabler;
  407. if (s_deadTasks->isEmpty())
  408. return;
  409. Task* next = nullptr;
  410. for (auto* deadTask = s_deadTasks->head(); deadTask; deadTask = next) {
  411. next = deadTask->next();
  412. delete deadTask;
  413. }
  414. s_deadTasks->clear();
  415. }
  416. void yield()
  417. {
  418. if (!current) {
  419. kprintf( "PANIC: yield() with !current" );
  420. HANG;
  421. }
  422. //kprintf("%s<%u> yield()\n", current->name().characters(), current->pid());
  423. InterruptDisabler disabler;
  424. if (!scheduleNewTask())
  425. return;
  426. //kprintf("yield() jumping to new task: %x (%s)\n", current->farPtr().selector, current->name().characters());
  427. switchNow();
  428. }
  429. void switchNow()
  430. {
  431. Descriptor& descriptor = getGDTEntry(current->selector());
  432. descriptor.type = 9;
  433. flushGDT();
  434. asm("sti\n"
  435. "ljmp *(%%eax)\n"
  436. ::"a"(&current->farPtr())
  437. );
  438. }
  439. bool scheduleNewTask()
  440. {
  441. ASSERT_INTERRUPTS_DISABLED();
  442. if (!current) {
  443. // XXX: The first ever context_switch() goes to the idle task.
  444. // This to setup a reliable place we can return to.
  445. return contextSwitch(Task::kernelTask());
  446. }
  447. // Check and unblock tasks whose wait conditions have been met.
  448. for (auto* task = s_tasks->head(); task; task = task->next()) {
  449. if (task->state() == Task::BlockedSleep) {
  450. if (task->wakeupTime() <= system.uptime) {
  451. task->unblock();
  452. continue;
  453. }
  454. }
  455. if (task->state() == Task::BlockedWait) {
  456. if (!Task::fromPID(task->waitee())) {
  457. task->unblock();
  458. continue;
  459. }
  460. }
  461. if (task->state() == Task::BlockedRead) {
  462. ASSERT(task->m_fdBlockedOnRead != -1);
  463. if (task->m_fileHandles[task->m_fdBlockedOnRead]->hasDataAvailableForRead()) {
  464. task->unblock();
  465. continue;
  466. }
  467. }
  468. }
  469. #if 0
  470. kprintf("Scheduler choices:\n");
  471. for (auto* task = s_tasks->head(); task; task = task->next()) {
  472. if (task->state() == Task::BlockedWait || task->state() == Task::BlockedSleep)
  473. continue;
  474. kprintf("%w %s(%u)\n", task->state(), task->name().characters(), task->pid());
  475. }
  476. #endif
  477. auto* prevHead = s_tasks->head();
  478. for (;;) {
  479. // Move head to tail.
  480. s_tasks->append(s_tasks->removeHead());
  481. auto* task = s_tasks->head();
  482. if (task->state() == Task::Runnable || task->state() == Task::Running) {
  483. //kprintf("switch to %s (%p vs %p)\n", task->name().characters(), task, current);
  484. return contextSwitch(task);
  485. }
  486. if (task == prevHead) {
  487. // Back at task_head, nothing wants to run.
  488. kprintf("Nothing wants to run!\n");
  489. kprintf("PID OWNER STATE NSCHED NAME\n");
  490. for (auto* task = s_tasks->head(); task; task = task->next()) {
  491. kprintf("%w %w:%w %b %w %s\n",
  492. task->pid(),
  493. task->uid(),
  494. task->gid(),
  495. task->state(),
  496. task->timesScheduled(),
  497. task->name().characters());
  498. }
  499. kprintf("Switch to kernel task\n");
  500. return contextSwitch(Task::kernelTask());
  501. }
  502. }
  503. }
  504. static bool contextSwitch(Task* t)
  505. {
  506. //kprintf("c_s to %s (same:%u)\n", t->name().characters(), current == t);
  507. t->setTicksLeft(5);
  508. t->didSchedule();
  509. if (current == t)
  510. return false;
  511. // Some sanity checking to force a crash earlier.
  512. auto csRPL = t->tss().cs & 3;
  513. auto ssRPL = t->tss().ss & 3;
  514. if (csRPL != ssRPL) {
  515. kprintf("Fuckup! Switching from %s(%u) to %s(%u) has RPL mismatch\n",
  516. current->name().characters(), current->pid(),
  517. t->name().characters(), t->pid()
  518. );
  519. kprintf("code: %w:%x\n", t->tss().cs, t->tss().eip);
  520. kprintf(" stk: %w:%x\n", t->tss().ss, t->tss().esp);
  521. ASSERT(csRPL == ssRPL);
  522. }
  523. if (current) {
  524. // If the last task hasn't blocked (still marked as running),
  525. // mark it as runnable for the next round.
  526. if (current->state() == Task::Running)
  527. current->setState(Task::Runnable);
  528. bool success = MemoryManager::the().unmapRegionsForTask(*current);
  529. ASSERT(success);
  530. }
  531. bool success = MemoryManager::the().mapRegionsForTask(*t);
  532. ASSERT(success);
  533. current = t;
  534. t->setState(Task::Running);
  535. if (!t->selector())
  536. t->setSelector(allocateGDTEntry());
  537. auto& tssDescriptor = getGDTEntry(t->selector());
  538. tssDescriptor.limit_hi = 0;
  539. tssDescriptor.limit_lo = 0xFFFF;
  540. tssDescriptor.base_lo = (DWORD)(&t->tss()) & 0xFFFF;
  541. tssDescriptor.base_hi = ((DWORD)(&t->tss()) >> 16) & 0xFF;
  542. tssDescriptor.base_hi2 = ((DWORD)(&t->tss()) >> 24) & 0xFF;
  543. tssDescriptor.dpl = 0;
  544. tssDescriptor.segment_present = 1;
  545. tssDescriptor.granularity = 1;
  546. tssDescriptor.zero = 0;
  547. tssDescriptor.operation_size = 1;
  548. tssDescriptor.descriptor_type = 0;
  549. tssDescriptor.type = 11; // Busy TSS
  550. flushGDT();
  551. return true;
  552. }
  553. Task* Task::fromPID(pid_t pid)
  554. {
  555. ASSERT_INTERRUPTS_DISABLED();
  556. for (auto* task = s_tasks->head(); task; task = task->next()) {
  557. if (task->pid() == pid)
  558. return task;
  559. }
  560. return nullptr;
  561. }
  562. FileHandle* Task::fileHandleIfExists(int fd)
  563. {
  564. if (fd < 0)
  565. return nullptr;
  566. if ((unsigned)fd < m_fileHandles.size())
  567. return m_fileHandles[fd].ptr();
  568. return nullptr;
  569. }
  570. ssize_t Task::sys$get_dir_entries(int fd, void* buffer, size_t size)
  571. {
  572. auto* handle = fileHandleIfExists(fd);
  573. if (!handle)
  574. return -1;
  575. return handle->get_dir_entries((byte*)buffer, size);
  576. }
  577. int Task::sys$seek(int fd, int offset)
  578. {
  579. auto* handle = fileHandleIfExists(fd);
  580. if (!handle)
  581. return -1;
  582. return handle->seek(offset, SEEK_SET);
  583. }
  584. ssize_t Task::sys$read(int fd, void* outbuf, size_t nread)
  585. {
  586. Task::checkSanity("Task::sys$read");
  587. #ifdef DEBUG_IO
  588. kprintf("Task::sys$read: called(%d, %p, %u)\n", fd, outbuf, nread);
  589. #endif
  590. auto* handle = fileHandleIfExists(fd);
  591. #ifdef DEBUG_IO
  592. kprintf("Task::sys$read: handle=%p\n", handle);
  593. #endif
  594. if (!handle) {
  595. kprintf("Task::sys$read: handle not found :(\n");
  596. return -1;
  597. }
  598. #ifdef DEBUG_IO
  599. kprintf("call read on handle=%p\n", handle);
  600. #endif
  601. if (handle->isBlocking()) {
  602. if (!handle->hasDataAvailableForRead()) {
  603. m_fdBlockedOnRead = fd;
  604. block(BlockedRead);
  605. yield();
  606. }
  607. }
  608. nread = handle->read((byte*)outbuf, nread);
  609. #ifdef DEBUG_IO
  610. kprintf("Task::sys$read: nread=%u\n", nread);
  611. #endif
  612. return nread;
  613. }
  614. int Task::sys$close(int fd)
  615. {
  616. auto* handle = fileHandleIfExists(fd);
  617. if (!handle)
  618. return -1;
  619. // FIXME: Implement.
  620. return 0;
  621. }
  622. int Task::sys$lstat(const char* path, void* statbuf)
  623. {
  624. auto handle = VirtualFileSystem::the().open(move(path), m_cwd.ptr());
  625. if (!handle)
  626. return -1;
  627. handle->stat((Unix::stat*)statbuf);
  628. return 0;
  629. }
  630. int Task::sys$chdir(const char* path)
  631. {
  632. auto handle = VirtualFileSystem::the().open(path, m_cwd.ptr());
  633. if (!handle)
  634. return -ENOENT; // FIXME: More detailed error.
  635. if (!handle->isDirectory())
  636. return -ENOTDIR;
  637. m_cwd = handle->vnode();
  638. kprintf("m_cwd <- %p (%u)\n", m_cwd.ptr(), handle->vnode()->inode.index());
  639. return 0;
  640. }
  641. int Task::sys$getcwd(char* buffer, size_t size)
  642. {
  643. // FIXME: Implement!
  644. return -ENOTIMPL;
  645. }
  646. int Task::sys$open(const char* path, size_t pathLength)
  647. {
  648. #ifdef DEBUG_IO
  649. kprintf("Task::sys$open(): PID=%u, path=%s {%u}\n", m_pid, path, pathLength);
  650. #endif
  651. if (m_fileHandles.size() >= m_maxFileHandles)
  652. return -EMFILE;
  653. auto handle = VirtualFileSystem::the().open(String(path, pathLength), m_cwd.ptr());
  654. if (!handle)
  655. return -ENOENT; // FIXME: Detailed error.
  656. int fd = m_fileHandles.size();
  657. handle->setFD(fd);
  658. m_fileHandles.append(move(handle));
  659. return fd;
  660. }
  661. int Task::sys$uname(utsname* buf)
  662. {
  663. strcpy(buf->sysname, "Serenity");
  664. strcpy(buf->release, "1.0-dev");
  665. strcpy(buf->version, "FIXME");
  666. strcpy(buf->machine, "i386");
  667. strcpy(buf->nodename, getHostname().characters());
  668. return 0;
  669. }
  670. int Task::sys$kill(pid_t pid, int sig)
  671. {
  672. (void) sig;
  673. if (pid == 0) {
  674. // FIXME: Send to same-group processes.
  675. ASSERT(pid != 0);
  676. }
  677. if (pid == -1) {
  678. // FIXME: Send to all processes.
  679. ASSERT(pid != -1);
  680. }
  681. ASSERT_NOT_REACHED();
  682. Task* peer = Task::fromPID(pid);
  683. if (!peer) {
  684. // errno = ESRCH;
  685. return -1;
  686. }
  687. return -1;
  688. }
  689. int Task::sys$sleep(unsigned seconds)
  690. {
  691. if (!seconds)
  692. return 0;
  693. sleep(seconds * TICKS_PER_SECOND);
  694. return 0;
  695. }
  696. int Task::sys$gettimeofday(timeval* tv)
  697. {
  698. InterruptDisabler disabler;
  699. auto now = RTC::now();
  700. tv->tv_sec = now;
  701. tv->tv_usec = 0;
  702. return 0;
  703. }
  704. uid_t Task::sys$getuid()
  705. {
  706. return m_uid;
  707. }
  708. gid_t Task::sys$getgid()
  709. {
  710. return m_gid;
  711. }
  712. pid_t Task::sys$getpid()
  713. {
  714. return m_pid;
  715. }
  716. pid_t Task::sys$waitpid(pid_t waitee)
  717. {
  718. InterruptDisabler disabler;
  719. if (!Task::fromPID(waitee))
  720. return -1;
  721. m_waitee = waitee;
  722. block(BlockedWait);
  723. yield();
  724. return m_waitee;
  725. }
  726. void Task::unblock()
  727. {
  728. ASSERT(m_state != Task::Runnable && m_state != Task::Running);
  729. system.nblocked--;
  730. m_state = Task::Runnable;
  731. }
  732. void Task::block(Task::State state)
  733. {
  734. ASSERT(current->state() == Task::Running);
  735. system.nblocked++;
  736. current->setState(state);
  737. }
  738. void block(Task::State state)
  739. {
  740. current->block(state);
  741. yield();
  742. }
  743. void sleep(DWORD ticks)
  744. {
  745. ASSERT(current->state() == Task::Running);
  746. current->setWakeupTime(system.uptime + ticks);
  747. current->block(Task::BlockedSleep);
  748. yield();
  749. }
  750. Task* Task::kernelTask()
  751. {
  752. ASSERT(s_kernelTask);
  753. return s_kernelTask;
  754. }
  755. Task::Region::Region(LinearAddress a, size_t s, RetainPtr<Zone>&& z, String&& n)
  756. : linearAddress(a)
  757. , size(s)
  758. , zone(move(z))
  759. , name(move(n))
  760. {
  761. }
  762. Task::Region::~Region()
  763. {
  764. }