Task.cpp 30 KB

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