1424dd6c8STomasz Jozwiak /* SPDX-License-Identifier: BSD-3-Clause 2424dd6c8STomasz Jozwiak * Copyright(c) 2019 Intel Corporation 3424dd6c8STomasz Jozwiak */ 4424dd6c8STomasz Jozwiak 5424dd6c8STomasz Jozwiak #include <rte_malloc.h> 6424dd6c8STomasz Jozwiak #include <rte_eal.h> 7424dd6c8STomasz Jozwiak #include <rte_log.h> 8424dd6c8STomasz Jozwiak #include <rte_compressdev.h> 9424dd6c8STomasz Jozwiak 10424dd6c8STomasz Jozwiak #include "comp_perf.h" 118c7a3131SArtur Trybula #include "comp_perf_options.h" 128c7a3131SArtur Trybula #include "comp_perf_test_benchmark.h" 13424dd6c8STomasz Jozwiak #include "comp_perf_test_common.h" 148c7a3131SArtur Trybula #include "comp_perf_test_verify.h" 158c7a3131SArtur Trybula 16424dd6c8STomasz Jozwiak 17424dd6c8STomasz Jozwiak #define DIV_CEIL(a, b) ((a) / (b) + ((a) % (b) != 0)) 18424dd6c8STomasz Jozwiak 196f1e5d80SArtur Trybula struct cperf_buffer_info { 206f1e5d80SArtur Trybula uint16_t total_segments; 216f1e5d80SArtur Trybula uint16_t segment_sz; 226f1e5d80SArtur Trybula uint16_t last_segment_sz; 236f1e5d80SArtur Trybula uint32_t total_buffs; /*number of buffers = number of ops*/ 246f1e5d80SArtur Trybula uint16_t segments_per_buff; 256f1e5d80SArtur Trybula uint16_t segments_per_last_buff; 266f1e5d80SArtur Trybula size_t input_data_sz; 276f1e5d80SArtur Trybula }; 286f1e5d80SArtur Trybula 296f1e5d80SArtur Trybula static struct cperf_buffer_info buffer_info; 306f1e5d80SArtur Trybula 31424dd6c8STomasz Jozwiak int 32424dd6c8STomasz Jozwiak param_range_check(uint16_t size, const struct rte_param_log2_range *range) 33424dd6c8STomasz Jozwiak { 34424dd6c8STomasz Jozwiak unsigned int next_size; 35424dd6c8STomasz Jozwiak 36424dd6c8STomasz Jozwiak /* Check lower/upper bounds */ 37424dd6c8STomasz Jozwiak if (size < range->min) 38424dd6c8STomasz Jozwiak return -1; 39424dd6c8STomasz Jozwiak 40424dd6c8STomasz Jozwiak if (size > range->max) 41424dd6c8STomasz Jozwiak return -1; 42424dd6c8STomasz Jozwiak 43424dd6c8STomasz Jozwiak /* If range is actually only one value, size is correct */ 44424dd6c8STomasz Jozwiak if (range->increment == 0) 45424dd6c8STomasz Jozwiak return 0; 46424dd6c8STomasz Jozwiak 47424dd6c8STomasz Jozwiak /* Check if value is one of the supported sizes */ 48424dd6c8STomasz Jozwiak for (next_size = range->min; next_size <= range->max; 49424dd6c8STomasz Jozwiak next_size += range->increment) 50424dd6c8STomasz Jozwiak if (size == next_size) 51424dd6c8STomasz Jozwiak return 0; 52424dd6c8STomasz Jozwiak 53424dd6c8STomasz Jozwiak return -1; 54424dd6c8STomasz Jozwiak } 55424dd6c8STomasz Jozwiak 56424dd6c8STomasz Jozwiak static uint32_t 57424dd6c8STomasz Jozwiak find_buf_size(uint32_t input_size) 58424dd6c8STomasz Jozwiak { 59424dd6c8STomasz Jozwiak uint32_t i; 60424dd6c8STomasz Jozwiak 61424dd6c8STomasz Jozwiak /* From performance point of view the buffer size should be a 62424dd6c8STomasz Jozwiak * power of 2 but also should be enough to store incompressible data 63424dd6c8STomasz Jozwiak */ 64424dd6c8STomasz Jozwiak 658c7a3131SArtur Trybula /* We're looking for nearest power of 2 buffer size, which is greater 66424dd6c8STomasz Jozwiak * than input_size 67424dd6c8STomasz Jozwiak */ 68424dd6c8STomasz Jozwiak uint32_t size = 69424dd6c8STomasz Jozwiak !input_size ? MIN_COMPRESSED_BUF_SIZE : (input_size << 1); 70424dd6c8STomasz Jozwiak 71424dd6c8STomasz Jozwiak for (i = UINT16_MAX + 1; !(i & size); i >>= 1) 72424dd6c8STomasz Jozwiak ; 73424dd6c8STomasz Jozwiak 74424dd6c8STomasz Jozwiak return i > ((UINT16_MAX + 1) >> 1) 75424dd6c8STomasz Jozwiak ? (uint32_t)((float)input_size * EXPANSE_RATIO) 76424dd6c8STomasz Jozwiak : i; 77424dd6c8STomasz Jozwiak } 78424dd6c8STomasz Jozwiak 79424dd6c8STomasz Jozwiak void 80424dd6c8STomasz Jozwiak comp_perf_free_memory(struct cperf_mem_resources *mem) 81424dd6c8STomasz Jozwiak { 82424dd6c8STomasz Jozwiak uint32_t i; 83424dd6c8STomasz Jozwiak 84*c591df32SAdam Dybkowski if (mem->decomp_bufs != NULL) 85*c591df32SAdam Dybkowski for (i = 0; i < mem->total_bufs; i++) 86424dd6c8STomasz Jozwiak rte_pktmbuf_free(mem->decomp_bufs[i]); 87*c591df32SAdam Dybkowski 88*c591df32SAdam Dybkowski if (mem->comp_bufs != NULL) 89*c591df32SAdam Dybkowski for (i = 0; i < mem->total_bufs; i++) 90*c591df32SAdam Dybkowski rte_pktmbuf_free(mem->comp_bufs[i]); 91424dd6c8STomasz Jozwiak 92424dd6c8STomasz Jozwiak rte_free(mem->decomp_bufs); 93424dd6c8STomasz Jozwiak rte_free(mem->comp_bufs); 94424dd6c8STomasz Jozwiak rte_free(mem->decompressed_data); 95424dd6c8STomasz Jozwiak rte_free(mem->compressed_data); 96424dd6c8STomasz Jozwiak rte_mempool_free(mem->op_pool); 97424dd6c8STomasz Jozwiak rte_mempool_free(mem->decomp_buf_pool); 98424dd6c8STomasz Jozwiak rte_mempool_free(mem->comp_buf_pool); 99424dd6c8STomasz Jozwiak } 100424dd6c8STomasz Jozwiak 101424dd6c8STomasz Jozwiak int 102424dd6c8STomasz Jozwiak comp_perf_allocate_memory(struct comp_test_data *test_data, 103424dd6c8STomasz Jozwiak struct cperf_mem_resources *mem) 104424dd6c8STomasz Jozwiak { 105424dd6c8STomasz Jozwiak test_data->out_seg_sz = find_buf_size(test_data->seg_sz); 106424dd6c8STomasz Jozwiak /* Number of segments for input and output 107424dd6c8STomasz Jozwiak * (compression and decompression) 108424dd6c8STomasz Jozwiak */ 109424dd6c8STomasz Jozwiak uint32_t total_segs = DIV_CEIL(test_data->input_data_sz, 110424dd6c8STomasz Jozwiak test_data->seg_sz); 111424dd6c8STomasz Jozwiak char pool_name[32] = ""; 112424dd6c8STomasz Jozwiak 113424dd6c8STomasz Jozwiak snprintf(pool_name, sizeof(pool_name), "comp_buf_pool_%u_qp_%u", 114424dd6c8STomasz Jozwiak mem->dev_id, mem->qp_id); 115424dd6c8STomasz Jozwiak mem->comp_buf_pool = rte_pktmbuf_pool_create(pool_name, 116424dd6c8STomasz Jozwiak total_segs, 117424dd6c8STomasz Jozwiak 0, 0, 118424dd6c8STomasz Jozwiak test_data->out_seg_sz + RTE_PKTMBUF_HEADROOM, 119424dd6c8STomasz Jozwiak rte_socket_id()); 120424dd6c8STomasz Jozwiak if (mem->comp_buf_pool == NULL) { 121424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Mbuf mempool could not be created\n"); 122424dd6c8STomasz Jozwiak return -1; 123424dd6c8STomasz Jozwiak } 124424dd6c8STomasz Jozwiak 125424dd6c8STomasz Jozwiak snprintf(pool_name, sizeof(pool_name), "decomp_buf_pool_%u_qp_%u", 126424dd6c8STomasz Jozwiak mem->dev_id, mem->qp_id); 127424dd6c8STomasz Jozwiak mem->decomp_buf_pool = rte_pktmbuf_pool_create(pool_name, 128424dd6c8STomasz Jozwiak total_segs, 129424dd6c8STomasz Jozwiak 0, 0, test_data->seg_sz + RTE_PKTMBUF_HEADROOM, 130424dd6c8STomasz Jozwiak rte_socket_id()); 131424dd6c8STomasz Jozwiak if (mem->decomp_buf_pool == NULL) { 132424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Mbuf mempool could not be created\n"); 133424dd6c8STomasz Jozwiak return -1; 134424dd6c8STomasz Jozwiak } 135424dd6c8STomasz Jozwiak 136424dd6c8STomasz Jozwiak mem->total_bufs = DIV_CEIL(total_segs, test_data->max_sgl_segs); 137424dd6c8STomasz Jozwiak 138424dd6c8STomasz Jozwiak snprintf(pool_name, sizeof(pool_name), "op_pool_%u_qp_%u", 139424dd6c8STomasz Jozwiak mem->dev_id, mem->qp_id); 140424dd6c8STomasz Jozwiak mem->op_pool = rte_comp_op_pool_create(pool_name, 141424dd6c8STomasz Jozwiak mem->total_bufs, 142424dd6c8STomasz Jozwiak 0, 0, rte_socket_id()); 143424dd6c8STomasz Jozwiak if (mem->op_pool == NULL) { 144424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Comp op mempool could not be created\n"); 145424dd6c8STomasz Jozwiak return -1; 146424dd6c8STomasz Jozwiak } 147424dd6c8STomasz Jozwiak 148424dd6c8STomasz Jozwiak /* 149424dd6c8STomasz Jozwiak * Compressed data might be a bit larger than input data, 150424dd6c8STomasz Jozwiak * if data cannot be compressed 151424dd6c8STomasz Jozwiak */ 152424dd6c8STomasz Jozwiak mem->compressed_data = rte_zmalloc_socket(NULL, 153971d89f5SAdam Dybkowski RTE_MAX( 154971d89f5SAdam Dybkowski (size_t) test_data->out_seg_sz * total_segs, 155971d89f5SAdam Dybkowski (size_t) MIN_COMPRESSED_BUF_SIZE), 156971d89f5SAdam Dybkowski 0, 157424dd6c8STomasz Jozwiak rte_socket_id()); 158424dd6c8STomasz Jozwiak if (mem->compressed_data == NULL) { 159424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Memory to hold the data from the input " 160424dd6c8STomasz Jozwiak "file could not be allocated\n"); 161424dd6c8STomasz Jozwiak return -1; 162424dd6c8STomasz Jozwiak } 163424dd6c8STomasz Jozwiak 164424dd6c8STomasz Jozwiak mem->decompressed_data = rte_zmalloc_socket(NULL, 165424dd6c8STomasz Jozwiak test_data->input_data_sz, 0, 166424dd6c8STomasz Jozwiak rte_socket_id()); 167424dd6c8STomasz Jozwiak if (mem->decompressed_data == NULL) { 168424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Memory to hold the data from the input " 169424dd6c8STomasz Jozwiak "file could not be allocated\n"); 170424dd6c8STomasz Jozwiak return -1; 171424dd6c8STomasz Jozwiak } 172424dd6c8STomasz Jozwiak 173424dd6c8STomasz Jozwiak mem->comp_bufs = rte_zmalloc_socket(NULL, 174424dd6c8STomasz Jozwiak mem->total_bufs * sizeof(struct rte_mbuf *), 175424dd6c8STomasz Jozwiak 0, rte_socket_id()); 176424dd6c8STomasz Jozwiak if (mem->comp_bufs == NULL) { 177424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Memory to hold the compression mbufs" 178424dd6c8STomasz Jozwiak " could not be allocated\n"); 179424dd6c8STomasz Jozwiak return -1; 180424dd6c8STomasz Jozwiak } 181424dd6c8STomasz Jozwiak 182424dd6c8STomasz Jozwiak mem->decomp_bufs = rte_zmalloc_socket(NULL, 183424dd6c8STomasz Jozwiak mem->total_bufs * sizeof(struct rte_mbuf *), 184424dd6c8STomasz Jozwiak 0, rte_socket_id()); 185424dd6c8STomasz Jozwiak if (mem->decomp_bufs == NULL) { 186424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Memory to hold the decompression mbufs" 187424dd6c8STomasz Jozwiak " could not be allocated\n"); 188424dd6c8STomasz Jozwiak return -1; 189424dd6c8STomasz Jozwiak } 1906f1e5d80SArtur Trybula 1916f1e5d80SArtur Trybula buffer_info.total_segments = total_segs; 1926f1e5d80SArtur Trybula buffer_info.segment_sz = test_data->seg_sz; 1936f1e5d80SArtur Trybula buffer_info.total_buffs = mem->total_bufs; 1946f1e5d80SArtur Trybula buffer_info.segments_per_buff = test_data->max_sgl_segs; 1956f1e5d80SArtur Trybula buffer_info.input_data_sz = test_data->input_data_sz; 1966f1e5d80SArtur Trybula 197424dd6c8STomasz Jozwiak return 0; 198424dd6c8STomasz Jozwiak } 199424dd6c8STomasz Jozwiak 200424dd6c8STomasz Jozwiak int 201424dd6c8STomasz Jozwiak prepare_bufs(struct comp_test_data *test_data, struct cperf_mem_resources *mem) 202424dd6c8STomasz Jozwiak { 203424dd6c8STomasz Jozwiak uint32_t remaining_data = test_data->input_data_sz; 204424dd6c8STomasz Jozwiak uint8_t *input_data_ptr = test_data->input_data; 2056f1e5d80SArtur Trybula size_t data_sz = 0; 206424dd6c8STomasz Jozwiak uint8_t *data_addr; 207424dd6c8STomasz Jozwiak uint32_t i, j; 2086f1e5d80SArtur Trybula uint16_t segs_per_mbuf = 0; 209424dd6c8STomasz Jozwiak 210424dd6c8STomasz Jozwiak for (i = 0; i < mem->total_bufs; i++) { 211424dd6c8STomasz Jozwiak /* Allocate data in input mbuf and copy data from input file */ 212424dd6c8STomasz Jozwiak mem->decomp_bufs[i] = 213424dd6c8STomasz Jozwiak rte_pktmbuf_alloc(mem->decomp_buf_pool); 214424dd6c8STomasz Jozwiak if (mem->decomp_bufs[i] == NULL) { 215424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not allocate mbuf\n"); 216424dd6c8STomasz Jozwiak return -1; 217424dd6c8STomasz Jozwiak } 218424dd6c8STomasz Jozwiak 219424dd6c8STomasz Jozwiak data_sz = RTE_MIN(remaining_data, test_data->seg_sz); 220424dd6c8STomasz Jozwiak data_addr = (uint8_t *) rte_pktmbuf_append( 221424dd6c8STomasz Jozwiak mem->decomp_bufs[i], data_sz); 222424dd6c8STomasz Jozwiak if (data_addr == NULL) { 223424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not append data\n"); 224424dd6c8STomasz Jozwiak return -1; 225424dd6c8STomasz Jozwiak } 226424dd6c8STomasz Jozwiak rte_memcpy(data_addr, input_data_ptr, data_sz); 227424dd6c8STomasz Jozwiak 228424dd6c8STomasz Jozwiak input_data_ptr += data_sz; 229424dd6c8STomasz Jozwiak remaining_data -= data_sz; 230424dd6c8STomasz Jozwiak 231424dd6c8STomasz Jozwiak /* Already one segment in the mbuf */ 2326f1e5d80SArtur Trybula segs_per_mbuf = 1; 233424dd6c8STomasz Jozwiak 234424dd6c8STomasz Jozwiak /* Chain mbufs if needed for input mbufs */ 235424dd6c8STomasz Jozwiak while (segs_per_mbuf < test_data->max_sgl_segs 236424dd6c8STomasz Jozwiak && remaining_data > 0) { 237424dd6c8STomasz Jozwiak struct rte_mbuf *next_seg = 238424dd6c8STomasz Jozwiak rte_pktmbuf_alloc(mem->decomp_buf_pool); 239424dd6c8STomasz Jozwiak 240424dd6c8STomasz Jozwiak if (next_seg == NULL) { 241424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, 242424dd6c8STomasz Jozwiak "Could not allocate mbuf\n"); 243424dd6c8STomasz Jozwiak return -1; 244424dd6c8STomasz Jozwiak } 245424dd6c8STomasz Jozwiak 246424dd6c8STomasz Jozwiak data_sz = RTE_MIN(remaining_data, test_data->seg_sz); 247424dd6c8STomasz Jozwiak data_addr = (uint8_t *)rte_pktmbuf_append(next_seg, 248424dd6c8STomasz Jozwiak data_sz); 249424dd6c8STomasz Jozwiak 250424dd6c8STomasz Jozwiak if (data_addr == NULL) { 251424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not append data\n"); 252424dd6c8STomasz Jozwiak return -1; 253424dd6c8STomasz Jozwiak } 254424dd6c8STomasz Jozwiak 255424dd6c8STomasz Jozwiak rte_memcpy(data_addr, input_data_ptr, data_sz); 256424dd6c8STomasz Jozwiak input_data_ptr += data_sz; 257424dd6c8STomasz Jozwiak remaining_data -= data_sz; 258424dd6c8STomasz Jozwiak 259424dd6c8STomasz Jozwiak if (rte_pktmbuf_chain(mem->decomp_bufs[i], 260424dd6c8STomasz Jozwiak next_seg) < 0) { 261424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not chain mbufs\n"); 262424dd6c8STomasz Jozwiak return -1; 263424dd6c8STomasz Jozwiak } 264424dd6c8STomasz Jozwiak segs_per_mbuf++; 265424dd6c8STomasz Jozwiak } 266424dd6c8STomasz Jozwiak 267424dd6c8STomasz Jozwiak /* Allocate data in output mbuf */ 268424dd6c8STomasz Jozwiak mem->comp_bufs[i] = 269424dd6c8STomasz Jozwiak rte_pktmbuf_alloc(mem->comp_buf_pool); 270424dd6c8STomasz Jozwiak if (mem->comp_bufs[i] == NULL) { 271424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not allocate mbuf\n"); 272424dd6c8STomasz Jozwiak return -1; 273424dd6c8STomasz Jozwiak } 274424dd6c8STomasz Jozwiak data_addr = (uint8_t *) rte_pktmbuf_append( 275424dd6c8STomasz Jozwiak mem->comp_bufs[i], 276424dd6c8STomasz Jozwiak test_data->out_seg_sz); 277424dd6c8STomasz Jozwiak if (data_addr == NULL) { 278424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not append data\n"); 279424dd6c8STomasz Jozwiak return -1; 280424dd6c8STomasz Jozwiak } 281424dd6c8STomasz Jozwiak 282424dd6c8STomasz Jozwiak /* Chain mbufs if needed for output mbufs */ 283424dd6c8STomasz Jozwiak for (j = 1; j < segs_per_mbuf; j++) { 284424dd6c8STomasz Jozwiak struct rte_mbuf *next_seg = 285424dd6c8STomasz Jozwiak rte_pktmbuf_alloc(mem->comp_buf_pool); 286424dd6c8STomasz Jozwiak 287424dd6c8STomasz Jozwiak if (next_seg == NULL) { 288424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, 289424dd6c8STomasz Jozwiak "Could not allocate mbuf\n"); 290424dd6c8STomasz Jozwiak return -1; 291424dd6c8STomasz Jozwiak } 292424dd6c8STomasz Jozwiak 293424dd6c8STomasz Jozwiak data_addr = (uint8_t *)rte_pktmbuf_append(next_seg, 294424dd6c8STomasz Jozwiak test_data->out_seg_sz); 295424dd6c8STomasz Jozwiak if (data_addr == NULL) { 296424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not append data\n"); 297424dd6c8STomasz Jozwiak return -1; 298424dd6c8STomasz Jozwiak } 299424dd6c8STomasz Jozwiak 300424dd6c8STomasz Jozwiak if (rte_pktmbuf_chain(mem->comp_bufs[i], 301424dd6c8STomasz Jozwiak next_seg) < 0) { 302424dd6c8STomasz Jozwiak RTE_LOG(ERR, USER1, "Could not chain mbufs\n"); 303424dd6c8STomasz Jozwiak return -1; 304424dd6c8STomasz Jozwiak } 305424dd6c8STomasz Jozwiak } 306424dd6c8STomasz Jozwiak } 307424dd6c8STomasz Jozwiak 3086f1e5d80SArtur Trybula buffer_info.segments_per_last_buff = segs_per_mbuf; 3096f1e5d80SArtur Trybula buffer_info.last_segment_sz = data_sz; 3106f1e5d80SArtur Trybula 311424dd6c8STomasz Jozwiak return 0; 312424dd6c8STomasz Jozwiak } 3136f1e5d80SArtur Trybula 3146f1e5d80SArtur Trybula void 3156f1e5d80SArtur Trybula print_test_dynamics(void) 3166f1e5d80SArtur Trybula { 3176f1e5d80SArtur Trybula uint32_t opt_total_segs = DIV_CEIL(buffer_info.input_data_sz, 3186f1e5d80SArtur Trybula MAX_SEG_SIZE); 3196f1e5d80SArtur Trybula 3206f1e5d80SArtur Trybula if (buffer_info.total_buffs > 1) { 3216f1e5d80SArtur Trybula printf("\nWarning: for the current input parameters, number" 3226f1e5d80SArtur Trybula " of ops is higher than one, which may result" 3236f1e5d80SArtur Trybula " in sub-optimal performance.\n"); 3246f1e5d80SArtur Trybula printf("To improve the performance (for the current" 3256f1e5d80SArtur Trybula " input data) following parameters are" 3266f1e5d80SArtur Trybula " suggested:\n"); 3276f1e5d80SArtur Trybula printf(" * Segment size: %d\n", MAX_SEG_SIZE); 3286f1e5d80SArtur Trybula printf(" * Number of segments: %u\n", opt_total_segs); 3296f1e5d80SArtur Trybula } else if (buffer_info.total_buffs == 1) { 3306f1e5d80SArtur Trybula printf("\nInfo: there is only one op with %u segments -" 3316f1e5d80SArtur Trybula " the compression ratio is the best.\n", 3326f1e5d80SArtur Trybula buffer_info.segments_per_last_buff); 3336f1e5d80SArtur Trybula if (buffer_info.segment_sz < MAX_SEG_SIZE) 3346f1e5d80SArtur Trybula printf("To reduce compression time, please use" 3356f1e5d80SArtur Trybula " bigger segment size: %d.\n", 3366f1e5d80SArtur Trybula MAX_SEG_SIZE); 3376f1e5d80SArtur Trybula else if (buffer_info.segment_sz == MAX_SEG_SIZE) 3386f1e5d80SArtur Trybula printf("Segment size is optimal for the best" 3396f1e5d80SArtur Trybula " performance.\n"); 3406f1e5d80SArtur Trybula } else 3416f1e5d80SArtur Trybula printf("Warning: something wrong happened!!\n"); 3426f1e5d80SArtur Trybula 3436f1e5d80SArtur Trybula printf("\nFor the current input parameters (segment size = %u," 3446f1e5d80SArtur Trybula " maximum segments per SGL = %u):\n", 3456f1e5d80SArtur Trybula buffer_info.segment_sz, 3466f1e5d80SArtur Trybula buffer_info.segments_per_buff); 3476f1e5d80SArtur Trybula printf(" * Total number of buffers: %d\n", 3486f1e5d80SArtur Trybula buffer_info.total_segments); 3496f1e5d80SArtur Trybula printf(" * %u buffer(s) %u bytes long, last buffer %u" 3506f1e5d80SArtur Trybula " byte(s) long\n", 3516f1e5d80SArtur Trybula buffer_info.total_segments - 1, 3526f1e5d80SArtur Trybula buffer_info.segment_sz, 3536f1e5d80SArtur Trybula buffer_info.last_segment_sz); 3546f1e5d80SArtur Trybula printf(" * Number of ops: %u\n", buffer_info.total_buffs); 3556f1e5d80SArtur Trybula printf(" * Total memory allocation: %u\n", 3566f1e5d80SArtur Trybula (buffer_info.total_segments - 1) * buffer_info.segment_sz 3576f1e5d80SArtur Trybula + buffer_info.last_segment_sz); 3586f1e5d80SArtur Trybula if (buffer_info.total_buffs > 1) 3596f1e5d80SArtur Trybula printf(" * %u ops: %u segment(s) in each," 3606f1e5d80SArtur Trybula " segment size %u\n", 3616f1e5d80SArtur Trybula buffer_info.total_buffs - 1, 3626f1e5d80SArtur Trybula buffer_info.segments_per_buff, 3636f1e5d80SArtur Trybula buffer_info.segment_sz); 3646f1e5d80SArtur Trybula if (buffer_info.segments_per_last_buff > 1) { 3656f1e5d80SArtur Trybula printf(" * 1 op %u segments:\n", 3666f1e5d80SArtur Trybula buffer_info.segments_per_last_buff); 3676f1e5d80SArtur Trybula printf(" o %u segment size %u\n", 3686f1e5d80SArtur Trybula buffer_info.segments_per_last_buff - 1, 3696f1e5d80SArtur Trybula buffer_info.segment_sz); 3706f1e5d80SArtur Trybula printf(" o last segment size %u\n", 3716f1e5d80SArtur Trybula buffer_info.last_segment_sz); 3726f1e5d80SArtur Trybula } else if (buffer_info.segments_per_last_buff == 1) { 3736f1e5d80SArtur Trybula printf(" * 1 op (the last one): %u segment %u" 3746f1e5d80SArtur Trybula " byte(s) long\n\n", 3756f1e5d80SArtur Trybula buffer_info.segments_per_last_buff, 3766f1e5d80SArtur Trybula buffer_info.last_segment_sz); 3776f1e5d80SArtur Trybula } 3786f1e5d80SArtur Trybula printf("\n"); 3796f1e5d80SArtur Trybula } 380