Ext2FileSystem.cpp 45 KB

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