Searched refs:QUEUE_SIZE (Results 1 – 5 of 5) sorted by relevance
22 const unsigned long QUEUE_SIZE = 1000L; variable23 const unsigned long TOTAL_ELEMENTS = QUEUE_SIZE * 1000L;235 for (unsigned long i = QUEUE_SIZE / 2L; i > 0; --i) { in fifo_test()259 bounded_buffer<int> bb_int(QUEUE_SIZE); in main()263 bounded_buffer_space_optimized<int> bb_space_optimized_int(QUEUE_SIZE); in main()267 bounded_buffer_deque_based<int> bb_deque_based_int(QUEUE_SIZE); in main()271 bounded_buffer_list_based<int> bb_list_based_int(QUEUE_SIZE); in main()275 bounded_buffer<std::string> bb_string(QUEUE_SIZE); in main()279 bounded_buffer_space_optimized<std::string> bb_space_optimized_string(QUEUE_SIZE); in main()283 bounded_buffer_deque_based<std::string> bb_deque_based_string(QUEUE_SIZE); in main()[all …]
18 QUEUE_SIZE = 5 variable110 for i in range(QUEUE_SIZE-1):114 last = 2 * QUEUE_SIZE115 full = 3 * 2 * QUEUE_SIZE134 for i in range(QUEUE_SIZE):206 q = self.type2test(QUEUE_SIZE)211 q = self.type2test(QUEUE_SIZE)218 q = self.type2test(QUEUE_SIZE)219 for i in range(QUEUE_SIZE):224 for i in range(QUEUE_SIZE):[all …]
48 #define QUEUE_SIZE 16384 macro57 char data[QUEUE_SIZE];108 i = (i + 1) % QUEUE_SIZE; in queue_pop()112 tst_atomic_store((i + 1) % QUEUE_SIZE, &q->front); in queue_pop()125 i = (i + 1) % QUEUE_SIZE; in queue_push()
63 #define QUEUE_SIZE 0x1000 macro71 unsigned char queue[QUEUE_SIZE]; in lz_unpack()85 memset(queue, 0x20, QUEUE_SIZE); in lz_unpack()