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