g                  52 src/liblzma/check/sha256.c 	h(i) += S1(e(i)) + Ch(e(i), f(i), g(i)) + SHA256_K[i + j] \
g                 107 src/liblzma/check/sha256.c 	state[6] += g(0);
g                 563 src/liblzma/common/index.c 	const index_group *g = (const index_group *)(s->groups.rightmost);
g                 565 src/liblzma/common/index.c 			g == NULL ? 0 : g->records[g->last].unpadded_sum,
g                 650 src/liblzma/common/index.c 	index_group *g = (index_group *)(s->groups.rightmost);
g                 652 src/liblzma/common/index.c 	const lzma_vli compressed_base = g == NULL ? 0
g                 653 src/liblzma/common/index.c 			: vli_ceil4(g->records[g->last].unpadded_sum);
g                 654 src/liblzma/common/index.c 	const lzma_vli uncompressed_base = g == NULL ? 0
g                 655 src/liblzma/common/index.c 			: g->records[g->last].uncompressed_sum;
g                 673 src/liblzma/common/index.c 	if (g != NULL && g->last + 1 < g->allocated) {
g                 675 src/liblzma/common/index.c 		++g->last;
g                 678 src/liblzma/common/index.c 		g = lzma_alloc(sizeof(index_group)
g                 681 src/liblzma/common/index.c 		if (g == NULL)
g                 684 src/liblzma/common/index.c 		g->last = 0;
g                 685 src/liblzma/common/index.c 		g->allocated = i->prealloc;
g                 692 src/liblzma/common/index.c 		g->node.uncompressed_base = uncompressed_base;
g                 693 src/liblzma/common/index.c 		g->node.compressed_base = compressed_base;
g                 694 src/liblzma/common/index.c 		g->number_base = s->record_count + 1;
g                 697 src/liblzma/common/index.c 		index_tree_append(&s->groups, &g->node);
g                 701 src/liblzma/common/index.c 	g->records[g->last].uncompressed_sum
g                 703 src/liblzma/common/index.c 	g->records[g->last].unpadded_sum
g                 797 src/liblzma/common/index.c 		index_group *g = (index_group *)(s->groups.rightmost);
g                 798 src/liblzma/common/index.c 		if (g != NULL && g->last + 1 < g->allocated) {
g                 799 src/liblzma/common/index.c 			assert(g->node.left == NULL);
g                 800 src/liblzma/common/index.c 			assert(g->node.right == NULL);
g                 803 src/liblzma/common/index.c 					+ (g->last + 1)
g                 809 src/liblzma/common/index.c 			newg->node = g->node;
g                 810 src/liblzma/common/index.c 			newg->allocated = g->last + 1;
g                 811 src/liblzma/common/index.c 			newg->last = g->last;
g                 812 src/liblzma/common/index.c 			newg->number_base = g->number_base;
g                 814 src/liblzma/common/index.c 			memcpy(newg->records, g->records, newg->allocated
g                 817 src/liblzma/common/index.c 			if (g->node.parent != NULL) {
g                 818 src/liblzma/common/index.c 				assert(g->node.parent->right == &g->node);
g                 819 src/liblzma/common/index.c 				g->node.parent->right = &newg->node;
g                 822 src/liblzma/common/index.c 			if (s->groups.leftmost == &g->node) {
g                 823 src/liblzma/common/index.c 				assert(s->groups.root == &g->node);
g                 828 src/liblzma/common/index.c 			if (s->groups.rightmost == &g->node)
g                 831 src/liblzma/common/index.c 			lzma_free(g, allocator);
g                1028 src/liblzma/common/index.c 		const index_group *g = (const index_group *)(
g                1035 src/liblzma/common/index.c 				+ vli_ceil4(g->records[g->last].unpadded_sum);
g                1037 src/liblzma/common/index.c 				= g->records[g->last].uncompressed_sum;