| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/ |
| H A D | giaCut.c | 99 int nSizeB = pBase->nLeaves; in Gia_CutCheck() local
105 for ( k = 0; k < nSizeB; k++ ) in Gia_CutCheck()
108 if ( k == nSizeB ) in Gia_CutCheck()
239 int i, nSizeB = pBase->nLeaves; in Gia_CutSetCutIsContainedOrder() local
241 if ( nSizeB == nSizeC ) in Gia_CutSetCutIsContainedOrder()
243 for ( i = 0; i < nSizeB; i++ ) in Gia_CutSetCutIsContainedOrder()
248 assert( nSizeB > nSizeC ); in Gia_CutSetCutIsContainedOrder()
251 for ( i = k = 0; i < nSizeB; i++ ) in Gia_CutSetCutIsContainedOrder()
|
| H A D | giaKf.c | 322 int nSizeB = pBase->nLeaves;
329 for ( k = 0; k < nSizeB; k++ )
332 if ( k == nSizeB )
539 int nSizeB = pBase->nLeaves;
544 assert( nSizeB >= nSizeC );
547 for ( k = 0; k < nSizeB; k++ )
550 if ( k == nSizeB )
661 int nSizeB = pBase->nLeaves;
664 if ( nSizeB == nSizeC )
666 for ( i = 0; i < nSizeB; i++ )
[all …]
|
| H A D | giaBalLut.c | 170 int nSizeB = pBase->nLeaves; in Bal_CutCheck() local
176 for ( k = 0; k < nSizeB; k++ ) in Bal_CutCheck()
179 if ( k == nSizeB ) in Bal_CutCheck()
314 int i, nSizeB = pBase->nLeaves; in Bal_SetCutIsContainedOrder() local
316 if ( nSizeB == nSizeC ) in Bal_SetCutIsContainedOrder()
318 for ( i = 0; i < nSizeB; i++ ) in Bal_SetCutIsContainedOrder()
323 assert( nSizeB > nSizeC ); in Bal_SetCutIsContainedOrder()
326 for ( i = k = 0; i < nSizeB; i++ ) in Bal_SetCutIsContainedOrder()
|
| H A D | giaPf.c | 534 int nSizeB = pBase->nLeaves; in Pf_CutCheck() local
540 for ( k = 0; k < nSizeB; k++ ) in Pf_CutCheck()
543 if ( k == nSizeB ) in Pf_CutCheck()
677 int i, nSizeB = pBase->nLeaves; in Pf_SetCutIsContainedOrder() local
679 if ( nSizeB == nSizeC ) in Pf_SetCutIsContainedOrder()
681 for ( i = 0; i < nSizeB; i++ ) in Pf_SetCutIsContainedOrder()
686 assert( nSizeB > nSizeC ); in Pf_SetCutIsContainedOrder()
689 for ( i = k = 0; i < nSizeB; i++ ) in Pf_SetCutIsContainedOrder()
|
| H A D | giaSatLE.c | 120 int i, nSizeB = Sle_CutSize(pBase); in Sle_SetCutIsContainedOrder() local
124 if ( nSizeB == nSizeC ) in Sle_SetCutIsContainedOrder()
126 for ( i = 0; i < nSizeB; i++ ) in Sle_SetCutIsContainedOrder()
131 assert( nSizeB > nSizeC ); in Sle_SetCutIsContainedOrder()
134 for ( i = k = 0; i < nSizeB; i++ ) in Sle_SetCutIsContainedOrder()
|
| H A D | giaOf.c | 443 int nSizeB = pBase->nLeaves; in Of_CutCheck() local
449 for ( k = 0; k < nSizeB; k++ ) in Of_CutCheck()
452 if ( k == nSizeB ) in Of_CutCheck()
586 int i, nSizeB = pBase->nLeaves; in Of_SetCutIsContainedOrder() local
588 if ( nSizeB == nSizeC ) in Of_SetCutIsContainedOrder()
590 for ( i = 0; i < nSizeB; i++ ) in Of_SetCutIsContainedOrder()
595 assert( nSizeB > nSizeC ); in Of_SetCutIsContainedOrder()
598 for ( i = k = 0; i < nSizeB; i++ ) in Of_SetCutIsContainedOrder()
|
| H A D | giaMf.c | 776 int nSizeB = pBase->nLeaves; in Mf_CutCheck() local
782 for ( k = 0; k < nSizeB; k++ ) in Mf_CutCheck()
785 if ( k == nSizeB ) in Mf_CutCheck()
919 int i, nSizeB = pBase->nLeaves; in Mf_SetCutIsContainedOrder() local
921 if ( nSizeB == nSizeC ) in Mf_SetCutIsContainedOrder()
923 for ( i = 0; i < nSizeB; i++ ) in Mf_SetCutIsContainedOrder()
928 assert( nSizeB > nSizeC ); in Mf_SetCutIsContainedOrder()
931 for ( i = k = 0; i < nSizeB; i++ ) in Mf_SetCutIsContainedOrder()
|
| H A D | giaNf.c | 612 int nSizeB = pBase->nLeaves; in Nf_CutCheck() local
618 for ( k = 0; k < nSizeB; k++ ) in Nf_CutCheck()
621 if ( k == nSizeB ) in Nf_CutCheck()
755 int i, nSizeB = pBase->nLeaves; in Nf_SetCutIsContainedOrder() local
757 if ( nSizeB == nSizeC ) in Nf_SetCutIsContainedOrder()
759 for ( i = 0; i < nSizeB; i++ ) in Nf_SetCutIsContainedOrder()
764 assert( nSizeB > nSizeC ); in Nf_SetCutIsContainedOrder()
767 for ( i = k = 0; i < nSizeB; i++ ) in Nf_SetCutIsContainedOrder()
|
| H A D | giaLf.c | 631 int nSizeB = pBase->nLeaves; in Lf_CutCheck() local
637 for ( k = 0; k < nSizeB; k++ ) in Lf_CutCheck()
640 if ( k == nSizeB ) in Lf_CutCheck()
800 int i, nSizeB = pBase->nLeaves; in Lf_SetCutIsContainedOrder() local
802 if ( nSizeB == nSizeC ) in Lf_SetCutIsContainedOrder()
804 for ( i = 0; i < nSizeB; i++ ) in Lf_SetCutIsContainedOrder()
809 assert( nSizeB > nSizeC ); in Lf_SetCutIsContainedOrder()
812 for ( i = k = 0; i < nSizeB; i++ ) in Lf_SetCutIsContainedOrder()
|
| H A D | giaJf.c | 556 int nSizeB = Jf_CutSize(pBase); in Jf_CutIsContainedOrder() local
559 if ( nSizeB == nSizeC ) in Jf_CutIsContainedOrder()
561 for ( i = 1; i <= nSizeB; i++ ) in Jf_CutIsContainedOrder()
566 assert( nSizeB > nSizeC ); in Jf_CutIsContainedOrder()
567 for ( i = k = 1; i <= nSizeB; i++ ) in Jf_CutIsContainedOrder()
|
| /dports/science/iboview/ibo-view.20150427/src/MicroScf/ |
| H A D | CtInt1e.h | 99 nSizeA, nSizeB; member
107 return Data[a + nSizeA*(b + iComp * nSizeB)]; in Int()
|
| H A D | CtAtomSet.cpp | 633 assert( IntResult.nSizeB == pShellB->nFn() ); in Add1eIntegralMatrix()
635 assert( StartFnB + IntResult.nSizeB <= ColBasis.nFn() ); in Add1eIntegralMatrix()
639 for ( size_t j_ = 0; j_ < IntResult.nSizeB; ++ j_ ) in Add1eIntegralMatrix()
701 for ( size_t j_ = 0; j_ < IntResult.nSizeB; ++ j_ ) in Make1eIntegralMatrixMultiComp()
|
| H A D | CtBasisSet.cpp | 224 nSizeB = pShellB->nFn(); in MakeIntMatrix() local
226 nSizeB == BasisCol.nFn(iShellB)); in MakeIntMatrix()
232 for ( size_t j_ = 0; j_ < nSizeB; ++ j_ ) in MakeIntMatrix()
|
| H A D | CtInt1e.cpp | 926 Result.nSizeB = b->nFn();
930 Result.Data.resize_and_clear(Result.nSizeA * Result.nSizeB * nIntComps);
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/ |
| H A D | acec2Mult.c | 343 int nSizeB = pBase->nLeaves; in Sdb_CutCheck() local
349 for ( k = 0; k < nSizeB; k++ ) in Sdb_CutCheck()
352 if ( k == nSizeB ) in Sdb_CutCheck()
483 int i, nSizeB = pBase->nLeaves; in Sdb_CutSetCutIsContainedOrder() local
485 if ( nSizeB == nSizeC ) in Sdb_CutSetCutIsContainedOrder()
487 for ( i = 0; i < nSizeB; i++ ) in Sdb_CutSetCutIsContainedOrder()
492 assert( nSizeB > nSizeC ); in Sdb_CutSetCutIsContainedOrder()
495 for ( i = k = 0; i < nSizeB; i++ ) in Sdb_CutSetCutIsContainedOrder()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/sfx2/source/control/ |
| H A D | listview.cxx | 223 sal_uInt64 nSizeA, nSizeB; in sortColumn() local
225 nSizeB = pItemB->mnSize; in sortColumn()
227 if (nSizeA < nSizeB) in sortColumn()
229 else if (nSizeA > nSizeB) in sortColumn()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sbd/ |
| H A D | sbdCut.c | 104 int nSizeB = pBase->nLeaves; in Sbd_CutCheck() local
110 for ( k = 0; k < nSizeB; k++ ) in Sbd_CutCheck()
113 if ( k == nSizeB ) in Sbd_CutCheck()
244 int i, nSizeB = pBase->nLeaves; in Sbd_CutSetCutIsContainedOrder() local
246 if ( nSizeB == nSizeC ) in Sbd_CutSetCutIsContainedOrder()
248 for ( i = 0; i < nSizeB; i++ ) in Sbd_CutSetCutIsContainedOrder()
253 assert( nSizeB > nSizeC ); in Sbd_CutSetCutIsContainedOrder()
256 for ( i = k = 0; i < nSizeB; i++ ) in Sbd_CutSetCutIsContainedOrder()
|
| /dports/games/crrcsim/crrcsim-0.9.13/src/mod_misc/ |
| H A D | SimpleXMLTransfer.cpp | 1590 int nSizeB; in equals() local
1648 nSizeB = item->getChildCount(); in equals()
1655 for (int m=0; m<nSizeB && !fFound; m++) in equals()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/if/ |
| H A D | ifCut.c | 47 int nSizeB = pBase->nLeaves; in If_CutVerifyCut() local
54 for ( k = 0; k < nSizeB; k++ ) in If_CutVerifyCut()
57 if ( k == nSizeB ) in If_CutVerifyCut()
|