search for: stepan

Hi, Please find the attached patch for review. -Stepan. John McCall wrote: > On Oct 28, 2011, at 2:00 AM, Stepan Dyatkovskiy wrote: >> I found next code when switch instruction differs: >> >> Engine.logf("right switch has extra case %r")<< CaseValue; >> >> Where CaseValue is a ConstantInt object. Looki...

...estion about 'load' instruction. When we promote v2i5 = load <addr> ; <MemoryVT = v2i5> to v2i64 = load <addr> ;<MemoryVT = v2i5> should we insert vector shuffling that moves second v2i5 item to the second v2i64 item? Or it is still depends from target? Thanks. -Stepan.

...lvm.org/bugs/show_bug.cgi?id=1784 I found that know Type and Vector Lagalization and in DAGCombining implicitly assumed that element size of MemoryVT is multiply of 8 bits. Thats the main reason why v2i5 works improperly with load/store. But I can't determine exactly what MemoryVT means... -Stepan. Stepan Dyatkovskiy wrote: > Probably, I misunderstood MemoryVT purpose? Should it be a type that > equal to original vector type (e.g. v2i5). Or it is a type of memory > area for this vector (e.g. v2i8) ? > > -Stepan. > > Stepan Dyatkovskiy wrote: >> Hi all. The questio...

ping. -Stepan. Stepan Dyatkovskiy wrote: > Hi, > > Please find the attached patch for review. > > -Stepan. > > John McCall wrote: >> On Oct 28, 2011, at 2:00 AM, Stepan Dyatkovskiy wrote: >>> I found next code when switch instruction differs: >>> >>> Engine....

Stepan, If you interested in only running a subset of the suite, then you can just cd to the associated subdirectory and execute the make command there. Due to the structuring of the makefile it's rather difficult to run an individual test. If you want to setup the structure of the test-suite (say a...

I just want to update test/Transforms/LowerSwitch/feature.ll that already uses grep. It uses grep + count, probably due to shorter construction. -Stepan. Eric Christopher wrote: > > On May 24, 2012, at 12:12 AM, Stepan Dyatkovskiy wrote: > >> Hi all. I found that if you want to use grep with escape characters in >> lit, you should pass it within the double slash (\\). Since the first >> one is captured by python scripts...

Well... each case is represented as pair<BB, vector<Range> >. Right? We need "union" for optimal case building. And we need support "difference" if we decided that some ranges or numbers in case will never used (in some optimization passes it happens sometimes). -Stepan 26.04.2012, 15:18, "Duncan Sands" <baldrick at free.fr>: > Hi Stepan, > >>  unionWith result is differs from set union, since it produces single set always >>  while set operations may produce two sets. > > this is true, but that's inevitable if the resu...

Probably, I misunderstood MemoryVT purpose? Should it be a type that equal to original vector type (e.g. v2i5). Or it is a type of memory area for this vector (e.g. v2i8) ? -Stepan. Stepan Dyatkovskiy wrote: > Hi all. The question about 'load' instruction. > When we promote > v2i5 = load<addr> ;<MemoryVT = v2i5> > to > v2i64 = load<addr> ;<MemoryVT = v2i5> > > should we insert vector shuffling that moves second v2i5 item...

Hi all. Is there any way to look how my changes affected on compile and exec time, except looking at global test-suite compile and exec time? In another words is there any way to detect regression/improvement for particular tests? Thanks! -Stepan.

...will take place co-located with, and during, useR! 2020 in St. Louis on July 8th. RIOT is an excellent venue for deep technical discussions about R implementations, tools, optimizations and R extension, and will be very interesting for anyone interested in what?s under the hood of R. Regards, Stepan Sindelar, Lukas Stadler (Oracle Labs), Jan Vitek (Northeastern), Alexander Bertram (BeDataDriven) [1] http://riotworkshop.github.io/

