Article View: comp.os.os2.programmer
Article #3181Dos calls efficiency
From: Christophe Wolfhugel
Date: Thu, 06 Jun 1991 17:11
Date: Thu, 06 Jun 1991 17:11
20 lines
1323 bytes
1323 bytes
When the same memory segment is given more than once to the same pid,
is there a counter incremented so that as many DosFreeSeg are
necessary as there were DosGiveSeg?
Are DosGiveSeg/DosGetSeg/DosFreeSeg as much time consuming on the
first operation for a given {selector,pid} or is it much faster after
(just the cycles to increment the counters, if any?).
In my portion of code, there are 3 sequential DosGiveSeg to a given
pid, and in 99% of the cases it's the same segment that is given (but
in the 1% I really have 3 different selectors). Do I have interest in
testing if all 3 GiveSeg (and their respective Get/Free) should be
executed or is it OK to call the Dos Calls each time?
Regards,
--
Christophe Wolfhugel | Email: wolf@grasp1.univ-lyon1.fr
INSA - Dpt Informatique | "Le progres ne vaut que s'il est partage par tous,"
Lyon, France | "les greves aussi. Hassan Cehef: c'est penible!"
Technical Details
Message-ID:
<1991Jun06.171103.29038@grasp1.univ-lyon1.fr>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!math.fu-berlin.de!grasp1!wolfShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!math.fu-berlin.de!grasp1!wolf From: wolf@grasp1.univ-lyon1.fr (Christophe Wolfhugel) Newsgroups: comp.os.os2.programmer Subject: Dos calls efficiency Message-ID: <1991Jun06.171103.29038@grasp1.univ-lyon1.fr> Date: 6 Jun 91 17:11:03 GMT Organization: INSA Departement Informatique, Lyon, France Lines: 20