Home
last modified time | relevance | path

Searched refs:entry2 (Results 1 – 17 of 17) sorted by relevance

/linux/fs/ext2/
H A Dxattr.c901 struct ext2_xattr_entry *entry1, *entry2; in ext2_xattr_cmp() local
904 entry2 = ENTRY(header2+1); in ext2_xattr_cmp()
906 if (IS_LAST_ENTRY(entry2)) in ext2_xattr_cmp()
908 if (entry1->e_hash != entry2->e_hash || in ext2_xattr_cmp()
909 entry1->e_name_index != entry2->e_name_index || in ext2_xattr_cmp()
910 entry1->e_name_len != entry2->e_name_len || in ext2_xattr_cmp()
911 entry1->e_value_size != entry2->e_value_size || in ext2_xattr_cmp()
912 memcmp(entry1->e_name, entry2->e_name, entry1->e_name_len)) in ext2_xattr_cmp()
914 if (entry1->e_value_block != 0 || entry2->e_value_block != 0) in ext2_xattr_cmp()
917 (char *)header2 + le16_to_cpu(entry2->e_value_offs), in ext2_xattr_cmp()
[all …]
/linux/drivers/net/ethernet/netronome/nfp/flower/
H A Dconntrack.c221 struct nfp_fl_ct_flow_entry *entry2) in nfp_ct_merge_check_cannot_skip() argument
225 entry2->type == CT_TYPE_POST_CT) in nfp_ct_merge_check_cannot_skip()
237 struct nfp_fl_ct_flow_entry *entry2) in nfp_ct_merge_check() argument
243 entry2->rule->match.dissector->used_keys; in nfp_ct_merge_check()
254 if (entry1->netdev && entry2->netdev && in nfp_ct_merge_check()
255 entry1->netdev != entry2->netdev) in nfp_ct_merge_check()
265 flow_rule_match_control(entry2->rule, &match2); in nfp_ct_merge_check()
275 flow_rule_match_basic(entry2->rule, &match2); in nfp_ct_merge_check()
294 nfp_ct_merge_check_cannot_skip(entry1, entry2)) { in nfp_ct_merge_check()
298 flow_rule_match_ipv4_addrs(entry2->rule, &match2); in nfp_ct_merge_check()
[all …]
/linux/drivers/infiniband/hw/irdma/
H A Duda.c179 struct irdma_mcast_grp_ctx_entry_info *entry2) in irdma_compare_mgs() argument
181 if (entry1->dest_port == entry2->dest_port && in irdma_compare_mgs()
182 entry1->qp_id == entry2->qp_id) in irdma_compare_mgs()
/linux/fs/ext4/
H A Dblock_validity.c47 struct ext4_system_zone *entry2) in can_merge() argument
49 if ((entry1->start_blk + entry1->count) == entry2->start_blk && in can_merge()
50 entry1->ino == entry2->ino) in can_merge()
H A Dxattr.c3071 struct ext4_xattr_entry *entry1, *entry2; in ext4_xattr_cmp() local
3074 entry2 = ENTRY(header2+1); in ext4_xattr_cmp()
3076 if (IS_LAST_ENTRY(entry2)) in ext4_xattr_cmp()
3078 if (entry1->e_hash != entry2->e_hash || in ext4_xattr_cmp()
3079 entry1->e_name_index != entry2->e_name_index || in ext4_xattr_cmp()
3080 entry1->e_name_len != entry2->e_name_len || in ext4_xattr_cmp()
3081 entry1->e_value_size != entry2->e_value_size || in ext4_xattr_cmp()
3082 entry1->e_value_inum != entry2->e_value_inum || in ext4_xattr_cmp()
3083 memcmp(entry1->e_name, entry2->e_name, entry1->e_name_len)) in ext4_xattr_cmp()
3087 (char *)header2 + le16_to_cpu(entry2->e_value_offs), in ext4_xattr_cmp()
[all …]
/linux/include/linux/
H A Dlist.h265 * list_swap - replace entry1 with entry2 and re-add entry1 at entry2's position
266 * @entry1: the location to place entry2
267 * @entry2: the location to place entry1
270 struct list_head *entry2) in list_swap() argument
272 struct list_head *pos = entry2->prev; in list_swap()
274 list_del(entry2); in list_swap()
275 list_replace(entry1, entry2); in list_swap()
277 pos = entry2; in list_swap()
/linux/fs/bcachefs/
H A Dbtree_trans_commit.c832 for (struct jset_entry *entry2 = trans->journal_entries; in bch2_trans_commit_write_locked() local
833 entry2 != entry; in bch2_trans_commit_write_locked()
834 entry2 = vstruct_next(entry2)) in bch2_trans_commit_write_locked()
835 if (entry2->type == BCH_JSET_ENTRY_write_buffer_keys && in bch2_trans_commit_write_locked()
836 entry2->start->k.type == KEY_TYPE_accounting) { in bch2_trans_commit_write_locked()
837 struct bkey_s_accounting a = bkey_i_to_s_accounting(entry2->start); in bch2_trans_commit_write_locked()
H A Dextents.c922 const union bch_extent_entry *entry1, *entry2; in bch2_extents_match() local
929 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2) in bch2_extents_match()
968 union bch_extent_entry *entry2; in bch2_extent_has_ptr() local
971 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2) in bch2_extent_has_ptr()
976 return &entry2->ptr; in bch2_extent_has_ptr()
/linux/mm/
H A Ddebug_vm_pgtable.c808 swp_entry_t entry, entry2; in pte_swap_exclusive_tests() local
822 entry2 = pte_to_swp_entry(pte); in pte_swap_exclusive_tests()
823 WARN_ON(memcmp(&entry, &entry2, sizeof(entry))); in pte_swap_exclusive_tests()
829 entry2 = pte_to_swp_entry(pte); in pte_swap_exclusive_tests()
830 WARN_ON(memcmp(&entry, &entry2, sizeof(entry))); in pte_swap_exclusive_tests()
835 entry2 = pte_to_swp_entry(pte); in pte_swap_exclusive_tests()
836 WARN_ON(memcmp(&entry, &entry2, sizeof(entry))); in pte_swap_exclusive_tests()
/linux/drivers/pci/controller/cadence/
H A Dpcie-cadence-host.c386 struct resource_entry *entry1, *entry2; in cdns_pcie_host_dma_ranges_cmp() local
389 entry2 = container_of(b, struct resource_entry, node); in cdns_pcie_host_dma_ranges_cmp()
391 return resource_size(entry2->res) - resource_size(entry1->res); in cdns_pcie_host_dma_ranges_cmp()
/linux/Documentation/locking/
H A Dww-mutex-design.rst189 struct obj_entry *entry, *entry2;
196 entry2 = entry;
198 list_for_each_entry_continue_reverse (entry2, list, head)
199 ww_mutex_unlock(&entry2->obj->lock);
/linux/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c2911 struct xfs_attr_leaf_entry *entry2; in xfs_attr3_leaf_flipflags() local
2950 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; in xfs_attr3_leaf_flipflags()
2970 if (entry2->flags & XFS_ATTR_LOCAL) { in xfs_attr3_leaf_flipflags()
2979 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); in xfs_attr3_leaf_flipflags()
2985 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); in xfs_attr3_leaf_flipflags()
2999 entry2->flags |= XFS_ATTR_INCOMPLETE; in xfs_attr3_leaf_flipflags()
3001 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); in xfs_attr3_leaf_flipflags()
3002 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { in xfs_attr3_leaf_flipflags()
/linux/drivers/char/ipmi/
H A Dipmi_devintf.c894 struct ipmi_reg_list *entry, *entry2; in cleanup_ipmi() local
896 list_for_each_entry_safe(entry, entry2, &reg_list, link) { in cleanup_ipmi()
/linux/lib/
H A Dtest_maple_tree.c394 void *entry, *entry2; in check_find() local
583 entry2 = mas_prev(&mas, 0); in check_find()
586 MT_BUG_ON(mt, entry != entry2); in check_find()
594 entry2 = mas_prev(&mas, 0); in check_find()
595 MT_BUG_ON(mt, entry != entry2); in check_find()
/linux/drivers/staging/media/ipu3/include/uapi/
H A Dintel-ipu3.h2427 __u32 entry2:6; member
/linux/fs/ocfs2/
H A Ddir.c3494 const struct ocfs2_dx_entry *entry2 = b; in dx_leaf_sort_cmp() local
3496 u32 major_hash2 = le32_to_cpu(entry2->dx_major_hash); in dx_leaf_sort_cmp()
3498 u32 minor_hash2 = le32_to_cpu(entry2->dx_minor_hash); in dx_leaf_sort_cmp()
/linux/tools/testing/radix-tree/
H A Dmaple.c34825 void *entry2; /* The second entry value */ member
34856 if (entry == test->entry2) { in eval_rcu_entry()
34986 mtree_store_range(mt, vals->index, vals->last, vals->entry2, in run_check_rcu()
35087 (index % 2 ? vals->entry2 : vals->entry3), in run_check_rcu_slowread()
35280 vals.entry2 = xa_mk_value(8650); in check_rcu_threaded()
35303 vals.entry2 = xa_mk_value(439); in check_rcu_threaded()
35340 vals.entry2 = xa_mk_value(439); in check_rcu_threaded()