Lines Matching refs:dent

348 	const struct ubifs_dent_node *dent = node;
354 err = ubifs_validate_entry(c, dent);
357 ubifs_dump_node(c, dent, zbr->len);
544 struct ubifs_dent_node *dent = node;
547 key_read(c, &dent->key, &node_key);
560 * @zbr: zbranch of dent
571 struct ubifs_dent_node *dent;
574 /* If possible, match against the dent in the leaf node cache */
576 dent = kmalloc(zbr->len, GFP_NOFS);
577 if (!dent)
580 err = ubifs_tnc_read_node(c, zbr, dent);
585 err = lnc_add_directly(c, zbr, dent);
589 dent = zbr->leaf;
591 nlen = le16_to_cpu(dent->nlen);
592 err = memcmp(dent->name, fname_name(nm), min_t(int, nlen, fname_len(nm)));
606 kfree(dent);
841 * fallible_matches_name - determine if a dent matches a given name.
843 * @zbr: zbranch of dent
859 struct ubifs_dent_node *dent;
862 /* If possible, match against the dent in the leaf node cache */
864 dent = kmalloc(zbr->len, GFP_NOFS);
865 if (!dent)
868 err = fallible_read_node(c, &zbr->key, zbr, dent);
878 err = lnc_add_directly(c, zbr, dent);
882 dent = zbr->leaf;
884 nlen = le16_to_cpu(dent->nlen);
885 err = memcmp(dent->name, fname_name(nm), min_t(int, nlen, fname_len(nm)));
899 kfree(dent);
1039 * @zbr: zbranch of dent
1040 * @lnum: LEB number of dent to match
1041 * @offs: offset of dent to match
1059 * @lnum: LEB number of dent node to match
1060 * @offs: offset of dent node to match
1898 const struct ubifs_dent_node *dent = node;
1908 len = le16_to_cpu(dent->nlen);
1909 if (fname_len(nm) == len && !memcmp(dent->name, fname_name(nm), len))
1921 struct ubifs_dent_node *dent, uint32_t cookie,
1944 err = tnc_read_hashed_node(c, zbr, dent);
1949 le32_to_cpu(dent->cookie) == cookie) {
1961 struct ubifs_dent_node *dent, uint32_t cookie)
1976 err = search_dh_cookie(c, key, dent, cookie, &znode, &n, err);
2001 const struct ubifs_dent_node *dent = node;
2014 if (le32_to_cpu(dent->cookie) == cookie)
2737 struct ubifs_dent_node *dent;
2749 dent = kmalloc(UBIFS_MAX_DENT_NODE_SZ, GFP_NOFS);
2750 if (!dent) {
2755 err = tnc_read_hashed_node(c, zbr, dent);
2760 if (le32_to_cpu(dent->cookie) != cookie) {
2769 err = search_dh_cookie(c, key, dent, cookie, &znode, &n, err);
2784 kfree(dent);
2994 struct ubifs_dent_node *dent;
3043 dent = kmalloc(zbr->len, GFP_NOFS);
3044 if (unlikely(!dent)) {
3060 err = tnc_read_hashed_node(c, zbr, dent);
3065 return dent;
3068 kfree(dent);