| /f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/ |
| H A D | qr.c | 23 entries[i].id = 'a' + i; in init_entries()
111 qr_after_insert(&entries[i - 1], &entries[i], link); in TEST_BEGIN()
124 qr_after_insert(&entries[i - 1], &entries[i], link); in TEST_BEGIN()
153 qr_before_insert(&entries[i - 1], &entries[i], link); in TEST_BEGIN()
212 qr_after_insert(&entries[i - 1], &entries[i], link); in TEST_BEGIN()
215 qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link); in TEST_BEGIN()
218 qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link); in TEST_BEGIN()
221 qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link); in TEST_BEGIN()
224 qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link); in TEST_BEGIN()
227 qr_split(&entries[0], &entries[0], ring_t, link); in TEST_BEGIN()
[all …]
|
| H A D | ql.c | 98 init_entries(entries, sizeof(entries)/sizeof(list_t)); in TEST_BEGIN()
113 init_entries(entries, sizeof(entries)/sizeof(list_t)); in TEST_BEGIN()
132 init_entries(entries, sizeof(entries)/sizeof(list_t)); in TEST_BEGIN()
147 init_entries(entries, sizeof(entries)/sizeof(list_t)); in TEST_BEGIN()
166 init_entries(entries, sizeof(entries)/sizeof(list_t)); in TEST_BEGIN()
167 a = &entries[0]; in TEST_BEGIN()
168 b = &entries[1]; in TEST_BEGIN()
169 c = &entries[2]; in TEST_BEGIN()
170 d = &entries[3]; in TEST_BEGIN()
171 e = &entries[4]; in TEST_BEGIN()
[all …]
|
| /f-stack/freebsd/kern/ |
| H A D | subr_filter.c | 149 tf->entries[i].value = tf->entries[j].value; in check_update_times()
150 tf->entries[i].time_up = tf->entries[j].time_up; in check_update_times()
184 tf->entries[i].value = tf->entries[j].value; in check_update_times_small()
185 tf->entries[i].time_up = tf->entries[j].time_up; in check_update_times_small()
221 tf->entries[i].value = tf->entries[0].value; in filter_reduce_by()
241 tf->entries[i].value = tf->entries[0].value; in filter_reduce_by_small()
258 tf->entries[i].value = tf->entries[0].value; in filter_increase_by()
275 tf->entries[i].value = tf->entries[0].value; in filter_increase_by_small()
333 tf->entries[i].value = tf->entries[(i+1)].value; in tick_filter_clock()
334 tf->entries[i].time_up = tf->entries[(i+1)].time_up; in tick_filter_clock()
[all …]
|
| H A D | kern_kcov.c | 129 size_t entries; /* (o) */ member
141 static int kcov_alloc(struct kcov_info *info, size_t entries);
217 if (index + 2 > info->entries) in trace_pc()
251 if (index * 4 + 4 + 1 > info->entries) in trace_cmp()
353 if (info->kvaddr == 0 || size / KCOV_ELEMENT_SIZE != info->entries) in kcov_mmap_single()
363 kcov_alloc(struct kcov_info *info, size_t entries) in kcov_alloc() argument
372 if (entries < 2 || entries > kcov_max_entries) in kcov_alloc()
376 info->bufsize = roundup2(entries * KCOV_ELEMENT_SIZE, PAGE_SIZE); in kcov_alloc()
395 info->entries = entries; in kcov_alloc()
|
| /f-stack/dpdk/drivers/net/nfp/nfpcore/ |
| H A D | nfp_nsp_eth.c | 265 union eth_table_entry *entries; in __nfp_eth_read_ports() local
271 if (!entries) in __nfp_eth_read_ports()
311 free(entries); in __nfp_eth_read_ports()
316 free(entries); in __nfp_eth_read_ports()
348 union eth_table_entry *entries; in nfp_eth_config_start() local
353 if (!entries) in nfp_eth_config_start()
359 free(entries); in nfp_eth_config_start()
379 free(entries); in nfp_eth_config_start()
391 free(entries); in nfp_eth_config_cleanup_end()
441 union eth_table_entry *entries; in nfp_eth_set_mod_enable() local
[all …]
|
| /f-stack/app/redis-5.0.5/utils/lru/ |
| H A D | lfu-simulation.c | 87 struct entry *entries = malloc(sizeof(*entries)*keyspace_size); in main() local
92 entries[j].counter = COUNTER_INIT_VAL; in main()
93 entries[j].decrtime = to_16bit_minutes(start); in main()
94 entries[j].hits = 0; in main()
95 entries[j].ctime = time(NULL); in main()
128 access_entry(entries+idx); in main()
134 entries[idx].counter = COUNTER_INIT_VAL; in main()
136 entries[idx].hits = 0; in main()
137 entries[idx].ctime = time(NULL); in main()
149 show_entry(j,entries+j); in main()
[all …]
|
| /f-stack/dpdk/lib/librte_reorder/ |
| H A D | rte_reorder.c | 42 struct rte_mbuf **entries; member
95 b->ready_buf.entries = (void *)&b[1]; in rte_reorder_init()
96 b->order_buf.entries = RTE_PTR_ADD(&b[1], in rte_reorder_init()
97 size * sizeof(b->ready_buf.entries[0])); in rte_reorder_init()
195 if (b->order_buf.entries[i]) in rte_reorder_free_mbufs()
196 rte_pktmbuf_free(b->order_buf.entries[i]); in rte_reorder_free_mbufs()
197 if (b->ready_buf.entries[i]) in rte_reorder_free_mbufs()
297 ready_buf->entries[ready_buf->head] = in rte_reorder_fill_overflow()
298 order_buf->entries[order_buf->head]; in rte_reorder_fill_overflow()
364 order_buf->entries[position] = mbuf; in rte_reorder_insert()
[all …]
|
| /f-stack/dpdk/lib/librte_cfgfile/ |
| H A D | rte_cfgfile.c | 20 struct rte_cfgfile_entry *entries; member
109 section->entries, in _add_entry()
117 section->entries = n_entries; in _add_entry()
315 free(cfg->sections[i].entries); in rte_cfgfile_create()
316 cfg->sections[i].entries = NULL; in rte_cfgfile_create()
436 cfg->sections[i].entries[j].name, in rte_cfgfile_save()
453 free(cfg->sections[i].entries); in rte_cfgfile_close()
454 cfg->sections[i].entries = NULL; in rte_cfgfile_close()
528 entries[i] = sect->entries[i]; in rte_cfgfile_section_entries()
545 entries[i] = sect->entries[i]; in rte_cfgfile_section_entries_by_index()
[all …]
|
| /f-stack/dpdk/drivers/event/opdl/ |
| H A D | opdl_ring.h | 228 opdl_ring_input(struct opdl_ring *t, const void *entries, uint32_t num_entries,
255 const void *entries, uint32_t num_entries, bool block);
281 void *entries, uint32_t num_entries, bool block);
311 opdl_stage_claim(struct opdl_stage *s, void *entries,
335 typedef uint32_t (opdl_ring_check_entries_t)(void *entries[],
367 opdl_stage_claim_check(struct opdl_stage *s, void **entries,
403 opdl_stage_claim_copy(struct opdl_stage *s, void *entries,
|
| H A D | opdl_ring.c | 254 rte_memcpy(get_slot(t, start), entries, in copy_entries_in()
261 RTE_PTR_ADD(entries, split * slot_size), in copy_entries_in()
275 rte_memcpy(entries, get_slot(t, start), in copy_entries_out()
281 rte_memcpy(RTE_PTR_ADD(entries, split * slot_size), in copy_entries_out()
299 copy_entries_in(t, head, entries, num_entries); in opdl_ring_input_singlethread()
471 copy_entries_in(t, old_head, entries, num_entries); in opdl_ring_input_multithread()
506 uint8_t *entries_offset = (uint8_t *)entries; in opdl_stage_claim_singlethread()
566 uint8_t *entries_offset = (uint8_t *)entries; in opdl_stage_claim_multithread()
658 copy_entries_in(t, head, entries, num_entries); in opdl_ring_copy_from_burst()
669 void *entries, uint32_t num_entries, bool block) in opdl_ring_copy_to_burst() argument
[all …]
|
| /f-stack/app/nginx-1.16.1/src/http/v2/ |
| H A D | ngx_http_v2_table.c | 132 entry = h2c->hpack.entries[index]; in ngx_http_v2_get_indexed_header()
194 ngx_http_v2_header_t *entry, **entries; in ngx_http_v2_add_header() local
200 if (h2c->hpack.entries == NULL) { in ngx_http_v2_add_header()
205 h2c->hpack.entries = ngx_palloc(h2c->connection->pool, in ngx_http_v2_add_header()
208 if (h2c->hpack.entries == NULL) { in ngx_http_v2_add_header()
270 entries = ngx_palloc(h2c->connection->pool, in ngx_http_v2_add_header()
273 if (entries == NULL) { in ngx_http_v2_add_header()
279 ngx_memcpy(entries, &h2c->hpack.entries[index], in ngx_http_v2_add_header()
283 ngx_memcpy(&entries[h2c->hpack.allocated - index], h2c->hpack.entries, in ngx_http_v2_add_header()
286 (void) ngx_pfree(h2c->connection->pool, h2c->hpack.entries); in ngx_http_v2_add_header()
[all …]
|
| /f-stack/dpdk/lib/librte_hash/ |
| H A D | rte_fbk_hash.c | 85 sizeof(*ht) + (sizeof(ht->t[0]) * params->entries); in rte_fbk_hash_create()
94 if ((!rte_is_power_of_2(params->entries)) || in rte_fbk_hash_create()
96 (params->entries == 0) || in rte_fbk_hash_create()
98 (params->entries_per_bucket > params->entries) || in rte_fbk_hash_create()
99 (params->entries > RTE_FBK_HASH_ENTRIES_MAX) || in rte_fbk_hash_create()
146 ht->entries = params->entries; in rte_fbk_hash_create()
149 ht->bucket_mask = (params->entries / params->entries_per_bucket) - 1; in rte_fbk_hash_create()
|
| /f-stack/freebsd/contrib/ck/src/ |
| H A D | ck_rhs.c | 126 const void **entries; member
129 } entries; member
139 return (map->entries.no_entries.entries[offset]); in ck_rhs_entry()
149 return (&map->entries.no_entries.entries[offset]); in ck_rhs_entry_addr()
161 return (&map->entries.descs[offset]); in ck_rhs_desc()
171 map->entries.descs[offset].wanted++; in ck_rhs_wanted_inc()
376 map->entries.no_entries.entries = (void *)(((uintptr_t)&map[1] + in ck_rhs_map_create()
378 …map->entries.no_entries.descs = (void *)(((uintptr_t)map->entries.no_entries.entries + (sizeof(voi… in ck_rhs_map_create()
379 memset(map->entries.no_entries.entries, 0, in ck_rhs_map_create()
463 desc = &m->entries.descs[offset]; in ck_rhs_map_bound_set()
[all …]
|
| /f-stack/app/nginx-1.16.1/src/http/modules/ |
| H A D | ngx_http_mp4_module.c | 2078 entries = ngx_mp4_get_32value(stts_atom->entries); in ngx_http_mp4_read_stts_atom()
2294 entries = ngx_mp4_get_32value(stss_atom->entries); in ngx_http_mp4_read_stss_atom()
2492 entries = ngx_mp4_get_32value(ctts_atom->entries); in ngx_http_mp4_read_ctts_atom()
2684 entries = ngx_mp4_get_32value(stsc_atom->entries); in ngx_http_mp4_read_stsc_atom()
2892 entries++; in ngx_http_mp4_crop_stsc_data()
3027 entries = ngx_mp4_get_32value(stsz_atom->entries); in ngx_http_mp4_read_stsz_atom()
3147 ngx_mp4_set_32value(stsz_atom->entries, entries); in ngx_http_mp4_update_stsz_atom()
3186 entries = ngx_mp4_get_32value(stco_atom->entries); in ngx_http_mp4_read_stco_atom()
3304 ngx_mp4_set_32value(stco_atom->entries, entries); in ngx_http_mp4_update_stco_atom()
3370 entries = ngx_mp4_get_32value(co64_atom->entries); in ngx_http_mp4_read_co64_atom()
[all …]
|
| H A D | ngx_http_autoindex_module.c | 59 ngx_array_t *entries);
61 ngx_array_t *entries, ngx_str_t *callback);
65 ngx_array_t *entries);
165 ngx_array_t entries; in ngx_http_autoindex_handler() local
363 entry = ngx_array_push(&entries); in ngx_http_autoindex_handler()
388 if (entries.nelts > 1) { in ngx_http_autoindex_handler()
389 ngx_qsort(entries.elts, (size_t) entries.nelts, in ngx_http_autoindex_handler()
486 entry = entries->elts; in ngx_http_autoindex_html()
487 for (i = 0; i < entries->nelts; i++) { in ngx_http_autoindex_html()
717 entry = entries->elts; in ngx_http_autoindex_json()
[all …]
|
| /f-stack/freebsd/netinet/cc/ |
| H A D | cc.c | 114 STAILQ_FOREACH(funcs, &cc_list, entries) { in cc_default_algo()
140 STAILQ_FOREACH(algo, &cc_list, entries) { in cc_list_available()
158 STAILQ_FOREACH(algo, &cc_list, entries) { in cc_list_available()
227 STAILQ_FOREACH_SAFE(funcs, &cc_list, entries, tmpfuncs) { in cc_deregister_algo()
230 STAILQ_REMOVE(&cc_list, funcs, cc_algo, entries); in cc_deregister_algo()
265 STAILQ_FOREACH(funcs, &cc_list, entries) { in cc_register_algo()
272 STAILQ_INSERT_TAIL(&cc_list, add_cc, entries); in cc_register_algo()
|
| /f-stack/dpdk/doc/guides/sample_app_ug/ |
| H A D | test_pipeline.rst | 20 processes it according to the actions configured in the table entries that
92 … | LRU hash table with 8-byte key size and 16 million | 16 million entries are successfully …
93 …| | | entries. | hash…
97 … | The action configured for all table entries is |
111 …et hash table with 8-byte key size | Same as hash-[spec]-8-lru table entries, above. |
112 …| | | and 16 million entries. | …
115 … | LRU hash table with 16-byte key size and 16 million | 16 million entries are successfully …
116 …| | | entries. | tabl…
120 … | The action configured for all table entries is |
134 …et hash table with 16-byte key size | Same as hash-[spec]-16-lru table entries, above. |
[all …]
|
| /f-stack/freebsd/security/mac_veriexec/ |
| H A D | veriexec_metadata.c | 56 LIST_ENTRY(veriexec_dev_list) entries;
140 LIST_REMOVE(ip, entries); in get_veriexec_file()
169 ip = LIST_NEXT(ip, entries)) in mac_veriexec_print_db_dev_list()
258 lp = LIST_NEXT(lp, entries)) in free_veriexec_dev()
266 LIST_REMOVE(lp, entries); in free_veriexec_dev()
273 nip = LIST_NEXT(ip, entries); in free_veriexec_dev()
274 LIST_REMOVE(ip, entries); in free_veriexec_dev()
310 lp = LIST_NEXT(lp, entries)) in find_veriexec_dev()
343 LIST_INSERT_HEAD(head, lp, entries); in find_veriexec_dev()
635 ip = LIST_NEXT(ip, entries)) { in mac_veriexec_metadata_add_file()
[all …]
|
| /f-stack/freebsd/contrib/device-tree/Bindings/sound/ |
| H A D | uniphier,evea.txt | 6 - clock-names : should include following entries:
9 entries in clock-names.
10 - reset-names : should include following entries:
12 - resets : a list of phandle, should contain reset entries of
|
| /f-stack/dpdk/app/test-bbdev/ |
| H A D | test_bbdev_vector.c | 396 op_data = vector->entries[type].segments; in parse_data_entry()
397 nb_ops = &vector->entries[type].nb_segments; in parse_data_entry()
916 if (vector->entries[DATA_INPUT].nb_segments == 0) in check_decoder_segments()
923 if (vector->entries[DATA_HARD_OUTPUT].nb_segments == 0) in check_decoder_segments()
932 (vector->entries[DATA_SOFT_OUTPUT].nb_segments == 0)) in check_decoder_segments()
958 (vector->entries[DATA_SOFT_OUTPUT].nb_segments == 0)) in check_ldpc_decoder_segments()
966 (vector->entries[DATA_HARQ_OUTPUT].nb_segments == 0)) in check_ldpc_decoder_segments()
1196 if (vector->entries[DATA_INPUT].nb_segments == 0) in check_encoder()
1203 if (vector->entries[DATA_HARD_OUTPUT].nb_segments == 0) in check_encoder()
1284 if (vector->entries[DATA_INPUT].nb_segments == 0) in check_ldpc_encoder()
[all …]
|
| /f-stack/freebsd/contrib/device-tree/Bindings/soc/qcom/ |
| H A D | qcom,smp2p.txt | 29 Definition: three entries specifying the outgoing ipc bit used for
52 Each SMP2P pair contain a set of inbound and outbound entries, these are
59 Definition: specifies the name of this entry, for inbound entries this
61 and for outbound entries this name is used for allocating
62 entries
65 Usage: required for incoming entries
73 Usage: required for incoming entries
78 Usage: required for outgoing entries
|
| /f-stack/dpdk/lib/librte_ring/ |
| H A D | rte_ring_generic.h | 129 uint32_t *entries) in __rte_ring_move_cons_head() argument
151 *entries = (r->prod.tail - *old_head); in __rte_ring_move_cons_head()
154 if (n > *entries) in __rte_ring_move_cons_head()
155 n = (behavior == RTE_RING_QUEUE_FIXED) ? 0 : *entries; in __rte_ring_move_cons_head()
|
| H A D | rte_ring_c11_mem.h | 133 uint32_t *entries) in __rte_ring_move_cons_head() argument
159 *entries = (prod_tail - *old_head); in __rte_ring_move_cons_head()
162 if (n > *entries) in __rte_ring_move_cons_head()
163 n = (behavior == RTE_RING_QUEUE_FIXED) ? 0 : *entries; in __rte_ring_move_cons_head()
|
| /f-stack/freebsd/sys/ |
| H A D | tim_filter.h | 56 struct filter_entry entries[NUM_FILTER_ENTRIES]; member
64 struct filter_entry_small entries[NUM_FILTER_ENTRIES]; member
96 return(tf->entries[0].value); in get_filter_value()
122 return(tf->entries[0].value); in get_filter_value_small()
|
| /f-stack/dpdk/lib/librte_table/ |
| H A D | rte_table.h | 159 void **entries,
196 void **entries);
236 void **entries);
|