Home
last modified time | relevance | path

Searched refs:queue_w (Results 1 – 2 of 2) sorted by relevance

/external/libaom/libaom/aom_util/
Ddebug_util.c40 static int queue_w = 0; variable
49 void bitstream_queue_record_write(void) { queue_prev_w = queue_w; } in bitstream_queue_record_write()
51 void bitstream_queue_reset_write(void) { queue_w = queue_prev_w; } in bitstream_queue_reset_write()
53 int bitstream_queue_get_write(void) { return queue_w; } in bitstream_queue_get_write()
59 if (queue_w == queue_r) { in bitstream_queue_pop()
60 printf("buffer underflow queue_w %d queue_r %d\n", queue_w, queue_r); in bitstream_queue_pop()
72 result_queue[queue_w] = result; in bitstream_queue_push()
73 nsymbs_queue[queue_w] = nsymbs; in bitstream_queue_push()
74 memcpy(cdf_queue[queue_w], cdf, nsymbs * sizeof(*cdf)); in bitstream_queue_push()
75 queue_w = (queue_w + 1) % QUEUE_MAX_SIZE; in bitstream_queue_push()
[all …]
/external/libvpx/libvpx/vpx_util/
Dvpx_debug_util.c35 static int queue_w = 0; variable
43 void bitstream_queue_record_write(void) { queue_prev_w = queue_w; } in bitstream_queue_record_write()
45 void bitstream_queue_reset_write(void) { queue_w = queue_prev_w; } in bitstream_queue_reset_write()
47 int bitstream_queue_get_write(void) { return queue_w; } in bitstream_queue_get_write()
53 if (queue_w == queue_r) { in bitstream_queue_pop()
54 printf("buffer underflow queue_w %d queue_r %d\n", queue_w, queue_r); in bitstream_queue_pop()
65 result_queue[queue_w] = result; in bitstream_queue_push()
66 prob_queue[queue_w] = prob; in bitstream_queue_push()
67 queue_w = (queue_w + 1) % QUEUE_MAX_SIZE; in bitstream_queue_push()
68 if (queue_w == queue_r) { in bitstream_queue_push()
[all …]