search for: coarsest

...alled mass. Both size and mass are continuous ratio data to all intents and purposes. The data actually represents sieving of sand where $size is sieve aperture and where $mass is the amount remaining on the sieve. So if I sieve 100g of sand through increasingly fine sieves nothing remains on the coarsest sieve say 2500 microns. Between 2000 and 2500 microns there is 0.2g remining on the 2000micron sieve etc. as per the data supplied. size, mass 2500, 0 2000, 0.2 1700, 1.8 1400, 5 1000, 13 800, 40 600, 20 300, 15 180, 3 <180, 2 The data here I have made up for simplicity. In general sands tend...

On Tue, Dec 19, 2017 at 9:10 AM, Siddharth Bhat via llvm-dev < llvm-dev at lists.llvm.org> wrote: > I could be entirely wrong, but from my understanding of memorySSA, each > def defines an "abstract heap state" which has the coarsest possible > definition - any write will be modelled as a "new heap state". > This is true for def-def relationships, but doesn't;'t matter here. > > So in that sense, from what I understand, it does not actually model the > heap in a fine grained way. > >...

...can algorithm satisfy the queries asked by a coalescer that expects a graph coloring algorithm? I don't know. It would be nice if it could, to ease the burden on the user as explained above. I think it can if the queries are not too fine-grained. The interface in the patch is pretty much the coarsest grain that I could think of. It would be bad, for example, to add interfaces like "does this graph node have neighbors of degree > N?" because not every allocator could answer it. The coalesceThisCopy interface is there for similar reasons. Some coalescing algorithms (Briggs' c...

Hi David, Sorry I should have replied earlier. I really don't like this dual interface approach. To me, this muddles things without offering any real useful new functionalities. IMHO, if a register coalescer is tied to a particular allocator. Then either it should simply belong to that allocator or that we have to allow the allocator to act as a pass manager itself, i.e. it can

Hi, I am new to MemorySSA and wanted to understand its capabilities. Hence I wrote the following program (test.c): int N; void test(int *restrict a, int *restrict b, int *restrict c, int *restrict d, int *restrict e) { int i; for (i = 0; i < N; i = i + 5) { a[i] = b[i] + c[i]; } for (i = 0; i < N - 5; i = i + 5) { e[i] = a[i] * d[i]; } } I compiled this program using

...ked by a coalescer that expects a graph coloring > algorithm? > I don't know. It would be nice if it could, to ease the burden on > the user as > explained above. I think it can if the queries are not too fine- > grained. The > interface in the patch is pretty much the coarsest grain that I > could think > of. It would be bad, for example, to add interfaces like "does > this graph > node have neighbors of degree > N?" because not every allocator could > answer it. I don't think we need that level of abstraction right now. :-) > &g...