search for: branch_dest

...rily fully modeling fetch, decode, or prediction. If in > addition to an assembly file, we also feed the tool a trace of branch > executions, the tool could essentially unroll all loops dynamically. The > type of thing I'm thinking of would look like something like this: (ENTRY, > branch_dest, branch_dest, branch_dest) where each "branch_dest" is the > taken successor of the next encountered branch instruction. > > As an example, consider a simple loop which executes 3 times: > ENTRY: > # fallthrough > bb1: > # various instructions > jne bb1 >...

...without necessarily fully modeling fetch, decode, or prediction.  If in addition to an assembly file, we also feed the tool a trace of branch executions, the tool could essentially unroll all loops dynamically.  The type of thing I'm thinking of would look like something like this: (ENTRY, branch_dest, branch_dest, branch_dest) where each "branch_dest" is the taken successor of the next encountered branch instruction. As an example, consider a simple loop which executes 3 times: ENTRY:   # fallthrough bb1:   # various instructions   jne bb1 bb2:   ret The trace for this would lo...

Hi all, At Sony we developed an LLVM based performance analysis tool named llvm-mca. We currently use it internally to statically measure the performance of code, and to help triage potential problems with target scheduling models. We decided to post this RFC because we are interested in the feedback from the community, and we also believe that other people might be interested in a tool like