Branch Coverage

snappy/csnappy_compress.c
Criterion Covered Total %
branch 45 52 86.5


line true false branch
51 0 75600 if (v < (1<<7)) {
53 29610 45990 } else if (v < (1<<14)) {
56 45990 0 } else if (v < (1<<21)) {
60 0 0 } else if (v < (1<<28)) {
266 386474760 135800 while (likely(s2 <= s2_limit - 8)) {
267 386397865 76895 if (unlikely(UNALIGNED_LOAD64(s1 + matched) ==
286 436135 122220 while (likely(s2 < s2_limit)) {
287 422555 13580 if (likely(s1[matched] == *s2)) {
336 196210 0 if (n < 60) {
350 174475 21735 if (allow_fast_path && len <= 16) {
154105 20370 if (allow_fast_path && len <= 16) {
360 0 0 while (n > 0) {
380 37800 48374375 if ((len < 12) && (offset < 2048)) {
21910 15890 if ((len < 12) && (offset < 2048)) {
400 48188175 212695 while (len >= 68) {
407 11305 201390 if (len > 64) {
498 5495 138460 if (unlikely(input_size < kInputMarginBytes))
543 700 1308475 if (unlikely(next_ip > ip_limit))
551 1134000 174475 } while (likely(UNALIGNED_LOAD32(ip) !=
585 137760 74935 if (unlikely(ip >= ip_limit))
594 38220 36715 } while (GetUint32AtOffset(input_bytes, 1) == candidate_bytes);
602 21735 122220 if (next_emit < ip_end)
636 143955 75600 while (input_length > 0) {
639 75390 68565 if (unlikely(num_to_read < kBlockSize)) {
640 430360 25305 for (workmem_size = 9;
643 50085 380275 if ((1 << (workmem_size-1)) >= num_to_read)