Home | History | Annotate | Download | only in b_BasicEm

Lines Matching refs:ptrA

41 					   struct bbs_Int8Arr* ptrA )
43 ptrA->arrPtrE = NULL;
44 ptrA->sizeE = 0;
45 ptrA->allocatedSizeE = 0;
46 ptrA->mspE = NULL;
52 struct bbs_Int8Arr* ptrA )
54 bbs_MemSeg_free( cpA, ptrA->mspE, ptrA->arrPtrE );
55 ptrA->arrPtrE = NULL;
56 ptrA->mspE = NULL;
57 ptrA->sizeE = 0;
58 ptrA->allocatedSizeE = 0;
72 struct bbs_Int8Arr* ptrA,
76 if( ptrA->allocatedSizeE < srcPtrA->allocatedSizeE )
83 bbs_Int8Arr_size( cpA, ptrA, srcPtrA->sizeE );
84 bbs_memcpy16( ptrA->arrPtrE, srcPtrA->arrPtrE, srcPtrA->sizeE >> 1 );
90 const struct bbs_Int8Arr* ptrA,
94 const int8* ptr1L = ptrA->arrPtrE;
96 if( ptrA->sizeE != srcPtrA->sizeE ) return FALSE;
97 for( iL = ptrA->sizeE; iL > 0; iL-- )
115 const struct bbs_Int8Arr* ptrA,
132 struct bbs_Int8Arr* ptrA,
137 if( ptrA->sizeE == sizeA ) return;
138 if( ptrA->arrPtrE != 0 )
140 bbs_Int8Arr_size( cpA, ptrA, sizeA );
148 ptrA->arrPtrE = bbs_MemSeg_alloc( cpA, mspA, sizeL >> 1 );
150 ptrA->allocatedSizeE = sizeL;
152 ptrA->sizeE = sizeA;
153 if( !mspA->sharedE ) ptrA->mspE = mspA;
160 struct bbs_Int8Arr* ptrA,
163 if( ptrA->allocatedSizeE < sizeA )
167 ptrA->allocatedSizeE );
170 ptrA->sizeE = sizeA;
184 const struct bbs_Int8Arr* ptrA )
186 return bbs_SIZEOF16( uint32 ) + bbs_SIZEOF16( ptrA->sizeE ) +
187 ptrA->sizeE / 2; /* int8 = 0.5 word size*/
193 const struct bbs_Int8Arr* ptrA,
196 uint32 memSizeL = bbs_Int8Arr_memSize( cpA, ptrA );
198 memPtrA += bbs_memWrite32( &ptrA->sizeE, memPtrA );
199 memPtrA += bbs_memWrite16Arr( cpA, ptrA->arrPtrE, ptrA->sizeE / 2, memPtrA );
200 /*bbs_memcpy( memPtrA, ptrA->arrPtrE, ptrA->sizeE );*/
207 struct bbs_Int8Arr* ptrA,
215 bbs_Int8Arr_create( cpA, ptrA, sizeL, mspA );
216 memPtrA += bbs_memRead16Arr( cpA, ptrA->arrPtrE, ptrA->sizeE / 2, memPtrA );
218 if( memSizeL != bbs_Int8Arr_memSize( cpA, ptrA ) )
238 struct bbs_Int8Arr* ptrA,
242 for( iL = 0; iL < ptrA->sizeE; iL++ )
244 ptrA->arrPtrE[ iL ] = valA;