Home
last modified time | relevance | path

Searched refs:nIn (Results 1 – 7 of 7) sorted by relevance

/freebsd-12.1/contrib/bzip2/
H A Dunzcrash.c44 int nIn, nOut, nZ; variable
92 nIn = fread ( inbuf, 1, M_BLOCK, f ); in main()
93 fprintf ( stderr, "%d bytes read\n", nIn ); in main()
97 zbuf, &nZ, inbuf, nIn, 9, 0, 30 ); in main()
113 if (nOut != nIn) { in main()
114 fprintf(stderr, "nIn/nOut mismatch %d %d\n", nIn, nOut ); in main()
130 assert (nOut == nIn); in main()
/freebsd-12.1/contrib/netbsd-tests/bin/sh/
H A Dt_redir.sh776 atf_check -s exit:0 -o inline:'In-Func\nIn-Func\nsuccess6\n' -e empty \
778 atf_check -s exit:0 -o inline:'In-Func\nIn-Func\nsuccess7\n' -e empty \
780 atf_check -s exit:0 -o inline:'In-Func\nIn-Func\nsuccess8\n' -e empty \
/freebsd-12.1/usr.sbin/bsdconfig/security/include/
H A Dmessages.subr46 …,\nwhich may increase resistance to exploits and protect system integrity.\nIn secure mode system …
/freebsd-12.1/contrib/sqlite3/
H A Dshell.c2236 sqlite3_int64 nIn; in readFileContents() local
2247 nIn = ftell(in); in readFileContents()
2251 if( nIn>mxBlob ){ in readFileContents()
2256 pBuf = sqlite3_malloc64( nIn ? nIn : 1 ); in readFileContents()
2262 if( nIn==(sqlite3_int64)fread(pBuf, 1, (size_t)nIn, in) ){ in readFileContents()
5980 sz = nIn; in zipfileUpdate()
5982 nData = nIn; in zipfileUpdate()
7643 if( nIn ) memcpy(zRet, zIn, nIn); in idxAppendText()
12524 long nIn; in readFile() local
12529 nIn = ftell(in); in readFile()
[all …]
H A Dsqlite3.h10702 int nIn, const void *pIn, /* Input changeset */
11355 int nIn, const void *pIn,
H A Dsqlite3.c118017 nIn -= len;
118028 nIn -= len;
147295 int nIn = 0;
173293 int nIn = n;
173393 nIn -= nByte;
174661 if( nIn>mx*2 ){
174662 for(j=mx, i=nIn-mx; i<nIn; i++, j++){
174699 if( nIn<3 || nIn>=(int)sizeof(zReverse)-7 ){
206193 pIn += nIn;
210912 if( nIn<0 ){
[all …]
/freebsd-12.1/crypto/heimdal/lib/sqlite/
H A Dsqlite3.c85160 while( nIn>0 ){
85168 nIn -= len;
85172 while( nIn>0 ){
85176 if( len<=nIn && memcmp(&zIn[nIn-len],azChar[i],len)==0 ) break;
85179 nIn -= len;
103826 pLevel->u.in.nIn++;
120113 int nIn = n;
120206 nIn -= nByte;
121194 if( nIn>mx*2 ){
121195 for(j=mx, i=nIn-mx; i<nIn; i++, j++){
[all …]