/media/sda-magnetic/david/Dokumente-15/fernuni-hagen/cs-i-ii/old-cs-2-03/kmp/kmp2.c

int p [N];


prefetch (int start) {
    int i;
    int j;

    for (i = start+1, j = 0;  i < N;  i++, j++) {
        while (p [i] == p[j]) {
           if (p [start] == p[j])
               prefetch (j);
           j++;
           i++;
        }
    }  

}