search for: dupliact

...into discriminator does not mean that we will change the profile. The encoded info in discriminator will be handled by the create_llvm_prof tool, which combines counts from different clones of the same source code and generate the combined profile data. The output profile will not have any cloning/dupliaction bits at all. So for the initial example profile I provided, the output profile will be: On Tue, Nov 1, 2016 at 1:04 PM, Hal Finkel <hfinkel at anl.gov> wrote: > > ------------------------------ > > *From: *"Paul Robinson" <paul.robinson at sony.com> > *To:...

...t mean that we will change the profile. The encoded info in discriminator >> will be handled by the create_llvm_prof tool, which combines counts from >> different clones of the same source code and generate the combined profile >> data. The output profile will not have any cloning/dupliaction bits at all. >> So for the initial example profile I provided, the output profile will be: >> > > #1: 10 > #3: 80 > > Not: > > #1: 10 > #3.0x400: 70 > #3.0x10400: 5 > #3.0x20400: 3 > #3.0x30400: 2 > > The goal of the proposed change, is to make...

...the create_llvm_prof tool, > > > > which > > > > combines counts from different clones of the same source code > > > > and > > > > generate the combined profile data. The output profile will not > > > > have > > > > any cloning/dupliaction bits at all. So for the initial example > > > > profile I provided, the output profile will be: > > > > > > > > > #1: 10 > > > > > > #3: 80 > > > > > > Not: > > > > > > #1: 10 > > >...

...ent clones of the same source > > > > > > code > > > > > > and > > > > > > generate the combined profile data. The output profile will > > > > > > not > > > > > > have > > > > > > any cloning/dupliaction bits at all. So for the initial > > > > > > example > > > > > > profile I provided, the output profile will be: > > > > > > > > > > > > > > > > > > > > #1: 10 > > > > > > >...

As illustrated in the above example, it is not like "vectorization has a distinct bit". All different optimizations make clones of code which will be labeled by UIDs represented by N (e.g. 8) bits. In this way, the space will be capped by the number of clones all optimizations have made, instead of # of optimizations that has applied. And it will be capped at 2^N-1. The cons of using uid

...> > > and > > > > > > > > generate the combined profile data. The output profile > > > > > > > > will > > > > > > > > not > > > > > > > > have > > > > > > > > any cloning/dupliaction bits at all. So for the initial > > > > > > > > example > > > > > > > > profile I provided, the output profile will be: > > > > > > > > > > > > > > > > > > > > > > > > >...

...gt;>> discriminator will be handled by the create_llvm_prof tool, which combines >>>>>> counts from different clones of the same source code and generate the >>>>>> combined profile data. The output profile will not have any >>>>>> cloning/dupliaction bits at all. So for the initial example profile I >>>>>> provided, the output profile will be: >>>>>> >>>>> >>>>> #1: 10 >>>>> #3: 80 >>>>> >>>>> Not: >>>>> >>>&...

...into discriminator does not mean that we will change the profile. The encoded info in discriminator will be handled by the create_llvm_prof tool, which combines counts from different clones of the same source code and generate the combined profile data. The output profile will not have any cloning/dupliaction bits at all. So for the initial example profile I provided, the output profile will be: #1: 10 #3: 80 Not: #1: 10 #3.0x400: 70 #3.0x10400: 5 #3.0x20400: 3 #3.0x30400: 2 Also, how does this work for vectorization? For vectorization, you're going to multiply by the duplication factor first...