search for: unimportable

On non-PCI devices, nobody should really care if the device does not provide HDMI... Signed-off-by: Alexandre Courbot <acourbot at nvidia.com> --- drm/nouveau/nouveau_drm.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/drm/nouveau/nouveau_drm.c b/drm/nouveau/nouveau_drm.c index 2f2f252e3fb6..c2337fb73fe7 100644 --- a/drm/nouveau/nouveau_drm.c +++

Hi. In ocfs2, fdatasync and fsync are identical. I think fdatasync should skip committing transaction when inode->i_state is set just I_DIRTY_SYNC and this indicates only atime or/and mtime updates. Following patch improves fdatasync throughput. #sysbench --num-threads=16 --max-requests=300000 --test=fileio --file-block-size=4K --file-total-size=16G --file-test-mode=rndwr

Hi, more than a year ago I created a mirrored ZFS-Pool consiting of 2x1TB HDDs using the OSX 10.5 ZFS Kernel Extension (Zpool Version 8, ZFS Version 2). Everything went fine and I used the pool to store personal stuff on it, like lots of photos and music. (So getting the data back is not time critical, but still important to me.) Later, since the development of the ZFS extension was

If I have two matrices like x <- matrix(rep(c(1,2,3),3),3) y <- matrix(rep(c(4,5,6),3),3) How can I combine them to get ? 1 1 1 4 4 4 1 1 1 5 5 5 1 1 1 6 6 6 2 2 2 4 4 4 2 2 2 5 5 5 2 2 2 6 6 6 3 3 3 4 4 4 3 3 3 5 5 5 3 3 3 6 6 6 The number of rows and the actual numbers above are unimportant, they are given so as to illustrate how I want to combine the matrices. I.e., I am looking for

Source: xen Version: 4.4.1-9 Severity: normal Tags: security upstream patch fixed-upstream Hi, the following vulnerability was published for xen. CVE-2015-3340[0]: | Xen 4.2.x through 4.5.x does not initialize certain fields, which | allows certain remote service domains to obtain sensitive information | from memory via a (1) XEN_DOMCTL_gettscinfo or (2) | XEN_SYSCTL_getdomaininfolist request.

This might not possible in R but I thought I would give it shot. I am have to set up a 40 x 40 cm grid of 181 points equidistant from each other. Is there any way to produce a graph with R that can do this for me? Actual sizes are unimportant as long it is to scale. Thanks -- View this message in context: http://www.nabble.com/Grid-building-in-R-tp18371874p18371874.html Sent from the R help

Dear R helpers, I have a data set with 4 types (W, C, E & S). Now I have values for all types plus all possible combinations (the order is unimportant): W, C, WC, E, WE, CE, WCE, S, WS, CS, WCS, ES, WES, CES & WCES. Ideally I would like to represent everything in one graph and as concise as possible. Drawing 4 circles and depicting it as overlap just gives me 13 out of the 15

Hello, I wonder if someone could send me suggestions on how to solve the following problem: I have a vector of an arbitrary size (ex. data<-c(10,10,11,10,12,11,10,12,11,11,10,11)) and use the table function, which gives the following result 10 11 12 5 5 2 that''s fine, but what I would like to do now is: construct new classes based on the number of classes from table, 10

I''ve started using specs as a to-do list. I write explicitly violated specs so I know what to come back to. But a lot of the time, that means if I start to work on another piece of functionality covered by the same spec, it''s hard to tell what I''m working on now from the explicit failues. I run all my specs through TextMate to use the HTML output, so I go by

For my thesis I''m constructing a questionnaire and I would like to know your opinion about it and perhaps additional questions. The research will focus on the adoption factors and demographic characteristics of companies using rails. So if you happen to know good questions, or think they''re inappropriate, let me know. I''ll start off: Organizational 1. What is your

I have a dataset with transactions and a timestamp at which they occoured during a day. The time stamp is in the format YYYY/MM/DD hh:mm:ss. I would like to plot a timeseries of the transactions to see if there is a particular time in the day when there is a spike in transactions. Ofcourse the YYYY/MM/DD can be dropped since I am monitoring activity for the day and the actual date is

Dear All, GSoC 2013 is coming! This means it's a good time to refresh the Open Projects pages. So, please, add your ideas there, remove old / unimportant stuff, tweak current ideas. It's really important to have these pages up-to-date by the time of GSoC (next couple of weeks). Your help is needed! -- With best regards, Anton Korobeynikov Faculty of Mathematics and Mechanics, Saint

Hi Inaki, > "Performant"... in terms of what. If the cost of copying the data > predominates over the computation time, maybe you didn't need > parallelization in the first place. Performant in terms of speed. There's no copying in that example using `mclapply` and so it is significantly faster than other alternatives. It is a very simple and contrived example, but

Hi, I was reading Clang's documentation [1] on Modules and there are several aspects that confused me that I was wondering if someone could clarify some parts. I'm CC'ing a few people who git blame shows contributed to the documentation. Hopefully answers can be used to help me write a patch to improve the documentation here. # Modules Semantics The following is stated ``` If any

Hello James et al. I try to set only one expectation per test, but I also dislike having extra stub declarations that are no longer used, thus I often find myself wanting Object.expects(:foo).at_least_once. That works, but I don''t actually "expect" foo to be called, in fact, I don''t care, I only want to know when it isn''t called so I can remember to

Hi, I''m running RoR and have set it up more or less like described in the wiki (for instance here http://wiki.rubyonrails.org/rails/pages/LighttpdWithProcessScripts). I can start the fcgi listener and see that ports 7000-7004 are listening. I can start lighttpd, and try to connect to the server. I can restart the default.fcgi listening scripts that i see in "ps ax | grep

Could someone please suggest a more clever solution to the following problem than my loop below? Given X a 2xN matrix X, and I a k-subset of N, Generate the (2^k)xN matrix Y with columns not in I all zero and the other columns with all choices of an entry from the first or second row of X. For example, with X <- matrix(1:8, nrow=2) I <- c(1,3) X is 1 3 5 7 2 4 6 8 and Y should be 1 0 5

On 2/18/2019 4:15 AM, Michael Platings via llvm-dev wrote: > Taking my previous example [1]: > > InnerLoopVectorizer LB(L, PSE, LI, DT, TLI, TTI, AC, ORE, VF.Width, IC, > &LVL, &CM); > > If we imagine that over time it evolves such that 50% of the variables have been renamed to camelBack versions of the type names, then it will look like this: > >

Hi, I have ported LLC to a risc cpu. It can pass benchmark that I have at current. But I want do some optimization after register alloction by adjusting register using. I scan MachineBasicBlock to analyze operand's IsKill, IsDead , IsDef attribute to get a physical register's liverange. But I get a strange case at MBB.jpg. R4 is marked <kill> at MBB0. If I scan R4's

Just throwing my two cents in: I think removing/deprecating fork would be a bad idea for two reasons: 1) There are no performant alternatives 2) Removing fork would break existing workflows Even if replaced with something using the same interface (e.g., a function that automatically detects variables to export as in the amazing `future` package), the lack of copy-on-write functionality would