TweetFollow Us on Twitter

Sep 95 Challenge
Volume Number:11
Issue Number:9
Column Tag:Programmer’s Challenge

Programmer’s Challenge

By Bob Boonstra, Westford, Massachusetts

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

Reversible Scrambling Algorithm

According to tradition, September is Assembly Language Challenge month here at MacTech, and we continue that tradition this month. Your challenge is to do some simple arithmetic - raising a number to a power, and taking the remainder of the result modulo another number. Simple, right? To make things interesting, though, the numbers are going to be a little larger than you are used to dealing with. Hundreds of decimal digits long, in fact. “Why,” you may ask? We’ll get into that in a minute, but there are a couple of hints in the title of this month’s challenge.

The data structure to be used for the large numbers in this Challenge, and the prototype for the code you should write are:

typedef struct BigNum {
 short numDig;   /* the number of bytes in the BigNum */
 unsigned char *dig; /* dig[0] is the most significant byte */
    /* dig[numDig-1] is least significant */
} BigNum;

void PowerAndRemainder( 
 BigNum *msg,    
 BigNum *exp,    /* calculate msg to the exp power, */
 BigNum *n, /* take the remainder modulo n */
 BigNum *res/* and store the result in res */
);

For example, the value 1048573 (0xFFFFD) would be provided to you in a BigNum b with the values b.numDig=3, b.dig[0] = 0x0F, b.dig[1]=0xFF, and b.dig[2]=0xFD. The first three arguments will be provided as input when PowerAndRemainder is called; you are to generate both elements of the BigNum struct for the res argument. The storage for all of the BigNums in the call to PowerAndRemainder will be allocated by the caller. All BigNums will be positive integers, and none of the BigNums will be larger than 128 bytes in length (i.e., b.numDig will be no larger than 128). There is no restriction on the amount of memory you may use (within reason).

Those of you with some number theory in your background may recognize what a function like this might be used for. If the modulus n is the product of two large primes p and q, one can find values e and d for the exponent with the property that they are inverses of one another, but that neither can be easily derived from the other, provided prime numbers p and q are not divulged. If you calculate PowerAndRemainder(msg,e,n,c), and I then calculate PowerAndRemainder(c,d,n,x), then the result x turns out to be identical to the original value msg if e and d are relatively prime to (p-1)*(q-1). Now what do you suppose such a function might be useful for?

Your solution may use any combination of ANSI C and/or 68K assembly language, along with your choice of either the THINK C or MetroWerks C 68K compilers. I considered making this a PowerPC challenge, but I wasn’t confident that enough people are proficient with PPC assembly just yet - perhaps next September. In the meantime, you can look forward to a native PPC challenge next month.

If you are interested in some sample values to test your code, send me email and I’ll provide some.

Challenge Deadline

Several people wrote to point out that the deadline for submitting Challenge solutions was missing from the Rules box during July and August. Unfortunately, when the rules were revised to accommodate multiple compilers and target instruction sets, the deadline was inadvertently omitted. The Challenge deadline remains the 10th of the month printed on the cover of the magazine. I received several submissions for the Chess challenge after the deadline (and after the article was submitted for publication). Because of the problem with the deadline, I would have awarded points to any fast and correct entries, but all of the late entries had problems with correctness so no additional points were awarded.

Two Months Ago Winner

Of the nine entries to the Sprite Blitz challenge, seven of them worked correctly. Congratulations to Xan Gregg (Durham, NC) for having the fastest solution, some 30% faster than the second place entry, submitted by John Nevard. Despite the variation in run time performance, there were a number of clever and creative solutions among the top entries.

Here are the times and code sizes for the entries that worked correctly. Numbers in parens after a person’s name indicate that person’s cumulative point total for all previous Challenges, not including this one.

Name time (68K)

Xan Gregg (31) 908

John Nevard 1300

Bill Karsh (71) 3363

Jim Bumgardner (4) 3495

Jeremy Vineyard (40) 5789

Norman Basham 10164

Steve Israelson 75846

Like most of the top entries, Xan composed his screen updates offscreen. Xan uses one offscreen GWorld to hold the background and another to prepare the next animation frame. One clever trick is that the offscreen image is large enough to contain all of a sprite that overlaps a window boundary, so that clipping need only be done when updating the window. Drawing is done directly to the screen, taking advantage of alignment conditions guaranteed to hold by the problem statement. Xan does all of his copying to the screen using unrolled loops, avoiding the overhead incurred when using CopyBits or CopyMask for small copies. When reading the code, take note of the switch statement in the COPY4 macro that copies the icon based on the value of the mask, and of the longword copies in the FastCopyChunk routine.

