search for: resctrict

Hi Gurus! I have a job that is to get randomly samples from point-based GIS data (sp called shape GIS files) under the total sum resctricted. For example, I would like to take random smaples under the 1000 persons in each city. The randomly sampled persons should not be over 1000 any case. Thank you in advance, -- Kum-Hoe Hwang, Ph.D. Phone : 82-31-250-3283 Email : phdhwang@gmail.com [[alternative HTML version deleted]]

I upgraded to samba 3.0 recently. I have a lot of shares containing excel workbooks that need to be rea only for certain people and writable by others. If I try and open any one that is resctricted to read only, whether by samba "read list" etc. of using linux ext permissions windows compalins that the file could not be found, check the spelling of the filaname blah blah ... No errors are reported in the samba log files. If I copy file to the windows box and set permissions to m...

...) { if (LI->getOperand(0) == AI) { LI->replaceAllUsesWith(OnlyStore->getOperand(0)); if (AST && isa<PointerType>(LI->getType())) AST->deleteValue(LI); LI->eraseFromParent(); } } } I suppose we could resctrict the map to containing only load and store instructions but if you've got a block with a lot of memory instructions I'm not sure it will be much faster, especially with the second loop. The artificial testcase I've come up with does exactly this. It basically does load-load-add-stor...

...te: > Ok, if you need this direction, just use an > std::vector<pair<unsigned,Instruction*>> as a forward map? You can do > fast binary searches in it. I don't see how that helps. I need a map from BasicBlock to a list of loads and stores. > > I suppose we could resctrict the map to containing only load and store > > instructions but if you've got a block with a lot of memory > > instructions I'm > > not sure it will be much faster, especially with the second loop. > > Yes, you only want load and stores that directly target allocas....

...of load and store instructions fast. That won't > be > possible with a map indexing all instructions. Ok, if you need this direction, just use an std::vector<pair<unsigned,Instruction*>> as a forward map? You can do fast binary searches in it. > I suppose we could resctrict the map to containing only load and store > instructions but if you've got a block with a lot of memory > instructions I'm > not sure it will be much faster, especially with the second loop. Yes, you only want load and stores that directly target allocas. This won't impac...

...t;pair<unsigned,Instruction*>> as a forward map? You can >> do >> fast binary searches in it. > > I don't see how that helps. I need a map from BasicBlock to a list > of loads > and stores. This isn't needed after all. >>> I suppose we could resctrict the map to containing only load and >>> store >>> instructions but if you've got a block with a lot of memory >>> instructions I'm >>> not sure it will be much faster, especially with the second loop. >> >> Yes, you only want load and stores...

On Saturday 04 October 2008 17:05, Chris Lattner wrote: > Looking more closely at the approach, I infer that the (logical in > hindsight) issue are cases where mem2reg scans a BB to see the > relative ordering of two instructions. For example, the single store Correct. > case. I could imagine that if you saw lots of single store allocas in > the middle of a large BB that

Hi Frank, I'm not sure I completely understand what your delegating memory manager is doing, but I probably don't need to. If your primary objection is that you can't derive from the DefaultJITMemoryManager then I personally wouldn't object to your submitting a patch to make that accessible as a base class. The future path for JIT and MCJIT is under debate. A few of us would

It seems wrong to delegate a dozen or more methods when I only want to change the behavior in a couple small ways. It would have been easier to derive a class, but the base class is inaccessible (in an anonymous namespace). And I was afraid to roll my own memory manager because I didn't understand what all those methods do. So MCJIT is future - will JITMemoryManager remain relevant? If so I

On Oct 4, 2008, at 2:51 PM, Chris Lattner wrote: >>> I like your approach of using the use lists but I'm not sure the >>> ordering >>> is guaranteed. If it is, your approach is superior. >> >> I got my patch updated to work with TOT. Here it is. Comments >> welcome. > > Hi Dave, > > Great. I'd like to get this in, but would

Hi, I would like to minimize the value of x1-x2, x2 is a fixed value of 0.01, x1 is the quantile of normal distribution (0.0032,x) with probability of 0.7, and the changing value should be x. Initial value for x is 0.0207. I am using the following codes, but it does not work. fr <- function(x) { x1<-qnorm(0.7,0.0032,x) x2=0.01 x1-x2 } xsd <- optim(0.0207, fr,