On Wed, Feb 27, 2002 at 09:25:41AM -0800, Peter Jay Salzman wrote:
>-funroll-loops
> Perform the optimization of loop unrolling. This
> is only done for loops whose number of iterations
> can be determined at compile time or run time.
/* co
The code I gave you was just an example. Try using ncftp manually first,
write down what commands you actually type, and use that in the script.
The actual commands vary slightly from server to server.
(and the script wasn't tested - I don't have any servers I'm in need of
archiving.)
-Mark
On
IIS Servers on NT systems, which have an ftp component have the ability
to have DOS style or UNIX style directory listings. You might want to
make sure that the UNIX style directory structure is set that way. It
has been a while since I played with ftp, but I am fairly sure I
remember using ncft
On Wed, 27 Feb 2002, Jay Strauss wrote:
> The lugod site looks (and works) nicely. What technologies are you using?
> That is, how and who did your graphics. Do you use some sort of a web
> templating system, lugod has a similar look to other open source sites. Is
> the mailing list major domo?
Thanks Mark. I just tried this but there is no response from ncftp after the
mget. It seems like since my ftp server is a Windows NT machine which does
not have a directory listing similar to unix (eg. The first char in the
listing is NOT 'd' for a directory like in unix), these tools may not work
On Wed, Feb 27, 2002 at 10:22:47PM -0600, Jay Strauss wrote:
> Pete et al,
>
> The lugod site looks (and works) nicely.
Thanks! :)
> What technologies are you using?
> That is, how and who did your graphics.
Marianne Waage using Photoshop and me using The Gimp.
> Do you use some sort of a
I think you can do it with ncftp and some scripting. Normally, you can
use ncftp like a normal ftp, but you can also pass a recursive option (ie:
`mget -r *`). You can write a script and pass appropriate commands, kind
of like this:
#!/bin/sh
ncftp -u <
bin
mget -r /
quit
EO
Pete et al,
The lugod site looks (and works) nicely. What technologies are you using?
That is, how and who did your graphics. Do you use some sort of a web
templating system, lugod has a similar look to other open source sites. Is
the mailing list major domo? What do you use to archive and se
Hi,
I have a linux machine to which i would like to mirror a private ftp site on
a nightly basis. A windows NT machine is serving as the ftp server. I tried
tools like wget and rftp from my linux box to allow recursive ftp's from the
windows NT machine, to occur automatically. rftp works only if t
On Wed, Feb 27, 2002 at 10:03:22AM -0800, ME wrote:
> $ gcc gcc -funroll-all-loops -S sample.c
>
> When I inspect the above, I see loops included.
> -12(%ebp) (3 32-bit offset from %ebp) is set to 5 and -4(%ebp) is incl
> until it is cmpl to be no longer less than -12(%ebp).
>
> Labels even sho
On Wed, Feb 27, 2002 at 09:46:29AM -0800, Peter Jay Salzman wrote:
...
> the reason why i'm asking is that this is completely deterministic, and
> a compiler can know, with certainty, that this loop will iterate over 0
> and 1. that is, you can know this at compile time, before executing any
> co
With:
--
#include
#define N 5
const int NN = 5;
int main()
{
int i = 0;
int m = 0;
int n = 5;
for (i=0 ; i < n ; i=i+1)
m=0;
for (i=0 ; i You can compile with -S and then look at the assembler output file.
>
> -- Rod
>http://www.sunsetsystems.com/
>
You can compile with -S and then look at the assembler output file.
-- Rod
http://www.sunsetsystems.com/
On Wednesday 27 February 2002 09:31, Peter Jay Salzman wrote:
> another optimization question:
>
>int n = 5;
>for (i=0; i
> can gcc unroll this loop the way it can (for instance)
>
begin Gabriel Rosa <[EMAIL PROTECTED]>
> On Wed, 27 Feb 2002, Peter Jay Salzman wrote:
>
> > another optimization question:
> >
> >int n = 5;
> >for (i=0; i >
> > can gcc unroll this loop the way it can (for instance)
> >
> >#define N 5
> >for (i=0; i
> Refer to previous answer.
On Wed, 27 Feb 2002, Gabriel Rosa wrote:
> On Wed, 27 Feb 2002, Peter Jay Salzman wrote:
>
> > another optimization question:
> >
> >int n = 5;
> >for (i=0; i >
> > can gcc unroll this loop the way it can (for instance)
> >
> >#define N 5
> >for (i=0; i
> Refer to previous answer.
On Wed, 27 Feb 2002, Peter Jay Salzman wrote:
> another optimization question:
>
>int n = 5;
>for (i=0; i
> can gcc unroll this loop the way it can (for instance)
>
>#define N 5
>for (i=0; i if it can't, what about
>
>const int n = 5;
> for (i=0; i
const int still gets
I think -funroll-all-loops adds run-time loop unrolling, which may or may
not speed up code execution. At least, that's what I've always deciphered it
to be.
However, I am not an expert :)
-Gabe
On Wed, 27 Feb 2002, Peter Jay Salzman wrote:
> hi everyone,
>
>-funroll-loops
>
another optimization question:
int n = 5;
for (i=0; ihttp://lists.lugod.org/mailman/listinfo/vox-tech
hi everyone,
-funroll-loops
Perform the optimization of loop unrolling. This
is only done for loops whose number of iterations
can be determined at compile time or run time.
-funroll-all-loops
Perform the optimization of
19 matches
Mail list logo
