equal
deleted
inserted
replaced
249 ((an<bn ? an:bn) + 1)); |
249 ((an<bn ? an:bn) + 1)); |
250 |
250 |
251 if (pos && l.base && t) { |
251 if (pos && l.base && t) { |
252 /* generate the matching block list */ |
252 /* generate the matching block list */ |
253 recurse(a, b, pos, 0, an, 0, bn, &l); |
253 recurse(a, b, pos, 0, an, 0, bn, &l); |
254 l.head->a1 = an; |
254 l.head->a1 = l.head->a2 = an; |
255 l.head->b1 = bn; |
255 l.head->b1 = l.head->b2 = bn; |
256 l.head++; |
256 l.head++; |
257 } |
257 } |
258 |
258 |
259 free(pos); |
259 free(pos); |
260 return l; |
260 return l; |