search for: biject

...multaneously set the plot region? The aspect ratio is one number and the plot region is given by four numbers (xleft, xright, yleft, yright). Logically, these 5 numbers are independent of each other and arbitrary, provided xleft<xright and yleft<yright. This should give a one-to-one bijection between 5-tuples and plots, determined up to a change of scale that is uniform in the x- and y-dirctions. My code above shows the (to me) obvious attempt, which fails. Thanks David

...#39;s line binary table, which is generated with llvm-dwarfdump -debug-line. However, About one third of the whole functions' start line is not found in the mapping table. Thus, I can not get the start binary address. I know that the mapping between source locations and binary addresses is not bijective. I am using O1 optimization option. I know that some of the information might be lost legitimately because of optimization. But I don't think dwarf will miss so many functions' start addresses. Am I right? Any useful comments and suggestions are welcomed. Many Thanks Regards Muhui -----...

For three of the beta distribution functions in R the parameters defining the distribution are alpha, beta and 'ncp'. Pretty trivially, there is no bijection between these three and the mean and variance, but for the special case of ncp = 0, I think there is. Rather than just write it down, it's probably a good idea to see how to get it. Note that mu = alpha/(alpha+beta) s2 = alpha*beta/((alpha+beta)^2*(alpha+beta+1)) = mu*(1-mu)/(alpha+be...

...keep growing, so that the next hunk > of bitcode added can have access to all the functions > defined so far? Yes. The JIT supports lazy compilation mode where it will generate thunks that only get compiled/linked when called - see JIT::getPointerToFunctionOrStub *. The above would solve a bijective requirement that earlier code may rely on functions defined in later code - if that is not necessary then the JIT should just work out of the box. * Note that the lazy compilation mode currently does not work well in a multithreaded environment. Cheers, James > -----Original Message-----...

...hing in the next > couple days. Details, since this has implications for vector machine backends? I'm just not groking how moving isSplat to SDNode eliminates BUILD_VECTOR or deals with constant vector formation. I like the idea of a ShuffleVectorSDNode (moves things in the direction of a bijective ISD to SDNode mapping), but eliminating BuildVectorSDNode in its entirety doesn't deal with constant and variable vectors. -scooter -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090223/adc53b8e/att...

...tting pressured into reviewing a patch in some area). +1 I've found this frustrating, especially coupled with the fact that folks' email addresses, phab usernames, and svn usernames are not always obviously related to each other. It would be nice to enforce (or very strongly suggest) a bijection on phab usernames and svn usernames, and then display them in the tool as something like: `jsmith2 "John Smith" <john at smith.com>` (for some hypothetical developer). Regards, Jon > > Alp. > > > > On 01/07/2014 14:11, Manuel Klimek wrote: >> Alp note...

...method on SDNode that took an SDNode, checked if it was a build vector, and calculated whatever splat information you wanted. There's no need for BuildVectorSDNode for this particular functionality. > I like the idea of a ShuffleVectorSDNode (moves things in the > direction of a bijective ISD to SDNode mapping), but eliminating > BuildVectorSDNode in its entirety doesn't deal with constant and > variable vectors. LLVM has no variable shuffle instruction, so there's no variable vectors to deal with; moving the constants into the shuffle sdnode does address c...

On Feb 23, 2009, at 1:46 PM, Chris Lattner wrote: > In my opinion, the proper direction for shuffles is: > > 1. Back out your patch. > 2. Move the functionality of "is splat" etc to method somewhere, e.g. > on SDNode. > 3. Introduce a new ShuffleVectorSDNode that only has two SDValue > operands (the two input vectors), but that also contains an array of > ints in

...en I try to find the corresponding binary address from the dwarf debug info. However, I noticed that the dwarf table might not always return me the answer and some of the source line and column number is not found inside dwarf table. The mapping between source locations and binary addresses is not bijective, especially so when the compiler performs any optimizations. To give an obvious example, when the compiler performs dead code elimination, the source locations of the dead code will not appear in the debug info for the resulting binary. Another common example is when two identical instructions w...

