Task.cpp 26 KB

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