Home
last modified time | relevance | path

Searched refs:entry2 (Results 1 – 11 of 11) 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()
/linux/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c2898 struct xfs_attr_leaf_entry *entry2; in xfs_attr3_leaf_flipflags() local
2937 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2]; in xfs_attr3_leaf_flipflags()
2957 if (entry2->flags & XFS_ATTR_LOCAL) { in xfs_attr3_leaf_flipflags()
2966 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval)); in xfs_attr3_leaf_flipflags()
2972 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0); in xfs_attr3_leaf_flipflags()
2986 entry2->flags |= XFS_ATTR_INCOMPLETE; in xfs_attr3_leaf_flipflags()
2988 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2))); in xfs_attr3_leaf_flipflags()
2989 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) { in xfs_attr3_leaf_flipflags()
/linux/drivers/acpi/
H A Dpci_root.c806 struct resource_entry *tmp, *entry, *entry2; in acpi_pci_root_validate_resources() local
834 resource_list_for_each_entry(entry2, resources) { in acpi_pci_root_validate_resources()
835 res2 = entry2->res; in acpi_pci_root_validate_resources()
/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/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/fs/ocfs2/
H A Ddir.c3548 const struct ocfs2_dx_entry *entry2 = b; in dx_leaf_sort_cmp() local
3550 u32 major_hash2 = le32_to_cpu(entry2->dx_major_hash); in dx_leaf_sort_cmp()
3552 u32 minor_hash2 = le32_to_cpu(entry2->dx_minor_hash); in dx_leaf_sort_cmp()
/linux/tools/perf/
H A Dbuiltin-trace.c4813 const struct syscall_entry *entry2 = e2; in entry_cmp() local
4815 return entry1->msecs > entry2->msecs ? -1 : 1; in entry_cmp()
/linux/tools/testing/radix-tree/
H A Dmaple.c34395 void *entry2; /* The second entry value */ member
34426 if (entry == test->entry2) { in eval_rcu_entry()
34556 mtree_store_range(mt, vals->index, vals->last, vals->entry2, in run_check_rcu()
34657 (index % 2 ? vals->entry2 : vals->entry3), in run_check_rcu_slowread()
34851 vals.entry2 = xa_mk_value(8650); in check_rcu_threaded()
34874 vals.entry2 = xa_mk_value(439); in check_rcu_threaded()
34911 vals.entry2 = xa_mk_value(439); in check_rcu_threaded()