search for: _last

...exe!std::_Debug_pointer<lld::coff::Chunk * __ptr64 const>(lld::coff::Chunk * const * _Ptr, const wchar_t * _File, unsigned int _Line) Line 926 C++ zig.exe!std::_Debug_range2<lld::coff::Chunk * __ptr64 const * __ptr64>(lld::coff::Chunk * const * _First, lld::coff::Chunk * const * _Last, const wchar_t * _File, unsigned int _Line, std::random_access_iterator_tag __formal) Line 958 C++ zig.exe!std::_Debug_range<lld::coff::Chunk * __ptr64 const * __ptr64>(lld::coff::Chunk * const * _First, lld::coff::Chunk * const * _Last, const wchar_t * _File, unsigned int _Line) Line...

...gt;> > const>(lld::coff::Chunk * const * _Ptr, const wchar_t * _File, unsigned int >> > _Line) Line 926 C++ >> zig.exe!std::_Debug_range2<lld::coff::Chunk * __ptr64 const * >> __ptr64>(lld::coff::Chunk * const * _First, lld::coff::Chunk * const * >> _Last, const wchar_t * _File, unsigned int _Line, >> std::random_access_iterator_tag __formal) Line 958 C++ >> zig.exe!std::_Debug_range<lld::coff::Chunk * __ptr64 const * >> __ptr64>(lld::coff::Chunk * const * _First, lld::coff::Chunk * const * >> _Last, const wchar...

...6384 (LWP 2159)] 0x4015b9fc in mallopt () from /lib/i686/libc.so.6 (gdb) bt #0 0x4015b9fc in mallopt () from /lib/i686/libc.so.6 #1 0x4015ac61 in malloc () from /lib/i686/libc.so.6 #2 0x40161dd0 in strdup () from /lib/i686/libc.so.6 #3 0x08055a2f in cfg_process (tmp=0x80e5950, _tmpc=0xbffff360, _last=0xbffff364, buf=0x6c636e69 <Address 0x6c636e69 out of bounds>, lineno=118, configfile=0x44ceb41d "extensions.conf", includelevel=0) at config.c:57 #4 0x08055472 in __ast_load (configfile=0x44ceb41d "extensions.conf", tmp=0x80e5950, _tmpc=0xbffff360, _last=0xbffff364,...

...(LWP 4824)] 0x4015b9fc in mallopt () from /lib/i686/libc.so.6 (gdb) bt #0 0x4015b9fc in mallopt () from /lib/i686/libc.so.6 #1 0x4015ac61 in malloc () from /lib/i686/libc.so.6 #2 0x40161dd0 in strdup () from /lib/i686/libc.so.6 #3 0x080559eb in cfg_process (tmp=0x80e3000, _tmpc=0xbffff360, _last=0xbffff364, buf=0x61666564 <Address 0x61666564 out of bounds>, lineno=99, configfile=0x44ceb41d "extensions.conf", includelevel=0) at config.c:57 #4 0x08055472 in __ast_load (configfile=0x44ceb41d "extensions.conf", tmp=0x80e3000, _tmpc=0xbffff360, _last=0xbff...

...fication 1.0 (1995), the strategy for floppy emulation and HDD emulation is to _shift_up_ the pre-existing drive numbers and to inject the El Torito disk _before_ those pre-existing drive numbers. This is another reason why it makes sense to scan _upward_ instead of downward. You will get the _last-booted_ El Torito floppy or HDD. This has been the case for close to 17 years. 2. For no-emulation mode, it is completely up to the BIOS (or hook) as to which drive number is used, as long as it's >= 0x81. In EDD-4, it is suggested to use 0xA0 or anything else > 0x9A (26 drive l...

...pare(struct virtqueue *vq); > > bool virtqueue_notify(struct virtqueue *vq); I don't much care for this API. It does exactly what balloon needs, but at cost of e.g. transparently busy-waiting. Unlikely to be a good fit for anything else. If you don't like my original _first/_next/_last, you will need to come up with something else. -- MST

...pare(struct virtqueue *vq); > > bool virtqueue_notify(struct virtqueue *vq); I don't much care for this API. It does exactly what balloon needs, but at cost of e.g. transparently busy-waiting. Unlikely to be a good fit for anything else. If you don't like my original _first/_next/_last, you will need to come up with something else. -- MST

...STL iterator loop given trivial bytecode input (essentially a single function to add a couple of integers). The bytecode compiled fine from llvm assembly via llvm-as. The hang was in one of the STL destroy() loops; basically _first was ok (originated inside the bowels of a SetVector (Value*)), but _last was an at best undefined pointer (something like 0x013), so the loop would just chug along forever, and crash at some point I presume because it doesn't sound healthy to walk through the entire free store. Has anyone seen this or should I try to find the cause? Best regards, Andreas -- And...

...to the correct one and I'll post similar queries there in the future. I've been happily using rc3 since shortly after its release and slowly converting the music collection on my PC from mp3 to ogg. I've now run into a problem that has me stumped. On the 2nd track of The Breeders _Last Splash_ album, the intro bass riff comes up with some frickin' /nasty/ artifacts that vorbis has never given me before; like it's been dropping samples. The test cases I've run so far are -q 4, -q 5, -q 9, and -b 128. The CD itself plays fine, as does the .wav from which I'm en...

