search for: ret2

...um here.*/ - "lea -32(%[ret],%[ret]),%[ret]\n\t" + /* Not working "lea -32(%[ret],%[ret]),%[ret]\n\t" */ + /* Like ret = ret+ret-32 */ + "add %[ret],%[ret]\n\t" + "sub 32,%[ret]\n\t" "movq 0x40(%[buf]),%%mm0\n\t" "cmp %[ret2],%[ret]\n\t" "movq 0x48(%[buf]),%%mm4\n\t" @@ -511,7 +514,11 @@ static unsigned oc_int_frag_satd_thresh_mmxext(const u "punpckhdq %%mm0,%%mm0\n\t" "paddd %%mm0,%%mm4\n\t" "movd %%mm4,%[ret2]\n\t" - "lea (%[ret],%[ret2],2),%[re...

...host_dev *dev, > } > EXPORT_SYMBOL_GPL(vhost_dequeue_msg); > > +int vhost_prefetch_desc_indices(struct vhost_virtqueue *vq, > + struct vring_used_elem *heads, > + u16 num, bool used_update) > +{ > + int ret, ret2; > + u16 last_avail_idx, last_used_idx, total, copied; > + __virtio16 avail_idx; > + struct vring_used_elem __user *used; > + int i; > + > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { > + vq_err(vq, &qu...

...host_dev *dev, > } > EXPORT_SYMBOL_GPL(vhost_dequeue_msg); > > +int vhost_prefetch_desc_indices(struct vhost_virtqueue *vq, > + struct vring_used_elem *heads, > + u16 num, bool used_update) > +{ > + int ret, ret2; > + u16 last_avail_idx, last_used_idx, total, copied; > + __virtio16 avail_idx; > + struct vring_used_elem __user *used; > + int i; > + > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { > + vq_err(vq, &qu...

...unction(w, y, z = 0){ w + y + z }||| |||| |||# the same as mylist, but now z is optional||| |||mylist2 <- list(one = list(w = 1),||| ||| two = list(w = 3, z = 4)||| ||| )||| |||| |||# undesired result||(first element has length 0)| |||ret2 <- lapply(FUN = function(x,...) f2(w = x$w, z = x$z, ...),||| ||| X = mylist2,||| ||| y = Y||| ||| )||| |||| |||# errors out ('z' not found)||| |||ret2 <- lapply(FUN = with.default,||| ||| X =...

...vhost_dev *dev, > } > EXPORT_SYMBOL_GPL(vhost_dequeue_msg); > > +int vhost_prefetch_desc_indices(struct vhost_virtqueue *vq, > + struct vring_used_elem *heads, > + u16 num, bool used_update) why do you need to combine used update with prefetch? > +{ > + int ret, ret2; > + u16 last_avail_idx, last_used_idx, total, copied; > + __virtio16 avail_idx; > + struct vring_used_elem __user *used; > + int i; > + > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { > + vq_err(vq, "Failed to access avail idx at %p\n"...

...vhost_dev *dev, > } > EXPORT_SYMBOL_GPL(vhost_dequeue_msg); > > +int vhost_prefetch_desc_indices(struct vhost_virtqueue *vq, > + struct vring_used_elem *heads, > + u16 num, bool used_update) why do you need to combine used update with prefetch? > +{ > + int ret, ret2; > + u16 last_avail_idx, last_used_idx, total, copied; > + __virtio16 avail_idx; > + struct vring_used_elem __user *used; > + int i; > + > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { > + vq_err(vq, "Failed to access avail idx at %p\n"...

...;lm" : dates &lt;- as.Date(data.df[,1]) selection&lt;-which(dates&gt;=as.Date("1986-1-1") &amp; dates&lt;=as.Date("2007-12-31")) dep &lt;- ts(data.df[selection,c("dep")]) indep.ret1 &lt;- ts(data.df[selection,c("RET1")]) indep.ret2 &lt;- ts(data.df[selection,c("RET2")]) indep.ret3 &lt;- ts(data.df[selection,c("RET3")]) indep.ret4 &lt;- ts(data.df[selection,c("RET4")]) indep.ret5 &lt;- ts(data.df[selection,c("RET5")]) d&lt;-ts.union(dep,indep.ret1,indep.ret2,indep.ret...

I've put up a second beta for testing. libtheora-1.1beta2: - Improves rate control with difficult-to-encode input (the huskies issue) - Has all the example code ported to the 1.0 api - Builds on OpenBSD and Apple Xcode - TH_ENCCTL_SET_SPLEVEL is work again for trading of encode speed for quality. There's now a TH_ENCCTL_GET_SPLEVEL as well for reading the default/current

I've put up a second beta for testing. libtheora-1.1beta2: - Improves rate control with difficult-to-encode input (the huskies issue) - Has all the example code ported to the 1.0 api - Builds on OpenBSD and Apple Xcode - TH_ENCCTL_SET_SPLEVEL is work again for trading of encode speed for quality. There's now a TH_ENCCTL_GET_SPLEVEL as well for reading the default/current

...dea how to fix this? Any help would greatly be appreciated! Kind regards, Gero > str(regdata) 'data.frame': 89 obs. of 7 variables: $ ret1 : num 0.0275 -0.01013 0.00569 -0.01582 0.0226 ... $ lag(ret1) : num NA 0.0275 -0.01013 0.00569 -0.01582 ... $ lag(ret2) : num NA 0.04072 -0.00509 0.02055 -0.01548 ... $ lag(ret3) : num NA 0.05393 0.00299 0.02432 0.02251 ... $ (lag(ret1)*lag(ret2)): num NA 1.12e-03 5.16e-05 1.17e-04 2.45e-04 ... $ (lag(ret1)*lag(ret3)): num NA 1.48e-03 -3.03e-05 1.38e-04 -3.56e-04 ... $ (lag(ret2)*lag(ret3)...

...+ b/drivers/vhost/vhost.c @@ -2437,6 +2437,61 @@ struct vhost_msg_node *vhost_dequeue_msg(struct vhost_dev *dev, } EXPORT_SYMBOL_GPL(vhost_dequeue_msg); +int vhost_prefetch_desc_indices(struct vhost_virtqueue *vq, + struct vring_used_elem *heads, + u16 num, bool used_update) +{ + int ret, ret2; + u16 last_avail_idx, last_used_idx, total, copied; + __virtio16 avail_idx; + struct vring_used_elem __user *used; + int i; + + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { + vq_err(vq, "Failed to access avail idx at %p\n", + &vq->avail->i...

...irtqueue *vq, >> + struct vring_used_elem *heads, >> + u16 num, bool used_update) > why do you need to combine used update with prefetch? For better performance and I believe we don't care about the overhead when we meet errors in tx. > >> +{ >> + int ret, ret2; >> + u16 last_avail_idx, last_used_idx, total, copied; >> + __virtio16 avail_idx; >> + struct vring_used_elem __user *used; >> + int i; >> + >> + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { >> + vq_err(vq, "Failed to ac...

Hi, How does the requirement that phi instructions have one value per predecessor basic block interact with indirectbr instructions? For instance, take the following code: L1: br i1 %somevalue, label %L2, label %L3 L2: %ret1 = i8* blockaddress(@myfunction, %L5) br label %L4 L3: %ret2 = i8* blockaddress(@myfunction, %L6) br label %L4 L4: %ret = phi i8* [%ret1, L2], [%ret2, L3] indirectbr i8* %ret, [label %L5, label %L6] L5: %myval = phi i32 [0, %L2], [1, %L3] ; are both of these values required, even though the only *real* possible predecessor block is L2? ret i32...

...b/src/guestfs-internal.h @@ -630,12 +630,14 @@ extern int guestfs___match (guestfs_h *g, const char *str, const pcre *re); extern char *guestfs___match1 (guestfs_h *g, const char *str, const pcre *re); extern int guestfs___match2 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2); extern int guestfs___match3 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2, char **ret3); +extern int guestfs___match4 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2, char **ret3, char **ret4); extern int guestfs___match6 (guestfs_h *g, const...

...b/src/guestfs-internal.h @@ -630,12 +630,14 @@ extern int guestfs___match (guestfs_h *g, const char *str, const pcre *re); extern char *guestfs___match1 (guestfs_h *g, const char *str, const pcre *re); extern int guestfs___match2 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2); extern int guestfs___match3 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2, char **ret3); +extern int guestfs___match4 (guestfs_h *g, const char *str, const pcre *re, char **ret1, char **ret2, char **ret3, char **ret4); extern int guestfs___match6 (guestfs_h *g, const...

...tx. That's a separate question, I do not really understand how you can fetch a descriptor and update the used ring at the same time. This allows the guest to overwrite the buffer. I might be misunderstanding what is going on here though. > > > > > +{ > > > + int ret, ret2; > > > + u16 last_avail_idx, last_used_idx, total, copied; > > > + __virtio16 avail_idx; > > > + struct vring_used_elem __user *used; > > > + int i; > > > + > > > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { >...

...tx. That's a separate question, I do not really understand how you can fetch a descriptor and update the used ring at the same time. This allows the guest to overwrite the buffer. I might be misunderstanding what is going on here though. > > > > > +{ > > > + int ret, ret2; > > > + u16 last_avail_idx, last_used_idx, total, copied; > > > + __virtio16 avail_idx; > > > + struct vring_used_elem __user *used; > > > + int i; > > > + > > > + if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) { >...

...alue) char *p = data; size_t plen; - while (p < data + len && - (plen = _hivex_utf16_string_len_in_bytes_max (p, data + len - p)) > 0) { + while (p < data + len) { + plen = _hivex_utf16_string_len_in_bytes_max (p, data + len - p); nr_strings++; char **ret2 = realloc (ret, (1 + nr_strings) * sizeof (char *)); if (ret2 == NULL) { -- 1.8.5.2

This change refactors guestfs___has_windows_systemroot to guestfs___get_windows_systemroot. The new function returns a dynamically allocated char * which must be freed. The new function is no less efficient than before, as it returns the result of guestfs___case_sensitive_path_silently, which is required anyway. The new code is slightly more efficient than before, as it re-uses the result of this

...ardlinks=yes causes the following IMAP error: Some of the requested messages no longer exist. A possible fix follows. --- src/lib-storage/index/maildir/maildir-copy.c 19 Feb 2003 21:32:21 -0000 1.21 +++ src/lib-storage/index/maildir/maildir-copy.c 5 Apr 2003 09:23:34 -0000 @@ -113,7 +113,7 @@ ret2 = index_messageset_deinit(ctx); if (ret2 < 0) ret = -1; - else { + else if (ret2 == 0) { mail_storage_set_error(src->box.storage, "Some of the requested messages no longer exist."); ret = -1; -- fuyuki