Lines Matching defs:in

27  * cmp_fnames - Compare two names in index.
215 const struct INDEX_NAMES *in = &s_index_names[indx->type];
219 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
479 const struct INDEX_NAMES *in = &s_index_names[indx->type];
482 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
527 const struct INDEX_NAMES *in = &s_index_names[indx->type];
530 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
600 /* Now we just make room for the inserted entries and jam it in. */
834 /* Now we just make room for the entry and jam it in. */
999 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1002 a = ni_find_attr(ni, NULL, &le, ATTR_ROOT, in->name, in->name_len, NULL,
1046 struct indx_node *in = *node;
1049 if (!in) {
1050 in = kzalloc(sizeof(struct indx_node), GFP_NOFS);
1051 if (!in)
1054 nb_put(&in->nb);
1057 ib = in->index;
1067 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1087 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1104 ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &in->nb, 0);
1115 in->index = ib;
1116 *node = in;
1125 if (ib != in->index)
1128 if (*node != in) {
1129 nb_put(&in->nb);
1130 kfree(in);
1416 /* 'e' points in root, */
1419 /* 'e' points in index, */
1441 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1452 err = ni_insert_nonresident(ni, ATTR_ALLOC, in->name, in->name_len,
1460 in->name, in->name_len, &bitmap, NULL, NULL);
1464 if (in->name == I30_NAME) {
1497 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1520 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1528 alloc = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, in->name, in->name_len,
1538 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
1547 if (in->name == I30_NAME)
1556 attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1589 /* Get the record this root placed in. */
1897 /* Insert in root. */
2050 const struct INDEX_NAMES *in = &s_index_names[indx->type];
2052 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
2088 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2093 if (in->name == I30_NAME)
2100 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2267 const struct INDEX_NAMES *in;
2418 struct indx_node *in;
2422 in = indx_find_buffer(indx, ni, root, sub_vbn, NULL);
2423 if (IS_ERR(in)) {
2424 err = PTR_ERR(in);
2428 if (in)
2429 fnd_push(fnd, in, NULL);
2441 struct indx_node *in = fnd->nodes[level - 1];
2443 ib = in->index;
2448 n2d = in;
2575 in = &s_index_names[indx->type];
2577 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2579 if (in->name == I30_NAME)
2582 err = ni_remove_attr(ni, ATTR_ALLOC, in->name, in->name_len,
2586 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2588 err = ni_remove_attr(ni, ATTR_BITMAP, in->name, in->name_len,
2634 * Update duplicated information in directory entry
2659 /* Find entry in directory. */
2679 * Nothing to update in index! Try to avoid this call.
2687 /* Directory entry in index. */
2690 /* Directory entry in directory MFT record. */