Mail Archives: djgpp/1997/08/16/00:34:23
From: | "Badman" <badman AT velocity DOT net>
|
Newsgroups: | comp.os.msdos.djgpp
|
Subject: | Newbie Question: Speed of indirection lookups
|
Date: | Fri, 15 Aug 1997 21:59:58 -0700
|
Organization: | Velocity.Net
|
Lines: | 16
|
Message-ID: | <5t31i0$961@news.velocity.net>
|
NNTP-Posting-Host: | 208.206.147.146
|
To: | djgpp AT delorie DOT com
|
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp
|
I have a question, I got an array of stuctures, which happen to cotain
arrays of structures which happen to contain pointers to values. I've got
several mult's with these, and was wondering if is was faster to cache
these within my procedure or just use stuct[x].struct2[y]->z .
Also, how smart, or how does the optimization option work? Is there a
limit, I useually use -O3, but I thought I saw somewhere somebody using
-O9.
Any help is appreciated.
-- Badman
http://www.velocity.net/~badman
badman AT velocity DOT net
- Raw text -