search for: ilseman

Trying to apply patches.. What's your base revision? Joe On Nov 15, 2012, at 5:44 PM, Michael Ilseman <milseman at apple.com> wrote: > New patches with review feedback incorporated: > * Changed single letter flags to short abbreviations ('S' ==> 'nsz') > * Indentation fixes > * Comments don't state function names > > <0002-Fast-math-flags-added...

...tes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121115/2e3c515f/attachment-0006.obj> -------------- next part -------------- On Nov 15, 2012, at 10:51 AM, Evan Cheng <evan.cheng at apple.com> wrote: > > On Nov 15, 2012, at 10:51 AM, Michael Ilseman <milseman at apple.com> wrote: > >> >> On Nov 15, 2012, at 10:38 AM, Evan Cheng <evan.cheng at apple.com> wrote: >> >>> Hi Michael, >>> >>> The patch looks good in general. But I'm a bit concerned about the textural representation...

...oSet : SubclassOptionalData &= ~BitToSet; Otherwise looks good to me. Joe On Nov 15, 2012, at 5:50 PM, Joe Abbey <joe.abbey at gmail.com> wrote: > Trying to apply patches.. > > What's your base revision? > > Joe > > On Nov 15, 2012, at 5:44 PM, Michael Ilseman <milseman at apple.com> wrote: > >> New patches with review feedback incorporated: >> * Changed single letter flags to short abbreviations ('S' ==> 'nsz') >> * Indentation fixes >> * Comments don't state function names >> >> <...

On Nov 14, 2012, at 12:47 PM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 14, 2012, at 12:28 PM, Michael Ilseman <milseman at apple.com> wrote: > >> I think I missed what problem we're trying to solve here. >> >> I'm looking at implementing the bitcode now. I have code to successfully read and write out the LLVM IR textual formal (LLParser, etc) and set the corresponding S...

...therwise looks good to me. > > Joe > > On Nov 15, 2012, at 5:50 PM, Joe Abbey <joe.abbey at gmail.com> wrote: > >> Trying to apply patches.. >> >> What's your base revision? >> >> Joe >> >> On Nov 15, 2012, at 5:44 PM, Michael Ilseman <milseman at apple.com> wrote: >> >>> New patches with review feedback incorporated: >>> * Changed single letter flags to short abbreviations ('S' ==> 'nsz') >>> * Indentation fixes >>> * Comments don't state function names &gt...

...ion doesn't have to precisely follow the internal names. What about: nnan : no nans ninf : no infs nsz : no signed zeros ar: allow reciprocal fast : unsafe algebra (and implicitly all the others) I'll get started on documentation. > Evan > > On Nov 15, 2012, at 10:17 AM, Michael Ilseman <milseman at apple.com> wrote: > >> Attached are some patches for adding in an IR-level mechanism for representing fast-math flags, as discussed in my prior RFC. Patches include infrastructure, API support, textual and bitcode reader/writer support, example optimization, and test ca...

