Searched refs:curr_table (Results 1 – 4 of 4) sorted by relevance
124 poll_wait_entry_table *curr_table = NULL; in destroy_poll_wait() local136 curr_table = wait->table; in destroy_poll_wait()137 wait->table = curr_table->next; in destroy_poll_wait()139 for (i = 0; i < curr_table->index; ++i) in destroy_poll_wait()141 wait_node = &curr_table->items[i]; in destroy_poll_wait()146 free(curr_table); in destroy_poll_wait()
224 if (root_table->curr_segment->curr_table + total_size >= in VP8LBuildHuffmanTable()244 next->curr_table = next->start; in VP8LBuildHuffmanTable()253 BuildHuffmanTable(root_table->curr_segment->curr_table, root_bits, in VP8LBuildHuffmanTable()259 BuildHuffmanTable(root_table->curr_segment->curr_table, root_bits, in VP8LBuildHuffmanTable()273 root->curr_table = root->start; in VP8LHuffmanTablesAllocate()
51 HuffmanCode* curr_table; member
480 htrees[j] = huffman_tables->curr_segment->curr_table; in ReadHuffmanCodes()488 huffman_tables->curr_segment->curr_table += size; in ReadHuffmanCodes()