Bill Karsh pointed out in his entry that the relative performance of CopyBits and CopyMask varies between his 68K machine and his PPC 7100, with CopyBits being faster on the former machine and CopyMask being faster on the latter. I didn’t have time to measure native performance on the PowerPC, but there was a 15% difference between the two versions in my 68K tests. Of course, as Xan’s solution shows, avoiding both can have its advantages also.

Does Performance Matter?

I’ve received some email suggesting that the emphasis on performance in this column ought to be replaced by emphases on other things, like code portability, readability, reliability, encapsulation, or object orientation. The argument is that improvements in hardware performance make efficiency less important than it has been in the past. This is certainly a valid point of view, and there is no question that processor improvements have enabled us to sacrifice some machine cycles to achieve objectives other than performance. However, I contend that the performance of several popular personal computer applications demonstrates that software developers are capable of adding enough functionality (or generating poor enough code) to degrade performance to an unacceptable level, despite hardware advances. In my opinion, this will always be so. Certainly the techniques demonstrated in this column should not be used in all software, but they have their place in time-critical areas, and it is worth devoting more attention to efficiency than we typically do. Besides, squeezing instructions out of code is great fun! But if you are interested in seeing a column that focuses on something besides efficiency, drop me a note.

Top 20 Contestants of All Time

Here are the Top 20 Contestants for the Programmer’s Challenges to date. The numbers below include points awarded for this month’s entrants. (Note: ties are listed alphabetically by last name - there are more than 20 people listed this month because of ties.)

1. [Name deleted] 176

2. Karsh, Bill 78

3. Munter, Ernst 70

4. Stenger, Allen 65

5. Larsson, Gustav 60

6. Gregg, Xan 51

7. Riha, Stepan 51

8. Goebel, James 49

9. Nepsund, Ronald 47

10. Cutts, Kevin 46

11. Mallett, Jeff 44

12. Kasparian, Raffi 42

13. Vineyard, Jeremy 42

14. Darrah, Dave 31

15. Landry, Larry 29

16. Elwertowski, Tom 24

17. Lee, Johnny 22

18. Noll, Robert 22

19. Anderson, Troy 20

20. Beith, Gary 20

21. Burgoyne, Nick 20

22. Galway, Will 20

23. Israelson, Steve 20

24. Landweber, Greg 20

25. Pinkerton, Tom 20

There are three ways to earn points: (1) scoring in the top 5 of any Challenge, (2) being the first person to find a bug in a published winning solution or, (3) being the first person to suggest a Challenge that I use. The points you can win are:

1st place 20 points

2nd place 10 points

3rd place 7 points

4th place 4 points

5th place 2 points

finding bug 2 points

suggesting Challenge 2 points

Here is Xan’s winning solution:

Sprite Blitz

Xan Gregg, July 1995
/*       
Since “correctness” is considered before speed in judging solutions, this solution makes correctness the 
top priority at the cost of speed.

I use two offscreen GWorlds.  One has the background, and another has the image to be displayed on the 
screen next.  The “on deck” image is updated sprite by sprite, then it is copied to the screen for minimum 
flicker.

The GWorlds are a little bigger than the screen so I don’t have to worry about sprites that overlap the edges 
until copying to the screen.

Memory usage:
    2 GWorlds, each 64 pixels wider and taller than window.
    1K of pixel data for each sprite.
    128 bytes of mask data for each sprite.
    16 bytes of info for each sprite.
I set the number of sprites to 400.  The problem states a maximum of 200 present at a time, but because 
a deleted sprite stays around until the next UpdateScreen() call,
I allow for 400 in case you delete all 200 then add 200 more before calling UpdateScreen().  Paranoid, but 
if you’ve got the memory...

Assumptions not stated in the problem:
    Enough memory available for above usage.
    Window width is a multiple of 4 (confirmed by BB).
    Window does not move during play.

*/

#include <QDOffscreen.h>

typedef struct
 {
 short  nextSlot;
 short  status;
 short  width;
 short  height;
 Point  position;
 Point  lastPosition;
 } SpriteInfo, *SpriteInfoPtr;

typedef struct
 {
 char pixData[1024];
 } SpritePixData, *SpritePixDataPtr;

typedef struct
 {
 char maskData[128];
 } SpriteMaskData, *SpriteMaskDataPtr;


#define kMaxSprites400L
#define kMaxSpriteWidth   32L
#define kMaxSpriteHeight  32L

