Displaying 20 results from an estimated 1549 matches for "prev".
Did you mean:
pdev
2017 Oct 18
2
Null deference panic in CentOS-6.5
...weight = 2,
inv_weight = 0
},
nr_running = 1,
h_nr_running = 2,
exec_clock = 3309310258875,
min_vruntime = 1181294560093,
tasks_timeline = {
rb_node = 0x0
},
rb_leftmost = 0x0,
tasks = {
next = 0xffff88013bc568e8,
prev = 0xffff88013bc568e8
},
balance_iterator = 0xffff88013bc568e8,
curr = 0xffff88204b501e00,
next = 0x0,
last = 0x0,
skip = 0x0,
nr_spread_over = 5,
....
We can see that the value if rq->cfs.nr_running is not zero, but
rb_leftmost is null. With skip...
2006 Nov 20
1
sem package subscript out of bounds error
...ve
tried this with simpler version of the below model, and keep getting
the same error.
What does this error mean?
Below is the full code, but I've tried this with all sorts of subsets
of the model, making sure to keep all of the proper error terms.
---
fish.invert.data<-data.frame(Prev.Year.Predatory.Invert.Abundance,
Prev.Year.Predatory.Fish.Abundance,
Predatory.Invert.Abundance,
Predatory.Fish.Abundance,
Prev.Year.Herbivorous.Invert.Abundance,
Prev.Year.Herbivorous.Fish.Abundance,
Herbivorous.Invert.Abundance,
Herbivorous.Fish.Abundance...
2010 Oct 07
3
reshape from wide to long, ordering of "varying"
Hello,
I have data in the following form
age sex Int.Prev.Est.1 Int.Prev.Est.2 Int.Prev.Est.3
Int.Prev.Est.4 Int.Prev.Est.5
93110 93 0 23.75482 57.86592 9.755003
4.343534 4.280714
93610 93 1 53.36475 39.47247 4.381618
1.622119 1.159044
94110 94 0 23.47514 58.23936 10.789339
3.690415...
2012 Jul 17
3
complexity of operations in R
Hello!
I am optimizing my code in R and for this I need to know a bit more about
the internals. It would help tremendously if someone could link me to a
page with O()-complexities of all the operations.
In this particular case, I need something like a linked list with O(1)
insertLast/First ability. I can't preallocate a vector since I do not know
the final size of the list ahead of time.
The
2025 Jan 09
3
[PATCH] nouveau/fence: handle cross device fences properly. (v3)
...u/drm/nouveau/nouveau_fence.c
index ee5e9d40c166..a3eb1f447a29 100644
--- a/drivers/gpu/drm/nouveau/nouveau_fence.c
+++ b/drivers/gpu/drm/nouveau/nouveau_fence.c
@@ -367,11 +367,13 @@ nouveau_fence_sync(struct nouveau_bo *nvbo, struct nouveau_channel *chan,
if (f) {
struct nouveau_channel *prev;
bool must_wait = true;
+ bool local;
rcu_read_lock();
prev = rcu_dereference(f->channel);
- if (prev && (prev == chan ||
- fctx->sync(f, prev, chan) == 0))
+ local = prev && prev->drm == chan->drm;
+ if (local && (prev == ch...
2009 Dec 15
0
[PATCH 1/4] btrfs: fix the bug that __tree_search() returns the wrong result in extent_map.c
__tree_search() returns the reverse result about the prev node and the next node. And we can
get the prev node and the next node directly by rb_prev() and rb_next(), so it is unnecessary
to use while loop to get them.
This patch fixes this bug of the wrong result.
Signed-off-by: Miao Xie <miaox@cn.fujitsu.com>
---
fs/btrfs/extent_map.c | 13 +++...
2012 Dec 17
4
[LLVMdev] BasicBlock back()
Hello,
I am a beginner of LLVM. I am trying to move among the instructions of a
BasicBlock and I cannot. In this particular example, I try to get the
previous instruction of the end instruction. I am trying 2 methods:
1. I have the following sequence of code:
bool patternDC::runOnBasicBlock(BasicBlock &BB) {
...
if (BB.getTerminator())
{
Instruction* current = BB.getTerminator();
errs() << "\n LAST: "...
2025 Jan 09
1
[PATCH] nouveau/fence: handle cross device fences properly. (v3)
...> index ee5e9d40c166..a3eb1f447a29 100644
> --- a/drivers/gpu/drm/nouveau/nouveau_fence.c
> +++ b/drivers/gpu/drm/nouveau/nouveau_fence.c
> @@ -367,11 +367,13 @@ nouveau_fence_sync(struct nouveau_bo *nvbo, struct nouveau_channel *chan,
> if (f) {
> struct nouveau_channel *prev;
> bool must_wait = true;
> + bool local;
>
> rcu_read_lock();
> prev = rcu_dereference(f->channel);
> - if (prev && (prev == chan ||
> - fctx->sync(f, prev, chan) == 0))
> + local = prev && prev->drm == chan->dr...
2012 Mar 15
2
Integrate inside function
Dear R users,
first I take this opportunity to greet all the R community for your
continuous efforts.
I wrote a function to calculate the pdf and cdf of a custom distribution
(mixed gamma model).
The function is the following:
pmixedgamma3 <- function(y, shape1, rate1, shape2, rate2, prev)
{
density.function<-function(x)
{
shape1=shape1
rate1=rate1
shape2=shape2
rate2=rate2
prev=prev
fun<-prev*((rate1^shape1)/gamma(shape1)*(x^(shape1-1))*exp(-rate1*x))
+ (1-prev)*((rate2^shape2)/gamma(shape2)*(x^(shape2-1))*exp(-rate2*x))
return(fun)
}
den<-density.fun...
2004 Oct 20
2
Replacing data from one data frame to another
Hi,
I have a data frame which contains two fields, 'prev' and 'mchnum'.
I have another data frame which also contains 'mchnum' and 'prev' and
some other fields. The 'prev' data in this field is corrupted and I
want to replace it with the data from the other data frame for matching
values of 'mchnum' (which...
2012 Oct 25
2
[LLVMdev] A question about pointer aliasing rules in LLVM
Hi,
I have the following IR code
</snippet>
%prev = getelementptr inbounds %struct.myStruct* %node, i32 0, i32 1
%1 = load %struct.myStruct** %prev, align 4, !tbaa !0
%next1 = getelementptr inbounds %struct.myStruct* %1, i32 0, i32 0
store %struct.myStruct* %0, %struct.myStruct** %next1, align 4, !tbaa !0
%2 = load %struct.myStruct** %prev, align...
2012 Dec 17
0
[LLVMdev] BasicBlock back()
On 12/17/12 10:34 AM, Alexandru Ionut Diaconescu wrote:
> Hello,
>
> I am a beginner of LLVM. I am trying to move among the instructions of
> a BasicBlock and I cannot. In this particular example, I try to get
> the previous instruction of the end instruction. I am trying 2 methods:
>
>
>
> 1. I have the following sequence of code:
>
> bool patternDC::runOnBasicBlock(BasicBlock &BB) {
> ...
> if (BB.getTerminator())
> {
> Instruction* current = BB.getTerminator();
>...
2012 Aug 10
2
creating a contingency table from a data.frame automatically (NOT BY HAND)
...gling with a binomial response over all categorical
variables (some of them with 3 levels, most with 2 levels). After
initial struggles with glm's (struggle coming from the data, not the
actual analysis) I have decided to prefer contingency tables. I have my
data such as:
response:
hunting.prev=c("success","fail","success","success","success","fail",...)
one of 21 surveyed variables:
groupsize=c("small","large","small","small","small","large"...)
...
now...
It is intui...
2012 Aug 02
0
predictions from hurdle model
...f
getting a zero response should reduce the overall mean below the non-zero
count mean.
I attached the relevant code and output below. Any thoughts or suggestions
would be much appreciated! I'm new to hurdle models and their
interpretation. Thank you,
Erin
> library(pscl)
> nbhurdle.prev<-hurdle(LLF.a~y.prev,data=full.cts,dist="negbin")
> summary(nbhurdle.prev)
Call:
hurdle(formula = LLF.a ~ y.prev, data = full.cts, dist = "negbin")
Pearson residuals:
Min 1Q Median 3Q Max
-0.6398 -0.3333 -0.3333 -0.1363 7.3145
Count model coefficie...
2008 Feb 14
3
contingency table
Hello!
May you help me? I'm trying to do a contingency table using this
> data(iris)
> library(rpart)
> modelo <- rpart(Species ~., iris)
> prev <- predict(modelo, iris)
Finally the contingency table
> table(iris$Species, prev)
But an error occurs:
Error in table(iris$Species, prev) :
all arguments must have the same length
And I do not understand why, may you help me?
Thank You!
2012 Dec 18
1
[LLVMdev] BasicBlock back()
PS:
I works when I use Instruction* prev = current->getPrevNode();
But then I have runtime error Stack dump that is very frequent...
On Mon, Dec 17, 2012 at 6:20 PM, John Criswell <criswell at illinois.edu>wrote:
> On 12/17/12 10:34 AM, Alexandru Ionut Diaconescu wrote:
>
> Hello,
>
> I am a beginner of LLVM. I...
2009 May 25
2
[PATCH 03/11] qemu: add routines to manage PCI capabilities
...I_CONFIG_SPACE_SIZE; ++i)
+ if (pdev->used[i])
+ offset = i + 1;
+ else if (i - offset + 1 == size)
+ return offset;
+ return 0;
+}
+
+static uint8_t pci_find_capability_list(PCIDevice *pdev, uint8_t cap_id,
+ uint8_t *prev_p)
+{
+ uint8_t next, prev;
+
+ if (!(pdev->config[PCI_STATUS] & PCI_STATUS_CAP_LIST))
+ return 0;
+
+ for (prev = PCI_CAPABILITY_LIST; (next = pdev->config[prev]);
+ prev = next + PCI_CAP_LIST_NEXT)
+ if (pdev->config[next + PCI_CAP_LIST_ID] != cap_id)
+...
2009 May 25
2
[PATCH 03/11] qemu: add routines to manage PCI capabilities
...I_CONFIG_SPACE_SIZE; ++i)
+ if (pdev->used[i])
+ offset = i + 1;
+ else if (i - offset + 1 == size)
+ return offset;
+ return 0;
+}
+
+static uint8_t pci_find_capability_list(PCIDevice *pdev, uint8_t cap_id,
+ uint8_t *prev_p)
+{
+ uint8_t next, prev;
+
+ if (!(pdev->config[PCI_STATUS] & PCI_STATUS_CAP_LIST))
+ return 0;
+
+ for (prev = PCI_CAPABILITY_LIST; (next = pdev->config[prev]);
+ prev = next + PCI_CAP_LIST_NEXT)
+ if (pdev->config[next + PCI_CAP_LIST_ID] != cap_id)
+...
2005 Feb 23
19
Calculating real cpu usage of Xen domains correctly!
Hi all,
With the new vm-tools we are trying to get top like capabilities going
correctly. Currently we have a program vm-list that has some of this
capability but is dependent on the cpu time given by libxc calls
(xc_get_dom_info & xc_domain_get_cpu_usage). These two functions give
you how much time (in nanoseconds, why is this not documented) the
domain has been actively used. Approaches:
2012 Oct 25
0
[LLVMdev] A question about pointer aliasing rules in LLVM
On Thu, Oct 25, 2012 at 3:15 PM, Pranav Bhandarkar
<pranavb at codeaurora.org>wrote:
> Hi,
>
> I have the following IR code
>
> </snippet>
> %prev = getelementptr inbounds %struct.myStruct* %node, i32 0, i32 1
> %1 = load %struct.myStruct** %prev, align 4, !tbaa !0
> %next1 = getelementptr inbounds %struct.myStruct* %1, i32 0, i32 0
> store %struct.myStruct* %0, %struct.myStruct** %next1, align 4, !tbaa !0
> %2 = load %struct.mySt...