search for: difference_typ

Hi, I'm part of an engineering team doing research on persistent memory support and we have stumbled upon an interesting problem. The issue is, we would like to be able to use the standard library containers in a persistent memory context (think NVDIMM-N). What I mean is that you allocate a container from said memory, use it like you normally would. After the application terminates, expectedly

...t in design, it does not even have an "empty" method. Is that because we want it to work on all iterators (including those dirty OutputIterator)? Maybe we can add a little bit to it? I recently needed: - bool empty() - value_type& font() - value_type& back() - void advance_begin(difference_type n) - void advance_end(difference_type n) Would you be open to those? -- *Alexandre Isoard* -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20171211/962ff1d2/attachment.html>

...'::LessOpcode, _InIt=const `anonymous-namespace'::MatchEntry * ] C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see reference to function template instantiation 'std::pair<_Ty1,_Ty2> std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const _Ty &,_Pr,_Diff *)' being compiled with [ _Ty1=const `anonymous-namespace'::MatchEntry *, _Ty2=const `anonymous-namespace'::MatchEntry *, _FwdIt=const `anonymous-namespace'::MatchEntry *,...

...; _InIt=const `anonymous-namespace'::MatchEntry * > ] > C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see > reference to function template instantiation 'std::pair<_Ty1,_Ty2> > std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const > _Ty &,_Pr,_Diff *)' being compiled > with > [ > _Ty1=const `anonymous-namespace'::MatchEntry *, > _Ty2=const `anonymous-namespace'::MatchEntry *, > _FwdIt=const `anonymous-namespace':...

...ct size is stated to be half of SIZE_MAX in C11 K.3.4/4 which is typically equivalent to PTRDIFF_MAX. - The expectation that PTRDIFF_MAX is more or less a proxy for the largest object size is not uncommon. For example, C++'s std::count doesn't return a size_t but a iterator_traits<>::difference_type which is going to be a ptrdiff_t for things like std::vector. On Fri, May 20, 2016 at 1:31 AM, John Regehr via llvm-dev < llvm-dev at lists.llvm.org> wrote: > It could be that 32-bit systems are disappearing so rapidly that nobody > cares too much about this issue, but this blog post...

It could be that 32-bit systems are disappearing so rapidly that nobody cares too much about this issue, but this blog post is still worth reading: http://trust-in-soft.com/objects-larger-than-ptrdiff_max-bytes/ John

...re is not clear. See, e.g., http://open-std.org/jtc1/sc22/wg14/www/docs/n1969.htm . > - The expectation that PTRDIFF_MAX is more or less a proxy for the largest > object size is not uncommon. For example, C++'s std::count doesn't return > a size_t but a iterator_traits<>::difference_type which is going to be a > ptrdiff_t for things like std::vector. Bug in C++? Because max_size() of std::vector<char> has the type `size_type` and returns SIZE_MAX in practice (even on x86-64). Let's see other examples (on x86-32): - glibc's malloc is happy to allocate more than...

...onst `anonymous-namespace'::MatchEntry * > > ] > > C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see > > reference to function template instantiation 'std::pair<_Ty1,_Ty2> > > std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const > > _Ty &,_Pr,_Diff *)' being compiled > > with > > [ > > _Ty1=const `anonymous-namespace'::MatchEntry *, > > _Ty2=const `anonymous-namespace'::MatchEntry *, > > _FwdIt=co...

...iterator (and actually InstIterator class template) is not Assignable, because it has a reference data member, while standard requires all iterators to be assignable. Second InstIterator is not DefaultConstructile, which is required from Forwarditerator. Also, I get error because InstIterator::difference_type is not signed integer type (its defined as unsigned), but in this case the current standard does not say it's should be signed, though it looks reasonable and proposal for new version of standard require that. > > > Probably the right thing to do would be to make the inst_iterator...

..._Ty1=`anonymous-namespace'::TableEntry, _Ty2=unsigned int ] c:\Program Files\Microsoft Visual Studio 8\VC\include\algorithm(1397) : see reference to function template instantiation '_FwdIt std::_Lower_bound<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type>(_FwdIt,_FwdIt,const _Ty &,_Diff *)' being compiled with [ _FwdIt=const `anonymous-namespace'::TableEntry *, _Ty=unsigned int, _Iter=const `anonymous-namespace'::TableEntry *, _Diff=std::iterator_traits<const `an...

