Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!stanford.edu!agate!darkstar!fuzzy!root
From: root@fuzzy (Dr. Michael M. Cohen)
Newsgroups: comp.sys.sgi
Subject: n3f v3f timing
Message-ID: <15146@darkstar.ucsc.edu>
Date: 29 Apr 91 09:15:56 GMT
Sender: usenet@darkstar.ucsc.edu
Reply-To: mmcohen@fuzzy (Dr. Michael M. Cohen)
Organization: Univ. of Calif. - Santa Cruz, Program in Exp. Psychology
Lines: 15

Query on the temporal characteristics of the n3f v3f calls:
Do these return to the main program only after transfer is
complete or are they asynchronous in the sense that they just start
transfer and next call will wait if the hardware is not ready?
My situation is that for about 1k polygons, it's taking about
10 msec to compute the normals followed by about 10 msec to
send the polygons. If the vertex sending calls are asynchronous
perhaps I can interleave the normal calculations with the
n3f v3f calls to do the job in less than the 10+10 msec it's now
taking... If anyone has assembly language routines for computing
polygon and vertex normals more efficiently than what the c
compiler can produce, I'd be real interested in taking a look!

TIA for any answers/pointers, MMCohen
[system is 4D310VGX-FX 3.3.2 16mb]