search for: 48294

Displaying 6 results from an estimated 6 matches for "48294".

Did you mean: 4294
2009 Apr 19
1
Stack trace dor gssapi-with-mic
...:05 570425 /var/run/nscd/passwd 2b044ea86000-2b044ea88000 r-xp 00000000 08:05 33878 /lib64/libutil-2.4.so 2b044ea88000-2b044eb87000 ---p 00002000 08:05 33878 /lib64/libutil-2.4.so 2b044eb87000-2b044eb89000 rw-p 00001000 08:05 33878 /lib64/libutil-2.4.so 2b044eb89000-2b044eb9d000 r-xp 00000000 08:05 48294 /lib64/libz.so.1.2.3 2b044eb9d000-2b044ec9c000 ---p 00014000 08:05 48294 /lib64/libz.so.1.2.3 2b044ec9c000-2b044ec9d000 rw-p 00013000 08:05 48294 /lib64/libz.so.1.2.3 2b044ec9d000-2b044ecb0000 r-xp 00000000 08:05 33855 /lib64/libnsl-2.4.so 2b044ecb0000-2b044edaf000 ---p 00013000 08:05 33855 /lib64/...
2009 Apr 07
1
typo in R-ints.texi's description of P_ macro
...nd StringP. Expanding the S and P to Singular and Plural, would be more descriptive. Bill Dunlap TIBCO Software Inc - Spotfire Division wdunlap tibco.com Index: doc/manual/R-ints.texi =================================================================== --- doc/manual/R-ints.texi (revision 48294) +++ doc/manual/R-ints.texi (working copy) @@ -2149,17 +2149,18 @@ @noindent from @file{src/main/errors.c}. -A macro +The @code{P_} macro @example #ifdef ENABLE_NLS #define P_(StringS, StringP, N) ngettext (StringS, StringP, N) #else -#define P_(String, StringP, N) (N > 1 ? StringP:...
2013 Aug 06
1
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
...ode into loops - you would instead want to sink it below code that guards the loop, but not actually into the loop. Here is one paper I am aware of that appears to have an SSA-based formulation of PDE. I have not read this as it is behind a paywall: http://rd.springer.com/chapter/10.1007%2F3-540-48294-6_12 Mark
2013 Aug 06
0
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
...stead > want to sink it below code that guards the loop, but not actually into the > loop. > > Here is one paper I am aware of that appears to have an SSA-based > formulation of PDE. I have not read this as it is behind a paywall: > http://rd.springer.com/chapter/10.1007%2F3-540-48294-6_12 > > Mark > > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130806/844869f2/attachment.html>
2013 Aug 06
3
[LLVMdev] Potential SimplifyCFG optimization; hammock to diamond transformation
All, I have some code that looks like the following: { double a, b, c; for (...) { ... a = lots of FP math; b = lots of FP math; c = lots of FP math; if (cond) { a = 0.0; b = 0.1; c = 0.2; } ... } } Could we not convert the hammock into a diamond and move the initial computation of a, b, and c into the else block. Something like this: {
2000 Oct 27
0
Testing Please Ignore
For my procmail ruleset... Dale -- /^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^V^^\ Dale Lovelace Red Hat, Inc. dale@redhat.com This week only, all our fiber-fill jackets are marked down!