Lines Matching refs:pX
409 fuzzer_rule *pX; in fuzzerLoadRules() local
412 while( (pX = pHead)!=0 ){ in fuzzerLoadRules()
413 pHead = pX->pNext; in fuzzerLoadRules()
414 pX->pNext = 0; in fuzzerLoadRules()
416 pX = fuzzerMergeRules(a[i], pX); in fuzzerLoadRules()
419 a[i] = fuzzerMergeRules(a[i], pX); in fuzzerLoadRules()
421 for(pX=a[0], i=1; i<sizeof(a)/sizeof(a[0]); i++){ in fuzzerLoadRules()
422 pX = fuzzerMergeRules(a[i], pX); in fuzzerLoadRules()
424 p->pRule = fuzzerMergeRules(p->pRule, pX); in fuzzerLoadRules()
795 fuzzer_stem *pBest, *pX; in fuzzerLowestCostStem() local
803 pX = pCur->aQueue[i]; in fuzzerLowestCostStem()
804 if( pX==0 ) continue; in fuzzerLowestCostStem()
805 if( pBest==0 || pBest->rCostX>pX->rCostX ){ in fuzzerLowestCostStem()
806 pBest = pX; in fuzzerLowestCostStem()
826 fuzzer_stem *pX; in fuzzerInsert() local
832 if( (pX = pCur->pStem)!=0 && pX->rCostX>pNew->rCostX ){ in fuzzerInsert()
835 pNew = pX; in fuzzerInsert()
840 pX = pNew; in fuzzerInsert()
843 pX = fuzzerMergeStems(pX, pCur->aQueue[i]); in fuzzerInsert()
846 pCur->aQueue[i] = pX; in fuzzerInsert()
853 pCur->aQueue[i] = pX; in fuzzerInsert()
856 pX = fuzzerMergeStems(pX, pCur->aQueue[FUZZER_NQUEUE-1]); in fuzzerInsert()
857 pCur->aQueue[FUZZER_NQUEUE-1] = pX; in fuzzerInsert()