Home
last modified time | relevance | path

Searched refs:node_ptr (Results 1 – 3 of 3) sorted by relevance

/isa-l/igzip/
H A Dproc_heap_base.c62 build_huff_tree(struct heap_tree *heap_space, uint64_t heap_size, uint64_t node_ptr) in build_huff_tree() argument
75 heap[1] = ((h1 + h2) & ~0xFFFFull) | node_ptr; in build_huff_tree()
79 store_native_u16_to_u64(&heap[node_ptr], h1); in build_huff_tree()
80 store_native_u16_to_u64(&heap[node_ptr - 1], h2); in build_huff_tree()
81 node_ptr -= 2; in build_huff_tree()
84 store_native_u16_to_u64(&heap[node_ptr], h1); in build_huff_tree()
85 return node_ptr; in build_huff_tree()
H A Dproc_heap.asm30 ; returns modified node_ptr
50 %define node_ptr rax
70 mov node_ptr, arg3
84 mov [heap + node_ptr*8], h1 %+ w
85 mov [heap + node_ptr*8 - 8], h2 %+ w
88 or h3, node_ptr
89 sub node_ptr, 2
100 mov [heap + node_ptr*8], h1 %+ w
H A Dhuff_codes.c595 build_huff_tree(struct heap_tree *heap, uint64_t heap_size, uint64_t node_ptr);
931 uint32_t root_node = HEAP_TREE_NODE_START, node_ptr; in gen_huff_code_lens() local
939 for (node_ptr = root_node; node_ptr < end_node; node_ptr++) in gen_huff_code_lens()
940 codes[tree[node_ptr].child].length = tree[node_ptr].depth; in gen_huff_code_lens()