Searched full:a_node (Results 1 – 4 of 4) sorted by relevance
| /linux/arch/x86/events/intel/ |
| H A D | uncore_discovery.c | 176 struct intel_uncore_discovery_unit *a_node, *b_node; in unit_less() local
178 a_node = rb_entry(a, struct intel_uncore_discovery_unit, node); in unit_less()
181 if (a_node->pmu_idx < b_node->pmu_idx) in unit_less()
183 if (a_node->pmu_idx > b_node->pmu_idx) in unit_less()
186 if (a_node->die < b_node->die) in unit_less()
188 if (a_node->die > b_node->die) in unit_less()
|
| /linux/arch/sparc/kernel/ |
| H A D | mdesc.c | 433 u64 a_node; in invoke_on_missing() local
450 mdesc_for_each_node_by_name(a, a_node, name) { in invoke_on_missing()
453 rv = get_info_func(a, a_node, &a_node_info); in invoke_on_missing()
460 /* Check each node in B for node matching a_node */ in invoke_on_missing()
478 func(a, a_node, name); in invoke_on_missing()
|
| /linux/lib/ |
| H A D | maple_tree.c | 981 struct maple_node *a_node; /* ancestor node. */ in mas_ascend() local
989 a_node = mas_mn(mas); in mas_ascend()
990 if (ma_is_root(a_node)) { in mas_ascend()
996 if (unlikely(a_node == p_node)) in mas_ascend()
1034 a_node = mte_parent(p_enode); in mas_ascend()
1036 a_enode = mt_mk_node(a_node, a_type); in mas_ascend()
1037 pivots = ma_pivots(a_node, a_type); in mas_ascend()
1039 if (unlikely(ma_dead_node(a_node))) in mas_ascend()
1052 if (unlikely(ma_dead_node(a_node))) in mas_ascend()
1055 if (unlikely(ma_is_root(a_node))) in mas_ascend()
|
| /linux/fs/btrfs/ |
| H A D | disk-io.c | 737 static int global_root_cmp(struct rb_node *a_node, const struct rb_node *b_node) in global_root_cmp() argument
739 const struct btrfs_root *a = rb_entry(a_node, struct btrfs_root, rb_node); in global_root_cmp()
|