This commit is contained in:
hexcoder 2021-03-05 18:11:05 +01:00 committed by GitHub
parent c9854ec8cb
commit 16d6f35aa6
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -4,7 +4,7 @@
This is an LLVM-based implementation of the context sensitive branch coverage.
Basically every function gets its own ID and, every time that an edge is logged,
Basically every function gets its own ID and, every time when an edge is logged,
all the IDs in the callstack are hashed and combined with the edge transition
hash to augment the classic edge coverage with the information about the
calling context.
@ -16,7 +16,7 @@ In math the coverage is collected as follows:
`map[current_location_ID ^ previous_location_ID >> 1 ^ hash_callstack_IDs] += 1`
The callstack hash is produced XOR-ing the function IDs to avoid explosion with
recusrsive functions.
recursive functions.
## Usage
@ -28,7 +28,7 @@ many map collisions occur.
## Caller Branch Coverage
If the context sensitive coverage introduces too may collisions becoming
If the context sensitive coverage introduces too may collisions and becoming
decremental, the user can choose to augment edge coverage with just the
called function ID, instead of the entire callstack hash.