static CWindowPtrgScreenWindowP;
static GWorldPtr gBackgroundGW;
static PixMapHandlegBackgroundPixMapH;
static GWorldPtr gOnDeckGW;
static PixMapHandlegOnDeckPixMapH;
static shortgLastSpriteSlot;
static shortgFirstSpriteSlot;
static shortgSpriteCount;
static shortgWindowWidth;
static shortgWindowHeight;
static SpriteInfoPtr gSpriteInfo;
static SpritePixDataPtr gSpritePixData;
static SpriteMaskDataPtr gSpriteMaskData;
static long gOnDeckRowBytes;
static PtrgOnDeckBaseAddr;
static long gBkgRowBytes;
static PtrgBkgBaseAddr;
static long gScreenRowBytes;
static PtrgScreenBaseAddr;
static Ptr*gBkgRowAddr;
static Ptr*gOnDeckRowAddr;
static Ptr*gScreenRowAddr;
static shortgDeletionCount;

StartGame
void StartGame(CWindowPtr windowP)
{
 Rect   r;
 PixMapPtrbkgPixMapP;
 PixMapPtronDeckPixMapP;
 PixMapPtrscreenPixMapP;
 
 gLastSpriteSlot = -1;
 gFirstSpriteSlot = -1;
 gSpriteCount = 0;
 gDeletionCount = 0;
 gScreenWindowP = windowP;
 r = windowP->portRect;
 OffsetRect(&r, -r.left, -r.top);
 gWindowWidth = r.right;
 gWindowHeight = r.bottom;

 InsetRect(&r, -kMaxSpriteWidth, -kMaxSpriteHeight);
 NewGWorld(&gBackgroundGW, 0, &r, 0, 0, 0);
 gBackgroundPixMapH = GetGWorldPixMap(gBackgroundGW);
 LockPixels(gBackgroundPixMapH); /* always locked */
 NewGWorld(&gOnDeckGW, 0, &r, 0, 0, 0);
 gOnDeckPixMapH = GetGWorldPixMap(gOnDeckGW);
 LockPixels(gOnDeckPixMapH);/* always locked */
 
 gSpriteInfo = (SpriteInfoPtr) NewPtrClear
 (sizeof(SpriteInfo) * kMaxSprites);
 gSpritePixData = (SpritePixDataPtr) NewPtrClear
 (sizeof(SpritePixData) * kMaxSprites);
 gSpriteMaskData = (SpriteMaskDataPtr) NewPtrClear
 (sizeof(SpriteMaskData) * kMaxSprites);
 gBkgRowAddr = (Ptr *) NewPtr(sizeof(Ptr) *
 (gWindowHeight + kMaxSpriteHeight * 2));
 gOnDeckRowAddr = (Ptr *) NewPtr(sizeof(Ptr) *
 (gWindowHeight + kMaxSpriteHeight * 2));
 gScreenRowAddr = (Ptr *) NewPtr(sizeof(Ptr)
 * (long) gWindowHeight);
 if (gSpriteInfo == 0 || gSpritePixData == 0
 || gSpriteMaskData == 0 || gScreenRowAddr == 0
 || gBkgRowAddr == 0 || gOnDeckRowAddr == 0
 || gBackgroundGW == 0 || gOnDeckGW == 0)
 DebugStr("\p out of memory!");
 InsetRect(&r, kMaxSpriteWidth, kMaxSpriteHeight);
 OffsetRect(&r, kMaxSpriteWidth, kMaxSpriteHeight);
 CopyBits(&((WindowPtr)windowP)->portBits,
 &((WindowPtr)gBackgroundGW)->portBits,
 &windowP->portRect, &r, srcCopy, NULL);
 CopyBits(&((WindowPtr)windowP)->portBits,
 &((WindowPtr)gOnDeckGW)->portBits,
 &windowP->portRect, &r, srcCopy, NULL);
 
 bkgPixMapP = *gBackgroundPixMapH;
 onDeckPixMapP = *gOnDeckPixMapH;
 gOnDeckRowBytes = onDeckPixMapP->rowBytes & 0x7fff;
 gOnDeckBaseAddr = onDeckPixMapP->baseAddr
 + gOnDeckRowBytes * kMaxSpriteHeight
 + kMaxSpriteWidth;
 gBkgRowBytes = bkgPixMapP->rowBytes & 0x7fff;
 gBkgBaseAddr = bkgPixMapP->baseAddr
 + gBkgRowBytes * kMaxSpriteHeight
 + kMaxSpriteWidth;
 screenPixMapP = *gScreenWindowP->portPixMap;
 gScreenRowBytes = screenPixMapP->rowBytes & 0x7fff;
 gScreenBaseAddr = screenPixMapP->baseAddr
 - screenPixMapP->bounds.left
 - screenPixMapP->bounds.top
  * gScreenRowBytes;
 
 { /* initialize rowAddr’s */
 long row;
 
 gOnDeckRowAddr += kMaxSpriteHeight;
 gBkgRowAddr += kMaxSpriteHeight;
 for (row = -kMaxSpriteHeight;
 row < gWindowHeight + kMaxSpriteHeight; row++)
  {
 gBkgRowAddr[row] = gBkgBaseAddr
 + row * gBkgRowBytes;
 gOnDeckRowAddr[row] = gOnDeckBaseAddr
 + row * gOnDeckRowBytes;
  }
 for (row = 0; row < gWindowHeight; row++)
 gScreenRowAddr[row] = gScreenBaseAddr
 + row * gScreenRowBytes;
 }
}

