search for: radix

...intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michal Hocko <mhocko at kernel.org> Cc: Michael S. Tsirkin <mst at redhat.com> Cc: Tetsuo Handa <penguin-kernel at I-love.SAKURA.ne.jp> --- include/linux/radix-tree.h | 2 + include/linux/xbitmap.h | 49 ++++++++++++ lib/Makefile | 2 +- lib/radix-tree.c | 25 +++++- lib/xbitmap.c | 130 +++++++++++++++++++++++++++++++ tools/testing/radix-tr...

...intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michal Hocko <mhocko at kernel.org> Cc: Michael S. Tsirkin <mst at redhat.com> Cc: Tetsuo Handa <penguin-kernel at I-love.SAKURA.ne.jp> --- include/linux/radix-tree.h | 2 + include/linux/xbitmap.h | 52 +++++++++ lib/Makefile | 2 +- lib/radix-tree.c | 26 ++++- lib/xbitmap.c | 179 +++++++++++++++++++++++++++++++ tools/testing/radix-tree/M...

....wang at intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michael S. Tsirkin <mst at redhat.com> --- tools/include/linux/bitmap.h | 34 ++++ tools/include/linux/kernel.h | 2 + tools/testing/radix-tree/Makefile | 7 +- tools/testing/radix-tree/linux/kernel.h | 2 - tools/testing/radix-tree/main.c | 5 + tools/testing/radix-tree/test.h | 1 + tools/testing/radix-tree/xbitmap.c | 278 ++++++++++++++++++++++++++++++++ 7 files changed, 326 insertions(+), 3 dele...

...thew Wilcox <mawilcox at microsoft.com> > Cc: Andrew Morton <akpm at linux-foundation.org> > Cc: Michael S. Tsirkin <mst at redhat.com> > --- > tools/include/linux/bitmap.h | 34 ++++ > tools/include/linux/kernel.h | 2 + > tools/testing/radix-tree/Makefile | 7 +- > tools/testing/radix-tree/linux/kernel.h | 2 - > tools/testing/radix-tree/main.c | 5 + > tools/testing/radix-tree/test.h | 1 + > tools/testing/radix-tree/xbitmap.c | 278 ++++++++++++++++++++++++++++++++ Umm. No. You've...

...thew Wilcox <mawilcox at microsoft.com> > Cc: Andrew Morton <akpm at linux-foundation.org> > Cc: Michael S. Tsirkin <mst at redhat.com> > --- > tools/include/linux/bitmap.h | 34 ++++ > tools/include/linux/kernel.h | 2 + > tools/testing/radix-tree/Makefile | 7 +- > tools/testing/radix-tree/linux/kernel.h | 2 - > tools/testing/radix-tree/main.c | 5 + > tools/testing/radix-tree/test.h | 1 + > tools/testing/radix-tree/xbitmap.c | 278 ++++++++++++++++++++++++++++++++ Umm. No. You've...

Hi, I have a llvm asssembly version of radix_mod.c modified from radix (a splash2 bench mark). It is named radix.bc. I have extended the number of arguments from 2 to 4 in the function called product_mod_46 and saved it as a new file called radix_mod.bc . Although the extra arguments does not do anything in the function. It still broke the c...

...at linux-foundation.org> Cc: Michal Hocko <mhocko at kernel.org> Cc: Michael S. Tsirkin <mst at redhat.com> Cc: Tetsuo Handa <penguin-kernel at I-love.SAKURA.ne.jp> --- include/linux/xbitmap.h | 48 ++++ lib/Makefile | 2 +- lib/radix-tree.c | 38 ++- lib/xbitmap.c | 444 +++++++++++++++++++++++++++++++ tools/include/linux/bitmap.h | 34 +++ tools/include/linux/kernel.h | 2 + tools/testing/radix-tree/Makefile | 17 +- tools/testing/radix-tree...

