search for: weaker

...mal for most codes. In most cases, I agree. But for codes that depend heavily on dependence analysis, I would think that being conservative with index expressions would really kill any disambiguation capability and make many loop optimizations and other dependence-based optimizations much weaker. For example, static scheduling of array intensive loops seems vulnerable to this. --Vikram

...med, and reused.  There are various other transforms we could implement for thread private locations (e.g. replace an atomicrmw on a thread private with a load, op, store sequence), but I'm not sure these are actually worth implementing at the moment. We could extend the memory model with a weaker access type.  I think our current NotAtomic is a good default, but we could consider adding a ThreadPrivate specifier which is weaker than the existing NotAtomic in exactly the same way that the metadata implies.  This is a reasonable implementation strategy, but might be a bit more work than I...

...g with this report, so you can recognize or block similar unwanted mail in future. See http://spamassassin.org/tag/ for more details. Content preview: candi LATEST BREAKTHROUGH - NEWS FLASH The BAD News: As you Age your body produces less hormones causing you to look older, feel older and be weaker! [...] Content analysis details: (7.80 points, 5 required) TO_ADDRESS_EQ_REAL (0.6 points) To: repeats address as real name HGH (0.5 points) BODY: Human Growth Hormone HTML_FONT_COLOR_RED (0.1 points) BODY: HTML font color is red HTML_MESSAGE (0.1 points) BODY: HTML inc...

...earning R and doing nested regression with the report due Mon (Friday night statistics...fun. ). Anyway, here's my problem: In a regression equation not accounting for the fact that people are nested in families, the result for Z variable is VERY strong (beta = -4511), but this result is much weaker when I use lme and account for people nested in families (beta = -2613). I'm struggling with a verbal interpretation of this result. Is it because the effect of Z within families is not very strong, but between family variation is high? ------------------------------------------------------...

...the opening paragraph: "In software engineering, strength reduction is a compiler optimization where expensive operations are replaced with equivalent but less expensive operations. The classic example of strength reduction converts "strong" multiplications inside a loop into "weaker" additions – something that frequently occurs in array addressing." :) ) And here is another loop: extern void foo(int); typedef struct {int i; int a[10];} S; void bar(S* A) { for(int i = 50; i < 400;i++) foo(A[i].i); } In this case, there is a multiplication in each...

...pth is greater than zero). With this solution, one problem remains: an 'always_inline' on the call site is currently stronger than a 'noinline' on the callee. Thus, a recursive 'always_inline' would ignore 'noinline'. To fix this, we can make 'always_inline' weaker than 'noinline'. If that breaks backwards compatibility too much, we could add a second parameter (boolean 'weak' or 'strong') to 'always_inline'. I've never worked on LLVM before, but if someone confirms what the preferred solution to this is, I will start work...

...rypted from their respective one-way hash ciphertexts. That is, you *cannot* convert through some function F: NT MD4 Hash = F(UNIX salted modified DES one-way hash); Not possible! or UNIX salted modified DES one-way hash = F(NT MD4 Hash); Not possible! [NOTE: You could probably brute-force the weaker LanMan passwords stored in the SAM back to plaintext although this would be quite compute intensive.] What this means is that all users will need to change their passwords at implementation time (you will issue new passwords to all users) in order to sample their plain text passwords. Once that o...

On Mon, 2015-11-09 at 21:35 -0800, Andy Lutomirski wrote: > > We could do it the other way around: on powerpc, if a PCI device is in > that range and doesn't have the "bypass" property at all, then it's > assumed to bypass the IOMMU.??This means that everything that > currently works continues working.??If someone builds a physical > virtio device or uses

On Mon, 2015-11-09 at 21:35 -0800, Andy Lutomirski wrote: > > We could do it the other way around: on powerpc, if a PCI device is in > that range and doesn't have the "bypass" property at all, then it's > assumed to bypass the IOMMU.??This means that everything that > currently works continues working.??If someone builds a physical > virtio device or uses

Hi, I would like to access the AsmPrinter MachineFunctionPass during compilation in order to do alternative dumping of instructions, instead of using MI->dump(), which can get a bit messy. Is there any way to access this object or the assembler strings? It seems that even these strings / methods are not available through any static methods. Does it exist during the whole compilation or is it

