search for: stmt1

...k count context info in additional > metadata. But when you use it in optimizer, I suppose you will need > to convert it to branch probability too? > Let me take an example to demonstrate my understanding of your use of > context-sensitive profile. > original code: > for () > stmt1; > optimized code: > if (cond1) > for() > stmt1; //100 samples > else if (cond2) > for() > stmt1; // 0 samples > else > for() > stmt1; // 50 samples > The loop was multi-versioned by cond1 and cond2. With my proposal, > the profile for stmt1 will be combined as...

...rameter-pointer or a global-pointer might point to. Then I defined several special Virtual Memory Locations: ALL_MEMORY, GLOBAL_MEMORY, STACK_MEMORY, HEAP_MEMORY. ALL_MEMORY contains GLOBAL_MEMORY, STACK_MEMORY, HEAP_MEMORY. e.g1: extern int * q; void f(int * p) { int a; *p = 0; //STMT1 *q = a; //STMT2 } For above case, both p and q pointed to ALL_MEMORY: p->ALL_MEMORY, q->ALL_MEMORY. And each STMT has two BitVectors to describe MayDef, MayUse. (I think the BitVector must be sparse, otherwise the alias-analysis module need too much memory to allocate for all BitVect...

...too? > > > > > > Let me take an example to demonstrate my understanding of your > > > use > > > of > > > context-sensitive profile. > > > > > > original code: > > > > > > for () > > > > > > stmt1; > > > > > > optimized code: > > > > > > if (cond1) > > > > > > for() > > > > > > stmt1; //100 samples > > > > > > else if (cond2) > > > > > > for() > > > > > &g...

----- Original Message ----- > From: "Hal Finkel via llvm-dev" <llvm-dev at lists.llvm.org> > To: "Dehao Chen" <dehao at google.com> > Cc: "llvm-dev" <llvm-dev at lists.llvm.org>, "Xinliang David Li" > <davidxl at google.com> > Sent: Tuesday, November 1, 2016 4:26:17 PM > Subject: Re: [llvm-dev] (RFC) Encoding code

...ptimizer, I suppose you will need to convert it to >>> branch probability too? >>> >>> Let me take an example to demonstrate my understanding of your use of >>> context-sensitive profile. >>> >>> original code: >>> for () >>> stmt1; >>> >>> optimized code: >>> if (cond1) >>> for() >>> stmt1; //100 samples >>> else if (cond2) >>> for() >>> stmt1; // 0 samples >>> else >>> for() >>> stmt1; // 50 samples >&gt...

...representation in GCC of points to anything is a single bit flag. We don't keep sparse bit vectors around just to have a single bit set in them. > > e.g1: > extern int * q; > void f(int * p) > { > int a; > *p = 0; //STMT1 > *q = a; //STMT2 > } > For above case, both p and q pointed to ALL_MEMORY: p->ALL_MEMORY, q->ALL_MEMORY. > And each STMT has two BitVectors to describe MayDef, MayUse. > (I think the BitVector must be sparse, otherwise the alias-anal...

.... > We don't keep sparse bit vectors around just to have a > single bit set in them. > > > > > >         e.g1: > >         extern int * q; > >         void f(int * p) > >         { > >             int > a; > >             *p > = 0; //STMT1 > >             *q > = a; //STMT2 > >         } > >         For above case, > both p and q pointed to ALL_MEMORY: p->ALL_MEMORY, > q->ALL_MEMORY. > >         And each STMT has > two BitVectors to describe MayDef, MayUse. > >         (I think the >...

...record more instruction/basicblock count context info in additional metadata. But when you use it in optimizer, I suppose you will need to convert it to branch probability too? Let me take an example to demonstrate my understanding of your use of context-sensitive profile. original code: for () stmt1; optimized code: if (cond1) for() stmt1; //100 samples else if (cond2) for() stmt1; // 0 samples else for() stmt1; // 50 samples The loop was multi-versioned by cond1 and cond2. With my proposal, the profile for stmt1 will be combined as 150 samples. If we use this profile to...

...ound just to have a >> single bit set in them. >> >> >> > >> > e.g1: >> > extern int * q; >> > void f(int * p) >> > { >> > int >> a; >> > *p >> = 0; //STMT1 >> > *q >> = a; //STMT2 >> > } >> > For above case, >> both p and q pointed to ALL_MEMORY: p->ALL_MEMORY, >> q->ALL_MEMORY. >> > And each STMT has >> two BitVectors to describe MayDef, MayUse. >...

On 3/13/13 4:06 AM, Steven Su wrote: > Hello, could any one point me following question. Without any context, your question is difficult to answer. Are you building a points-to analysis and wanting to know how an alias analysis might encode the fact that a pointer could alias any other pointer? -- John T. > > e.g: > void foo(int * p) > { > *p = 0; > } >

Hello, could any one point me following question. e.g: void foo(int * p) { *p = 0; } Here 'p' may point to all memory location. Could you tell me how to represent the POINT TO set of 'p'? Here is my solution: Introduce a memory-class named: Global_Mem, then p pointed to global_mem. And the MOD set of '*p=0' is

...n AFDO sees samples with different IP addresses that map to the same source line, it uses a max function to get the maximum number of samples and attach to that line. From this prospective, current AFDO is not control flow sensitive. Consider the following example: // Original code: for() Stmt1; // line 10 // After a versioning optimization for() { if (cond1) stmt1; // line 10, 100 samples, address: C1 else if (cond2) stmt1; // line 10, 80 samples, address: C2 else stmt1; // line 10, 20 samples, address: C3 } In the final binary, stmt1 i...

...n AFDO sees samples with different IP addresses that map to the same source line, it uses a max function to get the maximum number of samples and attach to that line. From this prospective, current AFDO is not control flow sensitive. Consider the following example: // Original code: for() Stmt1; // line 10 // After a versioning optimization for() { if (cond1) stmt1; // line 10, 100 samples, address: C1 else if (cond2) stmt1; // line 10, 80 samples, address: C2 else stmt1; // line 10, 20 samples, address: C3 } In the final binary, stmt1...

Hi Everyone, Can anyone help why the errors are coming and rectify it? invalid.ids <- c(1,3,5) if (length(invalid.ids)==0) { cat("No Errors found") } else {