...float lowidth,float hiwidth, int lomin,int himin, float *thresh,float *off){ long i,lo=0,hi=0; long median=LASTBIN; float bi,threshi; float negFour = -4.0f; float negQuarter = -0.25f; float radix[BINCOUNT]; float countabove=0.f; float countbelow=0.f; memset(radix,0,sizeof(radix)); for(i=0;i<n;i++){ // find new lo/hi bi=b[i]+hiwidth; for(;hi<n && (hi<i+himin || b[hi]<=bi);hi++){ int bin=BIN(f[hi]); if(bin>LASTBIN) bin=LASTBIN; if(bin<0)...

Does sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, method="radix")$ix give the intended result, because I get: > sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, method="radix") $x [1] 2 4 $ix [1] 1 3 With method="shell" and method="quick" in R devel, I get: > sort.int(c(2,NA,4), index.return=TRUE, na.last=NA, metho...

ckathy wrote: > > Hi, > > I have a llvm asssembly version of radix_mod.c modified from radix (a > splash2 bench mark). It is named radix.bc. > > I have extended the number of arguments from 2 to 4 in the function called > product_mod_46 and saved it as a new file called radix_mod.bc . Although > the extra arguments does not do anything in the funct...

OK, here's a rewrite of xbitmap. Compared to the version you sent: - xb_find_set() is the rewrite I sent out yesterday. - xb_find_clear() is a new implementation. I use the IDR_FREE tag to find clear bits. This led to me finding a bug in radix_tree_for_each_tagged(). - xb_zero() is also a new implementation (replacing xb_clear_bit_range). It should also be more efficient in deep trees. - Did not accept your change to xb_set_bit(); I think it's important to leave the radix tree node in place, so we're guaranteed to make pr...

http://bugzilla.mindrot.org/show_bug.cgi?id=547 Summary: Missing radix.o in makefile for AFS Product: Portable OpenSSH Version: 3.6p1 Platform: ix86 OS/Version: Linux Status: NEW Severity: minor Priority: P3 Component: Build system AssignedTo: openssh-unix-dev at mindrot.org...

...curs with --with-smbmount as you might expect from the file it fails on. Anyone else had this problem and fixed it? Regards Dan In file included from /usr/include/linux/fs.h:20, from /usr/include/linux/smb_fs.h:15, from client/smbmount.c:27: /usr/include/linux/radix-tree.h: In function `radix_tree_preload_end': /usr/include/linux/radix-tree.h:54: error: invalid type argument of `->' /usr/include/linux/radix-tree.h:54: error: `TIF_NEED_RESCHED' undeclared (first use in this function) /usr/include/linux/radix-tree.h:54: error: (Each undeclared ide...

...const float *thresh,const float *off){ long i=0,lo=0,hi=0; float bi,threshi; long median=LASTBIN; float negFour = -4.0; float negQuarter = -0.25; /* these are really integral values, but we store them in floats to avoid excessive float/int conversions */ float *radix=alloca(BINCOUNT*sizeof(*radix)); float countabove=0; float countbelow=0; memset(radix,0,BINCOUNT*sizeof(*radix)); for(i=0;i<n;i++){ /* find new lo/hi */ bi=b[i]; for(;hi<n && (hi<i+himin || b[hi]<=bi+hiwidth);hi++){ int bin=BIN(f[hi]); if(bin&...

So is there a way to return the value as a string instead? On Fri, Nov 16, 2012 at 3:00 PM, Ryan Taylor <ryta1203 at gmail.com> wrote: > Was hoping it might get some help or a better explanation of this: > > /ADT/APInt.h:1217: uint64_t llvm::APInt::getZExtValue() const: Assertion > `getActiveBits() <= 64 && "Too many bits for uint64_t"' failed. >

On Tue, Dec 12, 2017 at 07:55:55PM +0800, Wei Wang wrote: > +int xb_preload_and_set_bit(struct xb *xb, unsigned long bit, gfp_t gfp); I'm struggling to understand when one would use this. The xb_ API requires you to handle your own locking. But specifying GFP flags here implies you can sleep. So ... um ... there's no locking? > +void xb_clear_bit_range(struct xb *xb, unsigned

On Tue, Dec 12, 2017 at 07:55:55PM +0800, Wei Wang wrote: > +int xb_preload_and_set_bit(struct xb *xb, unsigned long bit, gfp_t gfp); I'm struggling to understand when one would use this. The xb_ API requires you to handle your own locking. But specifying GFP flags here implies you can sleep. So ... um ... there's no locking? > +void xb_clear_bit_range(struct xb *xb, unsigned

...e bit range, inclusive + * @nbits: number of bits to clear + * + * This function is used to clear a range of bits in the xbitmap. If all the + * bits in the bitmap are 0, the bitmap will be freed. + */ +void xb_clear_bit_range(struct xb *xb, unsigned long start, + unsigned long nbits) +{ + struct radix_tree_root *root = &xb->xbrt; + struct radix_tree_node *node; + void __rcu **slot; + struct ida_bitmap *bitmap; + unsigned long index = start / IDA_BITMAP_BITS; + unsigned long bit = start % IDA_BITMAP_BITS; + + if (nbits > ULONG_MAX - start) + nbits = ULONG_MAX - start; + + while (nbits)...

...e bit range, inclusive + * @nbits: number of bits to clear + * + * This function is used to clear a range of bits in the xbitmap. If all the + * bits in the bitmap are 0, the bitmap will be freed. + */ +void xb_clear_bit_range(struct xb *xb, unsigned long start, + unsigned long nbits) +{ + struct radix_tree_root *root = &xb->xbrt; + struct radix_tree_node *node; + void __rcu **slot; + struct ida_bitmap *bitmap; + unsigned long index = start / IDA_BITMAP_BITS; + unsigned long bit = start % IDA_BITMAP_BITS; + + if (nbits > ULONG_MAX - start) + nbits = ULONG_MAX - start; + + while (nbits)...

On Wed, Nov 29, 2017 at 09:55:17PM +0800, Wei Wang wrote: > The <linux/bug.h> was removed from radix-tree.h by the following commit: > f5bba9d11a256ad2a1c2f8e7fc6aabe6416b7890. > > Since that commit, tools/testing/radix-tree/ couldn't pass compilation > due to: tools/testing/radix-tree/idr.c:17: undefined reference to > WARN_ON_ONCE. This patch adds the bug.h header to idr.h to...