search for: v18

Sadly the latest optimization broke completely everything. The asm code isn't gas compliant. the libFLAC linker script has a typo, disabling the asm optimization and/or altivec won't let a correct build anyway. Instant fixes for the asm stuff: sed -i -e"s:;:\#:" on the lpc_asm.s to load address instead of addis+ori you could use lis and la and PLEASE use the @l(register)

...cmplw cr0,r8,r4 ; i<data_len bc 4,0,L1400 ; load coefficients into v0-v7 and initial history into v8-v15 li r31,0xf and r31,r8,r31 ; r31: data%4 li r11,16 subf r31,r31,r11 ; r31: 4-(data%4) slwi r31,r31,3 ; convert to bits for vsro li r10,-4 stw r31,-4(r9) lvewx v0,r10,r9 vspltisb v18,-1 vsro v18,v18,v0 ; v18: mask vector li r31,0x8 lvsl v0,0,r31 vsldoi v0,v0,v0,12 li r31,0xc lvsl v1,0,r31 vspltisb v2,0 vspltisb v3,-1 vmrglw v2,v2,v3 vsel v0,v1,v0,v2 ; v0: reversal permutation vector add r10,r5,r6 lvsl v17,0,r5 ; v17: coefficient alignment permutation vector vperm...

...12,13,14,15,16,17,18,19,20) V7 <- c(0,1,2,3,4,5,6) V8 <- c(0,1) V9 <- c(0,1) V10 <- c(0,1) V11 <- c(0,1) V12 <- c(0,1) V13 <- c(0,1) V14 <- c(0,1) V15 <- c(0,1,2,3,4,5,6,7,8,9) V16 <- c(0,1,2,3,4,5,6) V17 <- c(0,1,2,3,4,5,6,7,8) V18 <- c(0,1,2,3,4,5) V19 <- c(0,1) V20 <- c(0,1,2,3,4,5,6,7) When run expand.grid I found a problem: > all.V <- expand.grid(V1,V2,V3,V4,V5,V6,V7,V8,V9,V10,V11,V12,V13,V14,V15,V16,V17,V18,V19,V20) Error in rep.int(rep.int(x, rep.int(rep.fac, nx)), orep) : invalid num...

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 solve the issue. Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc:

On Thu, Nov 30, 2017 at 10:35:03PM +0900, Tetsuo Handa wrote: > According to xb_set_bit(), it seems to me that we are trying to avoid memory allocation > for "struct ida_bitmap" when all set bits within a 1024-bits bitmap reside in the first > 61 bits. > > But does such saving help? Is there characteristic bias that majority of set bits resides > in the first 61 bits,

