Lines Matching full:ptra
43 struct bim_APhImage* ptrA )
45 bbs_APhArr_init( cpA, &ptrA->arrE );
46 ptrA->widthE = 0;
47 ptrA->heightE = 0;
53 struct bim_APhImage* ptrA,
59 if( ptrA->arrE.arrPtrE != 0 )
61 bim_APhImage_size( cpA, ptrA, widthA, heightA );
65 bbs_APhArr_create( cpA, &ptrA->arrE, widthA * heightA, mspA );
66 ptrA->widthE = widthA;
67 ptrA->heightE = heightA;
74 struct bim_APhImage* ptrA )
76 bbs_APhArr_exit( cpA, &ptrA->arrE );
77 ptrA->widthE = 0;
78 ptrA->heightE = 0;
92 struct bim_APhImage* ptrA,
96 if( ptrA->arrE.allocatedSizeE < srcPtrA->arrE.allocatedSizeE )
103 ptrA->widthE = srcPtrA->widthE;
104 ptrA->heightE = srcPtrA->heightE;
105 bbs_APhArr_copy( cpA, &ptrA->arrE, &srcPtrA->arrE );
111 const struct bim_APhImage* ptrA,
114 if( ptrA->widthE != srcPtrA->widthE ) return FALSE;
115 if( ptrA->heightE != srcPtrA->heightE ) return FALSE;
116 return bbs_APhArr_equal( cpA, &ptrA->arrE, &srcPtrA->arrE );
138 struct bim_APhImage* ptrA,
143 if( ptrA->arrE.allocatedSizeE < widthA * heightA )
150 ptrA->widthE = widthA;
151 ptrA->heightE = heightA;
152 bbs_APhArr_size( cpA, &ptrA->arrE, widthA * heightA );
166 const struct bim_APhImage* ptrA )
170 + bbs_SIZEOF16( ptrA->widthE )
171 + bbs_SIZEOF16( ptrA->heightE )
172 + bbs_APhArr_memSize( cpA, &ptrA->arrE );
178 const struct bim_APhImage* ptrA,
181 uint32 memSizeL = bim_APhImage_memSize( cpA, ptrA );
184 memPtrA += bbs_memWrite32( &ptrA->widthE, memPtrA );
185 memPtrA += bbs_memWrite32( &ptrA->heightE, memPtrA );
186 bbs_APhArr_memWrite( cpA, &ptrA->arrE, memPtrA );
193 struct bim_APhImage* ptrA,
204 ptrA->widthE = widthL;
205 ptrA->heightE = heightL;
206 bbs_APhArr_memRead( cpA, &ptrA->arrE, memPtrA, mspA );
208 if( memSizeL != bim_APhImage_memSize( cpA, ptrA ) )
228 struct bim_APhImage* ptrA,
232 struct bbs_APh* ptrL = ptrA->arrE.arrPtrE;
233 for( iL = ptrA->widthE * ptrA->heightE; iL > 0; iL-- )
319 struct bim_APhImage* ptrA,
358 bim_APhImage_size( cpA, ptrA, sectionL.x2E - sectionL.x1E, sectionL.y2E - sectionL.y1E );
361 dstPixelPtrL = ptrA->arrE.arrPtrE;
