key.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549
  1. /*
  2. * This file is part of UBIFS.
  3. *
  4. * Copyright (C) 2006-2008 Nokia Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify it
  7. * under the terms of the GNU General Public License version 2 as published by
  8. * the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful, but WITHOUT
  11. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  12. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  13. * more details.
  14. *
  15. * You should have received a copy of the GNU General Public License along with
  16. * this program; if not, write to the Free Software Foundation, Inc., 51
  17. * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  18. *
  19. * Authors: Artem Bityutskiy (Битюцкий Артём)
  20. * Adrian Hunter
  21. */
  22. /*
  23. * This header contains various key-related definitions and helper function.
  24. * UBIFS allows several key schemes, so we access key fields only via these
  25. * helpers. At the moment only one key scheme is supported.
  26. *
  27. * Simple key scheme
  28. * ~~~~~~~~~~~~~~~~~
  29. *
  30. * Keys are 64-bits long. First 32-bits are inode number (parent inode number
  31. * in case of direntry key). Next 3 bits are node type. The last 29 bits are
  32. * 4KiB offset in case of inode node, and direntry hash in case of a direntry
  33. * node. We use "r5" hash borrowed from reiserfs.
  34. */
  35. #ifndef __UBIFS_KEY_H__
  36. #define __UBIFS_KEY_H__
  37. /**
  38. * key_mask_hash - mask a valid hash value.
  39. * @val: value to be masked
  40. *
  41. * We use hash values as offset in directories, so values %0 and %1 are
  42. * reserved for "." and "..". %2 is reserved for "end of readdir" marker. This
  43. * function makes sure the reserved values are not used.
  44. */
  45. static inline uint32_t key_mask_hash(uint32_t hash)
  46. {
  47. hash &= UBIFS_S_KEY_HASH_MASK;
  48. if (unlikely(hash <= 2))
  49. hash += 3;
  50. return hash;
  51. }
  52. /**
  53. * key_r5_hash - R5 hash function (borrowed from reiserfs).
  54. * @s: direntry name
  55. * @len: name length
  56. */
  57. static inline uint32_t key_r5_hash(const char *s, int len)
  58. {
  59. uint32_t a = 0;
  60. const signed char *str = (const signed char *)s;
  61. while (*str) {
  62. a += *str << 4;
  63. a += *str >> 4;
  64. a *= 11;
  65. str++;
  66. }
  67. return key_mask_hash(a);
  68. }
  69. /**
  70. * key_test_hash - testing hash function.
  71. * @str: direntry name
  72. * @len: name length
  73. */
  74. static inline uint32_t key_test_hash(const char *str, int len)
  75. {
  76. uint32_t a = 0;
  77. len = min_t(uint32_t, len, 4);
  78. memcpy(&a, str, len);
  79. return key_mask_hash(a);
  80. }
  81. /**
  82. * ino_key_init - initialize inode key.
  83. * @c: UBIFS file-system description object
  84. * @key: key to initialize
  85. * @inum: inode number
  86. */
  87. static inline void ino_key_init(const struct ubifs_info *c,
  88. union ubifs_key *key, ino_t inum)
  89. {
  90. key->u32[0] = inum;
  91. key->u32[1] = UBIFS_INO_KEY << UBIFS_S_KEY_BLOCK_BITS;
  92. }
  93. /**
  94. * ino_key_init_flash - initialize on-flash inode key.
  95. * @c: UBIFS file-system description object
  96. * @k: key to initialize
  97. * @inum: inode number
  98. */
  99. static inline void ino_key_init_flash(const struct ubifs_info *c, void *k,
  100. ino_t inum)
  101. {
  102. union ubifs_key *key = k;
  103. key->j32[0] = cpu_to_le32(inum);
  104. key->j32[1] = cpu_to_le32(UBIFS_INO_KEY << UBIFS_S_KEY_BLOCK_BITS);
  105. memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8);
  106. }
  107. /**
  108. * lowest_ino_key - get the lowest possible inode key.
  109. * @c: UBIFS file-system description object
  110. * @key: key to initialize
  111. * @inum: inode number
  112. */
  113. static inline void lowest_ino_key(const struct ubifs_info *c,
  114. union ubifs_key *key, ino_t inum)
  115. {
  116. key->u32[0] = inum;
  117. key->u32[1] = 0;
  118. }
  119. /**
  120. * highest_ino_key - get the highest possible inode key.
  121. * @c: UBIFS file-system description object
  122. * @key: key to initialize
  123. * @inum: inode number
  124. */
  125. static inline void highest_ino_key(const struct ubifs_info *c,
  126. union ubifs_key *key, ino_t inum)
  127. {
  128. key->u32[0] = inum;
  129. key->u32[1] = 0xffffffff;
  130. }
  131. /**
  132. * dent_key_init - initialize directory entry key.
  133. * @c: UBIFS file-system description object
  134. * @key: key to initialize
  135. * @inum: parent inode number
  136. * @nm: direntry name and length
  137. */
  138. static inline void dent_key_init(const struct ubifs_info *c,
  139. union ubifs_key *key, ino_t inum,
  140. const struct qstr *nm)
  141. {
  142. uint32_t hash = c->key_hash(nm->name, nm->len);
  143. ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK));
  144. key->u32[0] = inum;
  145. key->u32[1] = hash | (UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS);
  146. }
  147. /**
  148. * dent_key_init_hash - initialize directory entry key without re-calculating
  149. * hash function.
  150. * @c: UBIFS file-system description object
  151. * @key: key to initialize
  152. * @inum: parent inode number
  153. * @hash: direntry name hash
  154. */
  155. static inline void dent_key_init_hash(const struct ubifs_info *c,
  156. union ubifs_key *key, ino_t inum,
  157. uint32_t hash)
  158. {
  159. ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK));
  160. key->u32[0] = inum;
  161. key->u32[1] = hash | (UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS);
  162. }
  163. /**
  164. * dent_key_init_flash - initialize on-flash directory entry key.
  165. * @c: UBIFS file-system description object
  166. * @k: key to initialize
  167. * @inum: parent inode number
  168. * @nm: direntry name and length
  169. */
  170. static inline void dent_key_init_flash(const struct ubifs_info *c, void *k,
  171. ino_t inum, const struct qstr *nm)
  172. {
  173. union ubifs_key *key = k;
  174. uint32_t hash = c->key_hash(nm->name, nm->len);
  175. ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK));
  176. key->j32[0] = cpu_to_le32(inum);
  177. key->j32[1] = cpu_to_le32(hash |
  178. (UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS));
  179. memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8);
  180. }
  181. /**
  182. * lowest_dent_key - get the lowest possible directory entry key.
  183. * @c: UBIFS file-system description object
  184. * @key: where to store the lowest key
  185. * @inum: parent inode number
  186. */
  187. static inline void lowest_dent_key(const struct ubifs_info *c,
  188. union ubifs_key *key, ino_t inum)
  189. {
  190. key->u32[0] = inum;
  191. key->u32[1] = UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS;
  192. }
  193. /**
  194. * xent_key_init - initialize extended attribute entry key.
  195. * @c: UBIFS file-system description object
  196. * @key: key to initialize
  197. * @inum: host inode number
  198. * @nm: extended attribute entry name and length
  199. */
  200. static inline void xent_key_init(const struct ubifs_info *c,
  201. union ubifs_key *key, ino_t inum,
  202. const struct qstr *nm)
  203. {
  204. uint32_t hash = c->key_hash(nm->name, nm->len);
  205. ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK));
  206. key->u32[0] = inum;
  207. key->u32[1] = hash | (UBIFS_XENT_KEY << UBIFS_S_KEY_HASH_BITS);
  208. }
  209. /**
  210. * xent_key_init_flash - initialize on-flash extended attribute entry key.
  211. * @c: UBIFS file-system description object
  212. * @k: key to initialize
  213. * @inum: host inode number
  214. * @nm: extended attribute entry name and length
  215. */
  216. static inline void xent_key_init_flash(const struct ubifs_info *c, void *k,
  217. ino_t inum, const struct qstr *nm)
  218. {
  219. union ubifs_key *key = k;
  220. uint32_t hash = c->key_hash(nm->name, nm->len);
  221. ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK));
  222. key->j32[0] = cpu_to_le32(inum);
  223. key->j32[1] = cpu_to_le32(hash |
  224. (UBIFS_XENT_KEY << UBIFS_S_KEY_HASH_BITS));
  225. memset(k + 8, 0, UBIFS_MAX_KEY_LEN - 8);
  226. }
  227. /**
  228. * lowest_xent_key - get the lowest possible extended attribute entry key.
  229. * @c: UBIFS file-system description object
  230. * @key: where to store the lowest key
  231. * @inum: host inode number
  232. */
  233. static inline void lowest_xent_key(const struct ubifs_info *c,
  234. union ubifs_key *key, ino_t inum)
  235. {
  236. key->u32[0] = inum;
  237. key->u32[1] = UBIFS_XENT_KEY << UBIFS_S_KEY_HASH_BITS;
  238. }
  239. /**
  240. * data_key_init - initialize data key.
  241. * @c: UBIFS file-system description object
  242. * @key: key to initialize
  243. * @inum: inode number
  244. * @block: block number
  245. */
  246. static inline void data_key_init(const struct ubifs_info *c,
  247. union ubifs_key *key, ino_t inum,
  248. unsigned int block)
  249. {
  250. ubifs_assert(!(block & ~UBIFS_S_KEY_BLOCK_MASK));
  251. key->u32[0] = inum;
  252. key->u32[1] = block | (UBIFS_DATA_KEY << UBIFS_S_KEY_BLOCK_BITS);
  253. }
  254. /**
  255. * highest_data_key - get the highest possible data key for an inode.
  256. * @c: UBIFS file-system description object
  257. * @key: key to initialize
  258. * @inum: inode number
  259. */
  260. static inline void highest_data_key(const struct ubifs_info *c,
  261. union ubifs_key *key, ino_t inum)
  262. {
  263. data_key_init(c, key, inum, UBIFS_S_KEY_BLOCK_MASK);
  264. }
  265. /**
  266. * trun_key_init - initialize truncation node key.
  267. * @c: UBIFS file-system description object
  268. * @key: key to initialize
  269. * @inum: inode number
  270. *
  271. * Note, UBIFS does not have truncation keys on the media and this function is
  272. * only used for purposes of replay.
  273. */
  274. static inline void trun_key_init(const struct ubifs_info *c,
  275. union ubifs_key *key, ino_t inum)
  276. {
  277. key->u32[0] = inum;
  278. key->u32[1] = UBIFS_TRUN_KEY << UBIFS_S_KEY_BLOCK_BITS;
  279. }
  280. /**
  281. * invalid_key_init - initialize invalid node key.
  282. * @c: UBIFS file-system description object
  283. * @key: key to initialize
  284. *
  285. * This is a helper function which marks a @key object as invalid.
  286. */
  287. static inline void invalid_key_init(const struct ubifs_info *c,
  288. union ubifs_key *key)
  289. {
  290. key->u32[0] = 0xDEADBEAF;
  291. key->u32[1] = UBIFS_INVALID_KEY;
  292. }
  293. /**
  294. * key_type - get key type.
  295. * @c: UBIFS file-system description object
  296. * @key: key to get type of
  297. */
  298. static inline int key_type(const struct ubifs_info *c,
  299. const union ubifs_key *key)
  300. {
  301. return key->u32[1] >> UBIFS_S_KEY_BLOCK_BITS;
  302. }
  303. /**
  304. * key_type_flash - get type of a on-flash formatted key.
  305. * @c: UBIFS file-system description object
  306. * @k: key to get type of
  307. */
  308. static inline int key_type_flash(const struct ubifs_info *c, const void *k)
  309. {
  310. const union ubifs_key *key = k;
  311. return le32_to_cpu(key->j32[1]) >> UBIFS_S_KEY_BLOCK_BITS;
  312. }
  313. /**
  314. * key_inum - fetch inode number from key.
  315. * @c: UBIFS file-system description object
  316. * @k: key to fetch inode number from
  317. */
  318. static inline ino_t key_inum(const struct ubifs_info *c, const void *k)
  319. {
  320. const union ubifs_key *key = k;
  321. return key->u32[0];
  322. }
  323. /**
  324. * key_inum_flash - fetch inode number from an on-flash formatted key.
  325. * @c: UBIFS file-system description object
  326. * @k: key to fetch inode number from
  327. */
  328. static inline ino_t key_inum_flash(const struct ubifs_info *c, const void *k)
  329. {
  330. const union ubifs_key *key = k;
  331. return le32_to_cpu(key->j32[0]);
  332. }
  333. /**
  334. * key_hash - get directory entry hash.
  335. * @c: UBIFS file-system description object
  336. * @key: the key to get hash from
  337. */
  338. static inline uint32_t key_hash(const struct ubifs_info *c,
  339. const union ubifs_key *key)
  340. {
  341. return key->u32[1] & UBIFS_S_KEY_HASH_MASK;
  342. }
  343. /**
  344. * key_hash_flash - get directory entry hash from an on-flash formatted key.
  345. * @c: UBIFS file-system description object
  346. * @k: the key to get hash from
  347. */
  348. static inline uint32_t key_hash_flash(const struct ubifs_info *c, const void *k)
  349. {
  350. const union ubifs_key *key = k;
  351. return le32_to_cpu(key->j32[1]) & UBIFS_S_KEY_HASH_MASK;
  352. }
  353. /**
  354. * key_block - get data block number.
  355. * @c: UBIFS file-system description object
  356. * @key: the key to get the block number from
  357. */
  358. static inline unsigned int key_block(const struct ubifs_info *c,
  359. const union ubifs_key *key)
  360. {
  361. return key->u32[1] & UBIFS_S_KEY_BLOCK_MASK;
  362. }
  363. /**
  364. * key_block_flash - get data block number from an on-flash formatted key.
  365. * @c: UBIFS file-system description object
  366. * @k: the key to get the block number from
  367. */
  368. static inline unsigned int key_block_flash(const struct ubifs_info *c,
  369. const void *k)
  370. {
  371. const union ubifs_key *key = k;
  372. return le32_to_cpu(key->j32[1]) & UBIFS_S_KEY_BLOCK_MASK;
  373. }
  374. /**
  375. * key_read - transform a key to in-memory format.
  376. * @c: UBIFS file-system description object
  377. * @from: the key to transform
  378. * @to: the key to store the result
  379. */
  380. static inline void key_read(const struct ubifs_info *c, const void *from,
  381. union ubifs_key *to)
  382. {
  383. const union ubifs_key *f = from;
  384. to->u32[0] = le32_to_cpu(f->j32[0]);
  385. to->u32[1] = le32_to_cpu(f->j32[1]);
  386. }
  387. /**
  388. * key_write - transform a key from in-memory format.
  389. * @c: UBIFS file-system description object
  390. * @from: the key to transform
  391. * @to: the key to store the result
  392. */
  393. static inline void key_write(const struct ubifs_info *c,
  394. const union ubifs_key *from, void *to)
  395. {
  396. union ubifs_key *t = to;
  397. t->j32[0] = cpu_to_le32(from->u32[0]);
  398. t->j32[1] = cpu_to_le32(from->u32[1]);
  399. memset(to + 8, 0, UBIFS_MAX_KEY_LEN - 8);
  400. }
  401. /**
  402. * key_write_idx - transform a key from in-memory format for the index.
  403. * @c: UBIFS file-system description object
  404. * @from: the key to transform
  405. * @to: the key to store the result
  406. */
  407. static inline void key_write_idx(const struct ubifs_info *c,
  408. const union ubifs_key *from, void *to)
  409. {
  410. union ubifs_key *t = to;
  411. t->j32[0] = cpu_to_le32(from->u32[0]);
  412. t->j32[1] = cpu_to_le32(from->u32[1]);
  413. }
  414. /**
  415. * key_copy - copy a key.
  416. * @c: UBIFS file-system description object
  417. * @from: the key to copy from
  418. * @to: the key to copy to
  419. */
  420. static inline void key_copy(const struct ubifs_info *c,
  421. const union ubifs_key *from, union ubifs_key *to)
  422. {
  423. to->u64[0] = from->u64[0];
  424. }
  425. /**
  426. * keys_cmp - compare keys.
  427. * @c: UBIFS file-system description object
  428. * @key1: the first key to compare
  429. * @key2: the second key to compare
  430. *
  431. * This function compares 2 keys and returns %-1 if @key1 is less than
  432. * @key2, %0 if the keys are equivalent and %1 if @key1 is greater than @key2.
  433. */
  434. static inline int keys_cmp(const struct ubifs_info *c,
  435. const union ubifs_key *key1,
  436. const union ubifs_key *key2)
  437. {
  438. if (key1->u32[0] < key2->u32[0])
  439. return -1;
  440. if (key1->u32[0] > key2->u32[0])
  441. return 1;
  442. if (key1->u32[1] < key2->u32[1])
  443. return -1;
  444. if (key1->u32[1] > key2->u32[1])
  445. return 1;
  446. return 0;
  447. }
  448. /**
  449. * keys_eq - determine if keys are equivalent.
  450. * @c: UBIFS file-system description object
  451. * @key1: the first key to compare
  452. * @key2: the second key to compare
  453. *
  454. * This function compares 2 keys and returns %1 if @key1 is equal to @key2 and
  455. * %0 if not.
  456. */
  457. static inline int keys_eq(const struct ubifs_info *c,
  458. const union ubifs_key *key1,
  459. const union ubifs_key *key2)
  460. {
  461. if (key1->u32[0] != key2->u32[0])
  462. return 0;
  463. if (key1->u32[1] != key2->u32[1])
  464. return 0;
  465. return 1;
  466. }
  467. /**
  468. * is_hash_key - is a key vulnerable to hash collisions.
  469. * @c: UBIFS file-system description object
  470. * @key: key
  471. *
  472. * This function returns %1 if @key is a hashed key or %0 otherwise.
  473. */
  474. static inline int is_hash_key(const struct ubifs_info *c,
  475. const union ubifs_key *key)
  476. {
  477. int type = key_type(c, key);
  478. return type == UBIFS_DENT_KEY || type == UBIFS_XENT_KEY;
  479. }
  480. /**
  481. * key_max_inode_size - get maximum file size allowed by current key format.
  482. * @c: UBIFS file-system description object
  483. */
  484. static inline unsigned long long key_max_inode_size(const struct ubifs_info *c)
  485. {
  486. switch (c->key_fmt) {
  487. case UBIFS_SIMPLE_KEY_FMT:
  488. return (1ULL << UBIFS_S_KEY_BLOCK_BITS) * UBIFS_BLOCK_SIZE;
  489. default:
  490. return 0;
  491. }
  492. }
  493. #endif /* !__UBIFS_KEY_H__ */