| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/mvc/ |
| H A D | mvcCompare.c | 45 if ( Mvc_Cube1Words(pC1) ) in Mvc_CubeCompareInt()
53 else if ( Mvc_Cube2Words(pC1) ) in Mvc_CubeCompareInt()
67 int i = Mvc_CubeReadLast(pC1); in Mvc_CubeCompareInt()
101 if ( Mvc_Cube1Words( pC1 ) ) in Mvc_CubeCompareSizeAndInt()
109 else if ( Mvc_Cube2Words( pC1 ) ) in Mvc_CubeCompareSizeAndInt()
151 if ( Mvc_Cube1Words(pC1) ) in Mvc_CubeCompareIntUnderMask()
162 else if ( Mvc_Cube2Words(pC1) ) in Mvc_CubeCompareIntUnderMask()
210 if ( Mvc_Cube1Words(pC1) ) in Mvc_CubeCompareIntOutsideMask()
221 else if ( Mvc_Cube2Words(pC1) ) in Mvc_CubeCompareIntOutsideMask()
269 if ( Mvc_Cube1Words(pC1) ) in Mvc_CubeCompareIntOutsideAndUnderMask()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/if/ |
| H A D | ifCut.c | 204 int nSizeC1 = pC1->nLeaves; in If_CutMergeOrdered_()
293 int nSizeC1 = pC1->nLeaves; in If_CutMergeOrdered()
370 int * pC1 = pCut1->pLeaves; in If_CutMerge() local
378 if ( pC1[i] == pC0[k] ) in If_CutMerge()
388 pC[c++] = pC1[i]; in If_CutMerge()
411 If_Cut_t * pC1 = *ppC1; in If_CutCompareDelay() local
416 if ( pC0->nLeaves < pC1->nLeaves ) in If_CutCompareDelay()
418 if ( pC0->nLeaves > pC1->nLeaves ) in If_CutCompareDelay()
441 If_Cut_t * pC1 = *ppC1; in If_CutCompareDelayOld() local
450 if ( pC0->nLeaves < pC1->nLeaves ) in If_CutCompareDelayOld()
[all …]
|
| /dports/irc/kvirc/KVIrc-5.0.0-73-gbdeac0429/src/kvilib/core/ |
| H A D | KviQString.cpp | 78 pC1++; in equalCSN()
111 pC1++; in equalCIN()
135 if(!pC1) in equalCSN()
146 pC1++; in equalCSN()
170 if(!pC1) in equalCIN()
181 pC1++; in equalCIN()
217 pC1++; in equalCIN()
277 pC1++; in equalCS()
305 pC1++; in equalCI()
333 pC1++; in equalCI()
[all …]
|
| /dports/audio/opencore-amr/opencore-amr-0.1.5/opencore/codecs_v2/audio/gsm_amr/amr_nb/common/src/ |
| H A D | pred_lt.cpp | 213 Word16 *pC1; in Pow2()
244 pC1 = Coeff_1; in Pow2()
250 *(pC1++) = pC1_ref[k]; in Pow2()
251 *(pC1++) = pC2_ref[k]; in Pow2()
253 *(pC1++) = pC1_ref[k]; in Pow2()
254 *(pC1++) = pC2_ref[k]; in Pow2()
267 pC1 = Coeff_1; in Pow2()
274 s2 += ((Word32) * (pX3--)) * *(pC1); in Pow2()
275 s1 += ((Word32) * (pX3)) * *(pC1++); in Pow2()
276 s1 += ((Word32) * (pX2++)) * *(pC1); in Pow2()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/xsat/ |
| H A D | xsatClause.h | 65 xSAT_Clause_t * pC1 = ( xSAT_Clause_t * ) p1; in xSAT_ClauseCompare() local
68 if ( pC1->nSize > 2 && pC2->nSize == 2 ) in xSAT_ClauseCompare()
70 if ( pC1->nSize == 2 && pC2->nSize > 2 ) in xSAT_ClauseCompare()
72 if ( pC1->nSize == 2 && pC2->nSize == 2 ) in xSAT_ClauseCompare()
75 if ( pC1->nLBD > pC2->nLBD ) in xSAT_ClauseCompare()
77 if ( pC1->nLBD < pC2->nLBD ) in xSAT_ClauseCompare()
80 return pC1->pData[pC1->nSize].Act < pC2->pData[pC2->nSize].Act; in xSAT_ClauseCompare()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/exor/ |
| H A D | exorBits.c | 63 int GetDistance( Cube * pC1, Cube * pC2 );
65 int GetDistancePlus( Cube * pC1, Cube * pC2 );
67 int FindDiffVars( int * pDiffVars, Cube * pC1, Cube * pC2 );
221 int GetDistance( Cube * pC1, Cube * pC2 ) in GetDistance() argument
229 Temp1 = pC1->pCubeDataIn[i] ^ pC2->pCubeDataIn[i]; in GetDistance()
239 if ( pC1->pCubeDataOut[i] ^ pC2->pCubeDataOut[i] ) in GetDistance()
253 int GetDistancePlus( Cube * pC1, Cube * pC2 ) in GetDistancePlus() argument
263 Temp1 = pC1->pCubeDataIn[i] ^ pC2->pCubeDataIn[i]; in GetDistancePlus()
281 if ( pC1->pCubeDataOut[i] ^ pC2->pCubeDataOut[i] ) in GetDistancePlus()
311 int FindDiffVars( int * pDiffVars, Cube * pC1, Cube * pC2 ) in FindDiffVars() argument
[all …]
|
| H A D | exorList.c | 66 extern int GetDistance( Cube* pC1, Cube* pC2 );
68 extern int GetDistancePlus( Cube* pC1, Cube* pC2 );
82 extern int ExorLinkCubeIteratorStart( Cube** pGroup, Cube* pC1, Cube* pC2, cubedist Dist );
906 Cube** pC1; // the pointer to the first cube member
973 p->pC1[Pos] = p1; in NewRangeInsertCubePair()
1048 p1 = pQ->pC1[ pQ->PosOut ]; in IteratorCubePairStart()
1063 *ppC1 = pQ->pC1[ pQ->PosOut ]; in IteratorCubePairStart()
1082 p1 = pQ->pC1[ pQ->PosOut ]; in IteratorCubePairNext()
1097 *(s_Iter.ppC1) = pQ->pC1[ pQ->PosOut ]; in IteratorCubePairNext()
1124 s_Que[i].pC1 = (Cube**) ABC_ALLOC( Cube*, nPlaces ); in AllocateQueques()
[all …]
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/svx/source/svdraw/ |
| H A D | svdtrans.cxx | 164 bool bC1=pC1!=nullptr; in CrookRotateXPoint()
179 pC1->setY(FRound(static_cast<double>(pC1->Y()) /rRad.X()*(cx-pC1->X())) ); in CrookRotateXPoint()
187 pC1->setX(FRound(static_cast<double>(pC1->X())*nFact) ); in CrookRotateXPoint()
218 bool bC1=pC1!=nullptr; in CrookSlantXPoint()
254 …if (bC1) { if (bVert) pC1->AdjustY( -(y0-rCenter.Y()) ); else pC1->AdjustX( -(x0-rCenter.X()) ); R… in CrookSlantXPoint()
297 Point* pC1=nullptr; in CrookRotatePoly() local
300 pC1=pPnt; in CrookRotatePoly()
320 Point* pC1=nullptr; in CrookSlantPoly() local
323 pC1=pPnt; in CrookSlantPoly()
343 Point* pC1=nullptr; in CrookStretchPoly() local
[all …]
|
| H A D | svdpoev.cxx | 599 static void ImpMove(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* /*p2*/, const v… in ImpMove() argument
602 if (pC1!=nullptr) pC1->Move(*static_cast<const Size*>(p1)); in ImpMove()
616 static void ImpResize(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* p2, const voi… in ImpResize() argument
619 …if (pC1!=nullptr) ResizePoint(*pC1,*static_cast<const Point*>(p1),*static_cast<const Fraction*>(p2… in ImpResize()
633 static void ImpRotate(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* /*p2*/, const… in ImpRotate() argument
636 …if (pC1!=nullptr) RotatePoint(*pC1,*static_cast<const Point*>(p1),*static_cast<const double*>(p3),… in ImpRotate()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/svx/source/svdraw/ |
| H A D | svdtrans.cxx | 166 bool bC1=pC1!=nullptr; in CrookRotateXPoint()
181 pC1->setY(FRound(static_cast<double>(pC1->Y()) /rRad.X()*(cx-pC1->X())) ); in CrookRotateXPoint()
189 pC1->setX(FRound(static_cast<double>(pC1->X())*nFact) ); in CrookRotateXPoint()
220 bool bC1=pC1!=nullptr; in CrookSlantXPoint()
256 …if (bC1) { if (bVert) pC1->AdjustY( -(y0-rCenter.Y()) ); else pC1->AdjustX( -(x0-rCenter.X()) ); R… in CrookSlantXPoint()
299 Point* pC1=nullptr; in CrookRotatePoly() local
302 pC1=pPnt; in CrookRotatePoly()
322 Point* pC1=nullptr; in CrookSlantPoly() local
325 pC1=pPnt; in CrookSlantPoly()
345 Point* pC1=nullptr; in CrookStretchPoly() local
[all …]
|
| H A D | svdpoev.cxx | 599 static void ImpMove(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* /*p2*/, const v… in ImpMove() argument
602 if (pC1!=nullptr) pC1->Move(*static_cast<const Size*>(p1)); in ImpMove()
616 static void ImpResize(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* p2, const voi… in ImpResize() argument
619 …if (pC1!=nullptr) ResizePoint(*pC1,*static_cast<const Point*>(p1),*static_cast<const Fraction*>(p2… in ImpResize()
633 static void ImpRotate(Point& rPt, Point* pC1, Point* pC2, const void* p1, const void* /*p2*/, const… in ImpRotate() argument
636 …if (pC1!=nullptr) RotatePoint(*pC1,*static_cast<const Point*>(p1),*static_cast<const double*>(p3),… in ImpRotate()
|
| /dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/dar/ |
| H A D | darCut.c | 258 assert( pC0->nLeaves >= pC1->nLeaves ); in Dar_CutMergeOrdered()
261 if ( pC0->nLeaves == 4 && pC1->nLeaves == 4 ) in Dar_CutMergeOrdered()
263 if ( pC0->uSign != pC1->uSign ) in Dar_CutMergeOrdered()
277 if ( (pC0->uSign & pC1->uSign) != pC1->uSign ) in Dar_CutMergeOrdered()
279 for ( i = 0; i < (int)pC1->nLeaves; i++ ) in Dar_CutMergeOrdered()
297 if ( k == (int)pC1->nLeaves ) in Dar_CutMergeOrdered()
309 if ( k == (int)pC1->nLeaves ) in Dar_CutMergeOrdered()
314 pC->pLeaves[c] = pC1->pLeaves[k++]; in Dar_CutMergeOrdered()
317 if ( pC0->pLeaves[i] < pC1->pLeaves[k] ) in Dar_CutMergeOrdered()
322 if ( pC0->pLeaves[i] > pC1->pLeaves[k] ) in Dar_CutMergeOrdered()
[all …]
|
| /dports/devel/poco/poco-1.10.1-all/Foundation/testsuite/src/ |
| H A D | LoggingRegistryTest.cpp | 44 Channel::Ptr pC1 = new ConsoleChannel(); in testRegister() local
49 reg.registerChannel("c1", pC1); in testRegister()
55 assertTrue (pC1 == pC); in testRegister()
81 Channel::Ptr pC1 = new ConsoleChannel(); in testReregister() local
88 reg.registerChannel("c1", pC1); in testReregister()
116 Channel::Ptr pC1 = new ConsoleChannel(); in testUnregister() local
121 reg.registerChannel("c1", pC1); in testUnregister()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/dar/ |
| H A D | darCut.c | 270 assert( pC0->nLeaves >= pC1->nLeaves ); in Dar_CutMergeOrdered()
273 if ( pC0->nLeaves == 4 && pC1->nLeaves == 4 ) in Dar_CutMergeOrdered()
275 if ( pC0->uSign != pC1->uSign ) in Dar_CutMergeOrdered()
289 if ( (pC0->uSign & pC1->uSign) != pC1->uSign ) in Dar_CutMergeOrdered()
291 for ( i = 0; i < (int)pC1->nLeaves; i++ ) in Dar_CutMergeOrdered()
309 if ( k == (int)pC1->nLeaves ) in Dar_CutMergeOrdered()
321 if ( k == (int)pC1->nLeaves ) in Dar_CutMergeOrdered()
326 pC->pLeaves[c] = pC1->pLeaves[k++]; in Dar_CutMergeOrdered()
329 if ( pC0->pLeaves[i] < pC1->pLeaves[k] ) in Dar_CutMergeOrdered()
334 if ( pC0->pLeaves[i] > pC1->pLeaves[k] ) in Dar_CutMergeOrdered()
[all …]
|
| /dports/audio/opencore-amr/opencore-amr-0.1.5/opencore/codecs_v2/audio/gsm_amr/amr_nb/enc/src/ |
| H A D | inter_36.cpp | 163 const Word16 *pC1; in Interpol_3or6() local
184 pC1 = &inter_6[frac]; in Interpol_3or6()
193 s = amrnb_fxp_mac_16_by_16bb((Word32) * (pX1--), (Word32) pC1[k], s); in Interpol_3or6()
196 s = amrnb_fxp_mac_16_by_16bb((Word32) * (pX1--), (Word32) pC1[k], s); in Interpol_3or6()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/csw/ |
| H A D | cswCut.c | 297 assert( pC0->nFanins >= pC1->nFanins ); in Csw_CutMergeOrdered()
302 if ( pC0->pFanins[i] != pC1->pFanins[i] ) in Csw_CutMergeOrdered()
312 for ( i = 0; i < pC1->nFanins; i++ ) in Csw_CutMergeOrdered()
315 if ( pC0->pFanins[k] == pC1->pFanins[i] ) in Csw_CutMergeOrdered()
330 if ( k == pC1->nFanins ) in Csw_CutMergeOrdered()
342 if ( k == pC1->nFanins ) in Csw_CutMergeOrdered()
347 pC->pFanins[c] = pC1->pFanins[k++]; in Csw_CutMergeOrdered()
350 if ( pC0->pFanins[i] < pC1->pFanins[k] ) in Csw_CutMergeOrdered()
355 if ( pC0->pFanins[i] > pC1->pFanins[k] ) in Csw_CutMergeOrdered()
357 pC->pFanins[c] = pC1->pFanins[k++]; in Csw_CutMergeOrdered()
[all …]
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/ |
| H A D | aigCuts.c | 424 assert( pC0->nFanins >= pC1->nFanins ); in Aig_CutMergeOrdered()
429 if ( pC0->pFanins[i] != pC1->pFanins[i] ) in Aig_CutMergeOrdered()
439 for ( i = 0; i < pC1->nFanins; i++ ) in Aig_CutMergeOrdered()
442 if ( pC0->pFanins[k] == pC1->pFanins[i] ) in Aig_CutMergeOrdered()
457 if ( k == pC1->nFanins ) in Aig_CutMergeOrdered()
469 if ( k == pC1->nFanins ) in Aig_CutMergeOrdered()
474 pC->pFanins[c] = pC1->pFanins[k++]; in Aig_CutMergeOrdered()
477 if ( pC0->pFanins[i] < pC1->pFanins[k] ) in Aig_CutMergeOrdered()
482 if ( pC0->pFanins[i] > pC1->pFanins[k] ) in Aig_CutMergeOrdered()
484 pC->pFanins[c] = pC1->pFanins[k++]; in Aig_CutMergeOrdered()
[all …]
|
| /dports/graphics/pear-Image_Graph/Image_Graph-0.8.0/Graph/Plot/Smoothed/ |
| H A D | Bezier.php | 137 $pC1['X'] = Image_Graph_Tool::controlPoint($p0['X'], $p1['X'], $p2['X']);
138 $pC1['Y'] = Image_Graph_Tool::controlPoint($p0['Y'], $p1['Y'], $p2['Y']);
145 'P1X' => $pC1['X'],
146 'P1Y' => $pC1['Y'],
|
| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/2geom/ |
| H A D | bezier-clipping.cpp | 834 std::vector<Point> pC1, pC2; in iterate() local
838 pC1 = pC2 = pA; in iterate()
839 portion(pC1, H1_INTERVAL); in iterate()
851 pC1 = pC2 = pB; in iterate()
852 portion(pC1, H1_INTERVAL); in iterate()
981 std::vector<Point> pC1, pC2; in iterate() local
989 pC1 = pC2 = pA; in iterate()
990 portion(pC1, H1_INTERVAL); in iterate()
1020 pC1 = pC2 = pB; in iterate()
1021 portion(pC1, H1_INTERVAL); in iterate()
[all …]
|
| /dports/math/lib2geom/lib2geom-1.1/src/2geom/ |
| H A D | bezier-clipping.cpp | 834 std::vector<Point> pC1, pC2; in iterate() local
838 pC1 = pC2 = pA; in iterate()
839 portion(pC1, H1_INTERVAL); in iterate()
851 pC1 = pC2 = pB; in iterate()
852 portion(pC1, H1_INTERVAL); in iterate()
981 std::vector<Point> pC1, pC2; in iterate() local
989 pC1 = pC2 = pA; in iterate()
990 portion(pC1, H1_INTERVAL); in iterate()
1020 pC1 = pC2 = pB; in iterate()
1021 portion(pC1, H1_INTERVAL); in iterate()
[all …]
|
| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/2geom/orphan-code/ |
| H A D | intersection-by-bezier-clipping.cpp | 454 std::vector<Point> pC1, pC2; in intersection() local
462 pC1 = pC2 = pA; in intersection()
463 portion(pC1, H1_INTERVAL); in intersection()
468 intersection(domsA, domsB, pC1, pB, dompC1, dompB, precision); in intersection()
477 pC1 = pC2 = pB; in intersection()
478 portion(pC1, H1_INTERVAL); in intersection()
483 intersection(domsB, domsA, pC1, pA, dompC1, dompA, precision); in intersection()
|
| /dports/math/lib2geom/lib2geom-1.1/src/2geom/orphan-code/ |
| H A D | intersection-by-bezier-clipping.cpp | 454 std::vector<Point> pC1, pC2; in intersection() local
462 pC1 = pC2 = pA; in intersection()
463 portion(pC1, H1_INTERVAL); in intersection()
468 intersection(domsA, domsB, pC1, pB, dompC1, dompB, precision); in intersection()
477 pC1 = pC2 = pB; in intersection()
478 portion(pC1, H1_INTERVAL); in intersection()
483 intersection(domsB, domsA, pC1, pA, dompC1, dompA, precision); in intersection()
|
| /dports/cad/alliance/alliance/src/log/src/ |
| H A D | log_bdd1.c | 436 proofCct (pC1, pC2) in proofCct() argument
437 pCircuit pC1, pC2; in proofCct()
445 printf ("\n\n******* PROOF between %s & %s *******\n", pC1->name, pC2->name);
446 pEl = (pC1->pTI)->pElem; /* pointeur courant de la table pTI */
447 for (i = 0; i < (pC1->pTI)->length; i++)
465 pEl = (pC1->pTO)->pElem; /* pointeur courant de la table CC1 */
467 for (i = 0; i < (pC1->pTO)->length; i++)
485 expr = bddToAbl ((pNode) pEl->value, pC1->pNameI);
|
| /dports/games/retroarch/RetroArch-1.9.7/gfx/include/d3d8/ |
| H A D | d3dx8math.inl | 1619 if(!pOut || !pC1 || !pC2)
1623 pOut->r = pC1->r + pC2->r;
1624 pOut->g = pC1->g + pC2->g;
1625 pOut->b = pC1->b + pC2->b;
1634 if(!pOut || !pC1 || !pC2)
1664 if(!pOut || !pC1 || !pC2)
1679 if(!pOut || !pC1 || !pC2)
1683 pOut->r = pC1->r + s * (pC2->r - pC1->r);
1684 pOut->g = pC1->g + s * (pC2->g - pC1->g);
1685 pOut->b = pC1->b + s * (pC2->b - pC1->b);
[all …]
|
| /dports/games/xray_re-tools/xray_re-tools-52721d2/sources/3rd-party/dx8sdk/include/ |
| H A D | d3dx8math.inl | 1685 if(!pOut || !pC1 || !pC2)
1689 pOut->r = pC1->r + pC2->r;
1690 pOut->g = pC1->g + pC2->g;
1691 pOut->b = pC1->b + pC2->b;
1700 if(!pOut || !pC1 || !pC2)
1730 if(!pOut || !pC1 || !pC2)
1745 if(!pOut || !pC1 || !pC2)
1749 pOut->r = pC1->r + s * (pC2->r - pC1->r);
1750 pOut->g = pC1->g + s * (pC2->g - pC1->g);
1751 pOut->b = pC1->b + s * (pC2->b - pC1->b);
[all …]
|