AddSprite
/* make a copy of CIcon’s pixel and mask data */
short AddSprite(CIconPtr cIconP, Point startPt)
{
 short  slot;
 short  i;
 short  pixWidth;
 short  maskWidth;
 short  pixBytes;
 short  maskBytes;
 short  bitBytes;
 short  height;
 Ptr    pixSrcAddr, pixDstAddr;
 long   *maskSrcAddr, *maskDstAddr;
 
 slot = gLastSpriteSlot + 1;
 if (slot == kMaxSprites)
 slot = 0;
 while (gSpriteInfo[slot].status != 0)
  {
 slot++;
 if (slot == kMaxSprites)
 slot = 0;
  }
 gSpriteInfo[slot].status = 1;/* occupied */
 height = cIconP->iconPMap.bounds.bottom
 - cIconP->iconPMap.bounds.top;
 pixWidth = cIconP->iconPMap.bounds.right
 - cIconP->iconPMap.bounds.left;
 maskWidth = (pixWidth + 7) >> 3;
 gSpriteInfo[slot].width = pixWidth;
 gSpriteInfo[slot].height = height;
 pixBytes = cIconP->iconPMap.rowBytes & 0x7fff;
 maskBytes = cIconP->iconMask.rowBytes;
 bitBytes = cIconP->iconBMap.rowBytes;
 pixSrcAddr = ((Ptr) &cIconP->iconMaskData)
 + bitBytes * height
 + maskBytes * height
 + 256 * 8 + 8;  /* 8-bit color table */

 pixDstAddr = (char *) &gSpritePixData[slot];
 maskSrcAddr = (long *) &cIconP->iconMaskData;
 maskDstAddr = (long *) &gSpriteMaskData[slot];
 pixWidth = pixWidth >> 2;
 for (i = 0; i < height; i++)
  {
 {
 register long *q = (long *) pixDstAddr;
 register long *p = (long *) pixSrcAddr;
 register short  j = pixWidth;
 while (j > 0)
  {
 *q++ = *p++;
 j--;
  }
 }
 *maskDstAddr++ = *maskSrcAddr;
 pixDstAddr += 32;
 pixSrcAddr += pixBytes;
 maskSrcAddr = (long *) (((Ptr) maskSrcAddr)
 + maskBytes);
  }
 
 if (gLastSpriteSlot >= 0)
  {
 gSpriteInfo[gLastSpriteSlot].nextSlot = slot;
  }
 else
  {
 gFirstSpriteSlot = slot;
  }
 gLastSpriteSlot = slot;
 gSpriteInfo[slot].nextSlot = -1;
 gSpriteInfo[slot].position = startPt;
 gSpriteInfo[slot].lastPosition = startPt;
 gSpriteCount ++;
 return slot;
}

EraseSprite
/* replace sprite with chunk from the bkg gworld */
static void EraseSprite(SpriteInfoPtr spriteInfoP)
{
 short  numRows;
 short  numCols;
 register long *p;
 register long *q;
 short  h, v;
 register long srcRowBytes;
 register long dstRowBytes;
 
 numRows = spriteInfoP->height;
 numCols = spriteInfoP->width;
 h = spriteInfoP->lastPosition.h;
 v = spriteInfoP->lastPosition.v;
 if (h + numCols <= 0 || h >= gWindowWidth
 || v + numRows <= 0 || v >= gWindowHeight)
 return;/* totally offscreen, so skip it */
 
 p = (long *) (gBkgRowAddr[v] + h);
 q = (long *) (gOnDeckRowAddr[v] + h);
 srcRowBytes = gBkgRowBytes - numCols;
 dstRowBytes = gOnDeckRowBytes - numCols;
 if (numCols >= 16)
 if (numCols == 32)
  {
 while (numRows != 0)
  {
 numRows--;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
  }
  }
 else
  {
 while (numRows != 0)
  {
 numRows--;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
  }
  }
 else
  {
 if (numCols < 8)
 while (numRows != 0)
  {
 numRows--;
 *q = *p;
 p = (long *) (((Ptr) p) + gBkgRowBytes);
 q = (long *) (((Ptr) q) + gOnDeckRowBytes);
  }
 else /* erase 4 pixels, even if its smaller */
 while (numRows != 0)
  {
 numRows--;
 *q++ = *p++;
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
  }
  }
}

DeleteSprite

