search for: fpcc

...a > feature of g++. This is C++ land, so there is no "platform ABI", although static methods usually follow C calling convention. I've checked that wrapping the class definition with extern "C" changes nothing, so maybe it is following the platform ABI, after all. BTW, -fpcc-struct-return solves the case that motivated this thread. >> But my compiler knows nothing about Foo, so I >> must disable this "feature" of g++. Suggestions welcome. > > It is not possible to correctly codegen parameter passing/result returning > without knowing t...

Óscar Fuentes <ofv at wanadoo.es> writes: > BTW, -fpcc-struct-return solves the case that motivated this thread. -fpcc-struct-return is an ABI change, hence it requires "compiling the world". Not acceptable. I'll be interested on hearing ideas about how to determine how a function returns a small struct, without knowing the internals of...

Take a look at llvm-gcc. Look for HandleAggregateShadowArgument. Evan On Mar 26, 2008, at 10:31 AM, Óscar Fuentes wrote: > Óscar Fuentes <ofv at wanadoo.es> writes: > >> BTW, -fpcc-struct-return solves the case that motivated this thread. > > -fpcc-struct-return is an ABI change, hence it requires "compiling the > world". Not acceptable. > > I'll be interested on hearing ideas about how to determine how a > function returns a small struct, with...

I'm trying to manipulate/change a formula prior to passing it to another function. A simplified example: User passes formula to my function: y~x My function does: lm(transform(y)~x) Here, transform() is added to the model's response. What is the best way to accomplish this?

Hi Duncan. Duncan Sands <baldrick at free.fr> writes: >> define internal i1 @Addr_045442A0() { >> alloca [8 x i8], align 4 ; <[8 x i8]*>:1 [#uses=2] >> alloca i1, align 4 ; <i1*>:2 [#uses=2] >> tail call void @F95478DA5_FFI_FN( [8 x i8]* %1 sret ) > > this call uses the "struct-return" convention (due to the sret attribute). > On

...resses (192.168.x.1) - could that be confusing the kernel? If so, do I need to get public IP addresses for those modems? Do I HAVE to create a patched kernel (ala Anastasov)? May I post the script I used to try this out? Thanks, folks! Calvin Dodge Certified Linux Bigot (tm) http://www.caldodge.fpcc.net _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/

On Mar 26, 2008, at 1:31 PM, Óscar Fuentes wrote: > Óscar Fuentes <ofv at wanadoo.es> writes: > >> BTW, -fpcc-struct-return solves the case that motivated this thread. > > -fpcc-struct-return is an ABI change, hence it requires "compiling the > world". Not acceptable. > > I'll be interested on hearing ideas about how to determine how a > function returns a small struct, with...

Hi Óscar, > >> define internal i1 @Addr_045442A0() { > >> alloca [8 x i8], align 4 ; <[8 x i8]*>:1 [#uses=2] > >> alloca i1, align 4 ; <i1*>:2 [#uses=2] > >> tail call void @F95478DA5_FFI_FN( [8 x i8]* %1 sret ) > > > > this call uses the "struct-return" convention (due to the sret attribute). > > On x86 this means

...intervening ops will be NaN-preserving. You can't store the results back to memory without a check, but the technique avoids a check in the fp pipeline that can be serializing on intermediate expression results. The catch is that you can't use that technique unless you can ensure that the FPcc isn't clobbered by something else in the middle, which seems to suggest that you want to track the FP condition code as a register. And then there are machines with multiple condition codes, and machines the simply put the condition codes into a scalar register. These seem to suggest that firs...

Has anyone succeeded in compiling R-1.1.0 on a Digital (Compaq) Alpha running OSF4.0F (or E)? Everything seems to compile OK (except the frequent "Warning: Unresolved:" at link time - this threw me off the scent for a while!), but then at run time I get: Fatal error: The X11 shared library could not be loaded. The error was dlopen: cannot load

I'd trying to subclass the "lm" class to produce a "mylm" class whose instances behave like lm objects (are accepted by methods like summary.lm) but have additional data or slots of my own design. For starters: setClass("mylm", "lm") produces the somewhat cryptic: Warning message: Old-style (``S3'') class "mylm" supplied as a

I'm interfacing to C code that uses 1-based indexing on arrays -- it ignores the zeroth element. Thus, input vectors from R must be moved up one, and output arrays must be moved down one. What is the best way to deal with this using R internal code? My current approach is: For an input R vector of length n, allocate a new vector(v) of length n+1 and copy input into v[1] to v[1+n]. Call

Hello, Oscar > This is C++ land, so there is no "platform ABI", Well, here is g++ ABI :) > following the platform ABI, after all. > > BTW, -fpcc-struct-return solves the case that motivated this thread. Usually, special rules are applied for returning struct, if its size is small enough. So you can definitely find something small returned via registers. This is frontend job to select how to pass such object. -- With best regards, Anton Ko...

Is there an easy way to do a linear model with an a priori known slope? In essence, I want to minimize the residuals around a line of known slope. -R -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the

Hi Shap, > > 4. Do arithmetic in a type with one more bit. For example, suppose you > > want to know if an i32 add "x+y" will overflow. Extend x and y to 33 > > bit integers, and do an i33 add. Inspect the upper bit to see if it > > overflowed. Truncate to 32 bits to get the result. Probably codegen > > can be taught to implement this as a 32 bit add +

On Wed, 2008-03-26 at 15:07 +0100, Duncan Sands wrote: > 4. Do arithmetic in a type with one more bit. For example, suppose you > want to know if an i32 add "x+y" will overflow. Extend x and y to 33 > bit integers, and do an i33 add. Inspect the upper bit to see if it > overflowed. Truncate to 32 bits to get the result. Probably codegen > can be taught to implement

I am yet another person who is having a problem with Win98 clients needing to make several attempts before successfully logging in to our Samba box. I get the "broken pipe" message in the smb.log just like everyone else. This did not seem to be a problem until we got a phat broadband connection. All the Windows boxes are set to point to our ISP's DNS. I am not running DNS on the

The R interface to the GNU Linear Programming Kit (GLPK) is now available on CRAN. The R interface functions are almost identical to the native GLPK C API making it easy to move code and concepts between R and C. The GLPK package is intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP), and other related problems. The GLPK library includes the

Hello. I'd like to produce a simple pairs-like plot with two data frames - but not a traditional scatter-plot matrix - just multiple bivariate plots of data.frame1[i] vs data.frame2[i] ... In other words, given data frames X and Y, I'd like multiple plots on a page like: Y1 Y2 Y3 X1 X2 X3 Thanks in advance. -R

Has anyone coded a rref() in R/S? rref() is MatLab's routine for producing a Row-Reduced Echelon Form of a matrix. -R -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !)