| /kernel/linux/linux-5.10/fs/fscache/ |
| H A D | netfs.c | 18 struct fscache_cookie *candidate, *cookie; in __fscache_register_netfs() local
23 candidate = fscache_alloc_cookie(&fscache_fsdef_index, in __fscache_register_netfs()
28 if (!candidate) { in __fscache_register_netfs()
33 candidate->flags = 1 << FSCACHE_COOKIE_ENABLED; in __fscache_register_netfs()
36 cookie = fscache_hash_cookie(candidate); in __fscache_register_netfs()
39 if (cookie != candidate) { in __fscache_register_netfs()
40 trace_fscache_cookie(candidate, fscache_cookie_discard, 1); in __fscache_register_netfs()
41 fscache_free_cookie(candidate); in __fscache_register_netfs()
55 fscache_cookie_put(candidate, fscache_cookie_put_dup_netfs); in __fscache_register_netfs()
|
| H A D | cookie.c | 183 struct fscache_cookie *fscache_hash_cookie(struct fscache_cookie *candidate) in fscache_hash_cookie() argument
190 bucket = candidate->key_hash & (ARRAY_SIZE(fscache_cookie_hash) - 1); in fscache_hash_cookie()
195 if (fscache_compare_cookie(candidate, cursor) == 0) in fscache_hash_cookie()
199 __set_bit(FSCACHE_COOKIE_ACQUIRED, &candidate->flags); in fscache_hash_cookie()
200 fscache_cookie_get(candidate->parent, fscache_cookie_get_acquire_parent); in fscache_hash_cookie()
201 atomic_inc(&candidate->parent->n_children); in fscache_hash_cookie()
202 hlist_bl_add_head(&candidate->hash_link, h); in fscache_hash_cookie()
204 return candidate; in fscache_hash_cookie()
212 fscache_print_cookie(candidate, 'N'); in fscache_hash_cookie()
246 struct fscache_cookie *candidate, *cooki in __fscache_acquire_cookie() local
[all...] |
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/runtime/binary/src/ |
| H A D | binary.c | 1022 struct ia_css_binary_info *candidate = &xcandidate->sp; in __ia_css_binary_find() local
1023 /* printf("sh_css_binary_find: evaluating candidate: in __ia_css_binary_find()
1024 * %d\n",candidate->id); */ in __ia_css_binary_find()
1026 "ia_css_binary_find() candidate = %p, mode = %d ID = %d\n", in __ia_css_binary_find()
1027 candidate, candidate->pipeline.mode, candidate->id); in __ia_css_binary_find()
1034 if (!candidate->enable.continuous && in __ia_css_binary_find()
1038 __LINE__, candidate->enable.continuous, in __ia_css_binary_find()
1043 if (striped && candidate in __ia_css_binary_find()
[all...] |
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/runtime/binary/src/ |
| H A D | binary.c | 1493 struct ia_css_binary_info *candidate = &xcandidate->sp; in __ia_css_binary_find() local
1494 /* printf("sh_css_binary_find: evaluating candidate: in __ia_css_binary_find()
1495 * %d\n",candidate->id); */ in __ia_css_binary_find()
1497 "ia_css_binary_find() candidate = %p, mode = %d ID = %d\n", in __ia_css_binary_find()
1498 candidate, candidate->pipeline.mode, candidate->id); in __ia_css_binary_find()
1505 if (!candidate->enable.continuous && in __ia_css_binary_find()
1509 __LINE__, candidate->enable.continuous, in __ia_css_binary_find()
1514 if (striped && candidate in __ia_css_binary_find()
[all...] |
| /kernel/linux/linux-6.6/fs/fscache/ |
| H A D | cache.c | 61 struct fscache_cache *candidate, *cache, *unnamed = NULL; in fscache_lookup_cache() local
85 /* the cache does not exist - create a candidate */ in fscache_lookup_cache()
86 candidate = fscache_alloc_cache(name); in fscache_lookup_cache()
87 if (!candidate) in fscache_lookup_cache()
117 list_add_tail(&candidate->cache_link, &fscache_caches); in fscache_lookup_cache()
118 trace_fscache_cache(candidate->debug_id, in fscache_lookup_cache()
119 refcount_read(&candidate->ref), in fscache_lookup_cache()
122 return candidate; in fscache_lookup_cache()
129 cache->name = candidate->name; in fscache_lookup_cache()
130 candidate in fscache_lookup_cache()
[all...] |
| H A D | volume.c | 141 static void fscache_wait_on_volume_collision(struct fscache_volume *candidate, in fscache_wait_on_volume_collision() argument
144 wait_on_bit_timeout(&candidate->flags, FSCACHE_VOLUME_ACQUIRE_PENDING, in fscache_wait_on_volume_collision()
146 if (fscache_is_acquire_pending(candidate)) { in fscache_wait_on_volume_collision()
148 candidate->debug_id, collidee_debug_id); in fscache_wait_on_volume_collision()
150 wait_on_bit(&candidate->flags, FSCACHE_VOLUME_ACQUIRE_PENDING, in fscache_wait_on_volume_collision()
160 static bool fscache_hash_volume(struct fscache_volume *candidate) in fscache_hash_volume() argument
167 bucket = candidate->key_hash & (ARRAY_SIZE(fscache_volume_hash) - 1); in fscache_hash_volume()
172 if (fscache_volume_same(candidate, cursor)) { in fscache_hash_volume()
177 set_bit(FSCACHE_VOLUME_ACQUIRE_PENDING, &candidate->flags); in fscache_hash_volume()
183 hlist_bl_add_head(&candidate in fscache_hash_volume()
[all...] |
| /kernel/linux/linux-5.10/net/rxrpc/ |
| H A D | conn_client.c | 276 struct rxrpc_bundle *bundle, *candidate; in rxrpc_look_up_bundle() local
311 candidate = rxrpc_alloc_bundle(cp, gfp); in rxrpc_look_up_bundle()
312 if (!candidate) in rxrpc_look_up_bundle()
338 candidate->debug_id = atomic_inc_return(&rxrpc_bundle_id); in rxrpc_look_up_bundle()
339 rb_link_node(&candidate->local_node, parent, pp); in rxrpc_look_up_bundle()
340 rb_insert_color(&candidate->local_node, &local->client_bundles); in rxrpc_look_up_bundle()
341 rxrpc_get_bundle(candidate); in rxrpc_look_up_bundle()
343 _leave(" = %u [new]", candidate->debug_id); in rxrpc_look_up_bundle()
344 return candidate; in rxrpc_look_up_bundle()
347 rxrpc_free_bundle(candidate); in rxrpc_look_up_bundle()
410 struct rxrpc_connection *candidate = NULL, *old = NULL; global() variable
464 rxrpc_put_connection(candidate); global() variable
[all...] |
| H A D | peer_object.c | 335 struct rxrpc_peer *peer, *candidate; in rxrpc_lookup_peer() local
349 /* The peer is not yet present in hash - create a candidate in rxrpc_lookup_peer()
352 candidate = rxrpc_create_peer(rx, local, srx, hash_key, gfp); in rxrpc_lookup_peer()
353 if (!candidate) { in rxrpc_lookup_peer()
366 &candidate->hash_link, hash_key); in rxrpc_lookup_peer()
367 list_add_tail(&candidate->keepalive_link, in rxrpc_lookup_peer()
374 rxrpc_free_peer(candidate); in rxrpc_lookup_peer()
376 peer = candidate; in rxrpc_lookup_peer()
|
| /kernel/linux/linux-5.10/fs/erofs/ |
| H A D | namei.c | 97 struct page *candidate = ERR_PTR(-ENOENT); in find_target_block_classic() local
148 if (!IS_ERR(candidate)) in find_target_block_classic()
149 put_page(candidate); in find_target_block_classic()
150 candidate = page; in find_target_block_classic()
160 out: /* free if the candidate is valid */ in find_target_block_classic()
161 if (!IS_ERR(candidate)) in find_target_block_classic()
162 put_page(candidate); in find_target_block_classic()
165 return candidate; in find_target_block_classic()
|
| /kernel/linux/linux-5.10/fs/afs/ |
| H A D | server.c | 139 struct afs_server *candidate) in afs_install_server()
147 _enter("%p", candidate); in afs_install_server()
158 diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t)); in afs_install_server()
178 rcu_assign_pointer(server->uuid_next, candidate); in afs_install_server()
179 candidate->uuid_prev = server; in afs_install_server()
180 server = candidate; in afs_install_server()
185 server = candidate; in afs_install_server()
287 struct afs_server *server, *candidate; in afs_lookup_server() local
302 candidate = afs_alloc_server(cell, uuid, alist); in afs_lookup_server()
303 if (!candidate) { in afs_lookup_server()
138 afs_install_server(struct afs_cell *cell, struct afs_server *candidate) afs_install_server() argument
[all...] |
| H A D | volume.c | 122 struct afs_volume *candidate, *volume; in afs_lookup_volume() local
124 candidate = afs_alloc_volume(params, vldb, type_mask); in afs_lookup_volume()
125 if (IS_ERR(candidate)) in afs_lookup_volume()
126 return candidate; in afs_lookup_volume()
128 volume = afs_insert_volume_into_cell(params->cell, candidate); in afs_lookup_volume()
129 if (volume != candidate) in afs_lookup_volume()
130 afs_put_volume(params->net, candidate, afs_volume_trace_put_cell_dup); in afs_lookup_volume()
158 * Look up a volume in the VL server and create a candidate volume record for
|
| /kernel/linux/linux-6.6/fs/afs/ |
| H A D | server.c | 139 struct afs_server *candidate) in afs_install_server()
147 _enter("%p", candidate); in afs_install_server()
158 diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t)); in afs_install_server()
178 rcu_assign_pointer(server->uuid_next, candidate); in afs_install_server()
179 candidate->uuid_prev = server; in afs_install_server()
180 server = candidate; in afs_install_server()
185 server = candidate; in afs_install_server()
288 struct afs_server *server, *candidate; in afs_lookup_server() local
303 candidate = afs_alloc_server(cell, uuid, alist); in afs_lookup_server()
304 if (!candidate) { in afs_lookup_server()
138 afs_install_server(struct afs_cell *cell, struct afs_server *candidate) afs_install_server() argument
[all...] |
| H A D | volume.c | 123 struct afs_volume *candidate, *volume; in afs_lookup_volume() local
125 candidate = afs_alloc_volume(params, vldb, type_mask); in afs_lookup_volume()
126 if (IS_ERR(candidate)) in afs_lookup_volume()
127 return candidate; in afs_lookup_volume()
129 volume = afs_insert_volume_into_cell(params->cell, candidate); in afs_lookup_volume()
130 if (volume != candidate) in afs_lookup_volume()
131 afs_put_volume(params->net, candidate, afs_volume_trace_put_cell_dup); in afs_lookup_volume()
159 * Look up a volume in the VL server and create a candidate volume record for
|
| /kernel/linux/linux-5.10/security/keys/ |
| H A D | key.c | 53 struct key_user *candidate = NULL, *user; in key_user_lookup() local
75 if (!candidate) { in key_user_lookup()
76 /* allocate a candidate user record if we don't already have in key_user_lookup()
81 candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL); in key_user_lookup()
82 if (unlikely(!candidate)) in key_user_lookup()
92 * second pass - so we use the candidate record */ in key_user_lookup()
93 refcount_set(&candidate->usage, 1); in key_user_lookup()
94 atomic_set(&candidate->nkeys, 0); in key_user_lookup()
95 atomic_set(&candidate->nikeys, 0); in key_user_lookup()
96 candidate in key_user_lookup()
[all...] |
| /kernel/linux/linux-6.6/security/keys/ |
| H A D | key.c | 53 struct key_user *candidate = NULL, *user; in key_user_lookup() local
75 if (!candidate) { in key_user_lookup()
76 /* allocate a candidate user record if we don't already have in key_user_lookup()
81 candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL); in key_user_lookup()
82 if (unlikely(!candidate)) in key_user_lookup()
92 * second pass - so we use the candidate record */ in key_user_lookup()
93 refcount_set(&candidate->usage, 1); in key_user_lookup()
94 atomic_set(&candidate->nkeys, 0); in key_user_lookup()
95 atomic_set(&candidate->nikeys, 0); in key_user_lookup()
96 candidate in key_user_lookup()
[all...] |
| /kernel/linux/linux-6.6/fs/erofs/ |
| H A D | namei.c | 95 void *candidate = ERR_PTR(-ENOENT); in erofs_find_target_block() local
140 if (!IS_ERR(candidate)) in erofs_find_target_block()
149 candidate = de; in erofs_find_target_block()
153 out: /* free if the candidate is valid */ in erofs_find_target_block()
154 if (!IS_ERR(candidate)) in erofs_find_target_block()
158 return candidate; in erofs_find_target_block()
|
| /kernel/linux/linux-5.10/kernel/power/ |
| H A D | suspend_test.c | 130 struct rtc_device *candidate = to_rtc_device(dev); in has_wakealarm() local
132 if (!candidate->ops->set_alarm) in has_wakealarm()
134 if (!device_may_wakeup(candidate->dev.parent)) in has_wakealarm()
|
| /kernel/linux/linux-6.6/kernel/power/ |
| H A D | suspend_test.c | 130 struct rtc_device *candidate = to_rtc_device(dev); in has_wakealarm() local
132 if (!test_bit(RTC_FEATURE_ALARM, candidate->features)) in has_wakealarm()
134 if (!device_may_wakeup(candidate->dev.parent)) in has_wakealarm()
|
| /kernel/linux/linux-5.10/security/tomoyo/ |
| H A D | domain.c | 710 const struct tomoyo_path_info *candidate; in tomoyo_find_next_domain() local
741 candidate = &exename; in tomoyo_find_next_domain()
748 candidate = ptr->aggregated_name; in tomoyo_find_next_domain()
754 retval = tomoyo_execute_permission(&ee->r, candidate); in tomoyo_find_next_domain()
766 candidate = ee->r.param.path.matched_path; in tomoyo_find_next_domain()
806 candidate)) { in tomoyo_find_next_domain()
811 candidate->name); in tomoyo_find_next_domain()
822 old_domain->ns->name, candidate->name); in tomoyo_find_next_domain()
844 old_domain->domainname->name, candidate->name); in tomoyo_find_next_domain()
|
| /kernel/linux/linux-6.6/security/tomoyo/ |
| H A D | domain.c | 708 const struct tomoyo_path_info *candidate; in tomoyo_find_next_domain() local
739 candidate = &exename; in tomoyo_find_next_domain()
746 candidate = ptr->aggregated_name; in tomoyo_find_next_domain()
752 retval = tomoyo_execute_permission(&ee->r, candidate); in tomoyo_find_next_domain()
764 candidate = ee->r.param.path.matched_path; in tomoyo_find_next_domain()
803 candidate)) { in tomoyo_find_next_domain()
808 candidate->name); in tomoyo_find_next_domain()
819 old_domain->ns->name, candidate->name); in tomoyo_find_next_domain()
841 old_domain->domainname->name, candidate->name); in tomoyo_find_next_domain()
|
| /kernel/linux/linux-5.10/drivers/dma/ |
| H A D | of-dma.c | 345 struct dma_chan *chan, *candidate = NULL; in of_dma_xlate_by_chan_id() local
352 candidate = chan; in of_dma_xlate_by_chan_id()
356 if (!candidate) in of_dma_xlate_by_chan_id()
359 return dma_get_slave_channel(candidate); in of_dma_xlate_by_chan_id()
|
| /kernel/linux/linux-6.6/drivers/dma/ |
| H A D | of-dma.c | 355 struct dma_chan *chan, *candidate = NULL; in of_dma_xlate_by_chan_id() local
362 candidate = chan; in of_dma_xlate_by_chan_id()
366 if (!candidate) in of_dma_xlate_by_chan_id()
369 return dma_get_slave_channel(candidate); in of_dma_xlate_by_chan_id()
|
| /kernel/linux/linux-5.10/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 1167 * Find the leftmost 'candidate' overlapping or to the right in sparsebit_next_set()
1170 struct node *candidate = NULL; in sparsebit_next_set() local
1172 /* True iff lowest_possible is within candidate */ in sparsebit_next_set()
1183 candidate = nodep; in sparsebit_next_set()
1184 if (candidate->idx <= lowest_possible) { in sparsebit_next_set()
1193 if (!candidate) in sparsebit_next_set()
1196 assert(candidate->mask != 0); in sparsebit_next_set()
1198 /* Does the candidate node describe the setting of lowest_possible? */ in sparsebit_next_set()
1205 assert(candidate->idx > lowest_possible); in sparsebit_next_set()
1207 return node_first_set(candidate, in sparsebit_next_set()
[all...] |
| /kernel/linux/linux-6.6/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 1166 * Find the leftmost 'candidate' overlapping or to the right in sparsebit_next_set()
1169 struct node *candidate = NULL; in sparsebit_next_set() local
1171 /* True iff lowest_possible is within candidate */ in sparsebit_next_set()
1182 candidate = nodep; in sparsebit_next_set()
1183 if (candidate->idx <= lowest_possible) { in sparsebit_next_set()
1192 if (!candidate) in sparsebit_next_set()
1195 assert(candidate->mask != 0); in sparsebit_next_set()
1197 /* Does the candidate node describe the setting of lowest_possible? */ in sparsebit_next_set()
1204 assert(candidate->idx > lowest_possible); in sparsebit_next_set()
1206 return node_first_set(candidate, in sparsebit_next_set()
[all...] |
| /kernel/linux/linux-6.6/net/rxrpc/ |
| H A D | peer_object.c | 326 struct rxrpc_peer *peer, *candidate; in rxrpc_lookup_peer() local
340 /* The peer is not yet present in hash - create a candidate in rxrpc_lookup_peer()
343 candidate = rxrpc_create_peer(local, srx, hash_key, gfp); in rxrpc_lookup_peer()
344 if (!candidate) { in rxrpc_lookup_peer()
357 &candidate->hash_link, hash_key); in rxrpc_lookup_peer()
358 list_add_tail(&candidate->keepalive_link, in rxrpc_lookup_peer()
365 rxrpc_free_peer(candidate); in rxrpc_lookup_peer()
367 peer = candidate; in rxrpc_lookup_peer()
|