Branch Coverage

deps/libgit2/src/xdiff/xpatience.c
Criterion Covered Total %
branch 0 92 0.0


line true false branch
82 0 0 for (i = 0; i < xpp->anchors_nr; i++) {
83 0 0 if (!strncmp(line, xpp->anchors[i], strlen(xpp->anchors[i])))
94 0 0 map->env->xdf1.recs : map->env->xdf2.recs;
108 0 0 while (map->entries[index].line1) {
114 0 0 if (++index >= map->alloc)
118 0 0 if (pass == 2)
120 0 0 if (pass == 1 || map->entries[index].line2)
0 0 if (pass == 1 || map->entries[index].line2)
126 0 0 if (pass == 2)
131 0 0 if (!map->first)
133 0 0 if (map->last) {
162 0 0 if (!result->entries)
167 0 0 while (count1--)
171 0 0 while (count2--)
186 0 0 while (left + 1 < right) {
189 0 0 if (sequence[middle]->line2 > entry->line2)
220 0 0 if (!sequence)
223 0 0 for (entry = map->first; entry; entry = entry->next) {
224 0 0 if (!entry->line2 || entry->line2 == NON_UNIQUE)
0 0 if (!entry->line2 || entry->line2 == NON_UNIQUE)
227 0 0 entry->previous = i < 0 ? NULL : sequence[i];
229 0 0 if (i <= anchor_i)
232 0 0 if (entry->anchor) {
235 0 0 } else if (i == longest) {
241 0 0 if (!longest) {
249 0 0 while (entry->previous) {
277 0 0 if (first) {
280 0 0 while (next1 > line1 && next2 > line2 &&
289 0 0 while (line1 < next1 && line2 < next2 &&
296 0 0 if (next1 > line1 || next2 > line2) {
0 0 if (next1 > line1 || next2 > line2) {
300 0 0 if (patience_diff(map->file1, map->file2,
307 0 0 if (!first)
310 0 0 while (first->next &&
0 0 while (first->next &&
311 0 0 first->next->line1 == first->line1 + 1 &&
347 0 0 if (!count1) {
348 0 0 while(count2--)
351 0 0 } else if (!count2) {
352 0 0 while(count1--)
358 0 0 if (fill_hashmap(file1, file2, xpp, env, &map,
363 0 0 if (!map.has_matches) {
364 0 0 while(count1--)
366 0 0 while(count2--)
373 0 0 if (first)
387 0 0 if (xdl_prepare_env(file1, file2, xpp, env) < 0)