166 	int32_t *pb;  in create_qt_tbl()  local
175 		pb = alloc_pool(jd, 64 * sizeof (int32_t));/* Allocate a memory block for the table */  in create_qt_tbl()
176 		if (!pb) return JDR_MEM1;				/* Err: not enough memory */  in create_qt_tbl()
177 		jd->qttbl[i] = pb;						/* Register the table */  in create_qt_tbl()
180 …pb[zi] = (int32_t)((uint32_t)*data++ * Ipsf[zi]);	/* Apply scale factor of Arai algorithm to the d…  in create_qt_tbl()
202 	uint8_t d, *pb, *pd;  in create_huffman_tbl()  local
212 		pb = alloc_pool(jd, 16);			/* Allocate a memory block for the bit distribution table */  in create_huffman_tbl()
213 		if (!pb) return JDR_MEM1;			/* Err: not enough memory */  in create_huffman_tbl()
214 		jd->huffbits[num][cls] = pb;  in create_huffman_tbl()
216 			np += (pb[i] = *data++);		/* Get sum of code words for each code */  in create_huffman_tbl()
223 			b = pb[i];  in create_huffman_tbl()
256 				for (j = pb[b]; j; j--) {  in create_huffman_tbl()