Task.cpp 27 KB

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