| /linux-4.19.296/drivers/regulator/ |
| D | of_regulator.c | 376 struct device_node *search, *child; in regulator_of_get_init_data() local
384 search = of_get_child_by_name(dev->of_node, in regulator_of_get_init_data()
387 search = of_node_get(dev->of_node); in regulator_of_get_init_data()
389 if (!search) { in regulator_of_get_init_data()
395 for_each_available_child_of_node(search, child) { in regulator_of_get_init_data()
426 of_node_put(search); in regulator_of_get_init_data()
|
| /linux-4.19.296/lib/ |
| D | interval_tree_test.c | 29 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search() function
111 results += search(&root, start, last); in interval_tree_test_init()
|
| D | Kconfig | 408 it is being modified. It is also reasonably quick to search and
|
| /linux-4.19.296/include/linux/netfilter/ |
| D | nf_conntrack_sip.h | 65 const char *search; member
80 .search = (__search), \
|
| /linux-4.19.296/drivers/pci/ |
| D | Makefile | 6 remove.o pci.o pci-driver.o search.o \
|
| /linux-4.19.296/include/linux/ |
| D | w1.h | 160 void (*search)(void *, struct w1_master *, member
|
| /linux-4.19.296/fs/reiserfs/ |
| D | Kconfig | 17 database and keyword search systems than block allocation based file
|
| /linux-4.19.296/include/media/ |
| D | dvb_frontend.h | 489 enum dvbfe_search (*search)(struct dvb_frontend *fe); member
|
| /linux-4.19.296/fs/btrfs/ |
| D | ctree.c | 2254 u64 search; in reada_for_search() local
2270 search = btrfs_node_blockptr(node, slot); in reada_for_search()
2272 eb = find_extent_buffer(fs_info, search); in reada_for_search()
2278 target = search; in reada_for_search()
2298 search = btrfs_node_blockptr(node, nr); in reada_for_search()
2299 if ((search <= target && target - search <= 65536) || in reada_for_search()
2300 (search > target && search - target <= 65536)) { in reada_for_search()
2301 readahead_tree_block(fs_info, search); in reada_for_search()
|
| D | delayed-inode.c | 1050 goto search; in __btrfs_update_delayed_inode()
1084 search: in __btrfs_update_delayed_inode()
|
| /linux-4.19.296/fs/ocfs2/ |
| D | extent_map.c | 242 search: in ocfs2_extent_map_insert_rec()
268 goto search; in ocfs2_extent_map_insert_rec()
|
| D | xattr.c | 3835 struct ocfs2_xattr_bucket *search; in ocfs2_xattr_bucket_find() local
3838 search = ocfs2_xattr_bucket_new(inode); in ocfs2_xattr_bucket_find()
3839 if (!search) { in ocfs2_xattr_bucket_find()
3845 ret = ocfs2_read_xattr_bucket(search, p_blkno); in ocfs2_xattr_bucket_find()
3851 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3854 ocfs2_xattr_bucket_relse(search); in ocfs2_xattr_bucket_find()
3858 ret = ocfs2_read_xattr_bucket(search, blkno); in ocfs2_xattr_bucket_find()
3864 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3888 ret = ocfs2_find_xe_in_bucket(inode, search, in ocfs2_xattr_bucket_find()
3927 ocfs2_xattr_bucket_free(search); in ocfs2_xattr_bucket_find()
|
| D | suballoc.c | 1493 int search = -ENOSPC; in ocfs2_cluster_group_search() local
1545 search = 0; /* success */ in ocfs2_cluster_group_search()
1555 return search; in ocfs2_cluster_group_search()
|
| D | dir.c | 929 goto search; in ocfs2_dx_dir_search()
958 search: in ocfs2_dx_dir_search()
|
| /linux-4.19.296/drivers/media/dvb-frontends/ |
| D | dib9000.c | 1482 int ret = 10, search = state->channel_status.status == CHANNEL_STATUS_PARAMETERS_UNKNOWN; in dib9000_fw_tune() local
1493 if (search) in dib9000_fw_tune()
1502 if (search) in dib9000_fw_tune()
1511 if (search) in dib9000_fw_tune()
|
| D | cxd2820r_core.c | 513 .search = cxd2820r_search,
|
| D | stb0899_drv.c | 1607 .search = stb0899_search,
|
| D | lgdt3306a.c | 2181 .search = lgdt3306a_search,
|
| D | mb86a16.c | 1825 .search = mb86a16_search,
|
| D | stv0900_core.c | 1900 .search = stv0900_search,
|
| /linux-4.19.296/fs/befs/ |
| D | ChangeLog | 37 * Sergey S. Kostyliov made befs_find_key() use a binary search to find
38 keys within btree nodes, rather than the linear search we were using
|
| /linux-4.19.296/drivers/hid/ |
| D | hid-core.c | 1272 static int search(__s32 *array, __s32 value, unsigned n) in search() function
1401 && search(value, field->value[n], count)) in hid_input_field()
1407 && search(field->value, value[n], count)) in hid_input_field()
|
| /linux-4.19.296/fs/jfs/ |
| D | jfs_xtree.c | 107 uint search; member
255 INCREMENT(xtStat.search); in xtSearch()
3885 xtStat.search, in jfs_xtstat_proc_show()
|
| /linux-4.19.296/fs/gfs2/ |
| D | rgrp.c | 173 static const u64 search[] = { in gfs2_bit_search() local
179 tmp = le64_to_cpu(*ptr) ^ search[state]; in gfs2_bit_search()
|
| /linux-4.19.296/drivers/media/dvb-core/ |
| D | dvb_frontend.c | 758 if (fe->ops.search) { in dvb_frontend_thread()
759 fepriv->algo_status = fe->ops.search(fe); in dvb_frontend_thread()
|