Home
last modified time | relevance | path

Searched refs:newLen (Results 1 – 5 of 5) sorted by relevance

/titanic_44/usr/src/lib/libdns_sd/java/com/apple/dnssd/
H A DTXTRecord.java129 byte newLen, avLen; in insert()
136 newLen = (byte) ( avLen + oldBytes.length + 1); in insert()
138 fBytes = new byte[ newLen]; in insert()
141 System.arraycopy( oldBytes, insertion, fBytes, newLen - secondHalfLen, secondHalfLen); in insert()
/titanic_44/usr/src/lib/libnisdb/
H A Dldap_util.h96 int *newLen);
H A Dldap_util.c367 appendString2SingleVal(char *str, __nis_single_value_t *v, int *newLen) { in appendString2SingleVal() argument
394 if (newLen != 0) in appendString2SingleVal()
395 *newLen = nl; in appendString2SingleVal()
/titanic_44/usr/src/common/lzma/
H A DLzmaEnc.c1146 UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen; in GetOptimum() local
1158 newLen = ReadMatchDistances(p, &numPairs); in GetOptimum()
1159 if (newLen >= p->numFastBytes) in GetOptimum()
1162 p->longestMatchLength = newLen; in GetOptimum()
1410 if (newLen > numAvail) in GetOptimum()
1412 newLen = numAvail; in GetOptimum()
1413 for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2); in GetOptimum()
1414 matches[numPairs] = newLen; in GetOptimum()
1417 if (newLen >= startLen) in GetOptimum()
1422 while (lenEnd < cur + newLen) in GetOptimum()
/titanic_44/usr/src/cmd/gss/gssd/
H A Dgssdtest.c1835 int gidsLen, i, newLen; local
1852 newLen = expName.length/2;
1853 byteStr = (unsigned char *)MALLOC(newLen+1);
1860 expName.length = newLen;
1865 FREE(expName.value, newLen);