Lines Matching full:j
31 int i, j, item;
43 for (j = 0; j < sizes[i]; j++)
44 ptr[j] = '1';
48 for (j = 0; j < sizes[i] && !err; j++) {
49 if (ptr[j] != '1')
67 int i, j, item, last_index;
83 for (j = sizes[i] - 1; (j >= -underflow_range) &&
84 (!cur_mte_cxt.fault_valid); j--) {
85 ptr[j] = '1';
86 last_index = j;
91 for (j = 0; j < sizes[i]; j++) {
92 if (ptr[j] != '1') {
95 j, ptr);
110 for (j = 0 ; j < underflow_range; j++) {
111 if (und_ptr[j] != '1') {
128 for (j = last_index ; j < 0 ; j++) {
129 if (und_ptr[j] != '1') {
162 int i, j, item, last_index;
181 for (j = 0, last_index = 0 ; (j < (sizes[i] + overflow_range)) &&
182 (cur_mte_cxt.fault_valid == false); j++) {
183 ptr[j] = '1';
184 last_index = j;
189 for (j = 0; j < sizes[i]; j++) {
190 if (ptr[j] != '1') {
193 j, ptr);
211 for (j = 0 ; j < overflow_size; j++) {
212 if (over_ptr[j] != '1') {
229 for (j = tagged_size ; j < last_index; j++) {
230 if (over_ptr[j] != '1') {
244 for (j = 0 ; j < overflow_size; j++) {
245 if (over_ptr[j] == '1')
264 int j, result = KSFT_PASS;
319 for (j = 0; j < size; j++) {
320 if (src[j] != dst[j] || src[j] != '1') {