similar to: parallel scanner support (general question)

Dear All, Can anyone recommend a scanner that works well on 4.8. Thanks in advance, Regards, Dave -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 187 bytes Desc: This is a digitally signed message part Url : http://lists.freebsd.org/pipermail/freebsd-stable/attachments/20030906/4c29ef0a/attachment.bin

Hi, I just noticed this article, http://www.howtoforge.net/fully-utilizing-your-x-core-cpu which uses http://code.google.com/p/ppss/ for parralel processing. So, can anyone tell me if parralel processing happens automatically on CentOS, or would I need to use this script as well? We mainly have Dual Core & Dual CPU, Dual Core (i.e. 8 cores) servers and it would be benefitial to know whether

My problem with HFSC tc command is ... tc command''s HFSC have a lot parameter with 4 curve type SC curve -> umax dmax rate LS curve -> umax dmax rate RT curve -> umax dmax rate UL curve -> umax dmax rate so i''dont know which parameter are appropriate for my test case such real time class which curve are appropriate and good working result. my assumption about

I'm interested in using @llvm.experimental.vector.reduce.smax/umax to implement runtime overflow checking for vectors. Here's an example checked addition, without vectors, and then I'll follow the example with what I would do for checked addition with vectors. Frontend code (zig): export fn entry() void { var a: i32 = 1; var b: i32 = 2; var x = a + b; } LLVM IR code:

The IR update to allow vector types was here: https://reviews.llvm.org/D57090 ...we didn't update the docs at that time because it was not clear what the backend would do with that, but that might've changed with some of the more recent patches. On Sat, Feb 9, 2019 at 1:42 AM Craig Topper via llvm-dev < llvm-dev at lists.llvm.org> wrote: > I don't think I understand your

I'm trying to figure out how to plot basic utility maximization results with R, Ideally I'd like to plot the value of u through x1,x2 space, so you can graph income / substitution effects easily... also, it'd be nice if I could put a linear budget constraint on the graph here's an example with cobb douglas utility u <- function(x) { x1 <- x[1] x2 <- x[2]

Hi Sanjoy, Thanks for the reply! Your approach sounds good to me! I think 1) is legal as address wraparound in unsigned range doesn't make sense given a positive offset, but I am not sure. I think umax will not be added if we can prove the predicate as known. I am not sure whether umax will get simplified if we add nuw to the expressions. -Pankaj -----Original Message----- From: Sanjoy

declare i8 @llvm.atomic.load.max.i8.p0i8( i8* <ptr>, i8 <delta> ) declare i16 @llvm.atomic.load.max.i16.p0i16( i16* <ptr>, i16 <delta> ) declare i32 @llvm.atomic.load.max.i32.p0i32( i32* <ptr>, i32 <delta> ) declare i64 @llvm.atomic.load.max.i64.p0i64( i64* <ptr>, i64 <delta> ) declare i8 @llvm.atomic.load.min.i8.p0i8( i8* <ptr>, i8

I have a lot question about tc-command because now i''m doing research to compare performance between HTB and  HFSC so i''m doubt a lot thing and your reply are so very helpful to me ... My question is In HTB tc command question 1. I''m use opensource (Mastershaper) for help to config traffic control but when i''m try to config HTB, I''m doubt about

Full_Name: Christian Marquardt Version: 2.1.0 OS: Linux (Redhat 9) Submission from: (NULL) (151.170.240.10) Following the advice of a reader of R-help, I would now like to submit this as a bug report: Say we have x = seq(1,3, by = 0.01) y = exp(x) Plotting and reversing linear axis is fine plot(x,y) plot(x,y, ylim = c(30,1)) as is a usual log-plot: plot(x,y, log =

On Sat, Feb 9, 2019 at 6:25 PM Simon Pilgrim <llvm-dev at redking.me.uk> wrote: > The add/sub (+mul) overflow intrinsics are being updated to support > vectors to match the related add/sub saturation intrinsics. We haven't > updated the docs yet as legalization, vectorization and various minor bits > of plumbing still need to be finished before it can be officially supported

Thanks for the suggestion but datalayout info did not solve the problem! -Pankaj -----Original Message----- From: Philip Reames <listmail at philipreames.com> Sent: Tuesday, August 20, 2019 5:26 PM To: Chawla, Pankaj <pankaj.chawla at intel.com>; llvm-dev at lists.llvm.org Subject: Re: [llvm-dev] missing simplification in ScalarEvolution? Try adding a datalayout with pointer size

I am investigating changing our broadband bandwidth control scripts over to HFSC. What I would like to accomplish is this: { * DOWNLOAD * I need a download class for each user (we''ll call it Class 1) that offers a minimum of lets say 384Kbps and a maximum of 1.5Mbps. The rates between 384Kbps and 1.5Mbps should be shared among all users. Each user should always be able to get at

Hi, I am trying to generate all unordered combinations of a set of numbers / characters, and I can only find a (very) clumsy way of doing this using expand.grid. For example, all unordered combinations of the numbers 0, 1, 2 are: 0, 0, 0 0, 0, 1 0, 0, 2 0, 1, 1 0, 1, 2 0, 2, 2 1, 1, 1 1, 1, 2 1, 2, 2 2, 2, 2 (I have not included, for example, 1, 0, 0, since it is equivalent to 0, 0, 1). I have

Hi there! I have become a big fan of the 'foreach' package allowing me to do a lot of stuff in parallel. For example, evaluating the function f on all elements in a vector x is easily accomplished: foreach(i=1:length(x),.combine=c) %dopar% f(x[i]) Here the .combine=c option tells foreach to combine output using the c()-function. That is, to return it as a vector. Today I discovered the

hi all, long time since i posted on the list. just wondering if anybody has played around with hfsc and if so could he/she share their info on it thanks adrian -- To mess up a Linux box, you need to work at it; to mess up your Windows box, you just need to work on it. _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl

Hello, I’ve read this Article avout VOIP and HFSC http://automatthias.wordpress.com/2006/06/30/hfsc-and-voip/ I’ve got few questions ? Considering this tc class add dev $DEV parent 1:1 classid 1:2 hfsc \ rt m1 ${UPLINK}kbit d 50ms m2 $[1*$UPLINK/10]kbit \ ls m1 ${UPLINK}kbit d 50ms m2 $[3*$UPLINK/10]kbit \ ul rate ${UPLINK}kbit rt = realtime curve ls = linksharing curve but m1 = ? m2 = ? d =

Dear all, I would like to ask your help understand the subsequent steps for making my program faster. The following code: Gauslist<-array(data=NA,dim=c(dimx,dimy,dimz)) for (i in c(1:dimz)){ print(sprintf('Creating the %d map',i)); Gauslist[,,i]<-f <- GaussRF(x=x, y=y, model=model, grid=TRUE,param=c(mean,variance,nugget,scale,Whit.alpha)) } creates 100 GaussMaps (each

I have been working on a patch to add support for max/min reductions in LoopVectorize. One of the comments that came up in review is that the implementation could be simplified (and less fragile) if max and min intrinsics were recognized rather than looking for compare-select sequences. The suggestion was to change compare-selects into max and min intrinsic calls during instcombine. The

On 7 June 2013 15:41, Arnold Schwaighofer <aschwaighofer at apple.com> wrote: > We don’t want to encode backend knowledge into the vectorizer (i.e. don’t > vectorize type X because the backend does not support it). > We already do, via the cost table. This case is no different. It might not be the best choice, but it is how the cost table is being built over the last months. The