Branch Coverage

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


line true false branch
80 0 0 for (i = 0; i < xpp->anchors_nr; i++) {
81 0 0 if (!strncmp(line, xpp->anchors[i], strlen(xpp->anchors[i])))
92 0 0 map->env->xdf1.recs : map->env->xdf2.recs;
106 0 0 while (map->entries[index].line1) {
107 0 0 if (map->entries[index].hash != record->ha) {
108 0 0 if (++index >= map->alloc)
112 0 0 if (pass == 2)
114 0 0 if (pass == 1 || map->entries[index].line2)
0 0 if (pass == 1 || map->entries[index].line2)
120 0 0 if (pass == 2)
125 0 0 if (!map->first)
127 0 0 if (map->last) {
156 0 0 if (!result->entries)
161 0 0 while (count1--)
165 0 0 while (count2--)
180 0 0 while (left + 1 < right) {
183 0 0 if (sequence[middle]->line2 > entry->line2)
214 0 0 for (entry = map->first; entry; entry = entry->next) {
215 0 0 if (!entry->line2 || entry->line2 == NON_UNIQUE)
0 0 if (!entry->line2 || entry->line2 == NON_UNIQUE)
218 0 0 entry->previous = i < 0 ? NULL : sequence[i];
220 0 0 if (i <= anchor_i)
223 0 0 if (entry->anchor) {
226 0 0 } else if (i == longest) {
232 0 0 if (!longest) {
240 0 0 while (entry->previous) {
267 0 0 if (first) {
270 0 0 while (next1 > line1 && next2 > line2 &&
279 0 0 while (line1 < next1 && line2 < next2 &&
286 0 0 if (next1 > line1 || next2 > line2) {
0 0 if (next1 > line1 || next2 > line2) {
287 0 0 if (patience_diff(map->file1, map->file2,
294 0 0 if (!first)
297 0 0 while (first->next &&
0 0 while (first->next &&
298 0 0 first->next->line1 == first->line1 + 1 &&
336 0 0 if (!count1) {
337 0 0 while(count2--)
340 0 0 } else if (!count2) {
341 0 0 while(count1--)
347 0 0 if (fill_hashmap(file1, file2, xpp, env, &map,
352 0 0 if (!map.has_matches) {
353 0 0 while(count1--)
355 0 0 while(count2--)
362 0 0 if (first)
376 0 0 if (xdl_prepare_env(file1, file2, xpp, env) < 0)