Lines Matching refs:J
296 static void stone(const int *a, int n, const int *b, int *J, int pref) in stone() argument
346 J[q->x + pref] = q->y + pref; in stone()
452 int *J, slen[2], *class, *member; in create_J() local
551 J = xmalloc((nlen[0] + 2) * sizeof(J[0])); in create_J()
558 J[i] = i <= pref ? i : in create_J()
561 stone(class, slen[0], member, J, pref); in create_J()
562 J[nlen[0] + 1] = nlen[1] + 1; in create_J()
572 if (!J[i]) in create_J()
576 seek_ft(&ft[1], ix[1][J[i] - 1]); in create_J()
578 for (j = J[i]; i <= nlen[0] && J[i] == j; i++, j++) { in create_J()
587 J[i] = 0; /* Break the correspondence */ in create_J()
593 return J; in create_J()
605 int *J; in diff() local
611 J = create_J(ft, nlen, ix); in diff()
619 for (v[0].a = i; v[0].a <= nlen[0] && J[v[0].a] == J[v[0].a - 1] + 1; v[0].a++) in diff()
621 v[1].a = J[v[0].a - 1] + 1; in diff()
623 for (v[0].b = v[0].a - 1; v[0].b < nlen[0] && !J[v[0].b + 1]; v[0].b++) in diff()
625 v[1].b = J[v[0].b + 1] - 1; in diff()
657 J[v[0].b] = v[1].b; in diff()
703 free(J); in diff()