Home
last modified time | relevance | path

Searched refs:num (Results 1 – 25 of 1050) sorted by relevance

12345678910>>...42

/f-stack/freebsd/kern/
H A Dposix4_mib.c109 #define P31B_VALID(num) ((num) >= 1 && (num) < CTL_P1003_1B_MAXID) argument
114 int error, num, val; in p31b_sysctl_proc() local
116 num = arg2; in p31b_sysctl_proc()
117 if (!P31B_VALID(num)) in p31b_sysctl_proc()
119 val = facility_initialized[num - 1] ? facility[num - 1] : 0; in p31b_sysctl_proc()
132 if (P31B_VALID(num)) { in p31b_setcfg()
139 p31b_unsetcfg(int num) in p31b_unsetcfg() argument
147 p31b_getcfg(int num) in p31b_getcfg() argument
150 if (P31B_VALID(num)) in p31b_getcfg()
156 p31b_iscfg(int num) in p31b_iscfg() argument
[all …]
/f-stack/dpdk/lib/librte_ring/
H A Drte_ring_peek_c11_mem.h32 uint32_t num) in __rte_ring_st_get_tail() argument
40 RTE_ASSERT(n >= num); in __rte_ring_st_get_tail()
41 num = (n >= num) ? num : 0; in __rte_ring_st_get_tail()
44 return num; in __rte_ring_st_get_tail()
54 uint32_t num, uint32_t enqueue) in __rte_ring_st_set_head_tail() argument
60 pos = tail + num; in __rte_ring_st_set_head_tail()
76 uint32_t num) in __rte_ring_hts_get_tail() argument
84 RTE_ASSERT(n >= num); in __rte_ring_hts_get_tail()
85 num = (n >= num) ? num : 0; in __rte_ring_hts_get_tail()
88 return num; in __rte_ring_hts_get_tail()
[all …]
/f-stack/freebsd/contrib/openzfs/lib/libzutil/
H A Dzutil_nicenum.c52 uint64_t n = num; in zfs_nicenum_format()
72 snprintf(buf, buflen, "%llu", (u_longlong_t)num); in zfs_nicenum_format()
74 } else if (format == ZFS_NICENUM_RAWTIME && num > 0) { in zfs_nicenum_format()
75 snprintf(buf, buflen, "%llu", (u_longlong_t)num); in zfs_nicenum_format()
90 if ((format == ZFS_NICENUM_TIME) && (num == 0)) { in zfs_nicenum_format()
92 } else if ((index == 0) || ((num % in zfs_nicenum_format()
112 val = (double)num / in zfs_nicenum_format()
141 zfs_nicenum(uint64_t num, char *buf, size_t buflen) in zfs_nicenum() argument
151 zfs_nicetime(uint64_t num, char *buf, size_t buflen) in zfs_nicetime() argument
160 zfs_niceraw(uint64_t num, char *buf, size_t buflen) in zfs_niceraw() argument
[all …]
/f-stack/dpdk/drivers/net/virtio/
H A Dvirtio_ring.h85 unsigned int num; member
92 unsigned int num; member
137 size = num * sizeof(struct vring_packed_desc); in vring_size()
144 size = num * sizeof(struct vring_desc); in vring_size()
148 (num * sizeof(struct vring_used_elem)); in vring_size()
153 unsigned int num) in vring_init_split() argument
155 vr->num = num; in vring_init_split()
158 num * sizeof(struct vring_desc)); in vring_init_split()
165 unsigned int num) in vring_init_packed() argument
167 vr->num = num; in vring_init_packed()
[all …]
/f-stack/lib/
H A Dff_subr_prf.c114 c = hex2ascii(num % base); in ksprintn()
116 } while (num /= base); in ksprintn()
222 uintmax_t num; in kvprintf() local
229 num = 0; in kvprintf()
304 if (num == 0) in kvprintf()
449 num = va_arg(ap, u_int); in kvprintf()
459 num = va_arg(ap, long); in kvprintf()
467 num = va_arg(ap, int); in kvprintf()
471 num = -(intmax_t)num; in kvprintf()
475 if (sharpflag && num != 0) { in kvprintf()
[all …]
/f-stack/dpdk/lib/librte_acl/
H A Dacl_run_avx512.c119 while (num > max_iter) { in rte_acl_classify_avx512x16()
123 num -= max_iter; in rte_acl_classify_avx512x16()
127 if (num >= MAX_SEARCHES_AVX16) in rte_acl_classify_avx512x16()
129 if (num >= MAX_SEARCHES_SSE8) in rte_acl_classify_avx512x16()
131 if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_avx512x16()
146 while (num > max_iter) { in rte_acl_classify_avx512x32()
150 num -= max_iter; in rte_acl_classify_avx512x32()
154 if (num >= 2 * MAX_SEARCHES_AVX16) in rte_acl_classify_avx512x32()
156 if (num >= MAX_SEARCHES_AVX16) in rte_acl_classify_avx512x32()
158 if (num >= MAX_SEARCHES_SSE8) in rte_acl_classify_avx512x32()
[all …]
H A Dacl_run_avx2.c14 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_avx2() argument
16 if (likely(num >= MAX_SEARCHES_AVX16)) in rte_acl_classify_avx2()
17 return search_avx2x16(ctx, data, results, num, categories); in rte_acl_classify_avx2()
18 else if (num >= MAX_SEARCHES_SSE8) in rte_acl_classify_avx2()
19 return search_sse_8(ctx, data, results, num, categories); in rte_acl_classify_avx2()
20 else if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_avx2()
21 return search_sse_4(ctx, data, results, num, categories); in rte_acl_classify_avx2()
23 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_avx2()
H A Dacl_run_neon.c9 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_neon() argument
11 if (likely(num >= 8)) in rte_acl_classify_neon()
12 return search_neon_8(ctx, data, results, num, categories); in rte_acl_classify_neon()
13 else if (num >= 4) in rte_acl_classify_neon()
14 return search_neon_4(ctx, data, results, num, categories); in rte_acl_classify_neon()
16 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_neon()
H A Dacl_run_altivec.c10 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_altivec() argument
12 if (likely(num >= MAX_SEARCHES_ALTIVEC8)) in rte_acl_classify_altivec()
13 return search_altivec_8(ctx, data, results, num, categories); in rte_acl_classify_altivec()
14 else if (num >= MAX_SEARCHES_ALTIVEC4) in rte_acl_classify_altivec()
15 return search_altivec_4(ctx, data, results, num, categories); in rte_acl_classify_altivec()
17 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_altivec()
H A Dacl_run_sse.c9 uint32_t *results, uint32_t num, uint32_t categories) in rte_acl_classify_sse() argument
11 if (likely(num >= MAX_SEARCHES_SSE8)) in rte_acl_classify_sse()
12 return search_sse_8(ctx, data, results, num, categories); in rte_acl_classify_sse()
13 else if (num >= MAX_SEARCHES_SSE4) in rte_acl_classify_sse()
14 return search_sse_4(ctx, data, results, num, categories); in rte_acl_classify_sse()
16 return rte_acl_classify_scalar(ctx, data, results, num, in rte_acl_classify_sse()
/f-stack/dpdk/drivers/crypto/virtio/
H A Dvirtio_ring.h61 unsigned int num; member
97 #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
98 #define vring_avail_event(vr) (*(uint16_t *)&(vr)->used->ring[(vr)->num])
101 vring_size(unsigned int num, unsigned long align) in vring_size() argument
105 size = num * sizeof(struct vring_desc); in vring_size()
106 size += sizeof(struct vring_avail) + (num * sizeof(uint16_t)); in vring_size()
109 (num * sizeof(struct vring_used_elem)); in vring_size()
114 vring_init(struct vring *vr, unsigned int num, uint8_t *p, in vring_init() argument
117 vr->num = num; in vring_init()
120 num * sizeof(struct vring_desc)); in vring_init()
[all …]
/f-stack/freebsd/contrib/openzfs/tests/zfs-tests/tests/functional/reservation/
H A Dreservation_008_pos.ksh93 typeset -i num=1
94 while (($num < $RESV_NUM_FS)); do
95 log_must zfs set reservation=$resv_size_set $TESTPOOL/$TESTFS$num
96 ((num = num + 1))
106 num=0
107 log_note "Writing to $TESTDIR$num/$TESTFILE1"
109 file_write -o create -f $TESTDIR$num/$TESTFILE1 -b $BLOCK_SIZE \
118 num=1
119 log_must zfs set reservation=none $TESTPOOL/${TESTFS}$num
120 num=0
[all …]
/f-stack/dpdk/lib/librte_ipsec/
H A Desp_inb.c314 uint32_t dr[num]; in esp_inb_pkt_prepare()
339 move_bad_mbufs(mb, dr, num, num - k); in esp_inb_pkt_prepare()
520 uint32_t hl[num], to[num]; in tun_process()
580 uint32_t hl[num], to[num]; in trs_process()
636 return num; in esp_inb_rsn_update()
660 uint32_t sqn[num]; in esp_inb_pkt_process()
661 uint32_t dr[num]; in esp_inb_pkt_process()
668 move_bad_mbufs(mb, dr, num, num - k); in esp_inb_pkt_process()
677 if (n != num) in esp_inb_pkt_process()
699 uint32_t dr[num]; in cpu_inb_pkt_prepare()
[all …]
H A Dsa.h144 struct rte_mbuf *mb[], uint16_t num);
148 struct rte_mbuf *mb[], uint16_t num);
152 struct rte_mbuf *mb[], uint16_t num);
156 struct rte_mbuf *mb[], uint16_t num);
160 struct rte_mbuf *mb[], uint16_t num);
174 uint16_t num);
178 struct rte_mbuf *mb[], uint16_t num);
182 struct rte_mbuf *mb[], uint16_t num);
186 struct rte_mbuf *mb[], uint16_t num);
190 struct rte_mbuf *mb[], uint16_t num);
[all …]
H A Drte_ipsec.h40 uint16_t num);
43 uint16_t num);
47 uint16_t num);
119 struct rte_mbuf *mb[], struct rte_crypto_op *cop[], uint16_t num) in rte_ipsec_pkt_crypto_prepare() argument
121 return ss->pkt_func.prepare.async(ss, mb, cop, num); in rte_ipsec_pkt_crypto_prepare()
126 struct rte_mbuf *mb[], uint16_t num) in rte_ipsec_pkt_cpu_prepare() argument
128 return ss->pkt_func.prepare.sync(ss, mb, num); in rte_ipsec_pkt_cpu_prepare()
156 uint16_t num) in rte_ipsec_pkt_process() argument
158 return ss->pkt_func.process(ss, mb, num); in rte_ipsec_pkt_process()
H A Desp_outb.c237 n = num; in esp_outb_tun_prepare()
239 if (n != num) in esp_outb_tun_prepare()
377 n = num; in esp_outb_trs_prepare()
379 if (n != num) in esp_outb_trs_prepare()
462 n = num; in cpu_outb_pkt_prepare()
464 if (n != num) in cpu_outb_pkt_prepare()
534 uint16_t num) in esp_outb_sqh_process() argument
564 move_bad_mbufs(mb, dr, num, num - k); in esp_outb_sqh_process()
609 n = num; in inline_outb_tun_pkt_process()
659 n = num; in inline_outb_trs_pkt_process()
[all …]
/f-stack/freebsd/contrib/octeon-sdk/
H A Dcvmx-debug-handler.S105 #define HW_INSTRUCTION_BREAKPOINT_ADDRESS(num) (0xFFFFFFFFFF301100 + 0x100 * (num)) argument
106 #define HW_INSTRUCTION_BREAKPOINT_ADDRESS_MASK(num) (0xFFFFFFFFFF301108 + 0x100 * (num)) argument
107 #define HW_INSTRUCTION_BREAKPOINT_ASID(num) (0xFFFFFFFFFF301110 + 0x100 * (num)) argument
108 #define HW_INSTRUCTION_BREAKPOINT_CONTROL(num) (0xFFFFFFFFFF301118 + 0x100 * (num)) argument
111 #define HW_DATA_BREAKPOINT_ADDRESS(num) (0xFFFFFFFFFF302100 + 0x100 * (num)) argument
112 #define HW_DATA_BREAKPOINT_ADDRESS_MASK(num) (0xFFFFFFFFFF302108 + 0x100 * (num)) argument
113 #define HW_DATA_BREAKPOINT_ASID(num) (0xFFFFFFFFFF302110 + 0x100 * (num)) argument
114 #define HW_DATA_BREAKPOINT_CONTROL(num) (0xFFFFFFFFFF302118 + 0x100 * (num)) argument
/f-stack/freebsd/contrib/ncsw/etc/
H A Dncsw_mem.c236 uint32_t num,
337 p_Mem->num = num;
368 for (i=0; i < num; i++)
453 p_Mem->num = num;
499 for (i = 0; i < num; i++)
515 for (i = 0; i < num; i++)
567 uint32_t num, i;
574 num = p_Mem->consecutiveMem ? 1 : p_Mem->num;
665 if (num > availableBlocks)
667 num = availableBlocks;
[all …]
/f-stack/dpdk/examples/vm_power_manager/guest_cli/
H A Dparse.c20 parse_set(const char *input, uint16_t set[], unsigned int num) in parse_set() argument
27 memset(set, 0, num * sizeof(uint16_t)); in parse_set()
41 min = num; in parse_set()
53 if (errno || end == NULL || idx >= num) in parse_set()
60 if (min == num) in parse_set()
67 if (min == num) in parse_set()
74 min = num; in parse_set()
/f-stack/dpdk/examples/ipsec-secgw/
H A Dipsec_process.c44 if (num >= RTE_DIM(cqp->buf) * 3 / 4 && len == 0) { in enqueue_cop_bulk()
47 free_cops(cop + n, num - n); in enqueue_cop_bulk()
55 n = RTE_MIN(num - k, n); in enqueue_cop_bulk()
74 } while (k != num); in enqueue_cop_bulk()
113 struct rte_ipsec_group grp[], uint32_t num) in sa_group() argument
121 for (i = 0, n = 0; i != num; i++) { in sa_group()
146 uint32_t num) in copy_to_trf() argument
171 for (j = 0, s = out->num; j != num; j++) { in copy_to_trf()
177 out->num += num; in copy_to_trf()
378 trf->ip4.num = 0; in ipsec_cqp_process()
[all …]
/f-stack/dpdk/drivers/net/mvneta/
H A Dmvneta_rxtx.c80 uint16_t nb_desc = *num; in mvneta_buffs_refill()
85 *num = 0; in mvneta_buffs_refill()
97 *num = 0; in mvneta_buffs_refill()
125 nb_desc = *num; in mvneta_buffs_alloc()
141 *num = sent; in mvneta_buffs_alloc()
420 num = nb_pkts; in mvneta_tx_pkt_burst()
469 pkts.num = 0; in mvneta_tx_sg_pkt_burst()
516 pkts.num++; in mvneta_tx_sg_pkt_burst()
548 num = total_descs; in mvneta_tx_sg_pkt_burst()
568 nb_pkts = pkts.num; in mvneta_tx_sg_pkt_burst()
[all …]
/f-stack/dpdk/kernel/linux/kni/
H A Dkni_net.c109 uint32_t num; in kni_net_process_request() local
122 if (num < 1) { in kni_net_process_request()
457 num = min(num, num_aq); in kni_net_rx_lo_fifo()
458 num = min(num, num_fq); in kni_net_rx_lo_fifo()
459 num = min_t(uint32_t, num, MBUF_BURST_SZ); in kni_net_rx_lo_fifo()
462 if (num == 0) in kni_net_rx_lo_fifo()
473 num = ret; in kni_net_rx_lo_fifo()
509 if (ret != num) in kni_net_rx_lo_fifo()
543 num = min_t(uint32_t, num, MBUF_BURST_SZ); in kni_net_rx_lo_fifo_skb()
546 if (num == 0) in kni_net_rx_lo_fifo_skb()
[all …]
/f-stack/dpdk/drivers/bus/dpaa/base/qbman/
H A Dqman_priv.h35 static inline int qman_cgrs_get(struct qman_cgrs *c, int num) in qman_cgrs_get() argument
37 return QM_MCR_QUERYCONGESTION(&c->q, num); in qman_cgrs_get()
40 static inline void qman_cgrs_set(struct qman_cgrs *c, int num) in qman_cgrs_set() argument
42 c->q.state[__CGR_WORD(num)] |= (0x80000000 >> __CGR_SHIFT(num)); in qman_cgrs_set()
45 static inline void qman_cgrs_unset(struct qman_cgrs *c, int num) in qman_cgrs_unset() argument
47 c->q.state[__CGR_WORD(num)] &= ~(0x80000000 >> __CGR_SHIFT(num)); in qman_cgrs_unset()
50 static inline int qman_cgrs_next(struct qman_cgrs *c, int num) in qman_cgrs_next() argument
52 while ((++num < (int)__CGR_NUM) && !qman_cgrs_get(c, num)) in qman_cgrs_next()
54 return num; in qman_cgrs_next()
/f-stack/dpdk/examples/vm_power_manager/
H A Dparse.c19 parse_set(const char *input, uint16_t set[], unsigned int num) in parse_set() argument
26 memset(set, 0, num * sizeof(uint16_t)); in parse_set()
40 min = num; in parse_set()
52 if (errno || end == NULL || idx >= num) in parse_set()
59 if (min == num) in parse_set()
66 if (min == num) in parse_set()
73 min = num; in parse_set()
/f-stack/dpdk/app/test/
H A Dtest_ring_stress_impl.h155 for (i = 0; i != num; i++) { in check_updt_elem()
160 __func__, rte_lcore_id(), num, i, elm[i]); in check_updt_elem()
188 uint32_t lc, n, num; in test_worker() local
220 rc = check_ring_op(num, n, lc, fname, in test_worker()
238 rc = check_ring_op(num, n, lc, fname, in test_worker()
285 sz = num * sizeof(*elm); in mt1_init()
289 __func__, sz, num); in mt1_init()
296 nr = 2 * num; in mt1_init()
314 for (i = 0; i != num; i++) { in mt1_init()
321 if (i != num) { in mt1_init()
[all …]

12345678910>>...42