...ethod, as i have discovered a case where it seems very far from 'strict'. I had two MI's, A and B, where A is !isSafeToMove(): A B TwoAddress pass changes the order to B A , as it reschedules the LastKill MI (B). Is this a bug in TwoAdress, or is it the case that isSafeToMove() is weaker than isSchedulingBoundary() so that these indirect violations are expected and accepted in TwoAddress and elsewhere? Thanks, Jonas

...;> There NULL is macros which can be defined as 0 or (void*)0, again in >> accordance with c99: C99 permits: #define NULL 0 but POSIX does not. POSIX _requires_ #define NULL ((void*)0) or the equivalent, so that NULL is properly typed as a pointer to void in ALL cases (rather than the weaker C99 solution of letting the integer zero constant leak), in part _because_ of the commonality of passing NULL through varargs functions. >> >> In practice, this means that if NULL is defined as integer and we have >> 64 bit architecture, then here as the last argument - 4 bytes...

...sponsive too, what has science done?!?!. In the past threads I dug up, it seems that people were using wimpier hardware or gzip-9 and running into this. I ran into it with very capable hardware. I do not get this behavior using the default lzjb compression, and I was able to also produce it using weaker gzip-3 compression. Is there a fix for this I am not aware of? Workaround? Etc? gzip compression works wonderfully with the uncompressed smallers 1-4g files I am trying. It would be a shame to use the weaker default compression because of this test case.

...e chisq.test, i.e. put confidence intervals on each proportion. I thought about doing the arcsine transformation on the proportions and then I can use the binomial distribution to get the variance and hence 95% confidence interval (then back transformation). Clearly confidence in latter points is weaker (fewer observations), but I can't seem to find a plot to capture this fact.

Hi, I am trying to model a dataset with the response variable Y, which has 6 levels { Great, Greater, Greatest, Weak, Weaker, Weakest}, and predictor variables X, with continuous and factor variables using random forests in R. The variable Y acts like an ordinal variable, but I recoded it as factor variable. I ran a simulation and got OOB estimate of error rate 60%. I validated against some external datasets and got abo...

After playing around with the dlls/wined3d/directx.c file to update the driver version numbers used for nvidia drivers i noticed that 8800 ultra was missing and likely being recognized as the much weaker 8800, I didn't know where to go for this so I'm posting it here, if you could add these two lines it should cover the 8800 Ultra since its essentially the GTX with slightly faster clock speeds. @ line 1072 {HW_VENDOR_NVIDIA, CARD_NVIDIA_GEFORCE_8800GTX, "NVIDIA GeForce 880...

...they've spent quite some time on the subject and have the cipher routines both debugged and optimized. I know that some of the current cipher code was taken from SSLeay but since OpenSSL is de facto SSLeay successor, it might give tinc more flexibility and allow the user to choose between weaker/faster or stronger/slower ecryption schemes. Regards, Lubomir --- TINC development list, tinc-devel@nl.linux.org Archive: http://mail.nl.linux.org/tinc-devel/

...ily modify it to make it simpler and more conservative. Sounds good! I'd like to see the code, even though I can't promise that I'll do anything with it in the near term. I'd rather not depend on DSA in particular. If it could depend on AliasAnalysis then it would grow stronger or weaker depending on what aliasing analysis was loaded at the time. Are there any special features of DSA that you're using? Nick Lewycky

...* Residuals 22 386.30 17.56 --- Based on this, I should not remove either of the interaction terms, so I turned my attention to the main factors. Based on p-values, I removed HeightInitial and used a call to anova(model1,model2) to see if this resulted in a weaker model. Here is the output: Model 1: HeightFinal ~ Treatment + HeightInitial + DiameterInitial + Frost + HeightInitial:Frost + DiameterInitial:Frost Model 2: AbsoluteDiameterDiff ~ Treatment + DiameterInitial + Frost + HeightInitial:Frost + DiameterInitial:Frost Res.Df RSS Df Sum of Sq F Pr(...

...eld and crash if it isn't there. But do they have to be distinct? They have different fields (as you say, declaration DISubprograms don't have a "unit:" field, definition DISubprograms do have a unit: field that refers to a (itself distinct) DICompileUnit) > We actually had a weaker form of the check I added to Verifier already in place (https://github.com/llvm/llvm-project/blob/51cad041e0cb26597c7ccc0fbfaa349b8fffbcda/llvm/lib/IR/Verifier.cpp#L1186), but it didn't cover the specific testcase I added in https://reviews.llvm.org/rGe17f52d623cc146b7d9bf5a2e02965043508b4c4. &...