Home
last modified time | relevance | path

Searched refs:nLocal (Results 1 – 2 of 2) sorted by relevance

/illumos-gate/usr/src/common/ficl/
H A Dprimitives.c2359 ficlInteger nLocal = vm->runningWord->param[0].i; in ficlLocalParenIm() local
2376 ficlStackPush(stack, vm->returnStack->frame[nLocal]); in ficlLocalParenIm()
2378 ficlStackPush(stack, vm->returnStack->frame[nLocal+1]); in ficlLocalParenIm()
2390 if (nLocal == 0) { in ficlLocalParenIm()
2394 } else if ((nLocal == 1) && !isDouble) { in ficlLocalParenIm()
2406 ficlDictionaryAppendUnsigned(dictionary, nLocal); in ficlLocalParenIm()
2571 ficlInteger nLocal; in ficlPrimitiveToValue() local
2611 nLocal = word->param[0].i; in ficlPrimitiveToValue()
2617 if (nLocal == 0) { in ficlPrimitiveToValue()
2622 } else if ((nLocal == 1) && !isDouble) { in ficlPrimitiveToValue()
[all …]
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree.c1338 int n, c, rc, nLocal; in fileBtreeKeyCompare() local
1346 nLocal = NKEY(pBt, pCell->h) - nIgnore; in fileBtreeKeyCompare()
1347 if( nLocal<0 ) nLocal = 0; in fileBtreeKeyCompare()
1348 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1359 nLocal -= n; in fileBtreeKeyCompare()
1361 while( nKey>0 && nLocal>0 ){ in fileBtreeKeyCompare()
1371 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1382 nLocal -= n; in fileBtreeKeyCompare()
1386 c = nLocal - nKey; in fileBtreeKeyCompare()