Searched refs:internal (Results 1 – 8 of 8) sorted by relevance
25 if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { in hpfs_bplus_lookup()26 a = le32_to_cpu(btree->u.internal[i].down); in hpfs_bplus_lookup()86 a = le32_to_cpu(btree->u.internal[n].down); in hpfs_add_sector_to_btree()87 btree->u.internal[n].file_secno = cpu_to_le32(-1); in hpfs_add_sector_to_btree()140 btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree); in hpfs_add_sector_to_btree()141 btree->u.internal[0].file_secno = cpu_to_le32(-1); in hpfs_add_sector_to_btree()142 btree->u.internal[0].down = cpu_to_le32(na); in hpfs_add_sector_to_btree()178 btree->u.internal[n].file_secno = cpu_to_le32(-1); in hpfs_add_sector_to_btree()179 btree->u.internal[n].down = cpu_to_le32(na); in hpfs_add_sector_to_btree()180 btree->u.internal[n-1].file_secno = cpu_to_le32(fs); in hpfs_add_sector_to_btree()[all …]
410 struct bplus_internal_node internal[0]; /* (internal) 2-word entries giving member457 struct bplus_internal_node internal[12]; member499 struct bplus_internal_node internal[60]; member
35 possibly imagine of its internal consistency throughout its49 various ReiserFS statistics and internal data at the expense of
7 export internal kernel objects, their attributes, and their
44 sanity checks of quota internal structures. If unsure, say N.
43 This is the JFFS2-internal equivalent of the inode mutex i->i_sem.58 Instead of playing such games, we just have an extra internal
13 the internal geometry or flash memory management schemes aka FTL, F2FS
132 * Added test for "impossible" condition of empty internal nodes in