/* Don’t actually do the delete, just mark for deletion -- because we still 
   need to erase it in UpdateScreen()
*/
void DeleteSprite(short spriteID)
{
 gSpriteInfo[spriteID].status = -1;/* to be deleted */
 gDeletionCount++;
}

RemoveDeletedSprites
/* only called when there is at least one deletion */
static void RemoveDeletedSprites(void)
{
 short  prevSlot = -1;
 short  slot = gFirstSpriteSlot;
 short  count = gDeletionCount;
 
 while (1)
  {
 if (gSpriteInfo[slot].status < 0)
  {/* needs to be removed */
 if (prevSlot >= 0)
 gSpriteInfo[prevSlot].nextSlot
  = gSpriteInfo[slot].nextSlot;
 else
 gFirstSpriteSlot
  = gSpriteInfo[slot].nextSlot;
 if (slot == gLastSpriteSlot)
 gLastSpriteSlot = prevSlot;
 gSpriteInfo[slot].status = 0;/* available */
 gSpriteCount--;
 count--;
 if (count == 0)
 break;
  }
 else
  {
 prevSlot = slot;
  }
 slot = gSpriteInfo[slot].nextSlot;
  }
 gDeletionCount = 0;
}

MoveSprite
void MoveSprite(short spriteID, Point deltaPt)
{
 gSpriteInfo[spriteID].position.h += deltaPt.h;
 gSpriteInfo[spriteID].position.v += deltaPt.v;
}

EraseOldSprites
static void EraseOldSprites(void)
{
 short  slot;
 SpriteInfoPtr spriteInfoP;
 
 slot = gFirstSpriteSlot;
 while (slot >= 0)
  {
 spriteInfoP = &gSpriteInfo[slot];
 EraseSprite(spriteInfoP);
 slot = spriteInfoP->nextSlot;
  }
 
}

COPY4
/* copy 4 pixels based on bits of the mask */
#define COPY4(q,p,m) \
switch ((m) & 0x0f)\
 { \
 case 0x0: break;\
 case 0x1: *(q+3) = *(p+3); break; \
 case 0x2: *(q+2) = *(p+2); break; \
 case 0x3: *(short*)(q+2) = *(short*)(p+2); break; \
 case 0x4: *(q+1) = *(p+1); break; \
 case 0x5: *(q+1) = *(p+1); *(q+3) = *(p+3); break;      \
 case 0x6: *(short*)(q+1) = *(short*)(p+1); break; \
 case 0x7: *(q+1) = *(p+1); \
   *(short*)(q+2) = *(short*)(p+2); break;   \
 case 0x8: *(q) = *(p); break;\
 case 0x9: *(q) = *(p); *(q+3) = *(p+3); break;    \
 case 0xA: *(q) = *(p); *(q+2) = *(p+2); break;    \
 case 0xB: *(q) = *(p);   \
   *(short*)(q+2) = *(short*)(p+2); break;   \
 case 0xC: *(short*)(q) = *(short*)(p); break;     \
 case 0xD: *(short*)(q) = *(short*)(p);\
   *(q+3) = *(p+3); break;\
 case 0xE: *(short*)(q) = *(short*)(p);\
   *(q+2) = *(p+2); break;\
 case 0xF: *(long*)(q) = *(long*)(p); break; \
 }

COPY8
#define COPY8(q,p,mask)   \
 COPY4(q, p, mask >> 4)   \
 COPY4(q+4,p+4, mask)

DrawSprite
static void DrawSprite(short slot)
{
 SpriteInfoPtr spriteInfoP;
 short  numRows;
 short  numCols;
 register Ptr  p;
 register Ptr  q;
 Ptr    maskP;
 short  srcRowBytes;
 short  h, v;
 short  mask;
 short  maskMask;
 short  maskRowBytes;
 short  numMaskBytes;
 short  i;
 long   dstRowBytes;

 spriteInfoP = &gSpriteInfo[slot];
 h = spriteInfoP->position.h;
 v = spriteInfoP->position.v;
 numRows = spriteInfoP->height;
 numCols = spriteInfoP->width;
 p = (char *) &gSpritePixData[slot];
 q = gOnDeckRowAddr[v] + h;
 maskP = (char *) &gSpriteMaskData[slot];
 
 if (numCols >= 8)
  {
 numMaskBytes = numCols >> 3;
 maskRowBytes = 4 - numMaskBytes;
 srcRowBytes = 40 - numCols;
 dstRowBytes = gOnDeckRowBytes - numCols + 8;
 while (1)
  {
 i = numMaskBytes;
 while (1)
  {
 mask = *maskP++;
 COPY8(q, p, mask)
 if (--i == 0)
 break;
 p += 8;
 q += 8;
  }
 if (--numRows == 0)
 break;
 maskP += maskRowBytes;
 p += srcRowBytes;
 q += dstRowBytes;
  }
  }
 else
  {
 maskMask = 0xf00 >> numCols;
 while (1)
  {
 mask = (*maskP) & maskMask;
 COPY8(q, p, mask)
 if (--numRows == 0)
 break;
 maskP += 4;
 p += 32;
 q += gOnDeckRowBytes;
  }
  }
}

