Lines Matching refs:ARRAY_LEN
64 for (i = 0 ; i < ARRAY_LEN (test_codes) ; i++)
76 for (i = 0 ; i < ARRAY_LEN (test_pcm) - 1 ; i += 2)
94 if (ARRAY_LEN (adpcm.pcm) < ARRAY_LEN (test_pcm))
95 { 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)) ;
99 if (ARRAY_LEN (adpcm.codes) < ARRAY_LEN (test_codes))
100 { printf ("\n\nLine %d : ARRAY_LEN (adcodes->codes) > ARRAY_LEN (test_codes).n", __LINE__) ;
108 memcpy (adpcm.pcm, test_pcm, sizeof (adpcm.pcm [0]) * ARRAY_LEN (test_pcm)) ;
109 adpcm.pcm_count = ARRAY_LEN (test_pcm) ;
114 if (adpcm.code_count * 2 != ARRAY_LEN (test_pcm))
115 { printf ("\n\nLine %d : %d * 2 != %d\n\n", __LINE__, adpcm.code_count * 2, ARRAY_LEN (test_pcm)) ;
119 for (k = 0 ; k < ARRAY_LEN (test_codes) ; k++)
131 memcpy (adpcm.codes, test_codes, sizeof (adpcm.codes [0]) * ARRAY_LEN (test_codes)) ;
132 adpcm.code_count = ARRAY_LEN (test_codes) ;
137 if (adpcm.pcm_count != 2 * ARRAY_LEN (test_codes))
138 { printf ("\n\nLine %d : %d * 2 != %d\n\n", __LINE__, adpcm.pcm_count, 2 * ARRAY_LEN (test_codes)) ;
142 for (k = 0 ; k < ARRAY_LEN (test_pcm) ; k++)