buiw.rar_buiw

/*====================================================== FILE: wutil.c SERVICES: Utility functions for example widgets GENERAL DESCRIPTION: Reproduction and/or distribution of this file without the written consent of QUALCOMM, Incorporated. is prohibited. Copyright ?1999-2005 QUALCOMM Incorporated. All Rights Reserved. QUALCOMM Proprietary/GTDR =====================================================*/ #include "wutil.h" #include "AEEStdLib.h" #include "AEEShell.h" #include "AEEImage.h" #include "modres.h" // RCCOORD without the subtracting one #define GETCORNERS(prc,l,t,r,b) (l)=(prc)->x,(t)=(prc)->y,(r)=(l)+(prc)->dx,(b)=(t)+(prc)->dy // extract coordinates of an AEERect #define RCRIGHT(prc) (((prc)->x) + ((prc)->dx) - 1) #define RCBOTTOM(prc) (((prc)->y) + ((prc)->dy) - 1) #define RCCOORD(prc,l,t,r,b) (l)=(prc)->x,(t)=(prc)->y,(r)=RCRIGHT(prc),(b)=RCBOTTOM(prc) // calculate the intersection of two rectangles boolean IntersectRectEx(AEERect *prcDest, const AEERect *prcSrc1, const AEERect *prcSrc2) { int aleft, atop, aright, abottom; // coordinates of prcSrc1 int bleft, btop, bright, bbottom; // coordinates of prcSrc2 // get the left, top, right, bottom coordinates of each source rect RCCOORD(prcSrc1, aleft, atop, aright, abottom); RCCOORD(prcSrc2, bleft, btop, bright, bbottom); // early rejection test if (aleft > bright || atop > bbottom || bleft > aright || btop > abottom) { if (prcDest) { SETAEERECT(prcDest, 0, 0, 0, 0); } return 0; // empty intersection } if (prcDest) { prcDest->x = MAX(aleft, bleft); prcDest->y = MAX(atop, btop); prcDest->dx = MIN(aright, bright) - prcDest->x + 1; prcDest->dy = MIN(abottom, bbottom) - prcDest->y + 1; } return 1; } /* || SubtractRect || || subtraction can only succeed if the result will be a rectangular || region. for example, subtracting rectangle 1 from rectangle 2 || will not result in a rectangular region so the result will be || all of rectangle 2. In contrast, subtracting rectangle 3 from || rectangle 4 will result in a rectangular result so the result || will be rectangle 4 reduced in size, and with the origin || offset in the y direction.. || || 1 3 || +---+ +----------+ || | | 2 | +----+ | || | +-|-+ | | | | || | | | | - NO +----------+ - YES || +---+ | | | || | | +----+ 4 || +---+ || || || returns TRUE if subtraction succeeded || with result placed in prcResult */ boolean SubtractRect(AEERect *prcResult, const AEERect *prcBase, const AEERect *prcSub) { int nEdges = 0; boolean bLeftEdge = 0; boolean bRightEdge = 0; boolean bTopEdge = 0; boolean bBottomEdge = 0; int bleft, btop, bright, bbottom; // prcBase coordinates int sleft, stop, sright, sbottom; // prcSub coordinates GETCORNERS(prcBase, bleft, btop, bright, bbottom); GETCORNERS(prcSub, sleft, stop, sright, sbottom); // count which base rect edges fall between the sub rect edges if (BETWEEN(bleft, sleft, sright+1)) { bLeftEdge = 1; nEdges++; } if (BETWEEN(bright, sleft, sright+1)) { bRightEdge = 1; nEdges++; } if (BETWEEN(btop, stop, sbottom+1)) { bTopEdge = 1; nEdges++; } if (BETWEEN(bbottom, stop, sbottom+1)) { bBottomEdge = 1; nEdges++; } // empty rect result if (nEdges == 4) { // set result to empty rect bleft = bright = btop = bbottom = 0; } else if (nEdges == 3) { if (!bTopEdge) { bbottom = stop; } if (!bBottomEdge) { btop = sbottom; } if (!bLeftEdge) { bright = sleft; } if (!bRightEdge) { bleft = sright; } } SETAEERECT(prcResult, bleft, btop, bright-bleft, bbottom-btop); return (boolean)(nEdges > 2); } /* returns FALSE if either source rectangle is empty */ void UnionRect(AEERect *prcResult, const AEERect *prcSrc1, const AEERect *prcSrc2) { int aleft, atop, aright, abottom; // coordinates of prcSrc1 int bleft, btop, bright, bbottom; // coordinates of prcSrc2 // get the left, top, right, bottom coordinates of each source rect GETCORNERS(prcSrc1, aleft, atop, aright, abottom); GETCORNERS(prcSrc2, bleft, btop, bright, bbottom); prcResult->x = MIN(aleft, bleft); prcResult->dx = MAX(aright, bright) - prcResult->x; prcResult->y = MIN(atop, btop); prcResult->dy = MAX(abottom, bbottom) - prcResult->y; } // origin constants for DrawStairStep #define DSSO_LEFT 0 #define DSSO_RIGHT 1 #define DSSO_TOP 0 #define DSSO_BOTTOM 2 #define DSSO_BOTTOM_LEFT (DSSO_BOTTOM|DSSO_LEFT) // origin in bottom/left of rectangle #define DSSO_BOTTOM_RIGHT (DSSO_BOTTOM|DSSO_RIGHT) // origin in bottom/right... #define DSSO_TOP_LEFT (DSSO_TOP|DSSO_LEFT) // ... #define DSSO_TOP_RIGHT (DSSO_TOP|DSSO_RIGHT) // ... /* fill a rectangle with a stairstep pattern starting from origin and working to opposite corner with step height always increasing x x DSSO_BOTTOM_LEFT xx xx DSSO_BOTTOM_RIGHT (origin) --> xxx xxx <-- (origin) (origin) --> xxx xxx <-- (origin) DSSO_TOP_LEFT xx xx DSSO_TOP_RIGHT x x */ static void DrawStairStep(IDisplay *piDisplay, AEERect *prc, int nDSSOrigin, RGBVAL rgb, uint8 nAlpha) { int xOrigin, yOrigin; AEERect rc; int i; xOrigin = prc->x; if (nDSSOrigin & DSSO_RIGHT) { xOrigin += prc->dx-1; } yOrigin = prc->y; if (nDSSOrigin & DSSO_BOTTOM) { yOrigin += prc->dy-1; } SETAEERECT(&rc, xOrigin, yOrigin, 1, 1); for (i=0; i < prc->dx; i++) { // IDISPLAY_DrawRect(piDisplay, &rc, RGB_NONE, rgb, IDF_RECT_FILL); BlendRect(piDisplay, &rc, RGBA_STRIPALPHA(rgb), nAlpha); rc.dy++; if (nDSSOrigin & DSSO_RIGHT) { rc.x--; } else { rc.x++; } if (nDSSOrigin & DSSO_BOTTOM) { rc.y--; } } } void DrawAndInsetBorderEx(IDisplay *piDisplay, AEERect *prc, int nInset, int nThick, RGBVAL rgb, uint8 nAlpha, boolean bBeveled) { AEERect rc; AEERect rco = *prc; // outer rectangle nThick = MIN(nThick, nInset); // dont' allow nThick to exceed nInset INFLATERECT(prc, -nInset, -nInset); nInset -= nThick; INFLATERECT(&rco, -nInset, -nInset); rc.x = bBeveled ? prc->x : rco.x; rc.y = rco.y; rc.dx = bBeveled ? prc->dx : rco.dx; rc.dy = nThick; BlendRect(piDisplay, &rc, rgb, nAlpha); rc.y += prc->dy + nThick; BlendRect(piDisplay, &rc, rgb, nAlpha); rc.x = rco.x; // rc.y = bBeveled ? prc->y : rco.y; rc.y = prc->y; rc.dx = nThick; // rc.dy = bBeveled ? prc->dy : rco.dy; rc.dy = prc->dy; BlendRect(piDisplay, &rc, rgb, nAlpha); rc.x += prc->dx + nThick; BlendRect(piDisplay, &rc, rgb, nAlpha); /////////////////////////// // draw beveled corners /////////////////////////// if (bBeveled) { SETAEERECT(&rc, rco.x+1, rco.y+1, nThick-1, nThick-1); DrawStairStep(piDisplay, &rc, DSSO_BOTTOM_LEFT, rgb, nAlpha); rc.x += (prc->dx + rc.dx); DrawStairStep(piDisplay, &rc, DSSO_BOTTOM_RIGHT, rgb, nAlpha); rc.x = rco.x+1; rc.y += (prc->dy + rc.dy); DrawStairStep(piDisplay, &rc, DSSO_TOP_LEFT, rgb, nAlpha); rc.x += (prc->dx + rc.dx); DrawStairStep(piDisplay, &rc, DSSO_TOP_RIGHT, rgb, nAlpha); } } /* Rounded Corners To perform the SIN operation to dra