Home
last modified time | relevance | path

Searched refs:sCost (Results 1 – 22 of 22) sorted by relevance

/dports/net/nncp/nncp-8.0.2/src/vendor/go.cypherpunks.ru/balloon/
H A Dballoon.go54 func B(h hash.Hash, passwd, salt []byte, sCost, tCost uint64) []byte { argument
58 buf := make([]byte, 0, sCost*hSize)
67 for m = 1; m < sCost; m++ {
80 bs := big.NewInt(int64(sCost))
83 for m = 0; m < sCost; m++ {
86 prev = buf[(sCost-1)*hSize:]
126 return buf[(sCost-1)*hSize:]
138 func H(hasher func() hash.Hash, passwd, salt []byte, sCost, tCost int, jobs int) []byte { argument
146 results <- B(hasher(), passwd, saltBuf, uint64(sCost), uint64(tCost))
H A Dballoon_test.go60 sCost := uint64(1 << 10 / h.Size())
63 B(h, passwd, salt, sCost, 4)
72 sCost := 1 << 10 / sha512.New().Size()
75 H(sha512.New, passwd, salt, sCost, 4, 4)
/dports/editors/yudit/yudit-3.0.7/bin/
H A Dangles.pl121 my $sCost = int((($pi/60.0)*$angScale)+0.5);
131 print "dRadMax=$dRadMax dRadConv=$dRadConv sCost=$sCost sCostConv=$sCostConv\n";
146 $retcost = int(($dRad * $angScale) + 0.5) + $sCost;
148 $mycost = $i64th * $sCostConv + $sCost;
/dports/net/nncp/nncp-8.0.2/src/
H A Deblob.go57 func NewEBlob(sCost, tCost, pCost int, password, data []byte) ([]byte, error) { argument
65 SCost: uint32(sCost),
75 key := balloon.H(blake256, password, salt[:], sCost, tCost, pCost)
/dports/games/assaultcube/AssaultCube_v1.2.0.2/source/src/bot/
H A Dbot_waypoint.h62 short sCost; // Base and static cost member
69 node_s(void) : iFlags(0), sTriggerNr(0), sYaw(-1), sCost(10) { }; in node_s()
74 sCost(0) { }; in v_origin()
H A Dbot_waypoint.cpp617 AddScreenText("Base Cost: %d", nearestwp->sCost); in Think()
1265 pNode->sCost = (short)flCost; in CalcCost()
2844 return (GetDistance(pWP1->pNode->v_origin, pWP2->pNode->v_origin) * pWP2->pNode->sCost); in AStarCost()
/dports/games/jaggedalliance2/ja2-stracciatella-0.18.0/src/game/Tactical/
H A DSoldier_Tile.cc398 INT16 sCost; in HandleNextTileWaiting() local
493 …sCost = (INT16) FindBestPath( pSoldier, sCheckGridNo, pSoldier->bLevel, pSoldier->usUIMovementMode… in HandleNextTileWaiting()
497 if ( sCost > 0 ) in HandleNextTileWaiting()
513 …sCost = (INT16) FindBestPath( pSoldier, sCheckGridNo, pSoldier->bLevel, pSoldier->usUIMovementMode… in HandleNextTileWaiting()
H A DPoints.cc1211 INT16 sGridno,sCost; in MinPtsToMove() local
1223 if ( (sCost=ActionPointCost( pSoldier, sGridno, cnt , pSoldier->usUIMovementMode ) ) < sLowest ) in MinPtsToMove()
1225 sLowest = sCost; in MinPtsToMove()
1235 INT16 sGridno,sCost; in PtsToMoveDirection() local
1251 sCost = ActionPointCost( pSoldier, sGridno, bDirection , usMoveModeToUse ); in PtsToMoveDirection()
1257 sCost += AP_START_RUN_COST; in PtsToMoveDirection()
1261 return( (INT8)sCost ); in PtsToMoveDirection()
/dports/databases/sqlite3/sqlite-src-3350500/ext/misc/
H A Damatch.c468 amatch_avl sCost; /* Linkage of this node into the cost tree */ member
1061 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1068 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1082 pWord->sCost.zKey = pWord->zCost; in amatchAddWord()
1083 pWord->sCost.pWord = pWord; in amatchAddWord()
1084 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1151 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchNext()
/dports/databases/sqlcipher/sqlcipher-3.4.2/ext/misc/
H A Damatch.c468 amatch_avl sCost; /* Linkage of this node into the cost tree */ member
1060 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1067 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1081 pWord->sCost.zKey = pWord->zCost; in amatchAddWord()
1082 pWord->sCost.pWord = pWord; in amatchAddWord()
1083 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1150 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchNext()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/ext/misc/
H A Damatch.c468 amatch_avl sCost; /* Linkage of this node into the cost tree */ member
1061 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1068 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1082 pWord->sCost.zKey = pWord->zCost; in amatchAddWord()
1083 pWord->sCost.pWord = pWord; in amatchAddWord()
1084 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1151 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchNext()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/ext/misc/
H A Damatch.c468 amatch_avl sCost; /* Linkage of this node into the cost tree */ member
1061 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1068 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1082 pWord->sCost.zKey = pWord->zCost; in amatchAddWord()
1083 pWord->sCost.pWord = pWord; in amatchAddWord()
1084 pOther = amatchAvlInsert(&pCur->pCost, &pWord->sCost); in amatchAddWord()
1151 amatchAvlRemove(&pCur->pCost, &pWord->sCost); in amatchNext()
/dports/databases/db5/db-5.3.28/lang/sql/sqlite/src/
H A Dwhere.c4600 &sCost, pp); in sqlite3WhereBegin()
4605 &sCost); in sqlite3WhereBegin()
4607 assert( isOptimal || (sCost.used&notReady)==0 ); in sqlite3WhereBegin()
4612 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0 in sqlite3WhereBegin()
4613 || sCost.plan.u.pIdx==pTabItem->pIndex ); in sqlite3WhereBegin()
4639 if( (sCost.used&notReady)==0 /* (1) */ in sqlite3WhereBegin()
4642 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0) in sqlite3WhereBegin()
4646 || (sCost.rCost<=bestPlan.rCost in sqlite3WhereBegin()
4647 && sCost.plan.nRow<bestPlan.plan.nRow)) in sqlite3WhereBegin()
4651 j, sCost.rCost, sCost.plan.nRow)); in sqlite3WhereBegin()
[all …]
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcModel.cpp10965 double sCost;
10967 sCost = P_FACTOR * obj1->downShadowPrice();
10968 if (!obj1->numberTimesDown() || sCost > pCost)
10969 obj1->updateDownDynamicPseudoCost(sCost);
10972 sCost = P_FACTOR * obj1->upShadowPrice();
10973 if (!obj1->numberTimesUp() || sCost > pCost)
10974 obj1->updateUpDynamicPseudoCost(sCost);
/dports/databases/db5/db-5.3.28/lang/sql/generated/
H A Dsqlite3.c93351 &sCost, pp);
93356 &sCost);
93358 assert( isOptimal || (sCost.used&notReady)==0 );
93363 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
93364 || sCost.plan.u.pIdx==pTabItem->pIndex );
93390 if( (sCost.used&notReady)==0 /* (1) */
93393 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
93397 || (sCost.rCost<=bestPlan.rCost
93398 && sCost.plan.nRow<bestPlan.plan.nRow))
93402 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/fdbserver/sqlite/
H A Dsqlite3.amalgamation.c86765 &sCost, pp);
86770 &sCost);
86772 assert( isOptimal || (sCost.used&notReady)==0 );
86777 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
86778 || sCost.plan.u.pIdx==pTabItem->pIndex );
86804 if( (sCost.used&notReady)==0 /* (1) */
86807 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
86811 || (sCost.rCost<=bestPlan.rCost
86812 && sCost.plan.nRow<bestPlan.plan.nRow))
86816 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/games/pokerth/pokerth-1.1.2-rc/src/third_party/sqlite3/
H A Dsqlite3.c107397 &sCost, pp);
107402 pDist, &sCost);
107404 assert( isOptimal || (sCost.used&notReady)==0 );
107409 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
107410 || sCost.plan.u.pIdx==pTabItem->pIndex );
107436 if( (sCost.used&notReady)==0 /* (1) */
107439 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
107443 || (sCost.rCost<=bestPlan.rCost
107444 && sCost.plan.nRow<bestPlan.plan.nRow))
107448 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/sqlite/
H A Dsqlite3.c102964 &sCost, pp);
102969 &sCost);
102971 assert( isOptimal || (sCost.used&notReady)==0 );
102976 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
102977 || sCost.plan.u.pIdx==pTabItem->pIndex );
103003 if( (sCost.used&notReady)==0 /* (1) */
103006 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
103010 || (sCost.rCost<=bestPlan.rCost
103011 && sCost.plan.nRow<bestPlan.plan.nRow))
103015 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/sqlite/
H A Dsqlite3.c102928 &sCost, pp);
102933 &sCost);
102935 assert( isOptimal || (sCost.used&notReady)==0 );
102940 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
102941 || sCost.plan.u.pIdx==pTabItem->pIndex );
102967 if( (sCost.used&notReady)==0 /* (1) */
102970 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
102974 || (sCost.rCost<=bestPlan.rCost
102975 && sCost.plan.nRow<bestPlan.plan.nRow))
102979 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/irc/ircd-ratbox-devel/ircd-ratbox-3.0.7/bandb/sqlite3/
H A Dsqlite3.c105144 &sCost, pp);
105149 pDist, &sCost);
105151 assert( isOptimal || (sCost.used&notReady)==0 );
105156 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
105157 || sCost.plan.u.pIdx==pTabItem->pIndex );
105183 if( (sCost.used&notReady)==0 /* (1) */
105186 || (sCost.plan.wsFlags & WHERE_NOT_FULLSCAN)!=0)
105190 || (sCost.rCost<=bestPlan.rCost
105191 && sCost.plan.nRow<bestPlan.plan.nRow))
105195 j, sCost.rCost, sCost.plan.nRow));
[all …]
/dports/devel/raknet/raknet-3.9.2_10,1/DependentExtensions/SQLite3Plugin/
H A Dsqlite3.c84015 WhereCost sCost; /* Cost information from bestIndex() */
84029 sCost.rCost = bestVirtualIndex(pParse, pWC, pTabItem, notReady,
84032 sCost.plan.wsFlags = WHERE_VIRTUALTABLE;
84033 sCost.plan.u.pVtabIdx = pVtabIdx = *ppIdxInfo;
84035 sCost.plan.wsFlags = WHERE_VIRTUALTABLE | WHERE_ORDERBY;
84037 sCost.plan.nEq = 0;
84039 if( (SQLITE_BIG_DBL/((double)2))<sCost.rCost ){
84045 sCost.rCost = (SQLITE_BIG_DBL/((double)2));
84051 (i==0 && ppOrderBy) ? *ppOrderBy : 0, &sCost);
84053 if( once==0 || sCost.rCost<bestPlan.rCost ){
[all …]
/dports/math/vtk6/VTK-6.2.0/ThirdParty/sqlite/vtksqlite/
H A Dvtk_sqlite3.c90294 WhereCost sCost; /* Cost information from best[Virtual]Index() */
90310 bestVirtualIndex(pParse, pWC, pTabItem, mask, pOrderBy, &sCost, pp);
90314 bestBtreeIndex(pParse, pWC, pTabItem, mask, pOrderBy, &sCost);
90316 assert( isOptimal || (sCost.used&notReady)==0 );
90318 if( (sCost.used&notReady)==0
90319 && (j==iFrom || sCost.rCost<bestPlan.rCost)
90321 bestPlan = sCost;