search for: isequ

...s problem. This is very dangerous because no advice are provide by the online help, and anybody can use these functions no think to unusual results. I think that the problem is due to how double number are store by the C compiler. If it may be usefull, I have written to small function (Unique and isEqual) which can deal with this problem of the double numbers. I also add some other conditions for the same problem. 0.3 == 0.15 + 0.15 0.3 == 0.1 + 0.2 1 - 0.7 == 0.3 0.1 == 1 - 0.9 0.2 == 1 - 0.2 - 0.2 - 0.2 - 0.2 -0.2 == 1 - 0.2 - 0.2 - 0.2 - 0.2 - 0.2 - 0.2 identical (0.3, 0.1...

...o<{anonymous}::Expression>, llvm::DenseMap<KeyT, ValueT, KeyInfoT> = llvm::DenseMap<{anonymous}::Expression, unsigned int>]’ /home/zeus/masterLLVM/llvm/lib/Analysis/AVEAnalysis.cpp:153:13: instantiated from here /home/zeus/masterLLVM/llvm/include/llvm/ADT/DenseMap.h:256:7: error: ‘isEqual’ is not a member of ‘llvm::DenseMapInfo<{anonymous}::Expression>’ /home/zeus/masterLLVM/llvm/include/llvm/ADT/DenseMap.h:256:7: error: ‘isEqual’ is not a member of ‘llvm::DenseMapInfo<{anonymous}::Expression>’ Can someone help me solve the error? -- Rekha -------------- next part -...

...ion>, llvm::DenseMap<KeyT, ValueT, > KeyInfoT> = llvm::DenseMap<{anonymous}::Expression, unsigned int>]’ > /home/zeus/masterLLVM/llvm/lib/Analysis/AVEAnalysis.cpp:153:13: > instantiated from here > /home/zeus/masterLLVM/llvm/include/llvm/ADT/DenseMap.h:256:7: error: > ‘isEqual’ is not a member of ‘llvm::DenseMapInfo<{anonymous}::Expression>’ > /home/zeus/masterLLVM/llvm/include/llvm/ADT/DenseMap.h:256:7: error: > ‘isEqual’ is not a member of ‘llvm::DenseMapInfo<{anonymous}::Expression>’ > > Can someone help me solve the error? To use DenseMap w...

How do I tell puppet to log somewhere other than /var/log/messages. None of the logging configuration options seem to do anything any more. Specifically puppetdlog. # The log file for puppet agent. This is generally not used. # The default value is ''$logdir/puppetd.log''. puppetdlog = /var/lib/puppet/log/puppetd.log -- You received this message because you are

Suppose I have some LLVM assembly like this: declare i8* @CreateDistinctItem() nounwind declare void @dumpBoolean(i1 %val) define i32 @main() {  %var1 = call i8* CreateDistinctItem()  %var2 = call i8* CreateDistinctItem()  %isEqual = icmp eq i8* %val1, %val2  call void @dumpBoolean(i1 %isEqual)  ret i32 0 } So far so good.  But if I take out the "call @dumpBoolean", the optimizer still leaves me with two calls to CreateDistinctItem, because it assumes that CreateDistinctItem might have side-effects. Now if I add...

Hello Is it possible to configure a separate logfile for incoming POP3 connections ( dovecot 2.2.9 ) thanks

...m here .../include/llvm/ADT/DenseMap.h:488: error: `getEmptyKey' is not a member of `llvm::DenseMapInfo<uint32_t>' .../include/llvm/ADT/DenseMap.h:489: error: `getTombstoneKey' is not a member of `llvm::DenseMapInfo<uint32_t>' .../include/llvm/ADT/DenseMap.h:491: error: `isEqual' is not a member of `llvm::DenseMapInfo<uint32_t>' .../include/llvm/ADT/DenseMap.h:491: error: `isEqual' is not a member of `llvm::DenseMapInfo<uint32_t>' I've attached a patch to fix these. This allows me to build LLVM on cygwin. If there's consensus as to w...

...il at gmail.com> > Suppose I have some LLVM assembly like this: > > declare i8* @CreateDistinctItem() nounwind > > declare void @dumpBoolean(i1 %val) > > define i32 @main() > { > %var1 = call i8* CreateDistinctItem() > %var2 = call i8* CreateDistinctItem() > %isEqual = icmp eq i8* %val1, %val2 > call void @dumpBoolean(i1 %isEqual) > ret i32 0 > } > > So far so good. But if I take out the "call @dumpBoolean", the > optimizer still leaves me with two calls to CreateDistinctItem, > because it assumes that CreateDistinctItem migh...

...consider the register // requirements for both N and i at the same time. Limiting this code to // equality icmps is not a problem because all interesting loops use // equality icmps, thanks to IndVarSimplify. if (ICmpInst *CI = dyn_cast<ICmpInst>(LF.UserInst)) if (CI->isEquality()) { and this is happening for the first loop but not the second. The reason is that the second loop still has two loads of *l by the time IndVarSimplify is run; one for the precondition of the rotated loop and one for the loop exit. This means that IndVarSimplify can't tell that the pr...