On 11/30/2017 06:34 PM, Tetsuo Handa wrote: > Wei Wang wrote: >> + * @start: the start of the bit range, inclusive >> + * @end: the end of the bit range, inclusive >> + * >> + * This function is used to clear a bit in the xbitmap. If all the bits of the >> + * bitmap are 0, the bitmap will be freed. >> + */ >> +void xb_clear_bit_range(struct xb *xb,

On Fri, Dec 01, 2017 at 10:02:01PM +0900, Tetsuo Handa wrote: > If start == end is legal, > > for (; start < end; start = (start | (IDA_BITMAP_BITS - 1)) + 1) { > > makes this loop do nothing because 10 < 10 is false. ... and this is why we add tests to the test-suite!

On Friday, December 1, 2017 9:02 PM, Tetsuo Handa wrote: > Wei Wang wrote: > > On 11/30/2017 06:34 PM, Tetsuo Handa wrote: > > > Wei Wang wrote: > > >> + * @start: the start of the bit range, inclusive > > >> + * @end: the end of the bit range, inclusive > > >> + * > > >> + * This function is used to clear a bit in the xbitmap. If

The guest free pages should not be discarded by the live migration thread when page poisoning is enabled with PAGE_POISONING_NO_SANITY=n, because skipping the transfer of such poisoned free pages will trigger false positive when new pages are allocated and checked on the destination. This patch skips the reporting of free pages in the above case. Reported-by: Michael S. Tsirkin <mst at

On 12/03/2017 09:50 AM, Tetsuo Handa wrote: > Matthew Wilcox wrote: >> On Fri, Dec 01, 2017 at 03:09:08PM +0000, Wang, Wei W wrote: >>> On Friday, December 1, 2017 9:02 PM, Tetsuo Handa wrote: >>>> If start == end is legal, >>>> >>>> for (; start < end; start = (start | (IDA_BITMAP_BITS - 1)) + 1) { >>>> >>>>

On 12/01/2017 11:49 PM, Michael S. Tsirkin wrote: > On Wed, Nov 29, 2017 at 09:55:26PM +0800, Wei Wang wrote: >> The guest free pages should not be discarded by the live migration thread >> when page poisoning is enabled with PAGE_POISONING_NO_SANITY=n, because >> skipping the transfer of such poisoned free pages will trigger false >> positive when new pages are

On Thursday, November 30, 2017 6:36 PM, Tetsuo Handa wrote: > Wei Wang wrote: > > +static inline int xb_set_page(struct virtio_balloon *vb, > > + struct page *page, > > + unsigned long *pfn_min, > > + unsigned long *pfn_max) > > +{ > > + unsigned long pfn = page_to_pfn(page); > > + int ret; > > + > > + *pfn_min =

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

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

Current virtqueue_add API implementation is based on the scatterlist struct, which uses kaddr. This is inadequate to all the use case of vring. For example: - Some usages don't use IOMMU, in this case the user can directly pass in a physical address in hand, instead of going through the sg implementation (e.g. the VIRTIO_BALLOON_F_SG feature) - Sometimes, a guest physical page may not have

On Wed, Nov 29, 2017 at 09:55:22PM +0800, Wei Wang wrote: > Current virtqueue_add API implementation is based on the scatterlist > struct, which uses kaddr. This is inadequate to all the use case of > vring. For example: > - Some usages don't use IOMMU, in this case the user can directly pass > in a physical address in hand, instead of going through the sg >

On Wed, Nov 29, 2017 at 09:55:22PM +0800, Wei Wang wrote: > Current virtqueue_add API implementation is based on the scatterlist > struct, which uses kaddr. This is inadequate to all the use case of > vring. For example: > - Some usages don't use IOMMU, in this case the user can directly pass > in a physical address in hand, instead of going through the sg >

On Mon, Dec 11, 2017 at 02:38:45PM +0800, Wei Wang wrote: > On 12/01/2017 11:49 PM, Michael S. Tsirkin wrote: > > On Wed, Nov 29, 2017 at 09:55:26PM +0800, Wei Wang wrote: > > > The guest free pages should not be discarded by the live migration thread > > > when page poisoning is enabled with PAGE_POISONING_NO_SANITY=n, because > > > skipping the transfer of

On Mon, Dec 11, 2017 at 02:38:45PM +0800, Wei Wang wrote: > On 12/01/2017 11:49 PM, Michael S. Tsirkin wrote: > > On Wed, Nov 29, 2017 at 09:55:26PM +0800, Wei Wang wrote: > > > The guest free pages should not be discarded by the live migration thread > > > when page poisoning is enabled with PAGE_POISONING_NO_SANITY=n, because > > > skipping the transfer of

...00 p28 = B * 0.0010534576028534100000 p29 = B * 0.0009623383079593670000 p30 = B * 0.0008799959715670280000 ################Individual infection number################ v0 =0 v1 =1 v2 =2 v3 =3 v4 =4 v5 =5 v6 =6 v7 =7 v8 =8 v9 =9 v10 =10 v11 =11 v12 =12 v13 =13 v14 =14 v15 =15 v16 =16 v17 =17 v18 =18 v19 =19 v20 =20 v21 =21 v22 =22 v23 =23 v24 =24 v25 =25 v26 =26 v27 =27 v28 =28 v29 =29 v30 =30 #Set conditions of Petri Net N=list() N$M=c(susceptible, infectious, recovered) ################Pre-matrix################ N$Pre=matrix(c(0, 1, 0, v0, 1 , 0 , v1, 1 , 0 , v2, 1 , 0 , v3, 1 ,...