Another round of improved patches, and a patch for documentation changes to LangRef. * Make comments more up to date * Use 'arcp' instead of 'ar' * Use logical || Still based off of r168110 On Nov 15, 2012, at 3:31 PM, Michael Ilseman <milseman at apple.com> wrote: > > On Nov 15, 2012, at 3:23 PM, Joe Abbey <joe.abbey at gmail.com> wrote: > >> Though semantically equivalent in this case, however I think you should use logical ors here not bitwise. >> >> + bool any() { >> + ret...

On 10/29/2012 6:34 PM, Michael Ilseman wrote: > > N: no NaNs - ignore the existence of NaNs when convenient Maybe distinguish between quiet and signaling NaNs? > NI - no infs AND no NaNs > x - x ==> 0 > Inf > x ==> true Inf * x ==> 0? I think that if an infinity appears when NI (or I) is giv...

On Nov 15, 2012, at 10:51 AM, Michael Ilseman <milseman at apple.com> wrote: > > On Nov 15, 2012, at 10:38 AM, Evan Cheng <evan.cheng at apple.com> wrote: > >> Hi Michael, >> >> The patch looks good in general. But I'm a bit concerned about the textural representation about these flags. 'N'...

Thanks Michael. I wish to get Type of %1 i.e. result of instruction. Let me try out your suggestion. But It is still not clear to me how will dyn_cast will help here. I already have pointer to this particular instruction. On Mon, Aug 1, 2011 at 5:34 PM, Michael Ilseman <michael at lunarg.com> wrote: > In LLVM, %1 is the instruction itself. This is because LLVM IR is in > SSA, so the "=" really means equality. If you look at a use of %1, > e.g. as an operand to another instruction, you'll see that it's the > instruction itself...

...efx.com> wrote: > I got it working with this: > >     int          argc = 2; >     const char  *argv[2] = {"myopt", "-time-passes"}; > >     cl::ParseCommandLineOptions(argc, (char **)argv, "my optimizer"); > > On 06/01/2011 01:19 PM, Michael Ilseman wrote: >> I have some PassManagers, and I would like to output timing data for >> how long each pass takes to execute with a separate application using >> the API, rather than through an llvm tool. Unfortunately, I'm having >> trouble seeing how to use the existing facil...

Oh, you probably also need to create a static llvm_shutdown_obj. On 06/01/2011 02:19 PM, Michael Ilseman wrote: > Thanks for the reply! Unfortunately, that seems to have the same > effect as setting llvm::TimePassesIsEnabled myself, and all my same > problems still apply as the TimingInfo's destructor (PassManager.cpp) > is still never called. Running it in the debugger shows that >...

...on/octet-stream Size: 2928 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121114/12a06609/attachment.obj> -------------- next part -------------- Does this patch make sense, or am I still missing the main concern? On Nov 14, 2012, at 1:39 PM, Michael Ilseman <milseman at apple.com> wrote: > > On Nov 14, 2012, at 12:47 PM, Chris Lattner <clattner at apple.com> wrote: > >> >> On Nov 14, 2012, at 12:28 PM, Michael Ilseman <milseman at apple.com> wrote: >> >>> I think I missed what problem we'r...

What member function to use if I wish to operate on results of an instruction. eg. Instruction %1 = getelementptr inbounds [10 x i32]* %a, i32 0, i32 %0 I->getOperand will give me the operands. How should I get hold of %1? Thanks, Manish -------------- next part -------------- An HTML attachment was scrubbed... URL:

On Tue, Oct 30, 2012 at 8:28 PM, Michael Ilseman <milseman at apple.com> wrote: > > This is similar to how gcc defines *-fno-signed-zeros:* > "Allow optimizations for floating point arithmetic that ignore the > signedness of zero. IEEE arithmetic specifies the behavior of distinct > +0.0 and -0.0 values, which then pro...

On 11/1/2012 6:38 PM, Michael Ilseman wrote: > > On Nov 1, 2012, at 3:08 PM, Dan Gohman <dan433584 at gmail.com > <mailto:dan433584 at gmail.com>> wrote: >> >> If the "optimizer" may truly ignore the possibility of NaNs under the >> N flag, this would seem to be ok. However, a trap is ou...

...rget instructions my inclination would be to skip llvm.fmuladd.* and just form them from a*b+c expressions at isel time. I don't see any fundamental problem with forming llvm.fmuladd.* to model FMA formation opportunities in an IR pass though. - Lang. On Wed, Dec 12, 2012 at 4:11 PM, Michael Ilseman <milseman at apple.com> wrote: > > On Dec 12, 2012, at 3:40 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > > Hi, Dear All: > > I'm going implement FMA formation. On some architectures, "FMA a, b, c" > is more precise than > "a * b + c&q...

...eil <nileih at gmail.com> wrote: > Thank you for your quick answer... > > > "You can loop over the instruction's operands to see if they are > contained in VMap" > > I have no clue of to do that, do you have an example ? > > > > 2012/6/21 Michael Ilseman <michael at lunarg.com> >> >> CloneBasicBlock does a fairly shallow cloning; the instructions >> themselves are cloned but their operands are not replaced with any >> previously cloned values. >> >> Example: >> orig: >>  %a = ... >>  %b =...

On 11/2/2012 11:53 AM, Michael Ilseman wrote: > > > I think Dan was making two points with his example. Dan, correct me if I misrepresent your example, but image a situation where a target has two instructions to choose between in order to perform the operation. The first is IEEE compliant, but the second isn't compliant in...

...ave to insert a new element in the structure only if the > element is unique. I hardly expect more than 32 elements. Do you think I > gain a lot if I use the SmallSetVector instead of using SmallVector + slow > searching on every push_back? > Vassil > > On 7/12/12 6:23 PM, Michael Ilseman wrote: >> >> Something that might interest you is the SetVector, which as its name >> implies is both a set and a vector paired together. You get the >> advantage of doing set-like operations (search) on the set and >> vector-like operations (iteration, random access)...