ref1              711 arch/x86/kernel/tsc.c 	u64 tsc1, tsc2, delta, ref1, ref2;
ref1              756 arch/x86/kernel/tsc.c 		tsc1 = tsc_read_refs(&ref1, hpet);
ref1              765 arch/x86/kernel/tsc.c 		if (ref1 == ref2)
ref1              774 arch/x86/kernel/tsc.c 			tsc2 = calc_hpet_ref(tsc2, ref1, ref2);
ref1              776 arch/x86/kernel/tsc.c 			tsc2 = calc_pmtimer_ref(tsc2, ref1, ref2);
ref1              817 arch/x86/kernel/tsc.c 		if (!hpet && !ref1 && !ref2) {
ref1              836 arch/x86/kernel/tsc.c 	if (!hpet && !ref1 && !ref2) {
ref1              175 fs/btrfs/backref.c static int prelim_ref_compare(struct prelim_ref *ref1,
ref1              178 fs/btrfs/backref.c 	if (ref1->level < ref2->level)
ref1              180 fs/btrfs/backref.c 	if (ref1->level > ref2->level)
ref1              182 fs/btrfs/backref.c 	if (ref1->root_id < ref2->root_id)
ref1              184 fs/btrfs/backref.c 	if (ref1->root_id > ref2->root_id)
ref1              186 fs/btrfs/backref.c 	if (ref1->key_for_search.type < ref2->key_for_search.type)
ref1              188 fs/btrfs/backref.c 	if (ref1->key_for_search.type > ref2->key_for_search.type)
ref1              190 fs/btrfs/backref.c 	if (ref1->key_for_search.objectid < ref2->key_for_search.objectid)
ref1              192 fs/btrfs/backref.c 	if (ref1->key_for_search.objectid > ref2->key_for_search.objectid)
ref1              194 fs/btrfs/backref.c 	if (ref1->key_for_search.offset < ref2->key_for_search.offset)
ref1              196 fs/btrfs/backref.c 	if (ref1->key_for_search.offset > ref2->key_for_search.offset)
ref1              198 fs/btrfs/backref.c 	if (ref1->parent < ref2->parent)
ref1              200 fs/btrfs/backref.c 	if (ref1->parent > ref2->parent)
ref1              204 fs/btrfs/delayed-ref.c static int comp_tree_refs(struct btrfs_delayed_tree_ref *ref1,
ref1              207 fs/btrfs/delayed-ref.c 	if (ref1->node.type == BTRFS_TREE_BLOCK_REF_KEY) {
ref1              208 fs/btrfs/delayed-ref.c 		if (ref1->root < ref2->root)
ref1              210 fs/btrfs/delayed-ref.c 		if (ref1->root > ref2->root)
ref1              213 fs/btrfs/delayed-ref.c 		if (ref1->parent < ref2->parent)
ref1              215 fs/btrfs/delayed-ref.c 		if (ref1->parent > ref2->parent)
ref1              224 fs/btrfs/delayed-ref.c static int comp_data_refs(struct btrfs_delayed_data_ref *ref1,
ref1              227 fs/btrfs/delayed-ref.c 	if (ref1->node.type == BTRFS_EXTENT_DATA_REF_KEY) {
ref1              228 fs/btrfs/delayed-ref.c 		if (ref1->root < ref2->root)
ref1              230 fs/btrfs/delayed-ref.c 		if (ref1->root > ref2->root)
ref1              232 fs/btrfs/delayed-ref.c 		if (ref1->objectid < ref2->objectid)
ref1              234 fs/btrfs/delayed-ref.c 		if (ref1->objectid > ref2->objectid)
ref1              236 fs/btrfs/delayed-ref.c 		if (ref1->offset < ref2->offset)
ref1              238 fs/btrfs/delayed-ref.c 		if (ref1->offset > ref2->offset)
ref1              241 fs/btrfs/delayed-ref.c 		if (ref1->parent < ref2->parent)
ref1              243 fs/btrfs/delayed-ref.c 		if (ref1->parent > ref2->parent)
ref1              249 fs/btrfs/delayed-ref.c static int comp_refs(struct btrfs_delayed_ref_node *ref1,
ref1              255 fs/btrfs/delayed-ref.c 	if (ref1->type < ref2->type)
ref1              257 fs/btrfs/delayed-ref.c 	if (ref1->type > ref2->type)
ref1              259 fs/btrfs/delayed-ref.c 	if (ref1->type == BTRFS_TREE_BLOCK_REF_KEY ||
ref1              260 fs/btrfs/delayed-ref.c 	    ref1->type == BTRFS_SHARED_BLOCK_REF_KEY)
ref1              261 fs/btrfs/delayed-ref.c 		ret = comp_tree_refs(btrfs_delayed_node_to_tree_ref(ref1),
ref1              264 fs/btrfs/delayed-ref.c 		ret = comp_data_refs(btrfs_delayed_node_to_data_ref(ref1),
ref1              269 fs/btrfs/delayed-ref.c 		if (ref1->seq < ref2->seq)
ref1              271 fs/btrfs/delayed-ref.c 		if (ref1->seq > ref2->seq)
ref1              636 fs/btrfs/extent-tree.c 	struct btrfs_extent_data_ref *ref1 = NULL;
ref1              646 fs/btrfs/extent-tree.c 		ref1 = btrfs_item_ptr(leaf, path->slots[0],
ref1              648 fs/btrfs/extent-tree.c 		num_refs = btrfs_extent_data_ref_count(leaf, ref1);
ref1              669 fs/btrfs/extent-tree.c 			btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
ref1              682 fs/btrfs/extent-tree.c 	struct btrfs_extent_data_ref *ref1;
ref1              699 fs/btrfs/extent-tree.c 			ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
ref1              700 fs/btrfs/extent-tree.c 			num_refs = btrfs_extent_data_ref_count(leaf, ref1);
ref1              706 fs/btrfs/extent-tree.c 		ref1 = btrfs_item_ptr(leaf, path->slots[0],
ref1              708 fs/btrfs/extent-tree.c 		num_refs = btrfs_extent_data_ref_count(leaf, ref1);
ref1              140 fs/btrfs/ref-verify.c static int comp_refs(struct ref_entry *ref1, struct ref_entry *ref2)
ref1              142 fs/btrfs/ref-verify.c 	if (ref1->root_objectid < ref2->root_objectid)
ref1              144 fs/btrfs/ref-verify.c 	if (ref1->root_objectid > ref2->root_objectid)
ref1              146 fs/btrfs/ref-verify.c 	if (ref1->parent < ref2->parent)
ref1              148 fs/btrfs/ref-verify.c 	if (ref1->parent > ref2->parent)
ref1              150 fs/btrfs/ref-verify.c 	if (ref1->owner < ref2->owner)
ref1              152 fs/btrfs/ref-verify.c 	if (ref1->owner > ref2->owner)
ref1              154 fs/btrfs/ref-verify.c 	if (ref1->offset < ref2->offset)
ref1              156 fs/btrfs/ref-verify.c 	if (ref1->offset > ref2->offset)
ref1              497 tools/perf/util/bpf-loader.c 		struct probe_trace_arg_ref *ref1, *ref2;
ref1              506 tools/perf/util/bpf-loader.c 		ref1 = arg1->ref;
ref1              509 tools/perf/util/bpf-loader.c 		while (ref1 && ref2) {
ref1              510 tools/perf/util/bpf-loader.c 			ret = ref2->offset - ref1->offset;
ref1              514 tools/perf/util/bpf-loader.c 			ref1 = ref1->next;
ref1              518 tools/perf/util/bpf-loader.c 		if (ref1 || ref2)