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