59 	{	state->max_step_index = ARRAY_LEN (ima_steps) - 1 ;  in ima_oki_adpcm_init()
64 	{	state->max_step_index = ARRAY_LEN (oki_steps) - 1 ;  in ima_oki_adpcm_init()
198 	for (i = 0 ; i < ARRAY_LEN (test_codes) ; i++)  in test_oki_adpcm()
211 	for (i = 0 ; i < ARRAY_LEN (test_pcm) ; i += j)  in test_oki_adpcm()
229 	if (ARRAY_LEN (adpcm.pcm) < ARRAY_LEN (test_pcm))  in test_oki_adpcm_block()
230 …pcm->pcm) > ARRAY_LEN (test_pcm) (%d > %d).\n\n", __LINE__, ARRAY_LEN (adpcm.pcm), ARRAY_LEN (test…  in test_oki_adpcm_block()
234 	if (ARRAY_LEN (adpcm.codes) < ARRAY_LEN (test_codes))  in test_oki_adpcm_block()
244 	memcpy (adpcm.pcm, test_pcm, sizeof (adpcm.pcm [0]) * ARRAY_LEN (test_pcm)) ;  in test_oki_adpcm_block()
245 	adpcm.pcm_count = ARRAY_LEN (test_pcm) ;  in test_oki_adpcm_block()
250 	if (adpcm.code_count * 2 != ARRAY_LEN (test_pcm))  in test_oki_adpcm_block()
251 	{	printf ("\n\nLine %d : %d * 2 != %d\n\n", __LINE__, adpcm.code_count * 2, ARRAY_LEN (test_pcm)) ;  in test_oki_adpcm_block()
255 	for (k = 0 ; k < ARRAY_LEN (test_codes) ; k++)  in test_oki_adpcm_block()
268 	memcpy (adpcm.codes, test_codes, sizeof (adpcm.codes [0]) * ARRAY_LEN (test_codes)) ;  in test_oki_adpcm_block()
269 	adpcm.code_count = ARRAY_LEN (test_codes) ;  in test_oki_adpcm_block()
274 	if (adpcm.pcm_count != 2 * ARRAY_LEN (test_codes))  in test_oki_adpcm_block()
275 …{	printf ("\n\nLine %d : %d * 2 != %d\n\n", __LINE__, adpcm.pcm_count, 2 * ARRAY_LEN (test_codes))…  in test_oki_adpcm_block()
279 	for (k = 0 ; k < ARRAY_LEN (test_pcm) ; k++)  in test_oki_adpcm_block()