/macosx-10.9.5/CommonCrypto-60049/include/ |
H A D | CommonBaseXX.h | 83 @param inLen The number of bytes to be processed. 93 const void *in, const size_t inLen, 155 @param inLen The number of bytes to be processed. 162 CNEncoderGetOutputLength(CNEncoderRef coderRef, const size_t inLen) 174 @param inLen The number of bytes to be processed. 183 const size_t inLen) 196 @param inLen The number of bytes to be processed. 206 CNEncoderUpdate(CNEncoderRef coderRef, const void *in, const size_t inLen, void *out,
|
H A D | CommonRSACryptor.h | 396 @param inLen The input data length. 413 size_t inLen,
|
/macosx-10.9.5/CommonCrypto-60049/lib/ |
H A D | CommonRSACryptor.c | 386 CCRSACryptorCrypt(CCRSACryptorRef rsaKey, const void *in, size_t inLen, void *out, size_t *outLen) argument 393 if(inLen != keysizeBytes || *outLen < keysizeBytes) return kCCMemoryFailure; 397 ccn_read_uint(n, buf, inLen, in);
|
/macosx-10.9.5/CommonCrypto-60049/libcn/ |
H A D | CommonBaseXX.c | 398 CNEncoderGetOutputLength(CNEncoderRef encoderRef, const size_t inLen) argument 406 retval = encodeLen(coderRef, inLen + coderRef->base256buffer->bufferPos) + 1; 408 retval = decodeLen(coderRef, inLen + coderRef->baseXXbuffer->bufferPos); 417 CNEncoderGetOutputLengthFromEncoding(CNEncodings encoding, CNEncodingDirection direction, const size_t inLen) argument 426 retval = encodeLen(coder, inLen) + 1; 428 retval = decodeLen(coder, inLen); 438 CNEncoderUpdate(CNEncoderRef coderRef, const void *in, const size_t inLen, void *out, size_t *outLen) argument 450 if(0 == inLen) { 460 retval = CNBufferProcessData(coderRef->base256buffer, coderRef, in, inLen, out, outLen, enCode, encodeLen); 462 retval = CNBufferProcessData(coderRef->baseXXbuffer, coderRef, in, inLen, ou 538 CNEncode(CNEncodings encoding, CNEncodingDirection direction, const void *in, const size_t inLen, void *out, size_t *outLen) argument [all...] |
H A D | CommonBuffering.c | 48 void *ctx, const void *in, const size_t inLen, void *out, size_t *outLen, 53 size_t inputLen = inLen, outputLen, inputUsing, outputAvailable; 57 if(sizeFunc(ctx, bufRef->bufferPos + inLen) > outputAvailable) return kCNBufferTooSmall; 47 CNBufferProcessData(CNBufferRef bufRef, void *ctx, const void *in, const size_t inLen, void *out, size_t *outLen, cnProcessFunction pFunc, cnSizeFunction sizeFunc) argument
|
H A D | CommonBufferingPriv.h | 42 typedef int (*cnProcessFunction)(void *ctx, const void *in, size_t inLen, void *out, size_t *outLen); 43 typedef size_t (*cnSizeFunction)(void *ctx, size_t inLen); 47 void *ctx, const void *in, const size_t inLen, void *out, size_t *outLen,
|
/macosx-10.9.5/ICU-511.35/icuSources/test/iotest/ |
H A D | filetst.c | 918 size_t inLen =0; 940 inLen = fread(inBuf, 1, 200, myCFile); 943 if(inLen<=0) { 949 for(i=0;i<(int32_t)inLen;i++) { 965 if(inLen != 12) { 966 log_err("Expected 12 bytes, read %d\n", inLen); 968 log_verbose("OK: read %d bytes\n", inLen);
|
/macosx-10.9.5/IOFireWireFamily-455.4.0/IOFireWireFamily.kmodproj/ |
H A D | IOFWAddressSpace.cpp | 362 UInt32 IOFWAddressSpace::doLock(UInt16 nodeID, IOFWSpeed &speed, FWAddress addr, UInt32 inLen, argument 373 size = inLen/8; // Depends on type, right for 'compare and swap' 374 outLen = inLen/2; // right for 'compare and swap'
|
H A D | IOFWUserPseudoAddressSpace.cpp | 577 UInt32 IOFWUserPseudoAddressSpace::doLock(UInt16 nodeID, IOFWSpeed &speed, FWAddress addr, UInt32 inLen, argument 587 if(addr.addressLo + inLen > fBase.addressLo+fLen) 592 return doPacket( nodeID, speed, addr, inLen, newVal, refcon, IOFWPacketHeader::kLockPacket, oldVal ) ; 595 return IOFWPseudoAddressSpace::doLock( nodeID, speed, addr, inLen, newVal, outLen, oldVal, type, refcon ) ;
|
H A D | IOFWUserPseudoAddressSpace.h | 257 UInt32 inLen,
|
H A D | IOFireWireController.cpp | 5902 UInt32 IOFireWireController::doLockSpace(UInt16 nodeID, IOFWSpeed &speed, FWAddress addr, UInt32 inLen, argument 5910 ret = found->doLock(nodeID, speed, addr, inLen, newVal, outLen, oldVal, type, refcon);
|
/macosx-10.9.5/IOFireWireFamily-455.4.0/IOFireWireLib.CFPlugInProj/ |
H A D | IOFireWireLib.h | 2165 @param inLen Length of the data being added. 2167 IOReturn (*AddEntry_Ptr)(IOFireWireLibLocalUnitDirectoryRef self, int key, void* inBuffer, size_t inLen, CFStringRef inDesc) ;
|
H A D | IOFireWireLibUnitDirectory.cpp | 258 size_t inLen, 261 return IOFireWireIUnknown::InterfaceMap<LocalUnitDirectory>::GetThis(self)->AddEntry(key, inBuffer, inLen, inDesc); 254 SAddEntry_Ptr( DirRef self, int key, void* inBuffer, size_t inLen, CFStringRef inDesc) argument
|
H A D | IOFireWireLibUnitDirectory.h | 61 size_t inLen, 83 size_t inLen,
|
/macosx-10.9.5/Security-55471.14.18/libsecurity_apple_csp/tests/ |
H A D | t-dsa.cpp | 90 unsigned int inLen; 91 check(B_EncryptUpdate(enc, crypt, &inLen, sizeof(crypt), 93 printf("EncryptUpdate output = %u\n", inLen); 94 check(B_EncryptFinal(enc, crypt, &inLen, sizeof(crypt), random, NULL)); 95 printf("EncryptFinal output=%u\n", inLen); 102 crypt, inLen, random, NULL));
|
H A D | t-rsa.cpp | 87 unsigned int inLen; local 88 check(B_EncryptUpdate(enc, crypt, &inLen, sizeof(crypt), 90 printf("EncryptUpdate output = %u\n", inLen); 91 check(B_EncryptFinal(enc, crypt, &inLen, sizeof(crypt), random, NULL)); 92 printf("EncryptFinal output=%u\n", inLen); 99 crypt, inLen, random, NULL));
|
/macosx-10.9.5/SmartCardServices-55111/src/PCSC/ |
H A D | tokenfactory.c | 97 int inLen; local 100 inLen = 0; 102 inLen = strlen(inStr); 104 if (inLen > MSC_MAXSIZE_AID) 109 for (i = 0; i < inLen; i += 2)
|
/macosx-10.9.5/passwordserver_sasl-170/cyrus_sasl/mac/libdes/src/ |
H A D | md5.c | 301 /*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
RCSID("$Id: md5.c,v 1.4 2005/01/10 19:09:06 snsimon Exp $");
#endif
#include <stdlib.h>
#include <string.h>
#include "md5.h"
#ifndef min
#define min(a,b) (((a)>(b))?(b):(a))
#endif
#define A m->counter[0]
#define B m->counter[1]
#define C m->counter[2]
#define D m->counter[3]
#define X data
void
md5_init (struct md5 *m)
{
m->offset = 0;
m->sz = 0;
D = 0x10325476;
C = 0x98badcfe;
B = 0xefcdab89;
A = 0x67452301;
}
static inline u_int32_t
cshift (u_int32_t x, unsigned int n)
{
return (x << n) | (x >> (32 - n));
}
#define F(x,y,z) ((x & y) | (~x & z))
#define G(x,y,z) ((x & z) | (y & ~z))
#define H(x,y,z) (x ^ y ^ z)
#define I(x,y,z) (y ^ (x | ~z))
#define DOIT(a,b,c,d,k,s,i,OP) \
a = b + cshift(a + OP(b,c,d) + X[k] + (i), s)
#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
#define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I)
static inline void
calc (struct md5 *m, u_int32_t *data)
{
u_int32_t AA, BB, CC, DD;
AA = A;
BB = B;
CC = C;
DD = D;
/* Round 1 */
DO1(A,B,C,D,0,7,0xd76aa478);
DO1(D,A,B,C,1,12,0xe8c7b756);
DO1(C,D,A,B,2,17,0x242070db);
DO1(B,C,D,A,3,22,0xc1bdceee);
DO1(A,B,C,D,4,7,0xf57c0faf);
DO1(D,A,B,C,5,12,0x4787c62a);
DO1(C,D,A,B,6,17,0xa8304613);
DO1(B,C,D,A,7,22,0xfd469501);
DO1(A,B,C,D,8,7,0x698098d8);
DO1(D,A,B,C,9,12,0x8b44f7af);
DO1(C,D,A,B,10,17,0xffff5bb1);
DO1(B,C,D,A,11,22,0x895cd7be);
DO1(A,B,C,D,12,7,0x6b901122);
DO1(D,A,B,C,13,12,0xfd987193);
DO1(C,D,A,B,14,17,0xa679438e);
DO1(B,C,D,A,15,22,0x49b40821);
/* Round 2 */
DO2(A,B,C,D,1,5,0xf61e2562);
DO2(D,A,B,C,6,9,0xc040b340);
DO2(C,D,A,B,11,14,0x265e5a51);
DO2(B,C,D,A,0,20,0xe9b6c7aa);
DO2(A,B,C,D,5,5,0xd62f105d);
DO2(D,A,B,C,10,9,0x2441453);
DO2(C,D,A,B,15,14,0xd8a1e681);
DO2(B,C,D,A,4,20,0xe7d3fbc8);
DO2(A,B,C,D,9,5,0x21e1cde6);
DO2(D,A,B,C,14,9,0xc33707d6);
DO2(C,D,A,B,3,14,0xf4d50d87);
DO2(B,C,D,A,8,20,0x455a14ed);
DO2(A,B,C,D,13,5,0xa9e3e905);
DO2(D,A,B,C,2,9,0xfcefa3f8);
DO2(C,D,A,B,7,14,0x676f02d9);
DO2(B,C,D,A,12,20,0x8d2a4c8a);
/* Round 3 */
DO3(A,B,C,D,5,4,0xfffa3942);
DO3(D,A,B,C,8,11,0x8771f681);
DO3(C,D,A,B,11,16,0x6d9d6122);
DO3(B,C,D,A,14,23,0xfde5380c);
DO3(A,B,C,D,1,4,0xa4beea44);
DO3(D,A,B,C,4,11,0x4bdecfa9);
DO3(C,D,A,B,7,16,0xf6bb4b60);
DO3(B,C,D,A,10,23,0xbebfbc70);
DO3(A,B,C,D,13,4,0x289b7ec6);
DO3(D,A,B,C,0,11,0xeaa127fa);
DO3(C,D,A,B,3,16,0xd4ef3085);
DO3(B,C,D,A,6,23,0x4881d05);
DO3(A,B,C,D,9,4,0xd9d4d039);
DO3(D,A,B,C,12,11,0xe6db99e5);
DO3(C,D,A,B,15,16,0x1fa27cf8);
DO3(B,C,D,A,2,23,0xc4ac5665);
/* Round 4 */
DO4(A,B,C,D,0,6,0xf4292244);
DO4(D,A,B,C,7,10,0x432aff97);
DO4(C,D,A,B,14,15,0xab9423a7);
DO4(B,C,D,A,5,21,0xfc93a039);
DO4(A,B,C,D,12,6,0x655b59c3);
DO4(D,A,B,C,3,10,0x8f0ccc92);
DO4(C,D,A,B,10,15,0xffeff47d);
DO4(B,C,D,A,1,21,0x85845dd1);
DO4(A,B,C,D,8,6,0x6fa87e4f);
DO4(D,A,B,C,15,10,0xfe2ce6e0);
DO4(C,D,A,B,6,15,0xa3014314);
DO4(B,C,D,A,13,21,0x4e0811a1);
DO4(A,B,C,D,4,6,0xf7537e82);
DO4(D,A,B,C,11,10,0xbd3af235);
DO4(C,D,A,B,2,15,0x2ad7d2bb);
DO4(B,C,D,A,9,21,0xeb86d391);
A += AA;
B += BB;
C += CC;
D += DD;
}
/*
* From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
*/
static inline u_int32_t
swap_u_int32_t (u_int32_t t)
{
#if defined(WORDS_BIGENDIAN)
#define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
u_int32_t temp1, temp2;
temp1 = ROL(t,16);
temp2 = temp1 >> 8;
temp1 &= 0x00ff00ff;
temp2 &= 0x00ff00ff;
temp1 <<= 8;
return temp1 | temp2;
#else
return t;
#endif
}
struct x32{
unsigned int a:32;
unsigned int b:32;
};
void
md5_update (struct md5 *m, const void *v, size_t len)
{
const unsigned char *p = v;
m->sz += len;
while(len > 0){
size_t l = min(len, 64 - m->offset);
memcpy(m->save + m->offset, p, l);
m->offset += l;
p += l;
len -= l;
if(m->offset == 64){
#if defined(WORDS_BIGENDIAN)
int i;
u_int32_t current[16];
struct x32 *u = (struct x32*)m->save;
for(i = 0; i < 8; i++){
current[2*i+0] = swap_u_int32_t(u[i].a);
current[2*i+1] = swap_u_int32_t(u[i].b);
}
calc(m, current);
#else
calc(m, (u_int32_t*)m->save);
#endif
m->offset = 0;
}
}
}
void
md5_finito (struct md5 *m, void *res)
{
static unsigned char zeros[72];
u_int32_t len;
unsigned int dstart = (120 - m->offset - 1) % 64 + 1;
*zeros = 0x80;
memset (zeros + 1, 0, sizeof(zeros) - 1);
len = 8 * m->sz;
zeros[dstart+0] = (len >> 0) & 0xff;
zeros[dstart+1] = (len >> 8) & 0xff;
zeros[dstart+2] = (len >> 16) & 0xff;
zeros[dstart+3] = (len >> 24) & 0xff;
md5_update (m, zeros, dstart + 8);
{
int i;
unsigned char *r = (unsigned char *)res;
for (i = 0; i < 4; ++i) {
r[4*i] = m->counter[i] & 0xFF;
r[4*i+1] = (m->counter[i] >> 8) & 0xFF;
r[4*i+2] = (m->counter[i] >> 16) & 0xFF;
r[4*i+3] = (m->counter[i] >> 24) & 0xFF;
}
}
#if 0
{
int i;
u_int32_t *r = (u_int32_t *)res;
for (i = 0; i < 4; ++i)
r[i] = swap_u_int32_t (m->counter[i]);
}
#endif
}
/*
* This is only for linkage compatibility!
*/
#undef MD5Init
#undef MD5Update
#undef MD5Final
void
MD5Init (MD5_CTX *mdContext)
{
md5_init(&mdContext->m.d5);
}
void
MD5Update (MD5_CTX *mdContext, const unsigned char *inBuf, unsigned int inLen)
{
md5_update(&mdContext->m.d5, (unsigned char *)inBuf, inLen);
}
void
MD5Final (unsigned char digest[16], MD5_CTX *mdContext)
{
md5_finito(&mdContext->m.d5, (…) 1 MD5Update(MD5_CTX *mdContext, const unsigned char *inBuf, unsigned int inLen) argument
|
H A D | md5.h | 84 /*
* Copyright (c) 1995, 1996, 1997 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* $Id: md5.h,v 1.4 2005/01/10 19:09:06 snsimon Exp $ */
#include <stdlib.h>
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_SYS_BITYPES_H
#include <sys/bitypes.h>
#endif
#ifdef KRB5
#include <krb5-types.h>
#elif defined(KRB4)
#include <ktypes.h>
#endif
struct md5 {
unsigned int offset;
unsigned int sz;
u_int32_t counter[4];
unsigned char save[64];
};
void md5_init (struct md5 *m);
void md5_update (struct md5 *m, const void *p, size_t len);
void md5_finito (struct md5 *m, void *res); /* u_int32_t res[4] */
/*
* Functions for compatibility that have never been tested.
*/
typedef struct {
u_int32_t i[2]; /* number of _bits_ handled mod 2^64 */
u_int32_t buf[4]; /* scratch buffer */
unsigned char in[64]; /* input buffer */
} MD5_CTX_PREAMBLE;
typedef struct {
union {
MD5_CTX_PREAMBLE preamble_;
struct md5 d5;
} m;
} MD5_CTX;
void MD5Init (MD5_CTX *mdContext);
void MD5Update (MD5_CTX *mdContext,
const unsigned char *inBuf,
unsigned int inLen);
void MD5Final (unsigned char digest[16], MD5_CTX *mdContext);
#ifndef NO_MD5_MACROS
#define MD5Init(mdContext) md5_init(&(mdContext)->m.d5)
#define MD5Update(mdCtx, inBuf, inLen) md5_update(&(mdCtx)->m.d5, inBuf, inLen)
#define MD5Final(digest, mdCtx) md5_finito(&(mdCtx)->m.d5, (digest))
#endif
|
/macosx-10.9.5/ppp-727.90.1/Helpers/pppd/ |
H A D | md5.c | 141 account for the presence of each of the characters inBuf[0..inLen-1] 144 void MD5Update (mdContext, inBuf, inLen) 147 unsigned int inLen; 157 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0]) 159 mdContext->i[0] += ((UINT4)inLen << 3); 160 mdContext->i[1] += ((UINT4)inLen >> 29); 162 while (inLen--) {
|
/macosx-10.9.5/security_ocspd-55118.2/server/ |
H A D | ocspdServer.cpp | 277 size_t inLen) 279 size_t outStrLen = (inLen*2)+1; 285 size_t dataLen = inLen; 275 crlPrintableStringWithData( unsigned char *inData, size_t inLen) argument
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/md5/ |
H A D | md5.c | 114 account for the presence of each of the characters inBuf[0..inLen-1] 117 void MD5Update (mdContext, inBuf, inLen) 119 unsigned int inLen; 129 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0]) 131 mdContext->i[0] += ((UINT4)inLen << 3); 132 mdContext->i[1] += ((UINT4)inLen >> 29); 134 while (inLen--) {
|
/macosx-10.9.5/tcl-102/tcl_ext/trf/trf/generic/md5/ |
H A D | md5.c | 114 account for the presence of each of the characters inBuf[0..inLen-1] 117 void MD5Update (mdContext, inBuf, inLen) 119 unsigned int inLen; 129 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0]) 131 mdContext->i[0] += ((UINT4)inLen << 3); 132 mdContext->i[1] += ((UINT4)inLen >> 29); 134 while (inLen--) {
|
/macosx-10.9.5/xnu-2422.115.4/libkern/c++/ |
H A D | OSSymbol.cpp | 271 unsigned int j, inLen, hash; local 274 hashSymbol(cString, &hash, &inLen); inLen++; 284 if (inLen == probeSymbol->length 292 if (inLen == probeSymbol->length 304 unsigned int j, inLen, hash; local 307 hashSymbol(cString, &hash, &inLen); inLen++; 321 if (inLen == probeSymbol->length 340 if (inLen 363 unsigned int j, inLen, hash; local [all...] |