Hi James, > It depends on how your bitcode is loaded. It can be loaded either by llc, > which outputs pure ELF/Mach-O, in which case those function references get > turned into relocations that the linker (ld, Gold) applies. > > If you're loading bitcode via the JIT, it uses dlsym() to try and introspect > your runtime environment to find the symbol. Ah, that makes sense -

Hi I am using llvm-dwarfdump to dump the line table with -debug-line option. I compiled my program with -gdwarf-3. I first get the line number and source number for every instruction of the LLVM IR with metadata. Then I try to find the corresponding binary address from the dwarf debug info. However, I noticed that the dwarf table might not always return me the answer and some of the source line

...with llvm-dwarfdump -debug-line. >> >> However, About one third of the whole functions' start line is not found >> in the mapping table. Thus, I can not get the start binary address. I know >> that the mapping between source locations and binary addresses is not >> bijective. I am using O1 optimization option. I know that some of the >> information might be lost legitimately because of optimization. But I don't >> think dwarf will miss so many functions' start addresses. Am I right? Any >> useful comments and suggestions are welcomed. Many...

Hi all, I have some rough code to sample consecutive integers with length according to a vector of lengths #sample space (representing positions) pos<-c(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20) #sample lengths lengths<-c(2,3,2) From these two vectors I need a vector of sampled positions. the sampling is without replacement, making things tough as the sampled integers need

I have data that ranges from 0.3 to 2 and I want to change the scale to be from 0 to 1. Can this be done in R? -- Thanks, Jim. [[alternative HTML version deleted]]

...e now using static libs instead? Please note that the example is NOT directly registering a pass, in fact up till now, for this example, I've only be able to generate this pass registration conflict by having the main translation unit include llvm/ExecutionEngine/JIT.h. As doing the manual svn bijection effort to locate the commit was a slow process, I thought I would go to the list for help (I have real code which organizes its files with shared libraries), to short cut to a solution--finding out why a clang (platform dependent?), built clang/llvm manifests the issue would be another long effo...

Hello:I am trying to match the value 0.3 in the sequence seq(.2,.3). I get > 0.3 %in% seq(from=.2,to=.3) [1] FALSE Yet > 0.3 %in% c(.2,.3) [1] TRUE For arbitrary sequences, this "invisible .3" has been problematic. What is the best way to work around this? Thank you. Dan [[alternative HTML version deleted]]

Dear all, How does the effect() function in the effects package calculate effects and standard errors for glm quasipoisson models? I was using effect() to calculate the impact of increasing x to e + epsilon, and then finding the expected percent change. I thought that this effect (as a percentage) should be exp(beta*epsilon), where beta is the appropriate coefficient from the model, but

...per-text markings to make it explicit, then creating a bug will be unequivocal. But if you try to guess by the description, then we'll end up with a flood of bugs (been there, done that). Right now, "fixes PR" is our hyper-text marking, but it's only injective, you want something bijective. I can't think of anything that would have the same semantics whether you have a PR number or not. I actually see this as an attempt to overcome the problem that people don't create enough PRs, by forcing them to write more on the commit message. For me, this is trying to solve the wron...

...it makes no sense to look for it. That's one issue where I disagree and would argue for good O-O software design. At least my patch puts the functionality in a place where it's reasonable to expect it reside. I like the idea of a ShuffleVectorSDNode (moves things in the direction of a > bijective ISD to SDNode mapping), but eliminating BuildVectorSDNode in its > entirety doesn't deal with constant and variable vectors. > > > LLVM has no variable shuffle instruction, so there's no variable vectors to > deal with; moving the constants into the shuffle sdnode does add...

...e frag_id_hash for > devices. > > Now, user can set identical frag id hash for all devices > for a given VM. > > We can even expose this to guests: each guest would generate > the ID on boot and send it to host, host would set it > in sysfs. jhash_1word shouldn't be a bijection, so we are randomizing here and are increasing the probability of collisions. Instead of jhash_1word you would need to take a simple block cipher with the hash as key. Bye, Hannes