Home
last modified time | relevance | path

Searched refs:timer_count (Results 1 – 5 of 5) sorted by relevance

/external/grpc-grpc/test/core/iomgr/
Dtimer_heap_test.cc46 for (i = 0; i < pq->timer_count; i++) { in contains()
54 for (i = 0; i < pq->timer_count; ++i) { in check_valid()
57 if (left_child < pq->timer_count) { in check_valid()
60 if (right_child < pq->timer_count) { in check_valid()
97 GPR_ASSERT(pq.timer_count == num_test_elements); in test1()
242 GPR_ASSERT(i == pq.timer_count); in shrink_test()
245 GPR_ASSERT(num_elements == pq.timer_count); in shrink_test()
248 while (pq.timer_count > num_elements / 4) { in shrink_test()
249 grpc_timer* const te = pq.timers[pq.timer_count - 1]; in shrink_test()
253 GPR_ASSERT(num_elements / 4 == pq.timer_count); in shrink_test()
[all …]
/external/grpc-grpc/src/core/lib/iomgr/
Dtimer_heap.cc74 if (heap->timer_count >= 8 && in maybe_shrink()
75 heap->timer_count <= heap->timer_capacity / SHRINK_FULLNESS_FACTOR / 2) { in maybe_shrink()
76 heap->timer_capacity = heap->timer_count * SHRINK_FULLNESS_FACTOR; in maybe_shrink()
88 adjust_downwards(heap->timers, i, heap->timer_count, timer); in note_changed_priority()
99 if (heap->timer_count == heap->timer_capacity) { in grpc_timer_heap_add()
105 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
106 adjust_upwards(heap->timers, heap->timer_count, timer); in grpc_timer_heap_add()
107 heap->timer_count++; in grpc_timer_heap_add()
113 if (i == heap->timer_count - 1) { in grpc_timer_heap_remove()
114 heap->timer_count--; in grpc_timer_heap_remove()
[all …]
Dtimer_heap.h28 uint32_t timer_count; member
/external/python/cpython2/Lib/idlelib/
DParenMatch.py123 def handle_restore_timer(self, timer_count): argument
124 if timer_count == self.counter:
/external/python/cpython3/Lib/idlelib/
Dparenmatch.py113 def handle_restore_timer(self, timer_count): argument
114 if timer_count == self.counter: