Lines Matching defs:j1
341 int i, j, p, j1, j2, t;
354 for (j1 = 0; j1 < 0x2000; j1++) {
358 j = 8*j1+j2;
365 line[j1] = -2;
367 line[j1] = -1;
369 line[j1] = 0;
372 for (j1 = 0; j1 < 0x2000; j1++) {
373 if (line[j1] >= 0) {
375 && ((j1 > 0 && line[j1-1] == tableno-1)
376 || ((tables[tableno-1].maxline >> 5) == (j1 >> 5)
377 && j1 - tables[tableno-1].maxline <= 8))) {
378 line[j1] = tableno-1;
379 tables[tableno-1].maxline = j1;
382 line[j1] = tableno-1;
383 tables[tableno-1].minline = tables[tableno-1].maxline = j1;
389 j1 = 8*tables[t].minline;
391 for (j = j1; j < j2; j++)
416 for (j1 = tables[t].minline; j1 <= tables[t].maxline; j1++) {
417 if ((j1 % 0x20) == 0 && j1 > tables[t].minline)
418 fprintf(f, " /* 0x%04x */\n", 8*j1);
421 j = 8*j1+j2;
424 fprintf(f, " /* 0x%02x-0x%02x */\n", 8*(j1 % 0x20), 8*(j1 % 0x20)+7);
432 for (j1 = 0; j1 < 0x2000;) {
433 t = line[j1];
434 for (j2 = j1; j2 < 0x2000 && line[j2] == t; j2++);
437 if (!(t == -2 || (t == -1 && j1 == 0)))
439 j1 = j2;
446 for (j1 = 0; j1 < 0x2000;) {
447 t = line[j1];
448 for (j2 = j1; j2 < 0x2000 && line[j2] == t; j2++);
450 if (j1 != tables[t].minline) abort();
456 if (j1 == 0)
462 if (j2 != j1+1) abort();
463 for (j = 8*j1; j < 8*j2; j++)
469 if (j1 == 0) {
472 fprintf(f, "if (wc >= 0x%04x && wc < 0x%04x)", 8*j1, 8*j2);
475 if (j1 == 0)
483 fprintf(f, "-0x%04x", 8*j1);
485 if (j1 == 0 && uni2charset[0] == 0)
491 j1 = j2;
513 int i1, i2, i3, i1_min, i1_max, j1, j2;
548 for (j1 = 0; j1 < 32; j1++)
550 if (uni2charset[256*p+8*j1+j2] != 0) {
551 if (j1_min > j1) j1_min = j1;
552 if (j1_max < j1) j1_max = j1;
556 for (j1 = j1_min; j1 <= j1_max; j1++) {
559 printf("0x%02x, ", uni2charset[256*p+8*j1+j2]);
560 printf("/""* 0x%02x-0x%02x *""/\n", 8*j1, 8*j1+7);