Home
last modified time | relevance | path

Searched refs:idA (Results 1 – 6 of 6) sorted by relevance

/external/neven/Embedded/common/src/b_BasicEm/
DMemTbl.c188 uint32 idA ) in bbs_MemTbl_add() argument
197 ptrA->esArrE[ ptrA->esSizeE ].idE = idA; in bbs_MemTbl_add()
208 uint32 idA ) in bbs_MemTbl_addShared() argument
217 ptrA->ssArrE[ ptrA->ssSizeE ].idE = idA; in bbs_MemTbl_addShared()
225 uint32 idA ) in bbs_MemTbl_segPtr() argument
233 if( idA > 0 ) in bbs_MemTbl_segPtr()
237 if( idA == ptrA->espArrE[ iL ]->idE ) return ptrA->espArrE[ iL ]; in bbs_MemTbl_segPtr()
257 uint32 idA ) in bbs_MemTbl_sharedSegPtr() argument
265 if( idA > 0 ) in bbs_MemTbl_sharedSegPtr()
269 if( idA == ptrA->ssArrE[ iL ].idE ) return &ptrA->ssArrE[ iL ]; in bbs_MemTbl_sharedSegPtr()
DMemTbl.h100 uint32 idA );
107 uint32 idA );
112 uint32 idA );
116 uint32 idA );
DContext.c281 uint32 idA ) /* ID of segment, id=0: unspecified */ in bbs_Context_addStaticSeg() argument
305 memSegL.idE = idA; in bbs_Context_addStaticSeg()
329 uint32 idA ) /* ID of segment, id=0: unspecified */ in bbs_Context_addDynamicSeg() argument
364 memSegL.idE = idA; in bbs_Context_addDynamicSeg()
DContext.h190 uint32 idA ); /* ID of segment, id=0: unspecified */
199 uint32 idA ); /* ID of segment, id=0: unspecified */
/external/mesa3d/src/gallium/drivers/nouveau/codegen/
Dnv50_ir_bb.cpp523 int idA = bb->getId(); in printCFGraph() local
528 fprintf(out, "\t%i -> %i;\n", idA, idB); in printCFGraph()
531 fprintf(out, "\t%i -> %i [color=green];\n", idA, idB); in printCFGraph()
534 fprintf(out, "\t%i -> %i [color=red];\n", idA, idB); in printCFGraph()
537 fprintf(out, "\t%i -> %i;\n", idA, idB); in printCFGraph()
540 fprintf(out, "\t%i -> %i [style=dotted];\n", idA, idB); in printCFGraph()
Dnv50_ir.cpp492 uint32_t idA, idB; in interfers() local
500 idA = this->join->reg.data.offset; in interfers()
503 idA = this->join->reg.data.id * MIN2(this->reg.size, 4); in interfers()
507 if (idA < idB) in interfers()
508 return (idA + this->reg.size > idB); in interfers()
510 if (idA > idB) in interfers()
511 return (idB + that->reg.size > idA); in interfers()
513 return (idA == idB); in interfers()