DrawNewSprites
static void DrawNewSprites(void)
{
 register short  slot;
 SpriteInfoPtr spriteInfoP;
 
 slot = gFirstSpriteSlot;
 while (slot >= 0)
  {
 register short  numRows;
 register short  numCols;
 register short  h;
 register short  v;
 
 spriteInfoP = &gSpriteInfo[slot];
 if (spriteInfoP->status < 0)
 goto nextSlot;  /* deleted, so skip it */
 numRows = spriteInfoP->height;
 numCols = spriteInfoP->width;
 h = spriteInfoP->position.h;
 v = spriteInfoP->position.v;
 if (h + numCols <= 0 || h >= gWindowWidth
 || v + numRows <= 0 || v >= gWindowHeight)
 goto nextSlot;  /* totally offscreen */

 DrawSprite(slot);
nextSlot:
 slot = spriteInfoP->nextSlot;
  }
}

FastCopyChunk
/* count is a multiple of 4 in the range [4..44] */
static void FastCopyChunk(long *q, long *p,
 short count, short rows)
{
 register short  srcRowBytes;
 register short  dstRowBytes;
 register short  rowsLeft = rows;
 register short  copy8 = count & 8;
 register short  copy4 = count & 4;
 
 srcRowBytes = gOnDeckRowBytes - count;
 dstRowBytes = gScreenRowBytes - count;
 if (count & 32)
  {
 while (rowsLeft > 0)
  {
 rowsLeft--;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 if (copy8)
  {
 *q++ = *p++;
 *q++ = *p++;
  }
 if (copy4)
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
  }
  }
 else if (count & 16)
  {
 while (rowsLeft > 0)
  {
 rowsLeft--;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 *q++ = *p++;
 if (copy8)
  {
 *q++ = *p++;
 *q++ = *p++;
  }
 if (copy4)
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
    }
  }
 else
  {
 while (rowsLeft > 0)
  {
 rowsLeft--;
 if (copy8)
  {
 *q++ = *p++;
 *q++ = *p++;
  }
 if (copy4)
 *q++ = *p++;
 p = (long *) (((Ptr) p) + srcRowBytes);
 q = (long *) (((Ptr) q) + dstRowBytes);
    }
  }
}

DrawNewSpritesToScreen

/* Here we do have to watch out for sprites that overlap the edges of the window.  We copy a rectangluar 
region that includes the sprites previous and current positions.  We know they will be close sionce sprites 
move at most 8 pixels per turn.
*/
static void DrawNewSpritesToScreen(void)
{
 short  slot;
 SpriteInfoPtr spriteInfoP;
 short  numRows;
 short  numCols;
 register long   *p;
 register long   *q;
 short  hStart, hEnd;
 short  vStart, vEnd;
 
 slot = gFirstSpriteSlot;
 while (slot >= 0)
  {
 spriteInfoP = &gSpriteInfo[slot];
 numRows = spriteInfoP->height;
 numCols = spriteInfoP->width;
 if (spriteInfoP->position.h
  < spriteInfoP->lastPosition.h)
  {
 hStart = spriteInfoP->position.h;
 hEnd = spriteInfoP->lastPosition.h + numCols;
  }
 else
  {
 hStart = spriteInfoP->lastPosition.h;
 hEnd = spriteInfoP->position.h + numCols;
  }
 if (hStart < 0)
 hStart = 0;
 else if (hEnd > gWindowWidth)
 hEnd = gWindowWidth;
 if (spriteInfoP->position.v
  < spriteInfoP->lastPosition.v)
  {
 vStart = spriteInfoP->position.v;
 vEnd = spriteInfoP->lastPosition.v + numRows;
  }
 else
  {
 vStart = spriteInfoP->lastPosition.v;
 vEnd = spriteInfoP->position.v + numRows;
  }
 if (vStart < 0)
 vStart = 0;
 else if (vEnd > gWindowHeight)
 vEnd = gWindowHeight;
 hStart = hStart & -4;  /* make it a mult of 4 */
 hEnd = (hEnd + 3) & -4;  /* make it a mult of 4 */
 
 p = (long *) (gOnDeckRowAddr[vStart] + hStart);
 q = (long *) (gScreenRowAddr[vStart] + hStart);
 
 vEnd -= vStart; /* now it’s a count */
 hEnd -= hStart; /* now it’s a count */
 if (hEnd >= 0)
 FastCopyChunk(q, p, hEnd, vEnd);
 
 spriteInfoP->lastPosition = spriteInfoP->position;
 slot = spriteInfoP->nextSlot;
  }
}

