Home
last modified time | relevance | path

Searched refs:hops (Results 1 – 22 of 22) sorted by relevance

/linux/drivers/accel/habanalabs/common/mmu/
H A Dmmu_v2.c245 static int hl_mmu_v2_get_tlb_info(struct hl_ctx *ctx, u64 virt_addr, struct hl_mmu_hop_info *hops) in hl_mmu_v2_get_tlb_info() argument
262 hops->range_type = HL_VA_RANGE_TYPE_DRAM; in hl_mmu_v2_get_tlb_info()
264 hops->scrambled_vaddr = hdev->asic_funcs->scramble_addr(hdev, virt_addr); in hl_mmu_v2_get_tlb_info()
266 hops->hop_info[0].hop_addr = hl_mmu_dr_get_phys_hop0_addr(ctx); in hl_mmu_v2_get_tlb_info()
267 hops->hop_info[0].hop_pte_addr = hl_mmu_get_hop_pte_phys_addr(ctx, mmu_prop, 0, in hl_mmu_v2_get_tlb_info()
268 hops->hop_info[0].hop_addr, in hl_mmu_v2_get_tlb_info()
269 hops->scrambled_vaddr); in hl_mmu_v2_get_tlb_info()
270 if (hops->hop_info[0].hop_pte_addr == U64_MAX) in hl_mmu_v2_get_tlb_info()
273 hops->hop_info[0].hop_pte_val = hdev->asic_funcs->read_pte(hdev, in hl_mmu_v2_get_tlb_info()
274 hops->hop_info[0].hop_pte_addr); in hl_mmu_v2_get_tlb_info()
[all …]
H A Dmmu.c477 struct hl_mmu_hop_info *hops, in hl_mmu_pa_page_with_offset() argument
485 if (hops->unscrambled_paddr) in hl_mmu_pa_page_with_offset()
486 tmp_phys_addr = hops->unscrambled_paddr; in hl_mmu_pa_page_with_offset()
488 tmp_phys_addr = hops->hop_info[hops->used_hops - 1].hop_pte_val; in hl_mmu_pa_page_with_offset()
490 if (hops->range_type == HL_VA_RANGE_TYPE_HOST_HUGE) in hl_mmu_pa_page_with_offset()
492 else if (hops->range_type == HL_VA_RANGE_TYPE_HOST) in hl_mmu_pa_page_with_offset()
497 if ((hops->range_type == HL_VA_RANGE_TYPE_DRAM) && in hl_mmu_pa_page_with_offset()
524 hop_shift = mmu_prop->hop_shifts[hops->used_hops - 1]; in hl_mmu_pa_page_with_offset()
534 struct hl_mmu_hop_info hops; in hl_mmu_va_to_pa() local
537 memset(&hops, 0, sizeof(hops)); in hl_mmu_va_to_pa()
[all …]
H A Dmmu_v1.c454 struct hl_mmu_hop_info *hops) in hl_mmu_v1_get_tlb_info() argument
491 hops->hop_info[0].hop_addr = hl_mmu_dr_get_phys_hop0_addr(ctx); in hl_mmu_v1_get_tlb_info()
492 hops->hop_info[0].hop_pte_addr = in hl_mmu_v1_get_tlb_info()
494 hops->hop_info[0].hop_addr, virt_addr); in hl_mmu_v1_get_tlb_info()
495 hops->hop_info[0].hop_pte_val = in hl_mmu_v1_get_tlb_info()
497 hops->hop_info[0].hop_pte_addr); in hl_mmu_v1_get_tlb_info()
500 hops->hop_info[i].hop_addr = in hl_mmu_v1_get_tlb_info()
502 hops->hop_info[i - 1].hop_pte_val); in hl_mmu_v1_get_tlb_info()
503 if (hops->hop_info[i].hop_addr == ULLONG_MAX) in hl_mmu_v1_get_tlb_info()
506 hops->hop_info[i].hop_pte_addr = in hl_mmu_v1_get_tlb_info()
[all …]
H A Dmmu_v2_hr.c335 struct hl_mmu_hop_info *hops, in hl_mmu_v2_hr_get_tlb_mapping_params() argument
354 hops->range_type = HL_VA_RANGE_TYPE_DRAM; in hl_mmu_v2_hr_get_tlb_mapping_params()
358 hops->range_type = HL_VA_RANGE_TYPE_HOST; in hl_mmu_v2_hr_get_tlb_mapping_params()
362 hops->range_type = HL_VA_RANGE_TYPE_HOST_HUGE; in hl_mmu_v2_hr_get_tlb_mapping_params()
371 struct hl_mmu_hop_info *hops) in hl_mmu_v2_hr_get_tlb_info() argument
373 return hl_mmu_hr_get_tlb_info(ctx, virt_addr, hops, in hl_mmu_v2_hr_get_tlb_info()
/linux/tools/testing/selftests/bpf/prog_tests/
H A Dcls_redirect.c101 enum hops { in set_up_conn()
126 enum hops hops; in prepare_addr()
133 const char *family_str, *type, *conn, *hops, *result, *flags; in was_decapsulated()
147 hops = "no hops";
148 if (test->hops == ONE_HOP)
149 hops = "one hop";
162 type, result, conn, hops, flags);
227 encap_init(&encap, test->hops in encap_init()
144 enum hops { global() enum
169 enum hops hops; global() member
176 const char *family_str, *type, *conn, *hops, *result, *flags; test_str() local
[all...]
/linux/Documentation/networking/
H A Dnexthop-group-resilient.rst9 weights of constituent next hops.
48 constituent next hops: a hash table. The selection algorithm uses SKB hash
55 the individual next hops is arbitrary. Therefore when a next hop is deleted
56 the buckets that held it are simply reassigned to other next hops::
69 When weights of next hops in a group are altered, it may be possible to
83 cause bucket allocation change, the wants counts for individual next hops
86 Next hops that have fewer buckets than their wants count, are called
88 overweight (and therefore no underweight) next hops in the group, it is
97 After assigning wants counts to next hops, an "upkeep" algorithm runs. For
105 underweight next hops. If, after considering all buckets in this manner,
[all …]
H A Dip-sysctl.rst2573 shown as such, but rather as just a list of next hops. Also weights that
/linux/block/
H A Dbdev.c586 const struct blk_holder_ops *hops) in bd_may_claim() argument
597 if (WARN_ON_ONCE(bdev->bd_holder_ops != hops)) in bd_may_claim()
628 const struct blk_holder_ops *hops) in bd_prepare_to_claim() argument
637 if (!bd_may_claim(bdev, holder, hops)) { in bd_prepare_to_claim()
680 const struct blk_holder_ops *hops) in bd_finish_claiming() argument
685 BUG_ON(!bd_may_claim(bdev, holder, hops)); in bd_finish_claiming()
695 bdev->bd_holder_ops = hops; in bd_finish_claiming()
972 const struct blk_holder_ops *hops, struct file *bdev_file) in bdev_open() argument
980 ret = bd_prepare_to_claim(bdev, holder, hops); in bdev_open()
1007 bd_finish_claiming(bdev, holder, hops); in bdev_open()
[all …]
H A Dblk.h750 const struct blk_holder_ops *hops, struct file *bdev_file);
/linux/drivers/firmware/arm_scmi/
H A Dclock.c228 if (!ph->hops->protocol_msg_check(ph, CLOCK_RATE_NOTIFY, NULL)) in scmi_clock_protocol_attributes_get()
231 if (!ph->hops->protocol_msg_check(ph, in scmi_clock_protocol_attributes_get()
319 iter = ph->hops->iter_response_init(ph, &ops, 0, in scmi_clock_possible_parents()
326 return ph->hops->iter_response_run(iter); in scmi_clock_possible_parents()
395 ph->hops->extended_name_get(ph, CLOCK_NAME_GET, clk_id, in scmi_clock_attributes_get()
537 iter = ph->hops->iter_response_init(ph, &ops, clkd->tot_rates, in scmi_clock_describe_rates_get_full()
544 ret = ph->hops->iter_response_run(iter); in scmi_clock_describe_rates_get_full()
576 iter = ph->hops->iter_response_init(ph, &ops, 0, CLOCK_DESCRIBE_RATES, in scmi_clock_describe_rates_get_lazy()
585 ret = ph->hops->iter_response_run_bound(iter, &first, &last); in scmi_clock_describe_rates_get_lazy()
596 ret = ph->hops->iter_response_run_bound(iter, &first, &last); in scmi_clock_describe_rates_get_lazy()
[all …]
H A Ddriver.c2256 pi->ph.hops = &helpers_ops; in scmi_alloc_init_protocol_instance()
/linux/net/ipv6/
H A Dexthdrs.c1104 int hops; in ipv6_push_rthdr0() local
1111 hops = ihdr->rt_hdr.hdrlen >> 1; in ipv6_push_rthdr0()
1113 if (hops > 1) in ipv6_push_rthdr0()
1115 (hops - 1) * sizeof(struct in6_addr)); in ipv6_push_rthdr0()
1117 phdr->addr[hops - 1] = **addr_p; in ipv6_push_rthdr0()
1129 int plen, hops; in ipv6_push_rthdr4() local
1137 hops = sr_ihdr->first_segment + 1; in ipv6_push_rthdr4()
1139 (hops - 1) * sizeof(struct in6_addr)); in ipv6_push_rthdr4()
1144 if (sr_ihdr->hdrlen > hops * 2) { in ipv6_push_rthdr4()
1147 tlvs_offset = (1 + hops * 2) << 3; in ipv6_push_rthdr4()
[all …]
/linux/include/linux/usb/
H A Dpd_vdo.h437 #define VDO_ACABLE2(mtemp, stemp, u3p, trans, phy, ele, u4, hops, u2, u32, lane, iso, gen) \ argument
440 | ((hops) & 0x3) << 6 | (u2) << 5 | (u32) << 4 | (lane) << 3 \
/linux/drivers/dax/
H A Dsuper.c178 const struct dax_holder_operations *hops) in fs_dax_get() argument
217 dax_dev->holder_ops = hops; in fs_dax_get()
/linux/include/linux/
H A Dblkdev.h1696 const struct blk_holder_ops *hops);
1698 void *holder, const struct blk_holder_ops *hops);
1700 const struct blk_holder_ops *hops);
/linux/net/batman-adv/
H A Ddistributed-arp-table.c116 __u8 hops; member
145 __u8 hops; member
/linux/Documentation/ABI/testing/
H A Dsysfs-bus-rapidio156 (RO) number of hops on the path to the switch
/linux/kernel/sched/
H A Dtopology.c1120 * about doing this is to build the domains on 'hops'. For each NUMA level we
1121 * construct the mask of all nodes reachable in @level hops.
2202 * - If for two nodes A and B, located N > 1 hops away from each other, in init_numa_topology_type()
2203 * there is an intermediary node C, which is < N hops away from both in init_numa_topology_type()
2369 * CPUs of nodes that are that many hops away from us. in sched_init_numa()
2630 * sched_numa_hop_mask() - Get the cpumask of CPUs at most @hops hops away from
2632 * @node: The node to count hops from.
2633 * @hops: Include CPUs up to that many hops awa
2642 sched_numa_hop_mask(unsigned int node,unsigned int hops) sched_numa_hop_mask() argument
[all...]
/linux/Documentation/networking/devlink/
H A Ddevlink-dpipe.rst176 host table for directly connected routes, or adjacency table for next-hops.
/linux/net/sched/
H A Dsch_htb.c227 unsigned int hops = 0; in htb_classify() local
270 if (++hops > TC_HTB_MAXDEPTH) { in htb_classify()
/linux/net/ipv4/
H A Dipconfig.c633 u8 hops; /* Used only by gateways */ member
/linux/Documentation/core-api/
H A Dworkqueue.rst204 hops through different CPUs.