Home
last modified time | relevance | path

Searched refs:candidate (Results 1 – 25 of 62) sorted by relevance

123

/linux/fs/netfs/
H A Dfscache_cache.c61 struct fscache_cache *candidate, *cache, *unnamed = NULL; in fscache_lookup_cache() local
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->name = NULL; in fscache_lookup_cache()
133 kfree(candidate->name); in fscache_lookup_cache()
[all …]
H A Dfscache_volume.c154 static void fscache_wait_on_volume_collision(struct fscache_volume *candidate, in fscache_wait_on_volume_collision() argument
157 wait_on_bit_timeout(&candidate->flags, FSCACHE_VOLUME_ACQUIRE_PENDING, in fscache_wait_on_volume_collision()
159 if (fscache_is_acquire_pending(candidate)) { in fscache_wait_on_volume_collision()
161 candidate->debug_id, collidee_debug_id); in fscache_wait_on_volume_collision()
163 wait_on_bit(&candidate->flags, FSCACHE_VOLUME_ACQUIRE_PENDING, in fscache_wait_on_volume_collision()
173 static bool fscache_hash_volume(struct fscache_volume *candidate) in fscache_hash_volume() argument
180 bucket = candidate->key_hash & (ARRAY_SIZE(fscache_volume_hash) - 1); in fscache_hash_volume()
185 if (fscache_volume_same(candidate, cursor)) { in fscache_hash_volume()
190 set_bit(FSCACHE_VOLUME_ACQUIRE_PENDING, &candidate->flags); in fscache_hash_volume()
196 hlist_bl_add_head(&candidate->hash_link, h); in fscache_hash_volume()
[all …]
H A Dfscache_cookie.c382 static void fscache_wait_on_collision(struct fscache_cookie *candidate, in fscache_wait_on_collision() argument
391 candidate->debug_id, wait_for->debug_id); in fscache_wait_on_collision()
401 static bool fscache_hash_cookie(struct fscache_cookie *candidate) in fscache_hash_cookie() argument
408 bucket = candidate->key_hash & (ARRAY_SIZE(fscache_cookie_hash) - 1); in fscache_hash_cookie()
413 if (fscache_cookie_same(candidate, cursor)) { in fscache_hash_cookie()
422 fscache_get_volume(candidate->volume, fscache_volume_get_cookie); in fscache_hash_cookie()
423 atomic_inc(&candidate->volume->n_cookies); in fscache_hash_cookie()
424 hlist_bl_add_head(&candidate->hash_link, h); in fscache_hash_cookie()
425 set_bit(FSCACHE_COOKIE_IS_HASHED, &candidate->flags); in fscache_hash_cookie()
429 fscache_wait_on_collision(candidate, wait_for); in fscache_hash_cookie()
[all …]
/linux/rust/zerocopy/src/util/
H A Dmacros.rs26 ($(#[$attr:meta])* $ty:ty: $trait:ident $(; |$candidate:ident| $is_bit_valid:expr)?) => {{
32 unsafe_impl!(@method $trait $(; |$candidate| $is_bit_valid)?);
95 => $trait:ident for $ty:ty $(; |$candidate:ident| $is_bit_valid:expr)?
102 => $trait for $ty $(; |$candidate| $is_bit_valid)?
108 => $trait:ident for $ty:ty $(; |$candidate:ident| $is_bit_valid:expr)?
114 => $trait for $ty $(; |$candidate| $is_bit_valid)?
122 => $trait:ident for $ty:ty $(; |$candidate:ident| $is_bit_valid:expr)?
130 unsafe_impl!(@method $trait $(; |$candidate| $is_bit_valid)?);
134 (@method TryFromBytes ; |$candidate:ident| $is_bit_valid:expr) => {
140 fn is_bit_valid<Alignment>($candidate: Maybe<'_, Self, Alignment>) -> bool
[all …]
/linux/fs/afs/
H A Dserver.c70 struct afs_server **candidate) in afs_install_server() argument
77 _enter("%p", candidate); in afs_install_server()
86 diff = memcmp(&(*candidate)->uuid, &server->uuid, sizeof(uuid_t)); in afs_install_server()
95 server = *candidate; in afs_install_server()
96 *candidate = NULL; in afs_install_server()
182 struct afs_server *server, *candidate = NULL; in afs_lookup_server() local
202 candidate = afs_alloc_server(cell, uuid); in afs_lookup_server()
203 if (!candidate) { in afs_lookup_server()
209 server = afs_install_server(cell, &candidate); in afs_lookup_server()
244 if (candidate) { in afs_lookup_server()
[all …]
H A Dcell.c247 struct afs_cell *cell, *candidate, *cursor; in afs_lookup_cell() local
273 candidate = afs_alloc_cell(net, name, namesz, vllist); in afs_lookup_cell()
274 if (IS_ERR(candidate)) { in afs_lookup_cell()
275 _leave(" = %ld", PTR_ERR(candidate)); in afs_lookup_cell()
276 return candidate; in afs_lookup_cell()
302 ret = idr_alloc_cyclic(&net->cells_dyn_ino, candidate, in afs_lookup_cell()
306 candidate->dynroot_ino = ret; in afs_lookup_cell()
307 set_bit(AFS_CELL_FL_HAVE_INO, &candidate->flags); in afs_lookup_cell()
309 cell = candidate; in afs_lookup_cell()
310 candidate = NULL; in afs_lookup_cell()
[all …]
H A Dvolume.c137 struct afs_volume *candidate, *volume; in afs_lookup_volume() local
139 candidate = afs_alloc_volume(params, vldb, &slist); in afs_lookup_volume()
140 if (IS_ERR(candidate)) in afs_lookup_volume()
141 return candidate; in afs_lookup_volume()
143 volume = afs_insert_volume_into_cell(params->cell, candidate); in afs_lookup_volume()
144 if (volume == candidate) in afs_lookup_volume()
147 afs_put_volume(candidate, afs_volume_trace_put_cell_dup); in afs_lookup_volume()
/linux/security/keys/
H A Dkey.c52 struct key_user *candidate = NULL, *user; in key_user_lookup() local
74 if (!candidate) { in key_user_lookup()
75 /* allocate a candidate user record if we don't already have in key_user_lookup()
80 candidate = kmalloc_obj(struct key_user); in key_user_lookup()
81 if (unlikely(!candidate)) in key_user_lookup()
91 * second pass - so we use the candidate record */ in key_user_lookup()
92 refcount_set(&candidate->usage, 1); in key_user_lookup()
93 atomic_set(&candidate->nkeys, 0); in key_user_lookup()
94 atomic_set(&candidate->nikeys, 0); in key_user_lookup()
95 candidate in key_user_lookup()
[all...]
/linux/fs/erofs/
H A Dnamei.c95 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()
154 if (!IS_ERR(candidate)) in erofs_find_target_block()
158 return candidate; in erofs_find_target_block()
/linux/drivers/net/wireless/realtek/rtl8xxxu/
H A D8723b.c1097 int i, candidate; in rtl8723bu_phy_iq_calibrate() local
1108 candidate = -1; in rtl8723bu_phy_iq_calibrate()
1122 candidate = 0; in rtl8723bu_phy_iq_calibrate()
1131 candidate = 0; in rtl8723bu_phy_iq_calibrate()
1138 candidate = 1; in rtl8723bu_phy_iq_calibrate()
1144 candidate = 3; in rtl8723bu_phy_iq_calibrate()
1146 candidate = -1; in rtl8723bu_phy_iq_calibrate()
1162 if (candidate >= 0) { in rtl8723bu_phy_iq_calibrate()
1163 reg_e94 = result[candidate][0]; in rtl8723bu_phy_iq_calibrate()
1165 reg_e9c = result[candidate][1]; in rtl8723bu_phy_iq_calibrate()
[all …]
H A Dcore.c2717 int result[][8], int candidate, bool tx_only) in rtl8xxxu_fill_iqk_matrix_a() argument
2729 x = result[candidate][0]; in rtl8xxxu_fill_iqk_matrix_a()
2745 y = result[candidate][1]; in rtl8xxxu_fill_iqk_matrix_a()
2771 reg = result[candidate][2]; in rtl8xxxu_fill_iqk_matrix_a()
2778 reg = result[candidate][3] & 0x3F; in rtl8xxxu_fill_iqk_matrix_a()
2785 reg = (result[candidate][3] >> 6) & 0xF; in rtl8xxxu_fill_iqk_matrix_a()
2794 int result[][8], int candidate, bool tx_only) in rtl8xxxu_fill_iqk_matrix_b() argument
2806 x = result[candidate][4]; in rtl8xxxu_fill_iqk_matrix_b()
2822 y = result[candidate][5]; in rtl8xxxu_fill_iqk_matrix_b()
2848 reg = result[candidate][6]; in rtl8xxxu_fill_iqk_matrix_b()
[all …]
/linux/drivers/dma/
H A Dof-dma.c355 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()
/linux/net/rxrpc/
H A Dpeer_object.c337 struct rxrpc_peer *peer, *candidate; in rxrpc_lookup_peer() local
354 candidate = rxrpc_create_peer(local, srx, hash_key, gfp); in rxrpc_lookup_peer()
355 if (!candidate) { in rxrpc_lookup_peer()
368 &candidate->hash_link, hash_key); in rxrpc_lookup_peer()
369 list_add_tail(&candidate->keepalive_link, in rxrpc_lookup_peer()
376 rxrpc_free_peer(candidate); in rxrpc_lookup_peer()
378 peer = candidate; in rxrpc_lookup_peer()
H A Dconn_client.c252 struct rxrpc_bundle *bundle, *candidate; in rxrpc_look_up_bundle() local
291 candidate = rxrpc_alloc_bundle(call, gfp); in rxrpc_look_up_bundle()
292 if (!candidate) in rxrpc_look_up_bundle()
318 rb_link_node(&candidate->local_node, parent, pp); in rxrpc_look_up_bundle()
319 rb_insert_color(&candidate->local_node, &local->client_bundles); in rxrpc_look_up_bundle()
320 call->bundle = rxrpc_get_bundle(candidate, rxrpc_bundle_get_client_call); in rxrpc_look_up_bundle()
326 rxrpc_free_bundle(candidate); in rxrpc_look_up_bundle()
/linux/kernel/power/
H A Dsuspend_test.c130 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()
/linux/security/tomoyo/
H A Ddomain.c709 const struct tomoyo_path_info *candidate; in tomoyo_find_next_domain() local
750 candidate = &exename; in tomoyo_find_next_domain()
757 candidate = ptr->aggregated_name; in tomoyo_find_next_domain()
763 retval = tomoyo_execute_permission(&ee->r, candidate); in tomoyo_find_next_domain()
775 candidate = ee->r.param.path.matched_path; in tomoyo_find_next_domain()
814 candidate)) { in tomoyo_find_next_domain()
819 candidate->name); in tomoyo_find_next_domain()
830 old_domain->ns->name, candidate->name); in tomoyo_find_next_domain()
852 old_domain->domainname->name, candidate->name); in tomoyo_find_next_domain()
/linux/tools/testing/selftests/kvm/lib/
H A Dsparsebit.c1169 struct node *candidate = NULL; in sparsebit_next_set() local
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()
1204 assert(candidate->idx > lowest_possible); in sparsebit_next_set()
1206 return node_first_set(candidate, 0); in sparsebit_next_set()
1217 start = lowest_possible - candidate->idx; in sparsebit_next_set()
1219 if (start < MASK_BITS && candidate->mask >= (1 << start)) in sparsebit_next_set()
1220 return node_first_set(candidate, start); in sparsebit_next_set()
[all …]
/linux/drivers/iio/
H A Dindustrialio-gts-helper.c208 int *candidate = &scales[t_idx][i * 2]; in do_combined_scaletable() local
211 if (scale_smaller(candidate, &all_scales[new_idx - 2])) { in do_combined_scaletable()
212 all_scales[new_idx] = candidate[0]; in do_combined_scaletable()
213 all_scales[new_idx + 1] = candidate[1]; in do_combined_scaletable()
219 if (!scale_smaller(candidate, &all_scales[chk])) in do_combined_scaletable()
222 if (scale_eq(candidate, &all_scales[chk])) in do_combined_scaletable()
227 all_scales[chk] = candidate[0]; in do_combined_scaletable()
228 all_scales[chk + 1] = candidate[1]; in do_combined_scaletable()
/linux/rust/zerocopy-derive/derive/
H A Dtry_from_bytes.rs376 mut candidate: #zerocopy_crate::Maybe<'_, Self, ___ZcAlignment>, in derive_is_bit_valid()
418 candidate.reborrow().project_transmute_unchecked::< in derive_is_bit_valid()
427 let mut raw_enum = candidate.cast::< in derive_is_bit_valid()
581 mut candidate: #zerocopy_crate::Maybe<'_, Self, ___ZcAlignment>, in derive_try_from_bytes_struct()
587 … let field_candidate = #zerocopy_crate::into_inner!(candidate.reborrow().project::< in derive_try_from_bytes_struct()
629 mut candidate: #zerocopy_crate::Maybe<'_, Self, ___ZcAlignment>, in derive_try_from_bytes_union()
643 candidate.reborrow().project_transmute_unchecked::< in derive_try_from_bytes_union()
/linux/Documentation/admin-guide/mm/
H A Dksm.rst129 candidate for merging match the checksum of an empty
162 Historically KSM checked every candidate page for each scan. It did
182 specifies the target scan time in seconds to scan all the candidate
295 The number of candidate pages for KSM is dynamic. It can be often observed
296 that during the startup of an application more candidate pages need to be
298 sized for the maximum number of candidate pages. The scan time advisor can
302 number of candidate pages to scan. Two advisors are implemented: none and
309 scan all the KSM candidate pages. The parameter ``advisor_target_scan_time``
310 decides how aggressive the scan time advisor scans candidate pages. Lower
/linux/rust/zerocopy/src/
H A Dlib.rs1775 fn is_bit_valid<A>(candidate: Maybe<'_, Self, A>) -> bool in is_bit_valid()
3128 let candidate = match CoreMaybeUninit::<Self>::read_from_bytes(source) { in try_read_from_bytes() localVariable
3129 Ok(candidate) => candidate, in try_read_from_bytes()
3136 unsafe { try_read_from(source, candidate) } in try_read_from_bytes()
3206 let (candidate, suffix) = match CoreMaybeUninit::<Self>::read_from_prefix(source) { in try_read_from_prefix()
3207 Ok(candidate) => candidate, in try_read_from_prefix()
3214 unsafe { try_read_from(source, candidate).map(|slf| (slf, suffix)) } in try_read_from_prefix()
3285 let (prefix, candidate) = match CoreMaybeUninit::<Self>::read_from_suffix(source) { in try_read_from_suffix()
3286 Ok(candidate) => candidate, in try_read_from_suffix()
3293 unsafe { try_read_from(source, candidate).map(|slf| (prefix, slf)) } in try_read_from_suffix()
[all …]
/linux/drivers/net/ethernet/mellanox/mlx5/core/lib/
H A Dsd.c445 struct mlx5_core_dev *candidate; in sd_handle_primary_set() local
452 candidate = peer_sd->primary ? peer : peer_sd->primary_dev; in sd_handle_primary_set()
458 err = mlx5_fs_cmd_query_l2table_silent(candidate, in sd_handle_primary_set()
461 sd_warn(candidate, "Failed to query silent mode for dev: %d\n", in sd_handle_primary_set()
470 dev->pdev->bus->number < candidate->pdev->bus->number; in sd_handle_primary_set()
476 candidate_sd = mlx5_get_sd(candidate); in sd_handle_primary_set()
/linux/Documentation/block/
H A Ddeadline-iosched.rst62 request, or it fits at the front. That is called either a back merge candidate
63 or a front merge candidate. Due to the way files are typically laid out,
/linux/security/apparmor/
H A Ddomain.c396 struct aa_profile *profile, *candidate = NULL; in find_attach() local
475 candidate = profile; in find_attach()
485 candidate = profile; in find_attach()
490 if (!candidate || conflict) { in find_attach()
498 candidate = aa_get_newest_profile(candidate); in find_attach()
501 return &candidate->label; in find_attach()
/linux/drivers/dma/qcom/
H A Dqcom_adm.c721 struct dma_chan *chan, *candidate = NULL; in adm_dma_xlate() local
729 candidate = chan; in adm_dma_xlate()
733 if (!candidate) in adm_dma_xlate()
736 achan = to_adm_chan(candidate); in adm_dma_xlate()
742 return dma_get_slave_channel(candidate); in adm_dma_xlate()

123