Lines Matching refs:data
89 * This is the single most critical data structure when it comes
246 * early because the data cannot match (there can
247 * be no NUL in the ct/tcount data)
1284 * @data: data passed to @enter() and @finish()
1289 static void d_walk(struct dentry *parent, void *data,
1303 ret = enter(data, this_parent);
1327 ret = enter(data, dentry);
1400 static enum d_walk_ret path_check_mount(void *data, struct dentry *dentry)
1402 struct check_mount *info = data;
1424 struct check_mount data = { .mnt = parent->mnt, .mounted = 0 };
1427 d_walk(parent->dentry, &data, path_check_mount);
1430 return data.mounted;
1496 struct select_data *data = _data;
1499 if (data->start == dentry)
1503 data->found++;
1508 d_shrink_add(dentry, &data->dispose);
1509 data->found++;
1517 if (!list_empty(&data->dispose))
1525 struct select_data *data = _data;
1528 if (data->start == dentry)
1534 data->victim = dentry;
1541 d_shrink_add(dentry, &data->dispose);
1548 if (!list_empty(&data->dispose))
1563 struct select_data data = {.start = parent};
1565 INIT_LIST_HEAD(&data.dispose);
1566 d_walk(parent, &data, select_collect);
1568 if (!list_empty(&data.dispose)) {
1569 shrink_dentry_list(&data.dispose);
1574 if (!data.found)
1576 data.victim = NULL;
1577 d_walk(parent, &data, select_collect2);
1578 if (data.victim) {
1580 spin_lock(&data.victim->d_lock);
1581 if (!shrink_lock_dentry(data.victim)) {
1582 spin_unlock(&data.victim->d_lock);
1586 parent = data.victim->d_parent;
1587 if (parent != data.victim)
1588 __dput_to_list(parent, &data.dispose);
1589 __dentry_kill(data.victim);
1592 if (!list_empty(&data.dispose))
1593 shrink_dentry_list(&data.dispose);
3114 static enum d_walk_ret d_genocide_kill(void *data, struct dentry *dentry)
3116 struct dentry *root = data;