Lines Matching defs:nm

531  * @nm: name to match
534 * @nm. Returns %NAME_MATCHES if it does, %NAME_LESS if the name referred by
535 * @zbr is less than @nm, and %NAME_GREATER if it is greater than @nm. In case
539 const struct qstr *nm)
562 err = memcmp(dent->name, nm->name, min_t(int, nlen, nm->len));
564 if (nlen == nm->len)
566 else if (nlen < nm->len)
697 * @nm: name of the entry
702 * %0 is returned if @nm is not found and @zn and @n are set to the previous
703 * entry, i.e. to the entry after which @nm could follow if it were in TNC.
709 const struct qstr *nm)
713 err = matches_name(c, &(*zn)->zbranch[*n], nm);
774 err = matches_name(c, &(*zn)->zbranch[*n], nm);
796 err = matches_name(c, &znode->zbranch[nn], nm);
814 * @nm: name to match
820 * @nm. Returns %NAME_MATCHES it does, %NAME_LESS if the name referred by @zbr
821 * is less than @nm, %NAME_GREATER if it is greater than @nm, and @NOT_ON_MEDIA
827 const struct qstr *nm)
855 err = memcmp(dent->name, nm->name, min_t(int, nlen, nm->len));
857 if (nlen == nm->len)
859 else if (nlen < nm->len)
879 * @nm: name of directory entry
888 * o if @nm was found, %1 is returned and @zn and @n are set to the found
890 * o if we are @adding and @nm was not found, %0 is returned;
891 * o if we are not @adding and @nm was not found, but a dangling branch was
898 const struct qstr *nm, int adding)
903 cmp = fallible_matches_name(c, &znode->zbranch[nn], nm);
947 err = fallible_matches_name(c, &(*zn)->zbranch[*n], nm);
978 err = fallible_matches_name(c, &znode->zbranch[nn], nm);
1804 * @nm: node name
1813 void *node, const struct qstr *nm)
1818 dbg_tnck(key, "name '%.*s' key ", nm->len, nm->name);
1831 err = resolve_collision(c, key, &znode, &n, nm);
1852 * @nm: node name
1861 void *node, const struct qstr *nm)
1875 if (nm->len == len && !memcmp(dent->name, nm->name, len))
1882 return do_lookup_nm(c, key, node, nm);
2297 * @nm: node name
2303 int lnum, int offs, int len, const struct qstr *nm)
2310 lnum, offs, nm->len, nm->name);
2320 nm, 1);
2322 found = resolve_collision(c, key, &znode, &n, nm);
2533 * @nm: directory entry name
2538 const struct qstr *nm)
2544 dbg_tnck(key, "%.*s, key ", nm->len, nm->name);
2552 nm, 0);
2554 err = resolve_collision(c, key, &znode, &n, nm);
2693 struct qstr nm = { .name = NULL };
2706 xent = ubifs_tnc_next_ent(c, &key1, &nm);
2718 nm.name = xent->name;
2719 nm.len = le16_to_cpu(xent->nlen);
2720 err = ubifs_tnc_remove_nm(c, &key1, &nm);
2750 * @nm: name of last entry found or %NULL
2753 * after the given key (@key) if there is one. @nm is used to resolve
2757 * @nm->name has to be %NULL. In this case the semantics of this function is a
2771 const struct qstr *nm)
2779 dbg_tnck(key, "%s ", nm->name ? (char *)nm->name : "(lowest)");
2787 if (nm->name) {
2792 nm, 0);
2794 err = resolve_collision(c, key, &znode, &n, nm);