Displaying 9 results from an estimated 9 matches for "mayuse".
2013 Mar 21
2
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
...Y 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 BitVectors.)
For STMT1, the MayDef={ALL_MEMORY}, MayUse={}
For STMT2, the MayDef={ALL_MEMORY}, MayUse={'a'}
---------------------
e.g2:
extern int A[100];
int * q;
v...
2013 Mar 21
2
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
...bed the actually variable.
b.union(c) equal to {MD10, MD20}
a.union(b) equal to {MD1}
b.union(a) equal to {MD1}
Our flow-sensitive method is divided into 2 step:
1. Iterative solve flow-equation to compute POINT-TO for each stmt.
2. According to POINT-TO info, compute MayDef BITSET and MayUse BITSET for each stmt.
So, I have an question, after step 2 each stmt should own two BITSETs to record MayDef and MayUse.
Is that right or necessary?
How to describe both MayDef, MayUse info if just have a single BITSET in each stmt?
--- 13年3月21日，周四, Daniel Berlin <dberlin at dberlin.org>...
2013 Mar 22
0
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
...a.union(b) equal to {MD1}
> b.union(a) equal to {MD1}
>
> Our flow-sensitive method is divided into 2 step:
> 1. Iterative solve flow-equation to compute POINT-TO for each stmt.
> 2. According to POINT-TO info, compute MayDef BITSET and MayUse BITSET for each stmt.
>
> So, I have an question, after step 2 each stmt should own two BITSETs to record MayDef and MayUse.
> Is that right or necessary?
It's fine, it's not strictly necessary, but it's not bad or harmful.
> How to describe both MayDef, MayUse info if ju...
2013 Mar 21
0
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
...d 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 BitVectors.)
Well, actually, this is what led to bdd representations.
GCC uses sparse bitmaps, which work fine for intraprocedural use.
We do a large amount of presolv...
2013 Mar 13
0
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
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;
> }
>
2013 Mar 13
2
[LLVMdev] How to describe a pointer that points to All memory(include global memory, heap, stack)?
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
2008 Mar 01
0
[LLVMdev] Google Summer of Code Idea
On Feb 28, 2008, at 10:43 AM, Richard Warburton wrote:
> This email is written on the premise that LLVM will be involved in
> GSOC again this year.
I hope so too!
> I would be looking to implement a context-sensitive alias analysis.
> Whilst I accept that this isn't the most efficient category of alias
> analysis, I think the implementation of such an analysis, that trades
2008 Mar 01
2
[LLVMdev] Google Summer of Code Idea
...gt; default. However, it must be sound.
Both of my suggested algorithms have been implemented in Java - which,
by virtue of reflection, means one cannot statically determine which
class certain object are referring to. In this instance I believe
they simply assume the most conservative case (ie mayuse/maydef at
that point could be anything). I suspect that this approach could be
equally applied to an unknown library.
> Also, LLVM benefits quite a bit from mod/ref info for function. I
> don't know if you've thought about it at all, but it is an important
> problem. If you&...
2008 Feb 28
4
[LLVMdev] Google Summer of Code Idea
This email is written on the premise that LLVM will be involved in
GSOC again this year. I noted that the wiki's open projects page [0]
has several possible projects, that seem suitable for a summer of code
project. I am writing this email to this list with the hope of
getting some feedback on specifics for a GSOC application, and also
wondering if any potential mentors are interested in