...ng only happens when the vq is full (i.e. no desc left). If necessary, I think we can add an input parameter like "bool busywaiting", then the caller can decide to simply get a -ENOSPC or busy wait to add when no desc is available. > > If you don't like my original _first/_next/_last, you will > need to come up with something else. I thought the above virtqueue_add_chain_des() performs the same functionality as _first/next/last, which are used to grab descs from the vq and chain them together. If not, could you please elaborate the usage of the original proposal? Best, Wei

...d) >> >> struct vhost_umem_node { >> struct rb_node rb; >> struct list_head link; >> __u64 start; >> - __u64 last; >> + __u64 end; >> __u64 size; >> __u64 userspace_addr; >> __u32 perm; > >Preferably also rename __subtree_last to __subtree_end Yes, this was was another one that I had in mind renaming, but didn't want to grow the series -- all custom interval trees name _last for the subtree iirc. Like my previous reply, I'd rather leave this stuff for a followup series. Thanks, Davidlohr

...rivial bytecode input (essentially a single > function to add a couple of integers). The bytecode compiled fine from > llvm assembly via llvm-as. > > The hang was in one of the STL destroy() loops; basically _first was > ok (originated inside the bowels of a SetVector (Value*)), but _last > was an at best undefined pointer (something like 0x013), so the loop > would just chug along forever, and crash at some point I presume > because it doesn't sound healthy to walk through the entire free > store. > > Has anyone seen this or should I try to find the cause? &g...

I have had * installed for a couple of weeks now and am very impressed. I have got Zap, SIP and MGCP working and can call freely between them with just things like transfer still to sort out etc. I then though I would add H.323 support to my working system, having read the previous threads on the subject before I installed I installed the pre-reqs pwlib openh323 gnugk for h.323 gatekeeper

...ike > "bool busywaiting", then the caller can decide to simply get a -ENOSPC > or busy wait to add when no desc is available. I think this just shows this API is too high level. This policy should live in drivers. > > > > If you don't like my original _first/_next/_last, you will > > need to come up with something else. > > I thought the above virtqueue_add_chain_des() performs the same > functionality as _first/next/last, which are used to grab descs from the > vq and chain them together. If not, could you please elaborate the > usage of the...

...ike > "bool busywaiting", then the caller can decide to simply get a -ENOSPC > or busy wait to add when no desc is available. I think this just shows this API is too high level. This policy should live in drivers. > > > > If you don't like my original _first/_next/_last, you will > > need to come up with something else. > > I thought the above virtqueue_add_chain_des() performs the same > functionality as _first/next/last, which are used to grab descs from the > vq and chain them together. If not, could you please elaborate the > usage of the...

...~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/8/bits/stl_algo.h:5610:12: note: ‘constexpr _FIter std::min_element(_FIter, _FIter) [with _FIter = const int*]’ is not usable as a ‘constexpr’ function because: inline min_element(_ForwardIterator __first, _ForwardIterator __last) ^~~~~~~~~~~ In file included from /usr/include/c++/8/debug/debug.h:84, from /usr/include/c++/8/bits/stl_algobase.h:69, from /usr/include/c++/8/memory:62, from /home/jayfoad2/git/llvm-project/llvm/include/llvm/ADT/Optional.h:22,...

...~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ > /usr/include/c++/8/bits/stl_algo.h:5610:12: note: ‘constexpr _FIter std::min_element(_FIter, _FIter) [with _FIter = const int*]’ is not usable as a ‘constexpr’ function because: > inline min_element(_ForwardIterator __first, _ForwardIterator __last) > ^~~~~~~~~~~ > In file included from /usr/include/c++/8/bits/move.h:34, > from /usr/include/c++/8/bits/stl_pair.h:59, > from /usr/include/c++/8/utility:70, > from /usr/include/c++/8/algorithm:60, > f...

...~^~~~~~~~~~~~~~~~~~~~~~~~ >> > /usr/include/c++/8/bits/stl_algo.h:5610:12: note: ‘constexpr _FIter std::min_element(_FIter, _FIter) [with _FIter = const int*]’ is not usable as a ‘constexpr’ function because: >> > inline min_element(_ForwardIterator __first, _ForwardIterator __last) >> > ^~~~~~~~~~~ >> > In file included from /usr/include/c++/8/bits/move.h:34, >> > from /usr/include/c++/8/bits/stl_pair.h:59, >> > from /usr/include/c++/8/utility:70, >> > from /usr/includ...

This patch series enhances the existing virtio-balloon with the following new features: 1) fast ballooning: transfer ballooned pages between the guest and host in chunks using sgs, instead of one by one; and 2) cmdq: a new virtqueue to send commands between the device and driver. Currently, it supports commands to report memory stats (replace the old statq mechanism) and report guest unused pages.

This patch series enhances the existing virtio-balloon with the following new features: 1) fast ballooning: transfer ballooned pages between the guest and host in chunks using sgs, instead of one by one; and 2) cmdq: a new virtqueue to send commands between the device and driver. Currently, it supports commands to report memory stats (replace the old statq mechanism) and report guest unused pages.