aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Target/WebAssembly/WebAssemblyTargetMachine.cpp
diff options
context:
space:
mode:
authorVedant Kumar <vsk@apple.com>2018-05-31 22:09:01 +0000
committerVedant Kumar <vsk@apple.com>2018-05-31 22:09:01 +0000
commitcc5a6163a4a182f439827f2b17c9ea871332c954 (patch)
tree307580c4a505351674339cdf3548cad0f4728c30 /llvm/lib/Target/WebAssembly/WebAssemblyTargetMachine.cpp
parent7e4c84a78c5d3dc13f0fc9c20a63e2fcdcb84e55 (diff)
downloadllvm-cc5a6163a4a182f439827f2b17c9ea871332c954.zip
llvm-cc5a6163a4a182f439827f2b17c9ea871332c954.tar.gz
llvm-cc5a6163a4a182f439827f2b17c9ea871332c954.tar.bz2
[IRMemoryMap] Test interleaved Mallocs and Frees
This adds a new command to the ir-memory-map tester: free <allocation-index> The argument to free is an index which identifies which live allocation to free. Index 0 identifies the first live allocation in the address space, index 1 identifies the second, etc. where the allocations are sorted in increasing order. For illustrative purposes, assume malloc returns monotonically increasing addresses. Here are some examples of how free would work: Example 1 --------- malloc 16 1 malloc 32 1 free 1 //< Free the 32-byte allocation. free 0 //< Next, free the 16-byte allocation. Example 2 --------- malloc 16 1 malloc 32 1 free 0 //< Free the 16-byte allocation. free 0 //< Next, free the 32-byte allocation. llvm-svn: 333700
Diffstat (limited to 'llvm/lib/Target/WebAssembly/WebAssemblyTargetMachine.cpp')
0 files changed, 0 insertions, 0 deletions