Ext2FileSystem.cpp 50 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562
  1. #include <AK/Bitmap.h>
  2. #include <AK/BufferStream.h>
  3. #include <AK/StdLibExtras.h>
  4. #include <Kernel/FileSystem/Ext2FileSystem.h>
  5. #include <Kernel/FileSystem/ext2_fs.h>
  6. #include <Kernel/Process.h>
  7. #include <Kernel/RTC.h>
  8. #include <Kernel/UnixTypes.h>
  9. #include <LibC/errno_numbers.h>
  10. //#define EXT2_DEBUG
  11. static const size_t max_block_size = 4096;
  12. static const ssize_t max_inline_symlink_length = 60;
  13. static u8 to_ext2_file_type(mode_t mode)
  14. {
  15. if (is_regular_file(mode))
  16. return EXT2_FT_REG_FILE;
  17. if (is_directory(mode))
  18. return EXT2_FT_DIR;
  19. if (is_character_device(mode))
  20. return EXT2_FT_CHRDEV;
  21. if (is_block_device(mode))
  22. return EXT2_FT_BLKDEV;
  23. if (is_fifo(mode))
  24. return EXT2_FT_FIFO;
  25. if (is_socket(mode))
  26. return EXT2_FT_SOCK;
  27. if (is_symlink(mode))
  28. return EXT2_FT_SYMLINK;
  29. return EXT2_FT_UNKNOWN;
  30. }
  31. NonnullRefPtr<Ext2FS> Ext2FS::create(NonnullRefPtr<DiskDevice> device)
  32. {
  33. return adopt(*new Ext2FS(move(device)));
  34. }
  35. Ext2FS::Ext2FS(NonnullRefPtr<DiskDevice>&& device)
  36. : DiskBackedFS(move(device))
  37. {
  38. }
  39. Ext2FS::~Ext2FS()
  40. {
  41. }
  42. bool Ext2FS::flush_super_block()
  43. {
  44. LOCKER(m_lock);
  45. bool success = device().write_blocks(2, 1, (const u8*)&m_super_block);
  46. ASSERT(success);
  47. return true;
  48. }
  49. unsigned Ext2FS::first_block_of_group(GroupIndex group_index) const
  50. {
  51. return super_block().s_first_data_block + (group_index * super_block().s_blocks_per_group);
  52. }
  53. const ext2_group_desc& Ext2FS::group_descriptor(GroupIndex group_index) const
  54. {
  55. // FIXME: Should this fail gracefully somehow?
  56. ASSERT(group_index <= m_block_group_count);
  57. if (!m_cached_group_descriptor_table) {
  58. LOCKER(m_lock);
  59. unsigned blocks_to_read = ceil_div(m_block_group_count * (unsigned)sizeof(ext2_group_desc), block_size());
  60. unsigned first_block_of_bgdt = block_size() == 1024 ? 2 : 1;
  61. #ifdef EXT2_DEBUG
  62. kprintf("ext2fs: block group count: %u, blocks-to-read: %u\n", m_block_group_count, blocks_to_read);
  63. kprintf("ext2fs: first block of BGDT: %u\n", first_block_of_bgdt);
  64. #endif
  65. m_cached_group_descriptor_table = ByteBuffer::create_uninitialized(block_size() * blocks_to_read);
  66. read_blocks(first_block_of_bgdt, blocks_to_read, m_cached_group_descriptor_table.data());
  67. }
  68. return reinterpret_cast<ext2_group_desc*>(m_cached_group_descriptor_table.data())[group_index - 1];
  69. }
  70. bool Ext2FS::initialize()
  71. {
  72. bool success = const_cast<DiskDevice&>(device()).read_blocks(2, 1, (u8*)&m_super_block);
  73. ASSERT(success);
  74. auto& super_block = this->super_block();
  75. #ifdef EXT2_DEBUG
  76. kprintf("ext2fs: super block magic: %x (super block size: %u)\n", super_block.s_magic, sizeof(ext2_super_block));
  77. #endif
  78. if (super_block.s_magic != EXT2_SUPER_MAGIC)
  79. return false;
  80. #ifdef EXT2_DEBUG
  81. kprintf("ext2fs: %u inodes, %u blocks\n", super_block.s_inodes_count, super_block.s_blocks_count);
  82. kprintf("ext2fs: block size = %u\n", EXT2_BLOCK_SIZE(&super_block));
  83. kprintf("ext2fs: first data block = %u\n", super_block.s_first_data_block);
  84. kprintf("ext2fs: inodes per block = %u\n", inodes_per_block());
  85. kprintf("ext2fs: inodes per group = %u\n", inodes_per_group());
  86. kprintf("ext2fs: free inodes = %u\n", super_block.s_free_inodes_count);
  87. kprintf("ext2fs: desc per block = %u\n", EXT2_DESC_PER_BLOCK(&super_block));
  88. kprintf("ext2fs: desc size = %u\n", EXT2_DESC_SIZE(&super_block));
  89. #endif
  90. set_block_size(EXT2_BLOCK_SIZE(&super_block));
  91. ASSERT(block_size() <= (int)max_block_size);
  92. m_block_group_count = ceil_div(super_block.s_blocks_count, super_block.s_blocks_per_group);
  93. if (m_block_group_count == 0) {
  94. kprintf("ext2fs: no block groups :(\n");
  95. return false;
  96. }
  97. // Preheat the BGD cache.
  98. group_descriptor(0);
  99. #ifdef EXT2_DEBUG
  100. for (unsigned i = 1; i <= m_block_group_count; ++i) {
  101. auto& group = group_descriptor(i);
  102. kprintf("ext2fs: group[%u] { block_bitmap: %u, inode_bitmap: %u, inode_table: %u }\n",
  103. i,
  104. group.bg_block_bitmap,
  105. group.bg_inode_bitmap,
  106. group.bg_inode_table);
  107. }
  108. #endif
  109. return true;
  110. }
  111. const char* Ext2FS::class_name() const
  112. {
  113. return "Ext2FS";
  114. }
  115. InodeIdentifier Ext2FS::root_inode() const
  116. {
  117. return { fsid(), EXT2_ROOT_INO };
  118. }
  119. bool Ext2FS::read_block_containing_inode(unsigned inode, unsigned& block_index, unsigned& offset, u8* buffer) const
  120. {
  121. LOCKER(m_lock);
  122. auto& super_block = this->super_block();
  123. if (inode != EXT2_ROOT_INO && inode < EXT2_FIRST_INO(&super_block))
  124. return false;
  125. if (inode > super_block.s_inodes_count)
  126. return false;
  127. auto& bgd = group_descriptor(group_index_from_inode(inode));
  128. offset = ((inode - 1) % inodes_per_group()) * inode_size();
  129. block_index = bgd.bg_inode_table + (offset >> EXT2_BLOCK_SIZE_BITS(&super_block));
  130. offset &= block_size() - 1;
  131. return read_block(block_index, buffer);
  132. }
  133. Ext2FS::BlockListShape Ext2FS::compute_block_list_shape(unsigned blocks)
  134. {
  135. BlockListShape shape;
  136. const unsigned entries_per_block = EXT2_ADDR_PER_BLOCK(&super_block());
  137. unsigned blocks_remaining = blocks;
  138. shape.direct_blocks = min((unsigned)EXT2_NDIR_BLOCKS, blocks_remaining);
  139. blocks_remaining -= shape.direct_blocks;
  140. if (!blocks_remaining)
  141. return shape;
  142. shape.indirect_blocks = min(blocks_remaining, entries_per_block);
  143. blocks_remaining -= shape.indirect_blocks;
  144. shape.meta_blocks += 1;
  145. if (!blocks_remaining)
  146. return shape;
  147. shape.doubly_indirect_blocks = min(blocks_remaining, entries_per_block * entries_per_block);
  148. blocks_remaining -= shape.doubly_indirect_blocks;
  149. shape.meta_blocks += 1;
  150. shape.meta_blocks += shape.doubly_indirect_blocks / entries_per_block;
  151. if ((shape.doubly_indirect_blocks % entries_per_block) != 0)
  152. shape.meta_blocks += 1;
  153. if (!blocks_remaining)
  154. return shape;
  155. dbg() << "we don't know how to compute tind ext2fs blocks yet!";
  156. ASSERT_NOT_REACHED();
  157. shape.triply_indirect_blocks = min(blocks_remaining, entries_per_block * entries_per_block * entries_per_block);
  158. blocks_remaining -= shape.triply_indirect_blocks;
  159. if (!blocks_remaining)
  160. return shape;
  161. ASSERT_NOT_REACHED();
  162. return {};
  163. }
  164. bool Ext2FS::write_block_list_for_inode(InodeIndex inode_index, ext2_inode& e2inode, const Vector<BlockIndex>& blocks)
  165. {
  166. LOCKER(m_lock);
  167. // NOTE: There is a mismatch between i_blocks and blocks.size() since i_blocks includes meta blocks and blocks.size() does not.
  168. auto old_block_count = ceil_div(e2inode.i_size, block_size());
  169. auto old_shape = compute_block_list_shape(old_block_count);
  170. auto new_shape = compute_block_list_shape(blocks.size());
  171. Vector<BlockIndex> new_meta_blocks;
  172. if (new_shape.meta_blocks > old_shape.meta_blocks) {
  173. new_meta_blocks = allocate_blocks(group_index_from_inode(inode_index), new_shape.meta_blocks - old_shape.meta_blocks);
  174. }
  175. e2inode.i_blocks = (blocks.size() + new_shape.meta_blocks) * (block_size() / 512);
  176. bool inode_dirty = false;
  177. unsigned output_block_index = 0;
  178. unsigned remaining_blocks = blocks.size();
  179. for (unsigned i = 0; i < new_shape.direct_blocks; ++i) {
  180. if (e2inode.i_block[i] != blocks[output_block_index])
  181. inode_dirty = true;
  182. e2inode.i_block[i] = blocks[output_block_index];
  183. ++output_block_index;
  184. --remaining_blocks;
  185. }
  186. if (inode_dirty) {
  187. #ifdef EXT2_DEBUG
  188. dbgprintf("Ext2FS: Writing %u direct block(s) to i_block array of inode %u\n", min(EXT2_NDIR_BLOCKS, blocks.size()), inode_index);
  189. for (int i = 0; i < min(EXT2_NDIR_BLOCKS, blocks.size()); ++i)
  190. dbgprintf(" + %u\n", blocks[i]);
  191. #endif
  192. write_ext2_inode(inode_index, e2inode);
  193. inode_dirty = false;
  194. }
  195. if (!remaining_blocks)
  196. return true;
  197. const unsigned entries_per_block = EXT2_ADDR_PER_BLOCK(&super_block());
  198. bool ind_block_new = !e2inode.i_block[EXT2_IND_BLOCK];
  199. if (ind_block_new) {
  200. BlockIndex new_indirect_block = new_meta_blocks.take_last();
  201. if (e2inode.i_block[EXT2_IND_BLOCK] != new_indirect_block)
  202. inode_dirty = true;
  203. e2inode.i_block[EXT2_IND_BLOCK] = new_indirect_block;
  204. if (inode_dirty) {
  205. #ifdef EXT2_DEBUG
  206. dbgprintf("Ext2FS: Adding the indirect block to i_block array of inode %u\n", inode_index);
  207. #endif
  208. write_ext2_inode(inode_index, e2inode);
  209. inode_dirty = false;
  210. }
  211. }
  212. if (old_shape.indirect_blocks == new_shape.indirect_blocks) {
  213. // No need to update the singly indirect block array.
  214. remaining_blocks -= new_shape.indirect_blocks;
  215. output_block_index += new_shape.indirect_blocks;
  216. } else {
  217. auto block_contents = ByteBuffer::create_uninitialized(block_size());
  218. BufferStream stream(block_contents);
  219. ASSERT(new_shape.indirect_blocks <= entries_per_block);
  220. for (unsigned i = 0; i < new_shape.indirect_blocks; ++i) {
  221. stream << blocks[output_block_index++];
  222. --remaining_blocks;
  223. }
  224. stream.fill_to_end(0);
  225. bool success = write_block(e2inode.i_block[EXT2_IND_BLOCK], block_contents.data());
  226. ASSERT(success);
  227. }
  228. if (!remaining_blocks)
  229. return true;
  230. bool dind_block_dirty = false;
  231. bool dind_block_new = !e2inode.i_block[EXT2_DIND_BLOCK];
  232. if (dind_block_new) {
  233. BlockIndex new_dindirect_block = new_meta_blocks.take_last();
  234. if (e2inode.i_block[EXT2_DIND_BLOCK] != new_dindirect_block)
  235. inode_dirty = true;
  236. e2inode.i_block[EXT2_DIND_BLOCK] = new_dindirect_block;
  237. if (inode_dirty) {
  238. #ifdef EXT2_DEBUG
  239. dbgprintf("Ext2FS: Adding the doubly-indirect block to i_block array of inode %u\n", inode_index);
  240. #endif
  241. write_ext2_inode(inode_index, e2inode);
  242. inode_dirty = false;
  243. }
  244. }
  245. if (old_shape.doubly_indirect_blocks == new_shape.doubly_indirect_blocks) {
  246. // No need to update the doubly indirect block data.
  247. remaining_blocks -= new_shape.doubly_indirect_blocks;
  248. output_block_index += new_shape.doubly_indirect_blocks;
  249. } else {
  250. unsigned indirect_block_count = new_shape.doubly_indirect_blocks / entries_per_block;
  251. if ((new_shape.doubly_indirect_blocks % entries_per_block) != 0)
  252. indirect_block_count++;
  253. auto dind_block_contents = ByteBuffer::create_uninitialized(block_size());
  254. read_block(e2inode.i_block[EXT2_DIND_BLOCK], dind_block_contents.data());
  255. if (dind_block_new) {
  256. memset(dind_block_contents.data(), 0, dind_block_contents.size());
  257. dind_block_dirty = true;
  258. }
  259. auto* dind_block_as_pointers = (unsigned*)dind_block_contents.data();
  260. ASSERT(indirect_block_count <= entries_per_block);
  261. for (unsigned i = 0; i < indirect_block_count; ++i) {
  262. bool ind_block_dirty = false;
  263. BlockIndex indirect_block_index = dind_block_as_pointers[i];
  264. bool ind_block_new = !indirect_block_index;
  265. if (ind_block_new) {
  266. indirect_block_index = new_meta_blocks.take_last();
  267. dind_block_as_pointers[i] = indirect_block_index;
  268. dind_block_dirty = true;
  269. }
  270. auto ind_block_contents = ByteBuffer::create_uninitialized(block_size());
  271. read_block(indirect_block_index, ind_block_contents.data());
  272. if (ind_block_new) {
  273. memset(ind_block_contents.data(), 0, dind_block_contents.size());
  274. ind_block_dirty = true;
  275. }
  276. auto* ind_block_as_pointers = (unsigned*)ind_block_contents.data();
  277. unsigned entries_to_write = new_shape.doubly_indirect_blocks - (i * entries_per_block);
  278. if (entries_to_write > entries_per_block)
  279. entries_to_write = entries_per_block;
  280. ASSERT(entries_to_write <= entries_per_block);
  281. for (unsigned j = 0; j < entries_to_write; ++j) {
  282. BlockIndex output_block = blocks[output_block_index++];
  283. if (ind_block_as_pointers[j] != output_block) {
  284. ind_block_as_pointers[j] = output_block;
  285. ind_block_dirty = true;
  286. }
  287. --remaining_blocks;
  288. }
  289. for (unsigned j = entries_to_write; j < entries_per_block; ++j) {
  290. if (ind_block_as_pointers[j] != 0) {
  291. ind_block_as_pointers[j] = 0;
  292. ind_block_dirty = true;
  293. }
  294. }
  295. if (ind_block_dirty) {
  296. bool success = write_block(indirect_block_index, ind_block_contents.data());
  297. ASSERT(success);
  298. }
  299. }
  300. for (unsigned i = indirect_block_count; i < entries_per_block; ++i) {
  301. if (dind_block_as_pointers[i] != 0) {
  302. dind_block_as_pointers[i] = 0;
  303. dind_block_dirty = true;
  304. }
  305. }
  306. if (dind_block_dirty) {
  307. bool success = write_block(e2inode.i_block[EXT2_DIND_BLOCK], dind_block_contents.data());
  308. ASSERT(success);
  309. }
  310. }
  311. if (!remaining_blocks)
  312. return true;
  313. // FIXME: Implement!
  314. dbg() << "we don't know how to write tind ext2fs blocks yet!";
  315. ASSERT_NOT_REACHED();
  316. }
  317. Vector<Ext2FS::BlockIndex> Ext2FS::block_list_for_inode(const ext2_inode& e2inode, bool include_block_list_blocks) const
  318. {
  319. LOCKER(m_lock);
  320. unsigned entries_per_block = EXT2_ADDR_PER_BLOCK(&super_block());
  321. // NOTE: i_blocks is number of 512-byte blocks, not number of fs-blocks.
  322. unsigned block_count = e2inode.i_blocks / (block_size() / 512);
  323. #ifdef EXT2_DEBUG
  324. dbgprintf("Ext2FS::block_list_for_inode(): i_size=%u, i_blocks=%u, block_count=%u\n", e2inode.i_size, block_count);
  325. #endif
  326. unsigned blocks_remaining = block_count;
  327. Vector<BlockIndex> list;
  328. if (include_block_list_blocks) {
  329. // This seems like an excessive over-estimate but w/e.
  330. list.ensure_capacity(blocks_remaining * 2);
  331. } else {
  332. list.ensure_capacity(blocks_remaining);
  333. }
  334. unsigned direct_count = min(block_count, (unsigned)EXT2_NDIR_BLOCKS);
  335. for (unsigned i = 0; i < direct_count; ++i) {
  336. auto block_index = e2inode.i_block[i];
  337. if (!block_index)
  338. return list;
  339. list.unchecked_append(block_index);
  340. --blocks_remaining;
  341. }
  342. if (!blocks_remaining)
  343. return list;
  344. auto process_block_array = [&](unsigned array_block_index, auto&& callback) {
  345. if (include_block_list_blocks)
  346. callback(array_block_index);
  347. auto array_block = ByteBuffer::create_uninitialized(block_size());
  348. read_block(array_block_index, array_block.data());
  349. ASSERT(array_block);
  350. auto* array = reinterpret_cast<const __u32*>(array_block.data());
  351. unsigned count = min(blocks_remaining, entries_per_block);
  352. for (unsigned i = 0; i < count; ++i) {
  353. if (!array[i]) {
  354. blocks_remaining = 0;
  355. return;
  356. }
  357. callback(array[i]);
  358. --blocks_remaining;
  359. }
  360. };
  361. process_block_array(e2inode.i_block[EXT2_IND_BLOCK], [&](unsigned entry) {
  362. list.unchecked_append(entry);
  363. });
  364. if (!blocks_remaining)
  365. return list;
  366. process_block_array(e2inode.i_block[EXT2_DIND_BLOCK], [&](unsigned entry) {
  367. process_block_array(entry, [&](unsigned entry) {
  368. list.unchecked_append(entry);
  369. });
  370. });
  371. if (!blocks_remaining)
  372. return list;
  373. process_block_array(e2inode.i_block[EXT2_TIND_BLOCK], [&](unsigned entry) {
  374. process_block_array(entry, [&](unsigned entry) {
  375. process_block_array(entry, [&](unsigned entry) {
  376. list.unchecked_append(entry);
  377. });
  378. });
  379. });
  380. return list;
  381. }
  382. void Ext2FS::free_inode(Ext2FSInode& inode)
  383. {
  384. LOCKER(m_lock);
  385. ASSERT(inode.m_raw_inode.i_links_count == 0);
  386. #ifdef EXT2_DEBUG
  387. dbgprintf("Ext2FS: inode %u has no more links, time to delete!\n", inode.index());
  388. #endif
  389. struct timeval now;
  390. kgettimeofday(now);
  391. inode.m_raw_inode.i_dtime = now.tv_sec;
  392. write_ext2_inode(inode.index(), inode.m_raw_inode);
  393. auto block_list = block_list_for_inode(inode.m_raw_inode, true);
  394. for (auto block_index : block_list)
  395. set_block_allocation_state(block_index, false);
  396. set_inode_allocation_state(inode.index(), false);
  397. if (inode.is_directory()) {
  398. auto& bgd = const_cast<ext2_group_desc&>(group_descriptor(group_index_from_inode(inode.index())));
  399. --bgd.bg_used_dirs_count;
  400. dbgprintf("Ext2FS: decremented bg_used_dirs_count %u -> %u\n", bgd.bg_used_dirs_count - 1, bgd.bg_used_dirs_count);
  401. m_block_group_descriptors_dirty = true;
  402. }
  403. }
  404. void Ext2FS::flush_block_group_descriptor_table()
  405. {
  406. LOCKER(m_lock);
  407. unsigned blocks_to_write = ceil_div(m_block_group_count * (unsigned)sizeof(ext2_group_desc), block_size());
  408. unsigned first_block_of_bgdt = block_size() == 1024 ? 2 : 1;
  409. write_blocks(first_block_of_bgdt, blocks_to_write, m_cached_group_descriptor_table.data());
  410. }
  411. void Ext2FS::flush_writes()
  412. {
  413. if (m_super_block_dirty) {
  414. flush_super_block();
  415. m_super_block_dirty = false;
  416. }
  417. if (m_block_group_descriptors_dirty) {
  418. flush_block_group_descriptor_table();
  419. m_block_group_descriptors_dirty = false;
  420. }
  421. for (auto& cached_bitmap : m_cached_bitmaps) {
  422. if (cached_bitmap->dirty) {
  423. write_block(cached_bitmap->bitmap_block_index, cached_bitmap->buffer.data());
  424. cached_bitmap->dirty = false;
  425. #ifdef EXT2_DEBUG
  426. dbg() << "Flushed bitmap block " << cached_bitmap->bitmap_block_index;
  427. #endif
  428. }
  429. }
  430. DiskBackedFS::flush_writes();
  431. }
  432. Ext2FSInode::Ext2FSInode(Ext2FS& fs, unsigned index)
  433. : Inode(fs, index)
  434. {
  435. }
  436. Ext2FSInode::~Ext2FSInode()
  437. {
  438. if (m_raw_inode.i_links_count == 0)
  439. fs().free_inode(*this);
  440. }
  441. InodeMetadata Ext2FSInode::metadata() const
  442. {
  443. // FIXME: This should probably take the inode lock, no?
  444. InodeMetadata metadata;
  445. metadata.inode = identifier();
  446. metadata.size = m_raw_inode.i_size;
  447. metadata.mode = m_raw_inode.i_mode;
  448. metadata.uid = m_raw_inode.i_uid;
  449. metadata.gid = m_raw_inode.i_gid;
  450. metadata.link_count = m_raw_inode.i_links_count;
  451. metadata.atime = m_raw_inode.i_atime;
  452. metadata.ctime = m_raw_inode.i_ctime;
  453. metadata.mtime = m_raw_inode.i_mtime;
  454. metadata.dtime = m_raw_inode.i_dtime;
  455. metadata.block_size = fs().block_size();
  456. metadata.block_count = m_raw_inode.i_blocks;
  457. if (::is_character_device(m_raw_inode.i_mode) || ::is_block_device(m_raw_inode.i_mode)) {
  458. unsigned dev = m_raw_inode.i_block[0];
  459. if (!dev)
  460. dev = m_raw_inode.i_block[1];
  461. metadata.major_device = (dev & 0xfff00) >> 8;
  462. metadata.minor_device = (dev & 0xff) | ((dev >> 12) & 0xfff00);
  463. }
  464. return metadata;
  465. }
  466. void Ext2FSInode::flush_metadata()
  467. {
  468. LOCKER(m_lock);
  469. #ifdef EXT2_DEBUG
  470. dbgprintf("Ext2FSInode: flush_metadata for inode %u\n", index());
  471. #endif
  472. fs().write_ext2_inode(index(), m_raw_inode);
  473. if (is_directory()) {
  474. // Unless we're about to go away permanently, invalidate the lookup cache.
  475. if (m_raw_inode.i_links_count != 0) {
  476. // FIXME: This invalidation is way too hardcore. It's sad to throw away the whole cache.
  477. m_lookup_cache.clear();
  478. }
  479. }
  480. set_metadata_dirty(false);
  481. }
  482. RefPtr<Inode> Ext2FS::get_inode(InodeIdentifier inode) const
  483. {
  484. LOCKER(m_lock);
  485. ASSERT(inode.fsid() == fsid());
  486. {
  487. auto it = m_inode_cache.find(inode.index());
  488. if (it != m_inode_cache.end())
  489. return (*it).value;
  490. }
  491. if (!get_inode_allocation_state(inode.index())) {
  492. m_inode_cache.set(inode.index(), nullptr);
  493. return nullptr;
  494. }
  495. unsigned block_index;
  496. unsigned offset;
  497. u8 block[max_block_size];
  498. if (!read_block_containing_inode(inode.index(), block_index, offset, block))
  499. return {};
  500. auto it = m_inode_cache.find(inode.index());
  501. if (it != m_inode_cache.end())
  502. return (*it).value;
  503. auto new_inode = adopt(*new Ext2FSInode(const_cast<Ext2FS&>(*this), inode.index()));
  504. memcpy(&new_inode->m_raw_inode, reinterpret_cast<ext2_inode*>(block + offset), sizeof(ext2_inode));
  505. m_inode_cache.set(inode.index(), new_inode);
  506. return new_inode;
  507. }
  508. ssize_t Ext2FSInode::read_bytes(off_t offset, ssize_t count, u8* buffer, FileDescription*) const
  509. {
  510. Locker inode_locker(m_lock);
  511. ASSERT(offset >= 0);
  512. if (m_raw_inode.i_size == 0)
  513. return 0;
  514. // Symbolic links shorter than 60 characters are store inline inside the i_block array.
  515. // This avoids wasting an entire block on short links. (Most links are short.)
  516. if (is_symlink() && size() < max_inline_symlink_length) {
  517. ssize_t nread = min((off_t)size() - offset, static_cast<off_t>(count));
  518. memcpy(buffer, ((const u8*)m_raw_inode.i_block) + offset, (size_t)nread);
  519. return nread;
  520. }
  521. Locker fs_locker(fs().m_lock);
  522. if (m_block_list.is_empty()) {
  523. auto block_list = fs().block_list_for_inode(m_raw_inode);
  524. if (m_block_list.size() != block_list.size())
  525. m_block_list = move(block_list);
  526. }
  527. if (m_block_list.is_empty()) {
  528. kprintf("ext2fs: read_bytes: empty block list for inode %u\n", index());
  529. return -EIO;
  530. }
  531. const int block_size = fs().block_size();
  532. int first_block_logical_index = offset / block_size;
  533. int last_block_logical_index = (offset + count) / block_size;
  534. if (last_block_logical_index >= m_block_list.size())
  535. last_block_logical_index = m_block_list.size() - 1;
  536. int offset_into_first_block = offset % block_size;
  537. ssize_t nread = 0;
  538. int remaining_count = min((off_t)count, (off_t)size() - offset);
  539. u8* out = buffer;
  540. #ifdef EXT2_DEBUG
  541. kprintf("Ext2FS: Reading up to %u bytes %d bytes into inode %u:%u to %p\n", count, offset, identifier().fsid(), identifier().index(), buffer);
  542. //kprintf("ok let's do it, read(%u, %u) -> blocks %u thru %u, oifb: %u\n", offset, count, first_block_logical_index, last_block_logical_index, offset_into_first_block);
  543. #endif
  544. u8 block[max_block_size];
  545. for (int bi = first_block_logical_index; remaining_count && bi <= last_block_logical_index; ++bi) {
  546. bool success = fs().read_block(m_block_list[bi], block);
  547. if (!success) {
  548. kprintf("ext2fs: read_bytes: read_block(%u) failed (lbi: %u)\n", m_block_list[bi], bi);
  549. return -EIO;
  550. }
  551. int offset_into_block = (bi == first_block_logical_index) ? offset_into_first_block : 0;
  552. int num_bytes_to_copy = min(block_size - offset_into_block, remaining_count);
  553. memcpy(out, block + offset_into_block, num_bytes_to_copy);
  554. remaining_count -= num_bytes_to_copy;
  555. nread += num_bytes_to_copy;
  556. out += num_bytes_to_copy;
  557. }
  558. return nread;
  559. }
  560. bool Ext2FSInode::resize(u64 new_size)
  561. {
  562. u64 block_size = fs().block_size();
  563. u64 old_size = size();
  564. int blocks_needed_before = ceil_div(old_size, block_size);
  565. int blocks_needed_after = ceil_div(new_size, block_size);
  566. #ifdef EXT2_DEBUG
  567. dbgprintf("Ext2FSInode::resize(): blocks needed before (size was %Q): %d\n", old_size, blocks_needed_before);
  568. dbgprintf("Ext2FSInode::resize(): blocks needed after (size is %Q): %d\n", new_size, blocks_needed_after);
  569. #endif
  570. auto block_list = fs().block_list_for_inode(m_raw_inode);
  571. if (blocks_needed_after > blocks_needed_before) {
  572. auto new_blocks = fs().allocate_blocks(fs().group_index_from_inode(index()), blocks_needed_after - blocks_needed_before);
  573. block_list.append(move(new_blocks));
  574. } else if (blocks_needed_after < blocks_needed_before) {
  575. #ifdef EXT2_DEBUG
  576. dbgprintf("Ext2FSInode::resize(): Shrinking. Old block list is %d entries:\n", block_list.size());
  577. for (auto block_index : block_list) {
  578. dbgprintf(" # %u\n", block_index);
  579. }
  580. #endif
  581. while (block_list.size() != blocks_needed_after) {
  582. auto block_index = block_list.take_last();
  583. fs().set_block_allocation_state(block_index, false);
  584. }
  585. }
  586. bool success = fs().write_block_list_for_inode(index(), m_raw_inode, block_list);
  587. if (!success)
  588. return false;
  589. m_raw_inode.i_size = new_size;
  590. set_metadata_dirty(true);
  591. m_block_list = move(block_list);
  592. return true;
  593. }
  594. ssize_t Ext2FSInode::write_bytes(off_t offset, ssize_t count, const u8* data, FileDescription*)
  595. {
  596. ASSERT(offset >= 0);
  597. ASSERT(count >= 0);
  598. Locker inode_locker(m_lock);
  599. Locker fs_locker(fs().m_lock);
  600. if (is_symlink()) {
  601. if ((offset + count) < max_inline_symlink_length) {
  602. #ifdef EXT2_DEBUG
  603. dbgprintf("Ext2FSInode: write_bytes poking into i_block array for inline symlink '%s' (%u bytes)\n", String((const char*)data, count).characters(), count);
  604. #endif
  605. memcpy(((u8*)m_raw_inode.i_block) + offset, data, (size_t)count);
  606. if ((offset + count) > (off_t)m_raw_inode.i_size)
  607. m_raw_inode.i_size = offset + count;
  608. set_metadata_dirty(true);
  609. return count;
  610. }
  611. }
  612. const ssize_t block_size = fs().block_size();
  613. u64 old_size = size();
  614. u64 new_size = max(static_cast<u64>(offset) + count, (u64)size());
  615. if (!resize(new_size))
  616. return -EIO;
  617. int first_block_logical_index = offset / block_size;
  618. int last_block_logical_index = (offset + count) / block_size;
  619. if (last_block_logical_index >= m_block_list.size())
  620. last_block_logical_index = m_block_list.size() - 1;
  621. int offset_into_first_block = offset % block_size;
  622. int last_logical_block_index_in_file = new_size / block_size;
  623. ssize_t nwritten = 0;
  624. int remaining_count = min((off_t)count, (off_t)new_size - offset);
  625. const u8* in = data;
  626. #ifdef EXT2_DEBUG
  627. dbgprintf("Ext2FSInode::write_bytes: Writing %u bytes %d bytes into inode %u:%u from %p\n", count, offset, fsid(), index(), data);
  628. #endif
  629. auto buffer_block = ByteBuffer::create_uninitialized(block_size);
  630. for (int bi = first_block_logical_index; remaining_count && bi <= last_block_logical_index; ++bi) {
  631. int offset_into_block = (bi == first_block_logical_index) ? offset_into_first_block : 0;
  632. int num_bytes_to_copy = min(block_size - offset_into_block, remaining_count);
  633. ByteBuffer block;
  634. if (offset_into_block != 0 || num_bytes_to_copy != block_size) {
  635. block = ByteBuffer::create_uninitialized(block_size);
  636. bool success = fs().read_block(m_block_list[bi], block.data());
  637. if (!success) {
  638. kprintf("Ext2FSInode::write_bytes: read_block(%u) failed (lbi: %u)\n", m_block_list[bi], bi);
  639. return -EIO;
  640. }
  641. } else
  642. block = buffer_block;
  643. memcpy(block.data() + offset_into_block, in, num_bytes_to_copy);
  644. if (bi == last_logical_block_index_in_file && num_bytes_to_copy < block_size) {
  645. int padding_start = new_size % block_size;
  646. int padding_bytes = block_size - padding_start;
  647. #ifdef EXT2_DEBUG
  648. dbgprintf("Ext2FSInode::write_bytes padding last block of file with zero x %u (new_size=%u, offset_into_block=%u, num_bytes_to_copy=%u)\n", padding_bytes, new_size, offset_into_block, num_bytes_to_copy);
  649. #endif
  650. memset(block.data() + padding_start, 0, padding_bytes);
  651. }
  652. #ifdef EXT2_DEBUG
  653. dbgprintf("Ext2FSInode::write_bytes: writing block %u (offset_into_block: %u)\n", m_block_list[bi], offset_into_block);
  654. #endif
  655. bool success = fs().write_block(m_block_list[bi], block.data());
  656. if (!success) {
  657. kprintf("Ext2FSInode::write_bytes: write_block(%u) failed (lbi: %u)\n", m_block_list[bi], bi);
  658. ASSERT_NOT_REACHED();
  659. return -EIO;
  660. }
  661. remaining_count -= num_bytes_to_copy;
  662. nwritten += num_bytes_to_copy;
  663. in += num_bytes_to_copy;
  664. }
  665. #ifdef EXT2_DEBUG
  666. dbgprintf("Ext2FSInode::write_bytes: after write, i_size=%u, i_blocks=%u (%u blocks in list)\n", m_raw_inode.i_size, m_raw_inode.i_blocks, m_block_list.size());
  667. #endif
  668. if (old_size != new_size)
  669. inode_size_changed(old_size, new_size);
  670. inode_contents_changed(offset, count, data);
  671. return nwritten;
  672. }
  673. bool Ext2FSInode::traverse_as_directory(Function<bool(const FS::DirectoryEntry&)> callback) const
  674. {
  675. LOCKER(m_lock);
  676. ASSERT(is_directory());
  677. #ifdef EXT2_DEBUG
  678. kprintf("Ext2Inode::traverse_as_directory: inode=%u:\n", index());
  679. #endif
  680. auto buffer = read_entire();
  681. ASSERT(buffer);
  682. auto* entry = reinterpret_cast<ext2_dir_entry_2*>(buffer.data());
  683. while (entry < buffer.end_pointer()) {
  684. if (entry->inode != 0) {
  685. #ifdef EXT2_DEBUG
  686. kprintf("Ext2Inode::traverse_as_directory: %u, name_len: %u, rec_len: %u, file_type: %u, name: %s\n", entry->inode, entry->name_len, entry->rec_len, entry->file_type, String(entry->name, entry->name_len).characters());
  687. #endif
  688. if (!callback({ entry->name, entry->name_len, { fsid(), entry->inode }, entry->file_type }))
  689. break;
  690. }
  691. entry = (ext2_dir_entry_2*)((char*)entry + entry->rec_len);
  692. }
  693. return true;
  694. }
  695. bool Ext2FSInode::write_directory(const Vector<FS::DirectoryEntry>& entries)
  696. {
  697. LOCKER(m_lock);
  698. #ifdef EXT2_DEBUG
  699. dbgprintf("Ext2FS: New directory inode %u contents to write:\n", index());
  700. #endif
  701. int directory_size = 0;
  702. for (auto& entry : entries) {
  703. //kprintf(" - %08u %s\n", entry.inode.index(), entry.name);
  704. directory_size += EXT2_DIR_REC_LEN(entry.name_length);
  705. }
  706. auto block_size = fs().block_size();
  707. int blocks_needed = ceil_div(directory_size, block_size);
  708. int occupied_size = blocks_needed * block_size;
  709. #ifdef EXT2_DEBUG
  710. dbgprintf("Ext2FS: directory size: %u (occupied: %u)\n", directory_size, occupied_size);
  711. #endif
  712. auto directory_data = ByteBuffer::create_uninitialized(occupied_size);
  713. BufferStream stream(directory_data);
  714. for (int i = 0; i < entries.size(); ++i) {
  715. auto& entry = entries[i];
  716. int record_length = EXT2_DIR_REC_LEN(entry.name_length);
  717. if (i == entries.size() - 1)
  718. record_length += occupied_size - directory_size;
  719. #ifdef EXT2_DEBUG
  720. dbgprintf("* inode: %u", entry.inode.index());
  721. dbgprintf(", name_len: %u", u16(entry.name_length));
  722. dbgprintf(", rec_len: %u", u16(record_length));
  723. dbgprintf(", file_type: %u", u8(entry.file_type));
  724. dbgprintf(", name: %s\n", entry.name);
  725. #endif
  726. stream << u32(entry.inode.index());
  727. stream << u16(record_length);
  728. stream << u8(entry.name_length);
  729. stream << u8(entry.file_type);
  730. stream << entry.name;
  731. int padding = record_length - entry.name_length - 8;
  732. for (int j = 0; j < padding; ++j)
  733. stream << u8(0);
  734. }
  735. stream.fill_to_end(0);
  736. ssize_t nwritten = write_bytes(0, directory_data.size(), directory_data.data(), nullptr);
  737. return nwritten == directory_data.size();
  738. }
  739. KResult Ext2FSInode::add_child(InodeIdentifier child_id, const StringView& name, mode_t mode)
  740. {
  741. LOCKER(m_lock);
  742. ASSERT(is_directory());
  743. if (name.length() > EXT2_NAME_LEN)
  744. return KResult(-ENAMETOOLONG);
  745. #ifdef EXT2_DEBUG
  746. dbg() << "Ext2FSInode::add_child(): Adding inode " << child_id.index() << " with name '" << name << " and mode " << mode << " to directory " << index();
  747. #endif
  748. Vector<FS::DirectoryEntry> entries;
  749. bool name_already_exists = false;
  750. traverse_as_directory([&](auto& entry) {
  751. if (name == entry.name) {
  752. name_already_exists = true;
  753. return false;
  754. }
  755. entries.append(entry);
  756. return true;
  757. });
  758. if (name_already_exists) {
  759. dbg() << "Ext2FSInode::add_child(): Name '" << name << "' already exists in inode " << index();
  760. return KResult(-EEXIST);
  761. }
  762. auto child_inode = fs().get_inode(child_id);
  763. if (child_inode)
  764. child_inode->increment_link_count();
  765. entries.empend(name.characters_without_null_termination(), name.length(), child_id, to_ext2_file_type(mode));
  766. bool success = write_directory(entries);
  767. if (success)
  768. m_lookup_cache.set(name, child_id.index());
  769. return KSuccess;
  770. }
  771. KResult Ext2FSInode::remove_child(const StringView& name)
  772. {
  773. LOCKER(m_lock);
  774. #ifdef EXT2_DEBUG
  775. dbg() << "Ext2FSInode::remove_child(" << name << ") in inode " << index();
  776. #endif
  777. ASSERT(is_directory());
  778. unsigned child_inode_index;
  779. auto it = m_lookup_cache.find(name);
  780. if (it == m_lookup_cache.end())
  781. return KResult(-ENOENT);
  782. child_inode_index = (*it).value;
  783. InodeIdentifier child_id { fsid(), child_inode_index };
  784. #ifdef EXT2_DEBUG
  785. dbg() << "Ext2FSInode::remove_child(): Removing '" << name << "' in directory " << index();
  786. #endif
  787. Vector<FS::DirectoryEntry> entries;
  788. traverse_as_directory([&](auto& entry) {
  789. if (name != entry.name)
  790. entries.append(entry);
  791. return true;
  792. });
  793. bool success = write_directory(entries);
  794. if (!success) {
  795. // FIXME: Plumb error from write_directory().
  796. return KResult(-EIO);
  797. }
  798. m_lookup_cache.remove(name);
  799. auto child_inode = fs().get_inode(child_id);
  800. child_inode->decrement_link_count();
  801. return KSuccess;
  802. }
  803. unsigned Ext2FS::inodes_per_block() const
  804. {
  805. return EXT2_INODES_PER_BLOCK(&super_block());
  806. }
  807. unsigned Ext2FS::inodes_per_group() const
  808. {
  809. return EXT2_INODES_PER_GROUP(&super_block());
  810. }
  811. unsigned Ext2FS::inode_size() const
  812. {
  813. return EXT2_INODE_SIZE(&super_block());
  814. }
  815. unsigned Ext2FS::blocks_per_group() const
  816. {
  817. return EXT2_BLOCKS_PER_GROUP(&super_block());
  818. }
  819. bool Ext2FS::write_ext2_inode(unsigned inode, const ext2_inode& e2inode)
  820. {
  821. LOCKER(m_lock);
  822. unsigned block_index;
  823. unsigned offset;
  824. u8 block[max_block_size];
  825. if (!read_block_containing_inode(inode, block_index, offset, block))
  826. return false;
  827. memcpy(reinterpret_cast<ext2_inode*>(block + offset), &e2inode, inode_size());
  828. bool success = write_block(block_index, block);
  829. ASSERT(success);
  830. return success;
  831. }
  832. Ext2FS::BlockIndex Ext2FS::allocate_block(GroupIndex preferred_group_index)
  833. {
  834. LOCKER(m_lock);
  835. #ifdef EXT2_DEBUG
  836. dbg() << "Ext2FS: allocate_block() preferred_group_index: " << preferred_group_index;
  837. #endif
  838. bool found_a_group = false;
  839. GroupIndex group_index = preferred_group_index;
  840. if (group_descriptor(preferred_group_index).bg_free_blocks_count) {
  841. found_a_group = true;
  842. } else {
  843. for (group_index = 1; group_index < m_block_group_count; ++group_index) {
  844. if (group_descriptor(group_index).bg_free_blocks_count) {
  845. found_a_group = true;
  846. break;
  847. }
  848. }
  849. }
  850. ASSERT(found_a_group);
  851. auto& bgd = group_descriptor(group_index);
  852. auto& cached_bitmap = get_bitmap_block(bgd.bg_block_bitmap);
  853. int blocks_in_group = min(blocks_per_group(), super_block().s_blocks_count);
  854. auto block_bitmap = Bitmap::wrap(cached_bitmap.buffer.data(), blocks_in_group);
  855. BlockIndex first_block_in_group = (group_index - 1) * blocks_per_group() + first_block_index();
  856. int first_unset_bit_index = block_bitmap.find_first_unset();
  857. ASSERT(first_unset_bit_index != -1);
  858. BlockIndex block_index = (unsigned)first_unset_bit_index + first_block_in_group;
  859. set_block_allocation_state(block_index, true);
  860. return block_index;
  861. }
  862. Vector<Ext2FS::BlockIndex> Ext2FS::allocate_blocks(GroupIndex preferred_group_index, int count)
  863. {
  864. LOCKER(m_lock);
  865. #ifdef EXT2_DEBUG
  866. dbgprintf("Ext2FS: allocate_blocks(preferred group: %u, count: %u)\n", preferred_group_index, count);
  867. #endif
  868. if (count == 0)
  869. return {};
  870. Vector<BlockIndex> blocks;
  871. #ifdef EXT2_DEBUG
  872. dbg() << "Ext2FS: allocate_blocks:";
  873. #endif
  874. blocks.ensure_capacity(count);
  875. for (int i = 0; i < count; ++i) {
  876. auto block_index = allocate_block(preferred_group_index);
  877. blocks.unchecked_append(block_index);
  878. #ifdef EXT2_DEBUG
  879. dbg() << " > " << block_index;
  880. #endif
  881. }
  882. ASSERT(blocks.size() == count);
  883. return blocks;
  884. }
  885. unsigned Ext2FS::allocate_inode(GroupIndex preferred_group, off_t expected_size)
  886. {
  887. LOCKER(m_lock);
  888. #ifdef EXT2_DEBUG
  889. dbgprintf("Ext2FS: allocate_inode(preferredGroup: %u, expected_size: %u)\n", preferred_group, expected_size);
  890. #endif
  891. unsigned needed_blocks = ceil_div(expected_size, block_size());
  892. #ifdef EXT2_DEBUG
  893. dbgprintf("Ext2FS: minimum needed blocks: %u\n", needed_blocks);
  894. #endif
  895. unsigned group_index = 0;
  896. auto is_suitable_group = [this, needed_blocks](GroupIndex group_index) {
  897. auto& bgd = group_descriptor(group_index);
  898. return bgd.bg_free_inodes_count && bgd.bg_free_blocks_count >= needed_blocks;
  899. };
  900. if (preferred_group && is_suitable_group(preferred_group)) {
  901. group_index = preferred_group;
  902. } else {
  903. for (unsigned i = 1; i <= m_block_group_count; ++i) {
  904. if (is_suitable_group(i))
  905. group_index = i;
  906. }
  907. }
  908. if (!group_index) {
  909. kprintf("Ext2FS: allocate_inode: no suitable group found for new inode with %u blocks needed :(\n", needed_blocks);
  910. return 0;
  911. }
  912. #ifdef EXT2_DEBUG
  913. dbgprintf("Ext2FS: allocate_inode: found suitable group [%u] for new inode with %u blocks needed :^)\n", group_index, needed_blocks);
  914. #endif
  915. auto& bgd = group_descriptor(group_index);
  916. unsigned inodes_in_group = min(inodes_per_group(), super_block().s_inodes_count);
  917. unsigned first_free_inode_in_group = 0;
  918. unsigned first_inode_in_group = (group_index - 1) * inodes_per_group() + 1;
  919. auto& cached_bitmap = get_bitmap_block(bgd.bg_inode_bitmap);
  920. auto inode_bitmap = Bitmap::wrap(cached_bitmap.buffer.data(), inodes_in_group);
  921. for (int i = 0; i < inode_bitmap.size(); ++i) {
  922. if (inode_bitmap.get(i))
  923. continue;
  924. first_free_inode_in_group = first_inode_in_group + i;
  925. break;
  926. }
  927. if (!first_free_inode_in_group) {
  928. kprintf("Ext2FS: first_free_inode_in_group returned no inode, despite bgd claiming there are inodes :(\n");
  929. return 0;
  930. }
  931. unsigned inode = first_free_inode_in_group;
  932. #ifdef EXT2_DEBUG
  933. dbgprintf("Ext2FS: found suitable inode %u\n", inode);
  934. #endif
  935. ASSERT(get_inode_allocation_state(inode) == false);
  936. // FIXME: allocate blocks if needed!
  937. return inode;
  938. }
  939. Ext2FS::GroupIndex Ext2FS::group_index_from_block_index(BlockIndex block_index) const
  940. {
  941. if (!block_index)
  942. return 0;
  943. return (block_index - 1) / blocks_per_group() + 1;
  944. }
  945. unsigned Ext2FS::group_index_from_inode(unsigned inode) const
  946. {
  947. if (!inode)
  948. return 0;
  949. return (inode - 1) / inodes_per_group() + 1;
  950. }
  951. bool Ext2FS::get_inode_allocation_state(InodeIndex index) const
  952. {
  953. LOCKER(m_lock);
  954. if (index == 0)
  955. return true;
  956. unsigned group_index = group_index_from_inode(index);
  957. auto& bgd = group_descriptor(group_index);
  958. unsigned index_in_group = index - ((group_index - 1) * inodes_per_group());
  959. unsigned bit_index = (index_in_group - 1) % inodes_per_group();
  960. auto& cached_bitmap = const_cast<Ext2FS&>(*this).get_bitmap_block(bgd.bg_inode_bitmap);
  961. return cached_bitmap.bitmap(inodes_per_group()).get(bit_index);
  962. }
  963. bool Ext2FS::set_inode_allocation_state(InodeIndex inode_index, bool new_state)
  964. {
  965. LOCKER(m_lock);
  966. unsigned group_index = group_index_from_inode(inode_index);
  967. auto& bgd = group_descriptor(group_index);
  968. unsigned index_in_group = inode_index - ((group_index - 1) * inodes_per_group());
  969. unsigned bit_index = (index_in_group - 1) % inodes_per_group();
  970. auto& cached_bitmap = get_bitmap_block(bgd.bg_inode_bitmap);
  971. bool current_state = cached_bitmap.bitmap(inodes_per_group()).get(bit_index);
  972. #ifdef EXT2_DEBUG
  973. dbgprintf("Ext2FS: set_inode_allocation_state(%u) %u -> %u\n", inode_index, current_state, new_state);
  974. #endif
  975. if (current_state == new_state) {
  976. ASSERT_NOT_REACHED();
  977. return true;
  978. }
  979. cached_bitmap.bitmap(inodes_per_group()).set(bit_index, new_state);
  980. cached_bitmap.dirty = true;
  981. // Update superblock
  982. #ifdef EXT2_DEBUG
  983. dbgprintf("Ext2FS: superblock free inode count %u -> %u\n", m_super_block.s_free_inodes_count, m_super_block.s_free_inodes_count - 1);
  984. #endif
  985. if (new_state)
  986. --m_super_block.s_free_inodes_count;
  987. else
  988. ++m_super_block.s_free_inodes_count;
  989. m_super_block_dirty = true;
  990. // Update BGD
  991. auto& mutable_bgd = const_cast<ext2_group_desc&>(bgd);
  992. if (new_state)
  993. --mutable_bgd.bg_free_inodes_count;
  994. else
  995. ++mutable_bgd.bg_free_inodes_count;
  996. #ifdef EXT2_DEBUG
  997. dbgprintf("Ext2FS: group free inode count %u -> %u\n", bgd.bg_free_inodes_count, bgd.bg_free_inodes_count - 1);
  998. #endif
  999. m_block_group_descriptors_dirty = true;
  1000. return true;
  1001. }
  1002. Ext2FS::BlockIndex Ext2FS::first_block_index() const
  1003. {
  1004. return block_size() == 1024 ? 1 : 0;
  1005. }
  1006. Ext2FS::CachedBitmap& Ext2FS::get_bitmap_block(BlockIndex bitmap_block_index)
  1007. {
  1008. for (auto& cached_bitmap : m_cached_bitmaps) {
  1009. if (cached_bitmap->bitmap_block_index == bitmap_block_index)
  1010. return *cached_bitmap;
  1011. }
  1012. auto block = ByteBuffer::create_uninitialized(block_size());
  1013. bool success = read_block(bitmap_block_index, block.data());
  1014. ASSERT(success);
  1015. m_cached_bitmaps.append(make<CachedBitmap>(bitmap_block_index, move(block)));
  1016. return *m_cached_bitmaps.last();
  1017. }
  1018. bool Ext2FS::set_block_allocation_state(BlockIndex block_index, bool new_state)
  1019. {
  1020. LOCKER(m_lock);
  1021. #ifdef EXT2_DEBUG
  1022. dbgprintf("Ext2FS: set_block_allocation_state(block=%u, state=%u)\n", block_index, new_state);
  1023. #endif
  1024. GroupIndex group_index = group_index_from_block_index(block_index);
  1025. auto& bgd = group_descriptor(group_index);
  1026. BlockIndex index_in_group = (block_index - first_block_index()) - ((group_index - 1) * blocks_per_group());
  1027. unsigned bit_index = index_in_group % blocks_per_group();
  1028. auto& cached_bitmap = get_bitmap_block(bgd.bg_block_bitmap);
  1029. bool current_state = cached_bitmap.bitmap(blocks_per_group()).get(bit_index);
  1030. #ifdef EXT2_DEBUG
  1031. dbgprintf("Ext2FS: block %u state: %u -> %u (in bitmap block %u)\n", block_index, current_state, new_state, bgd.bg_block_bitmap);
  1032. #endif
  1033. if (current_state == new_state) {
  1034. ASSERT_NOT_REACHED();
  1035. return true;
  1036. }
  1037. cached_bitmap.bitmap(blocks_per_group()).set(bit_index, new_state);
  1038. cached_bitmap.dirty = true;
  1039. // Update superblock
  1040. #ifdef EXT2_DEBUG
  1041. dbgprintf("Ext2FS: superblock free block count %u -> %u\n", m_super_block.s_free_blocks_count, m_super_block.s_free_blocks_count - 1);
  1042. #endif
  1043. if (new_state)
  1044. --m_super_block.s_free_blocks_count;
  1045. else
  1046. ++m_super_block.s_free_blocks_count;
  1047. m_super_block_dirty = true;
  1048. // Update BGD
  1049. auto& mutable_bgd = const_cast<ext2_group_desc&>(bgd);
  1050. if (new_state)
  1051. --mutable_bgd.bg_free_blocks_count;
  1052. else
  1053. ++mutable_bgd.bg_free_blocks_count;
  1054. #ifdef EXT2_DEBUG
  1055. dbgprintf("Ext2FS: group %u free block count %u -> %u\n", group_index, bgd.bg_free_blocks_count, bgd.bg_free_blocks_count - 1);
  1056. #endif
  1057. m_block_group_descriptors_dirty = true;
  1058. return true;
  1059. }
  1060. RefPtr<Inode> Ext2FS::create_directory(InodeIdentifier parent_id, const String& name, mode_t mode, int& error)
  1061. {
  1062. LOCKER(m_lock);
  1063. ASSERT(parent_id.fsid() == fsid());
  1064. // Fix up the mode to definitely be a directory.
  1065. // FIXME: This is a bit on the hackish side.
  1066. mode &= ~0170000;
  1067. mode |= 0040000;
  1068. // NOTE: When creating a new directory, make the size 1 block.
  1069. // There's probably a better strategy here, but this works for now.
  1070. auto inode = create_inode(parent_id, name, mode, block_size(), 0, error);
  1071. if (!inode)
  1072. return nullptr;
  1073. #ifdef EXT2_DEBUG
  1074. dbgprintf("Ext2FS: create_directory: created new directory named '%s' with inode %u\n", name.characters(), inode->identifier().index());
  1075. #endif
  1076. Vector<DirectoryEntry> entries;
  1077. entries.empend(".", inode->identifier(), EXT2_FT_DIR);
  1078. entries.empend("..", parent_id, EXT2_FT_DIR);
  1079. bool success = static_cast<Ext2FSInode&>(*inode).write_directory(entries);
  1080. ASSERT(success);
  1081. auto parent_inode = get_inode(parent_id);
  1082. error = parent_inode->increment_link_count();
  1083. if (error < 0)
  1084. return nullptr;
  1085. auto& bgd = const_cast<ext2_group_desc&>(group_descriptor(group_index_from_inode(inode->identifier().index())));
  1086. ++bgd.bg_used_dirs_count;
  1087. #ifdef EXT2_DEBUG
  1088. dbgprintf("Ext2FS: incremented bg_used_dirs_count %u -> %u\n", bgd.bg_used_dirs_count - 1, bgd.bg_used_dirs_count);
  1089. #endif
  1090. m_block_group_descriptors_dirty = true;
  1091. error = 0;
  1092. return inode;
  1093. }
  1094. RefPtr<Inode> Ext2FS::create_inode(InodeIdentifier parent_id, const String& name, mode_t mode, off_t size, dev_t dev, int& error)
  1095. {
  1096. LOCKER(m_lock);
  1097. ASSERT(parent_id.fsid() == fsid());
  1098. auto parent_inode = get_inode(parent_id);
  1099. #ifdef EXT2_DEBUG
  1100. dbgprintf("Ext2FS: Adding inode '%s' (mode %o) to parent directory %u:\n", name.characters(), mode, parent_inode->identifier().index());
  1101. #endif
  1102. auto needed_blocks = ceil_div(size, block_size());
  1103. if ((size_t)needed_blocks > super_block().s_free_blocks_count) {
  1104. dbg() << "Ext2FS: create_inode: not enough free blocks";
  1105. error = -ENOSPC;
  1106. return {};
  1107. }
  1108. // NOTE: This doesn't commit the inode allocation just yet!
  1109. auto inode_id = allocate_inode(0, size);
  1110. if (!inode_id) {
  1111. kprintf("Ext2FS: create_inode: allocate_inode failed\n");
  1112. error = -ENOSPC;
  1113. return {};
  1114. }
  1115. // Try adding it to the directory first, in case the name is already in use.
  1116. auto result = parent_inode->add_child({ fsid(), inode_id }, name, mode);
  1117. if (result.is_error()) {
  1118. error = result;
  1119. return {};
  1120. }
  1121. auto blocks = allocate_blocks(group_index_from_inode(inode_id), needed_blocks);
  1122. ASSERT(blocks.size() == needed_blocks);
  1123. // Looks like we're good, time to update the inode bitmap and group+global inode counters.
  1124. bool success = set_inode_allocation_state(inode_id, true);
  1125. ASSERT(success);
  1126. unsigned initial_links_count;
  1127. if (is_directory(mode))
  1128. initial_links_count = 2; // (parent directory + "." entry in self)
  1129. else
  1130. initial_links_count = 1;
  1131. struct timeval now;
  1132. kgettimeofday(now);
  1133. ext2_inode e2inode;
  1134. memset(&e2inode, 0, sizeof(ext2_inode));
  1135. e2inode.i_mode = mode;
  1136. e2inode.i_uid = current->process().euid();
  1137. e2inode.i_gid = current->process().egid();
  1138. e2inode.i_size = size;
  1139. e2inode.i_atime = now.tv_sec;
  1140. e2inode.i_ctime = now.tv_sec;
  1141. e2inode.i_mtime = now.tv_sec;
  1142. e2inode.i_dtime = 0;
  1143. e2inode.i_links_count = initial_links_count;
  1144. if (is_character_device(mode))
  1145. e2inode.i_block[0] = dev;
  1146. else if (is_block_device(mode))
  1147. e2inode.i_block[1] = dev;
  1148. success = write_block_list_for_inode(inode_id, e2inode, blocks);
  1149. ASSERT(success);
  1150. #ifdef EXT2_DEBUG
  1151. dbgprintf("Ext2FS: writing initial metadata for inode %u\n", inode_id);
  1152. #endif
  1153. e2inode.i_flags = 0;
  1154. success = write_ext2_inode(inode_id, e2inode);
  1155. ASSERT(success);
  1156. // We might have cached the fact that this inode didn't exist. Wipe the slate.
  1157. m_inode_cache.remove(inode_id);
  1158. return get_inode({ fsid(), inode_id });
  1159. }
  1160. void Ext2FSInode::populate_lookup_cache() const
  1161. {
  1162. LOCKER(m_lock);
  1163. if (!m_lookup_cache.is_empty())
  1164. return;
  1165. HashMap<String, unsigned> children;
  1166. traverse_as_directory([&children](auto& entry) {
  1167. children.set(String(entry.name, entry.name_length), entry.inode.index());
  1168. return true;
  1169. });
  1170. if (!m_lookup_cache.is_empty())
  1171. return;
  1172. m_lookup_cache = move(children);
  1173. }
  1174. InodeIdentifier Ext2FSInode::lookup(StringView name)
  1175. {
  1176. ASSERT(is_directory());
  1177. populate_lookup_cache();
  1178. LOCKER(m_lock);
  1179. auto it = m_lookup_cache.find(name.hash(), [&](auto& entry) { return entry.key == name; });
  1180. if (it != m_lookup_cache.end())
  1181. return { fsid(), (*it).value };
  1182. return {};
  1183. }
  1184. void Ext2FSInode::one_ref_left()
  1185. {
  1186. // FIXME: I would like to not live forever, but uncached Ext2FS is fucking painful right now.
  1187. }
  1188. int Ext2FSInode::set_atime(time_t t)
  1189. {
  1190. LOCKER(m_lock);
  1191. if (fs().is_readonly())
  1192. return -EROFS;
  1193. m_raw_inode.i_atime = t;
  1194. set_metadata_dirty(true);
  1195. return 0;
  1196. }
  1197. int Ext2FSInode::set_ctime(time_t t)
  1198. {
  1199. LOCKER(m_lock);
  1200. if (fs().is_readonly())
  1201. return -EROFS;
  1202. m_raw_inode.i_ctime = t;
  1203. set_metadata_dirty(true);
  1204. return 0;
  1205. }
  1206. int Ext2FSInode::set_mtime(time_t t)
  1207. {
  1208. LOCKER(m_lock);
  1209. if (fs().is_readonly())
  1210. return -EROFS;
  1211. m_raw_inode.i_mtime = t;
  1212. set_metadata_dirty(true);
  1213. return 0;
  1214. }
  1215. int Ext2FSInode::increment_link_count()
  1216. {
  1217. LOCKER(m_lock);
  1218. if (fs().is_readonly())
  1219. return -EROFS;
  1220. ++m_raw_inode.i_links_count;
  1221. set_metadata_dirty(true);
  1222. return 0;
  1223. }
  1224. int Ext2FSInode::decrement_link_count()
  1225. {
  1226. LOCKER(m_lock);
  1227. if (fs().is_readonly())
  1228. return -EROFS;
  1229. ASSERT(m_raw_inode.i_links_count);
  1230. --m_raw_inode.i_links_count;
  1231. if (m_raw_inode.i_links_count == 0)
  1232. fs().uncache_inode(index());
  1233. set_metadata_dirty(true);
  1234. return 0;
  1235. }
  1236. void Ext2FS::uncache_inode(InodeIndex index)
  1237. {
  1238. LOCKER(m_lock);
  1239. m_inode_cache.remove(index);
  1240. }
  1241. size_t Ext2FSInode::directory_entry_count() const
  1242. {
  1243. ASSERT(is_directory());
  1244. LOCKER(m_lock);
  1245. populate_lookup_cache();
  1246. return m_lookup_cache.size();
  1247. }
  1248. KResult Ext2FSInode::chmod(mode_t mode)
  1249. {
  1250. LOCKER(m_lock);
  1251. if (m_raw_inode.i_mode == mode)
  1252. return KSuccess;
  1253. m_raw_inode.i_mode = mode;
  1254. set_metadata_dirty(true);
  1255. return KSuccess;
  1256. }
  1257. KResult Ext2FSInode::chown(uid_t uid, gid_t gid)
  1258. {
  1259. LOCKER(m_lock);
  1260. if (m_raw_inode.i_uid == uid && m_raw_inode.i_gid == gid)
  1261. return KSuccess;
  1262. m_raw_inode.i_uid = uid;
  1263. m_raw_inode.i_gid = gid;
  1264. set_metadata_dirty(true);
  1265. return KSuccess;
  1266. }
  1267. KResult Ext2FSInode::truncate(off_t size)
  1268. {
  1269. LOCKER(m_lock);
  1270. if ((off_t)m_raw_inode.i_size == size)
  1271. return KSuccess;
  1272. resize(size);
  1273. set_metadata_dirty(true);
  1274. return KSuccess;
  1275. }
  1276. unsigned Ext2FS::total_block_count() const
  1277. {
  1278. LOCKER(m_lock);
  1279. return super_block().s_blocks_count;
  1280. }
  1281. unsigned Ext2FS::free_block_count() const
  1282. {
  1283. LOCKER(m_lock);
  1284. return super_block().s_free_blocks_count;
  1285. }
  1286. unsigned Ext2FS::total_inode_count() const
  1287. {
  1288. LOCKER(m_lock);
  1289. return super_block().s_inodes_count;
  1290. }
  1291. unsigned Ext2FS::free_inode_count() const
  1292. {
  1293. LOCKER(m_lock);
  1294. return super_block().s_free_inodes_count;
  1295. }
  1296. KResult Ext2FS::prepare_to_unmount() const
  1297. {
  1298. LOCKER(m_lock);
  1299. for (auto& it : m_inode_cache) {
  1300. if (it.value->ref_count() > 1)
  1301. return KResult(-EBUSY);
  1302. }
  1303. m_inode_cache.clear();
  1304. return KSuccess;
  1305. }