Lines Matching refs:ptrA
54 struct bbs_MemTbl* ptrA ) in bbs_MemTbl_init() argument
59 bbs_MemSeg_init( cpA, &ptrA->esArrE[ iL ] ); in bbs_MemTbl_init()
60 bbs_MemSeg_init( cpA, &ptrA->ssArrE[ iL ] ); in bbs_MemTbl_init()
61 ptrA->espArrE[ iL ] = NULL; in bbs_MemTbl_init()
63 ptrA->esSizeE = 0; in bbs_MemTbl_init()
64 ptrA->ssSizeE = 0; in bbs_MemTbl_init()
70 struct bbs_MemTbl* ptrA ) in bbs_MemTbl_exit() argument
75 bbs_MemSeg_exit( cpA, &ptrA->esArrE[ iL ] ); in bbs_MemTbl_exit()
76 bbs_MemSeg_exit( cpA, &ptrA->ssArrE[ iL ] ); in bbs_MemTbl_exit()
77 ptrA->espArrE[ iL ] = NULL; in bbs_MemTbl_exit()
79 ptrA->esSizeE = 0; in bbs_MemTbl_exit()
80 ptrA->ssSizeE = 0; in bbs_MemTbl_exit()
102 struct bbs_MemTbl* ptrA, in bbs_MemTbl_overlap() argument
106 for( iL = 0; iL < ptrA->esSizeE; iL++ ) in bbs_MemTbl_overlap()
108 if( bbs_MemTbl_memOverlap( ptrA->espArrE[ iL ]->memPtrE, in bbs_MemTbl_overlap()
109 ptrA->espArrE[ iL ]->sizeE, in bbs_MemTbl_overlap()
116 for( iL = 0; iL < ptrA->ssSizeE; iL++ ) in bbs_MemTbl_overlap()
118 if( bbs_MemTbl_memOverlap( ptrA->ssArrE[ iL ].memPtrE, in bbs_MemTbl_overlap()
119 ptrA->ssArrE[ iL ].sizeE, in bbs_MemTbl_overlap()
156 struct bbs_MemTbl* ptrA, in bbs_MemTbl_create() argument
167 bbs_MemTbl_init( cpA, ptrA ); in bbs_MemTbl_create()
170 ptrA->esArrE[ 0 ] = bbs_MemSeg_create( cpA, memPtrA, sizeA - sharedSubSizeA ); in bbs_MemTbl_create()
172 …ptrA->ssArrE[ 0 ] = bbs_MemSeg_createShared( cpA, ( uint16* ) ( ( int32 ) ( ( uint16* )memPtrA ) +… in bbs_MemTbl_create()
174 …ptrA->ssArrE[ 0 ] = bbs_MemSeg_createShared( cpA, ( uint16* )memPtrA + sizeA - sharedSubSizeA, sha… in bbs_MemTbl_create()
176 ptrA->espArrE[ 0 ] = &ptrA->esArrE[ 0 ]; in bbs_MemTbl_create()
178 ptrA->esSizeE = 1; in bbs_MemTbl_create()
179 ptrA->ssSizeE = 1; in bbs_MemTbl_create()
185 struct bbs_MemTbl* ptrA, in bbs_MemTbl_add() argument
190 if( ptrA->esSizeE == bbs_MAX_MEM_SEGS ) in bbs_MemTbl_add()
196 ptrA->esArrE[ ptrA->esSizeE ] = bbs_MemSeg_create( cpA, memPtrA, sizeA ); in bbs_MemTbl_add()
197 ptrA->esArrE[ ptrA->esSizeE ].idE = idA; in bbs_MemTbl_add()
198 ptrA->espArrE[ ptrA->esSizeE ] = &ptrA->esArrE[ ptrA->esSizeE ]; in bbs_MemTbl_add()
199 ptrA->esSizeE++; in bbs_MemTbl_add()
205 struct bbs_MemTbl* ptrA, in bbs_MemTbl_addShared() argument
210 if( ptrA->ssSizeE == bbs_MAX_MEM_SEGS ) in bbs_MemTbl_addShared()
216 ptrA->ssArrE[ ptrA->ssSizeE ] = bbs_MemSeg_createShared( cpA, memPtrA, sizeA ); in bbs_MemTbl_addShared()
217 ptrA->ssArrE[ ptrA->ssSizeE ].idE = idA; in bbs_MemTbl_addShared()
218 ptrA->ssSizeE++; in bbs_MemTbl_addShared()
224 struct bbs_MemTbl* ptrA, in bbs_MemTbl_segPtr() argument
228 if( ptrA->esSizeE == 0 ) in bbs_MemTbl_segPtr()
235 for( iL = 0; iL < ptrA->esSizeE; iL++ ) in bbs_MemTbl_segPtr()
237 if( idA == ptrA->espArrE[ iL ]->idE ) return ptrA->espArrE[ iL ]; in bbs_MemTbl_segPtr()
240 for( iL = 0; iL < ptrA->esSizeE; iL++ ) in bbs_MemTbl_segPtr()
242 if( ptrA->espArrE[ iL ]->sizeE > 0 || in bbs_MemTbl_segPtr()
243 ptrA->espArrE[ iL ]->dynMemManagerPtrE != 0 ) in bbs_MemTbl_segPtr()
245 return ptrA->espArrE[ iL ]; in bbs_MemTbl_segPtr()
256 struct bbs_MemTbl* ptrA, in bbs_MemTbl_sharedSegPtr() argument
260 if( ptrA->ssSizeE == 0 ) in bbs_MemTbl_sharedSegPtr()
267 for( iL = 0; iL < ptrA->ssSizeE; iL++ ) in bbs_MemTbl_sharedSegPtr()
269 if( idA == ptrA->ssArrE[ iL ].idE ) return &ptrA->ssArrE[ iL ]; in bbs_MemTbl_sharedSegPtr()
272 for( iL = 0; iL < ptrA->ssSizeE; iL++ ) in bbs_MemTbl_sharedSegPtr()
274 if( ptrA->ssArrE[ iL ].sizeE > 0 || in bbs_MemTbl_sharedSegPtr()
275 ptrA->ssArrE[ iL ].dynMemManagerPtrE != 0 ) in bbs_MemTbl_sharedSegPtr()
277 return &ptrA->ssArrE[ iL ]; in bbs_MemTbl_sharedSegPtr()
288 struct bbs_MemTbl* ptrA, in bbs_MemTbl_fastestSegPtr() argument
292 for( iL = 0; iL < ptrA->esSizeE; iL++ ) in bbs_MemTbl_fastestSegPtr()
294 if( bbs_MemSeg_availableSize( cpA, ptrA->espArrE[ iL ] ) >= minSizeA ) break; in bbs_MemTbl_fastestSegPtr()
296 if( iL == ptrA->esSizeE ) in bbs_MemTbl_fastestSegPtr()
298 if( ptrA->esSizeE == 0 ) in bbs_MemTbl_fastestSegPtr()
312 if( ptrA->espArrE[ iL ]->sharedE ) in bbs_MemTbl_fastestSegPtr()
319 return ptrA->espArrE[ iL ]; in bbs_MemTbl_fastestSegPtr()
325 struct bbs_MemTbl* ptrA ) in bbs_MemTbl_largestSegPtr() argument
331 if( ptrA->esSizeE == 0 ) in bbs_MemTbl_largestSegPtr()
338 for( iL = 0; iL < ptrA->esSizeE; iL++ ) in bbs_MemTbl_largestSegPtr()
340 uint32 sizeL = bbs_MemSeg_availableSize( cpA, ptrA->espArrE[ iL ] ); in bbs_MemTbl_largestSegPtr()
348 if( ptrA->espArrE[ maxIndexL ]->sharedE ) in bbs_MemTbl_largestSegPtr()
355 return ptrA->espArrE[ maxIndexL ]; in bbs_MemTbl_largestSegPtr()
361 struct bbs_MemTbl* ptrA, in bbs_MemTbl_fastestSharedSegPtr() argument
365 for( iL = 0; iL < ptrA->ssSizeE; iL++ ) in bbs_MemTbl_fastestSharedSegPtr()
367 if( bbs_MemSeg_availableSize( cpA, &ptrA->ssArrE[ iL ] ) >= minSizeA ) break; in bbs_MemTbl_fastestSharedSegPtr()
369 if( iL == ptrA->ssSizeE ) in bbs_MemTbl_fastestSharedSegPtr()
371 if( ptrA->esSizeE == 0 ) in bbs_MemTbl_fastestSharedSegPtr()
385 if( !ptrA->ssArrE[ iL ].sharedE ) in bbs_MemTbl_fastestSharedSegPtr()
392 return &ptrA->ssArrE[ iL ]; in bbs_MemTbl_fastestSharedSegPtr()
398 struct bbs_MemTbl* ptrA ) in bbs_MemTbl_largestSharedSegPtr() argument
404 if( ptrA->ssSizeE == 0 ) in bbs_MemTbl_largestSharedSegPtr()
411 for( iL = 0; iL < ptrA->ssSizeE; iL++ ) in bbs_MemTbl_largestSharedSegPtr()
413 uint32 sizeL = bbs_MemSeg_availableSize( cpA, &ptrA->ssArrE[ iL ] ); in bbs_MemTbl_largestSharedSegPtr()
421 if( !ptrA->ssArrE[ maxIndexL ].sharedE ) in bbs_MemTbl_largestSharedSegPtr()
428 return &ptrA->ssArrE[ maxIndexL ]; in bbs_MemTbl_largestSharedSegPtr()