UpdateScreen
void UpdateScreen(void)
{
 EraseOldSprites();
 DrawNewSprites();
 DrawNewSpritesToScreen();
 if (gDeletionCount != 0)
 RemoveDeletedSprites();
}

 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Adobe After Effects CC 2018 16.1.3 - Cre...
After Effects CC 2018 is available as part of Adobe Creative Cloud for $52.99/month (or $20.99/month for a single app license). The new, more connected After Effects CC 2018 can make the impossible... Read more
Adobe Audition CC 2019 12.1.4 - Professi...
Audition CC 2019 is available as part of Adobe Creative Cloud for as little as $20.99/month (or $9.99/month if you're a previous Audition customer). Adobe Audition CC 2019 empowers you to create and... Read more
Adobe Premiere Pro CC 2019 13.1.5 - Digi...
Premiere Pro CC 2019 is available as part of Adobe Creative Cloud for as little as $52.99/month. The price on display is a price for annual by-monthly plan for Adobe Premiere Pro only Adobe Premiere... Read more
Navicat Premium Essentials 12.1.25 - Pro...
Navicat Premium Essentials is a compact version of Navicat which provides basic and necessary features you will need to perform simple administration on a database. It supports the latest features... Read more
Sketch 58 - Design app for UX/UI for iOS...
Sketch is an innovative and fresh look at vector drawing. Its intentionally minimalist design is based upon a drawing space of unlimited size and layers, free of palettes, panels, menus, windows, and... Read more
ClipGrab 3.8.5 - Download videos from Yo...
ClipGrab is a free downloader and converter for YouTube, Vimeo, Facebook and many other online video sites. It converts downloaded videos to MPEG4, MP3 or other formats in just one easy step Version... Read more
Dash 4.6.6 - Instant search and offline...
Dash is an API documentation browser and code snippet manager. Dash helps you store snippets of code, as well as instantly search and browse documentation for almost any API you might use (for a full... Read more
FotoMagico 5.6.8 - Powerful slideshow cr...
FotoMagico lets you create professional slideshows from your photos and music with just a few, simple mouse clicks. It sports a very clean and intuitive yet powerful user interface. High image... Read more
Civilization VI 1.2.4 - Next iteration o...
Sid Meier’s Civilization VI is the next entry in the popular Civilization franchise. Originally created by legendary game designer Sid Meier, Civilization is a strategy game in which you attempt to... Read more
Skype 8.52.0.138 - Voice-over-internet p...
Skype allows you to talk to friends, family and co-workers across the Internet without the inconvenience of long distance telephone charges. Using peer-to-peer data transmission technology, Skype... Read more

Latest Forum Discussions

See All

Lots of premium games are going free (so...
You may have seen over the past couple weeks a that a bunch of premium games have suddenly become free. This isn’t a mistake, nor is it some last hurrah before Apple Arcade hits, and it’s important to know that these games aren’t actually becoming... | Read more »
Yoozoo Games launches Saint Seiya Awaken...
If you’re into your anime, you’ve probably seen or heard of Saint Seiya. Based on a shonen manga by Masami Kurumada, the series was massively popular in the 1980s – especially in its native Japan. Since then, it’s grown into a franchise of all... | Read more »
Five Nights at Freddy's AR: Special...
Five Nights at Freddy's AR: Special Delivery is a terrifying new nightmare from developer Illumix. Last week, FNAF fans were sent into a frenzy by a short teaser for what we now know to be Special Delivery. Those in the comments were quick to... | Read more »
Rush Rally 3's new live events are...
Last week, Rush Rally 3 got updated with live events, and it’s one of the best things to happen to racing games on mobile. Prior to this update, the game already had multiplayer, but live events are more convenient in the sense that it’s somewhat... | Read more »
Why your free-to-play racer sucks
It’s been this way for a while now, but playing Hot Wheels Infinite Loop really highlights a big issue with free-to-play mobile racing games: They suck. It doesn’t matter if you’re trying going for realism, cart racing, or arcade nonsense, they’re... | Read more »
Steam Link Spotlight - The Banner Saga 3
Steam Link Spotlight is a new feature where we take a look at PC games that play exceptionally well using the Steam Link app. Our last entry talked about Terry Cavanaugh’s incredible Dicey Dungeons. Read about how it’s a great mobile experience... | Read more »
Combo Quest (Games)
Combo Quest 1.0 Device: iOS Universal Category: Games Price: $.99, Version: 1.0 (iTunes) Description: Combo Quest is an epic, time tap role-playing adventure. In this unique masterpiece, you are a knight on a heroic quest to retrieve... | Read more »
Hero Emblems (Games)
Hero Emblems 1.0 Device: iOS Universal Category: Games Price: $2.99, Version: 1.0 (iTunes) Description: ** 25% OFF for a limited time to celebrate the release ** ** Note for iPhone 6 user: If it doesn't run fullscreen on your device... | Read more »
Puzzle Blitz (Games)
Puzzle Blitz 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: Puzzle Blitz is a frantic puzzle solving race against the clock! Solve as many puzzles as you can, before time runs out! You have... | Read more »
Sky Patrol (Games)
Sky Patrol 1.0.1 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0.1 (iTunes) Description: 'Strategic Twist On The Classic Shooter Genre' - Indie Game Mag... | Read more »

Price Scanner via MacPrices.net

$250 prepaid Visa card with any Apple iPhone,...
Xfinity Mobile will include a free $250 prepaid Visa card with the purchase of any new iPhone, new line activation, and transfer of phone number to Xfinity Mobile. Offer is valid through October 27,... Read more
Sprint is offering the 64GB Apple iPhone 11 P...
Sprint has the new 64GB iPhone 11 Pro available for $12.50 per month for new customers with an eligible trade-in in of iPhone 7 or newer. That’s down from their standard monthly lease of $41.67. The... Read more
Final week: Apple’s 2019 Back to School Promo...
Purchase a new Mac using Apple’s Education discount, and take up to $400 off MSRP. All teachers, students, and staff of any educational institution with a .edu email address qualify for the discount... Read more
Save $30 on Apple’s AirPods at these reseller...
Amazon is offering discounts on new 2019 Apple AirPods ranging up to $30 off MSRP as part of their Labor Day sale. Shipping is free: – AirPods with Charging Case: $144.95 $15 off MSRP – AirPods with... Read more
Preorder your Apple Watch Series 5 today at A...
Amazon has Apple Watch Series 5 GPS models available for preorder and on sale today for $15 off Apple’s MSRP. Shipping is free and starts on September 20th: – 40mm Apple Watch Series 5 GPS: $384.99 $... Read more
21″ iMacs on sale for $100 off Apple’s MSRP,...
B&H Photo has new 21″ Apple iMacs on sale for $100 off MSRP with models available starting at $999. These are the same iMacs offered by Apple in their retail and online stores. Overnight shipping... Read more
2018 4 and 6-Core Mac minis on sale today for...
Apple resellers are offering new 2018 4-Core and 6-Core Mac minis for $100-$150 off MSRP for a limited time. B&H Photo has the new 2018 4-Core and 6-Core Mac minis on sale for up to $150 off... Read more
Save $150-$250 on 10.2″ WiFi + Cellular iPads...
Verizon is offering $150-$250 discounts on Apple’s new 10.2″ WiFi + Cellular iPad with service. Buy the iPad itself and save $150. Save $250 on the purchase of an iPad along with an iPhone. The fine... Read more
Apple continues to offer 13″ 2.3GHz Dual-Core...
Apple has Certified Refurbished 2017 13″ 2.3GHz Dual-Core non-Touch Bar MacBook Pros available starting at $1019. An standard Apple one-year warranty is included with each model, outer cases are new... Read more
Apple restocks 2018 MacBook Airs, Certified R...
Apple has restocked Certified Refurbished 2018 13″ MacBook Airs starting at only $849. Each MacBook features a new outer case, comes with a standard Apple one-year warranty, and is shipped free. The... Read more

Jobs Board

Student Employment (Blue *Apple* Cafe) Spri...
Student Employment (Blue Apple Cafe) Spring 2019 Penn State University Campus/Location: Penn State Brandywine Campus City: Media, PA Date Announced: 12/20/2018 Date Read more
Geek Squad *Apple* Master Consultation Agen...
**732907BR** **Job Title:** Geek Squad Apple Master Consultation Agent **Job Category:** Services/Installation/Repair **Location Number:** 000360-Williston-Store Read more
*Apple* Mobile Master - Best Buy (United Sta...
**728519BR** **Job Title:** Apple Mobile Master **Job Category:** Store Associates **Location Number:** 000853-Jackson-Store **Job Description:** **What does a Best Read more
*Apple* Mobility Pro - Best Buy (United Stat...
**733006BR** **Job Title:** Apple Mobility Pro **Job Category:** Store Associates **Location Number:** 000865-Conroe-Store **Job Description:** At Best Buy, our Read more
*Apple* Mobility Pro-Store 149 - Best Buy (U...
**731985BR** **Job Title:** Apple Mobility Pro-Store 149 **Job Category:** Store Associates **Location Number:** 000149-Towson-Store **Job Description:** At Best Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.