...ll the functions in binary tree and perform lookup in O(log(N)) time. This post has two attachments: 1. The patch, that has implementation of this idea. 2. The MergeFunctions pass detailed description, with explanation how order relation could be possible. Hope it helps to make things better! -Stepan. -------------- next part -------------- A non-text attachment was scrubbed... Name: MergeFunctions.doc.tar.gz Type: application/x-gzip Size: 20480 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20140118/16992e44/attachment.bin> -------------- next part -...

...tional symbol info. But it takes additional memory consumption. 2. Add user tag (void*) for MCSymbol object. As I understood MCSymbol can live without asm sources, so we can't add info field directly. But the user tags is pretty common practice for this cases. So, what are you think about it? Stepan

...trees at left and at right are equal, than you catch at once all the cases that are represented by these subtrees. I still didn't look at you patch carefully. Sorry.. But I hope that helps, and I'll try look at it in nearest time and perhaps its not the best solution I gave in this post. -Stepan 22.01.2014, 20:53, "Tobias von Koch" <tobias.von.koch at gmail.com>: > Hi Stepan, > > As you've seen we have recently implemented a significant enhancement to > the MergeFunctions pass that also allows merging of functions that are > only similar but not identica...

...aggregated methods we can add symbol location info. 2. Add create-symbol event to the MCContext. So each time when symbol will created by the MCContext::CreateSymbol this event will be fired. We can process this event by adding symbol location info to some AsmParser internal table for example. -- Stepan 08.09.2011, 15:23, "Stepan Dyatkovskiy" <STPWORLD at yandex.ru>: > Hi everybody. I found that there are some problems with symbol location in AsmParser. > 1. We need to know where symbol was declared. > 2. We need to know where symbol was defined first time. > > Ther...

Hi. I just want to know does anyone has the same problem or not. After running "make check-lit" tests are stopped at 61th percent (Linker tests). Each time it stops on different tests. Thanks. -- Regards, Stepan

Hi Stepan, http://llvm.org/docs/lnt/ Chad On Jan 11, 2012, at 12:31 AM, Stepan Dyatkovskiy wrote: > Hi all. Is there any way to look how my changes affected on compile and > exec time, except looking at global test-suite compile and exec time? In > another words is there any way to detect reg...

...uot; and "F", but I think it's unreal :-( Since debugger should check function name it entered, and then filter such debug information with this name. Though I'm not that familiar with Debug Info, perhaps there are still possible ways to provide single body with two debug infos. -Stepan 08.10.2014, 00:32, "Stepan Dyatkovskiy" <stpworld at narod.ru>: > Hi David, > Thanks for attention to MergeFunctions! I have read your mail briefly, > tomorrow I'll provide you with detailed information. By now you could > use tests from  $LLVM/test/Transforms/Merge...

Hi all, Please find the updated patch in attachment: * Added some comments. * Fixed some typos. -Stepan Nick Lewycky wrote: > On 30 January 2014 01:27, Stepan Dyatkovskiy <stpworld at narod.ru > <mailto:stpworld at narod.ru>> wrote: > > Hello Sean and Tobias, > > Sean, > Thank you. Could you describe Nick's ideas in few words or give me > links...

...r in if (a == a) print(1) : argument is not interpretable as logical Neither does work, but the first error message is much more confusing. When thinking about it, stopifnot() should really issue a better error message in this case. Patch attached. But I should perhaps send it also to R-devel. Stepan Kasal > On Mon, Mar 12, 2018 at 8:15 AM, Stepan Kasal <kasal at ucw.cz> wrote: > > > Hello, > > I stumbled over a problem: > > stopifnot(m1 == m2) > > > > It works with vector or matrix, but does not work for classes from Matrix > > package. &gt...

.... Please find patches in attachment for review. To apply all patches at once, use "apply-patches.sh" script as follows: 0. Place "apply-patches.sh" in same directory with patches. 1. cd <llvm-sources-dir> 2. "bash <path-to-patches-dir>/apply-patches.sh" -Stepan Stepan Dyatkovskiy wrote: > Hi Nick, > About partition refinement. > > It looks like patch proposed here allows to apply your idea with > painless way (as series of small changes actually). > > If I got it right, you would like to introduce the next > partition-refinement....