...h of Annex K but doesn't say anything about K.3.4/4. > > > - The expectation that PTRDIFF_MAX is more or less a proxy for the largest >> object size is not uncommon. For example, C++'s std::count doesn't >> return >> a size_t but a iterator_traits<>::difference_type which is going to be a >> ptrdiff_t for things like std::vector. >> > > Bug in C++? Because max_size() of std::vector<char> has the type > `size_type` and returns SIZE_MAX in practice (even on x86-64). > Some folks in the C++ community believe that using unsigned typ...

That source file was removed from LLVM in r232397 on March 16, 2015. It looks like lljvm hasn't been updated in a long time. LLVM's C++ APIs are not stable, so there is no expectation that a project built against LLVM's C++ API in 2015 would build or reasonably function against LLVM trunk. The project probably works against LLVM 3.6.2 which was (I believe) the last LLVM release to

...namespace'::TableEntry, > _Ty2=unsigned int > ] > c:\Program Files\Microsoft Visual Studio >8\VC\include\algorithm(1397) : see reference to function template >instantiation '_FwdIt >std::_Lower_bound<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type>(_FwdIt,_FwdIt,const >_Ty &,_Diff *)' being compiled > with > [ > _FwdIt=const `anonymous-namespace'::TableEntry *, > _Ty=unsigned int, > _Iter=const `anonymous-namespace'::TableEntry *, > _Diff=std::...

...plate) > is not Assignable, because it has a reference data member, while standard > requires all iterators to be assignable. Ok. > Second InstIterator is not DefaultConstructile, which is required from > Forwarditerator. Ok, makes sense. > Also, I get error because InstIterator::difference_type is not signed integer > type (its defined as unsigned), but in this case the current standard does > not say it's should be signed, though it looks reasonable and proposal for > new version of standard require that. Either way should work. I'm not opposed to changing it. :) &g...

...tried building rc1 for 32-bit FreeBSD, but ran into a compile error in > mlir: > > /home/dim/llvm/10.0.0/rc1/llvm-project/mlir/lib/Transforms/DialectConversion.cpp:787:67: > error: non-constant-expression cannot be narrowed from type 'unsigned int' > to 'Region::iterator::difference_type' (aka 'int') in initializer list > [-Wc++11-narrowing] > blockActions.push_back(BlockAction::getMove(&block, {&region, > position})); > ^~~~~~~~ > /home/dim/llvm/10.0.0/rc1/llvm-project/mlir/li...

Hi list, I have several questions about LLVM pass. 1) Is building a custom LLVM pass out-of-source not recommended? The official document only contains instructions about in-source build (http://llvm.org/docs/WritingAnLLVMPass.html <http://llvm.org/docs/WritingAnLLVMPass.html>). 2) opt (ver >= 4) with custom pass libraries does not work as before. When I have a simple custom LLVM pass

On Fri, 23 Apr 2004, Vladimir Prus wrote: > Yea, I've noticed that. However, it looks like inst_iterator is iterator over > pointers. Oh, wait a minite, that's the current code: > > inline IIty operator*() const { return BI; } > inline IIty operator->() const { return operator*(); } > > So operator* works as if value_type is Instruction*, but operator->

Chris Lattner wrote: > On Fri, 23 Apr 2004, Vladimir Prus wrote: > > and since result of *it is considered to be rvalue it can't be accepted > > by this operator. The complete discussion is in > > > > http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm > > > > I'd suggest to apply the following patch which makes operator* return >

Hello everyone, It took a bit longer than planned due to master being a somewhat unstable at the branch point, but Release Candidate 1 has now been tagged as llvmorg-10.0.0-rc1. Source code and docs are available at https://prereleases.llvm.org/10.0.0/#rc1 Pre-built binaries will be added there as they become available. Please file bug reports for any issues you find as blockers of

...(x == y); +} + +template <class T> +class malloc_alloc +{ +public: + typedef T value_type; + typedef T& reference; + typedef const T& const_reference; + typedef T* pointer; + typedef const T* const_pointer; + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + + malloc_alloc() = default; + template <class U> malloc_alloc(const malloc_alloc<U>&) noexcept {} + + T* allocate(std::size_t n) + { + return static_cast<T*>(std::malloc(n*sizeof(T))); + } + void deallocate(T* p, std::size_t) noexcept + { +...