...lue *LHSPtr = LHS->stripPointerCasts(); + Value *RHSPtr = RHS->stripPointerCasts(); + if (LHSPtr == RHSPtr) + return ConstantInt::get(ITy, CmpInst::isTrueWhenEqual(Predicate)); + if (isa<ConstantPointerNull>(RHSPtr) && isKnownNonNull(LHSPtr)) { + if (ICmpInst::isEquality(Pred)) + return ConstantInt::get(ITy, Predicate != ICmpInst::ICMP_EQ); + } + if (ICmpInst::isEquality(Pred)) { + // RHS is not a null pointer and the objects are different. + // Remove inbound GEPs and determine the object types. + LHSPtr = LHSPtr->stripInBoundsO...

On Mon, May 4, 2015 at 2:19 PM, Nicholas White <n.j.white at gmail.com> wrote: >> It's not quite the same testcase. > Yes - it's an extension of the first test case that I'd expect to be > optimised out in the same way as my earlier example (i.e., store a > value, read it back and branch on it). If you miss out the > "check.first.array.element" block

%0 = icmp eq i32 %y, 0 In the above instruction how can i know that the comparison is equality comparison?? --Rajwinder Singh -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100628/8d8e5cb1/attachment.html>

...r chars. +template<> struct DenseMapInfo<char> { + static inline char getEmptyKey() { return ~0; } + static inline char getTombstoneKey() { return ~0 - 1; } + static unsigned getHashValue(const char& Val) { return Val * 37; } + static bool isPod() { return true; } + static bool isEqual(const char& LHS, const char& RHS) { + return LHS == RHS; + } +}; + // Provide DenseMapInfo for unsigned ints. template<> struct DenseMapInfo<unsigned> { static inline unsigned getEmptyKey() { return ~0; }

...;grow(NumBuckets * 2); LookupBucketFor(Key, TheBucket); } + if (NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { + this->grow(NumBuckets); + LookupBucketFor(Key, TheBucket); + } // If we are writing over a tombstone, remember this. if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) -- 1.7.4.1

Dear all, I very often use the R function "apply", for speedup purposes. I am now also using MATLAB, and would like to use the same kind of function. I have already asked MATLAB people, and the answer is : "vectorize"... but of course, this is not always possible. So, instead of using a FOR loop all the time, I tried using the bsxfun. So you R people, who might also use MATLAB,

I have several network appliances, and I want aggregate their syslog output for later analysis. Eventually I might think about a Splunk box, but for the interim I'm hoping to just build a CentOS 6 syslog server and have it aggregate everything on it for quick review. I installed rsyslog and am looking through the /etc/rsyslog.conf file for what I configure to (a) listen for syslog input from

...r > // requirements for both N and i at the same time. Limiting this code to > // equality icmps is not a problem because all interesting loops use > // equality icmps, thanks to IndVarSimplify. > if (ICmpInst *CI = dyn_cast<ICmpInst>(LF.UserInst)) > if (CI->isEquality()) { > > and this is happening for the first loop but not the second. The reason > is that the second loop still has two loads of *l by the time IndVarSimplify > is run; one for the precondition of the rotated loop and one for the loop > exit. This means that IndVarSimplify c...

On Wed, Dec 12, 2012 at 01:59:55PM -0800, Dan Gohman wrote: > The bug here isn't in clang's use of noalias or in BasicAliasAnalysis' > implementation of noalias; it's in the code that's optimizing the > icmp. Let's come back to this. The attached patch decouples InstSimplify from the alias analysis and provides the conservative logic for when pointers are not

...if (NumEntries*4 >= NumBuckets*3 || NumBuckets-(NumEntries+NumTombstones) < NumBuckets/8) { this->grow(NumBuckets * 2); LookupBucketFor(Key, TheBucket); } - ++NumEntries; // If we are writing over a tombstone, remember this. if (!KeyInfoT::isEqual(TheBucket->first, getEmptyKey())) ------------------------------------------------------ Question: How can I test this? I was able to create a nifty Googletest unit test: Index: llvm.test/unittests/ADT/DenseSetTest.cpp ===================================================================...

...opVariantFromCLSID(). xmllite/writer: Fix "xml:space" output. opcservices/tests: Fix copy-pasted copyright line. d2d1: Update to ID2D1BitmapBrush1. d2d1: Implement newer CreateBitmapBrush() variant. include: Add ID2D1Effect definition. urlmon/tests: Add IsEqual test for custom IUri implementation. opcservices/uri: Fix IsEqual() to work with OPC URI objects. opcservices/tests: Add some GetRelativeUri() tests. opcservices: Fix path used for part URIs. opcservices: Implement CombinePartUri(). opcservices: Write package parts....