/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
H A D | DERApplicationSpecific.java | 16 private final byte[] octets; field in class:DERApplicationSpecific 21 byte[] octets) 25 this.octets = octets; 30 byte[] octets) 32 this(false, tag, octets); 58 this.octets = data; 65 this.octets = tmp; 86 this.octets = bOut.toByteArray(); 151 return octets; 18 DERApplicationSpecific( boolean isConstructed, int tag, byte[] octets) argument 28 DERApplicationSpecific( int tag, byte[] octets) argument [all...] |
H A D | DERBoolean.java | 65 byte[] octets) 67 return (octets[0] != 0) ? TRUE : FALSE; 64 getInstance( byte[] octets) argument
|
/external/v8/src/ |
H A D | uri.js | 46 function URIEncodeOctets(octets, result, index) { 51 index = URIAddEncodedOctetToBuffer(octets[0], result, index); 52 if (octets[1]) index = URIAddEncodedOctetToBuffer(octets[1], result, index); 53 if (octets[2]) index = URIAddEncodedOctetToBuffer(octets[2], result, index); 54 if (octets[3]) index = URIAddEncodedOctetToBuffer(octets[3], result, index); 63 var octets = new $Array(3); 65 octets[ [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/ |
H A D | IPAddress.java | 47 int octets = 0; 56 if (octets == 4) 73 octets++; 76 return octets == 4; 129 int octets = 0; 138 if (octets == 8) 154 octets++; // add an extra one as address covers 2 words. 181 octets++; 184 return octets == 8 || doubleColonFound;
|
/external/libppp/src/ |
H A D | mbuf.c | 72 size_t octets; member in struct:memmap 159 MemMap[type].octets += bp->m_size; 172 MemMap[bp->m_type].octets -= bp->m_size; 325 prompt_Printf(arg->prompt, "Fragments (octets) in use:\n"); 330 (u_long)MemMap[i].octets, mbuftype(i+1), 331 (u_long)MemMap[i+1].fragments, (u_long)MemMap[i+1].octets); 336 (u_long)MemMap[i].octets); 415 MemMap[bp->m_type].octets -= bp->m_size; 418 MemMap[type].octets += bp->m_size;
|
H A D | throughput.c | 113 prompt_Printf(prompt, "%llu octets in, %llu octets out\n", 142 log_Printf(level, "%s%sConnect time: %d secs: %llu octets in, %llu octets" 165 unsigned long long octets; local 180 octets = t->in.OctetsPerSecond + t->out.OctetsPerSecond; 181 if (t->BestOctetsPerSecond < octets) { 182 t->BestOctetsPerSecond = octets;
|
H A D | lqr.c | 374 u_int32_t LQRs, transitLQRs, pkts, octets, disc, err; local 386 octets = (newlqr->LastOutOctets - oldlqr->LastOutOctets) - 391 (int)octets, octets == 1 ? "" : "s"); 395 octets = (newlqr->PeerOutOctets - oldlqr->PeerOutOctets) - 399 (int)octets, octets == 1 ? "" : "s"); 434 * All octets which are included in the FCS calculation MUST be counted, 436 * The FCS octets MUST also be counted, and one flag octet per frame 437 * MUST be counted. All other octets (suc [all...] |
H A D | link.c | 151 link_PendingLowPriorityData(struct link *l, size_t *pkts, size_t *octets) argument 169 *pkts = *octets = 0; 174 *octets += m_length(m) - m->priv;
|
H A D | bundle.c | 1026 unsigned long long octets; local 1030 octets = MAX(dl->physical->link.stats.total.in.OctetsPerSecond, 1039 octets * 8, octets); 1044 octets = MAX(t->in.OctetsPerSecond, t->out.OctetsPerSecond); 1050 " over the last %d secs\n", octets * 8, octets, secs);
|
/external/tcpdump/ |
H A D | print-cnfp.c | 71 u_int32_t octets; member in struct:nfrec 185 printf("tos %u, %u (%u octets) %s", 188 EXTRACT_32BITS(&nr->octets), buf);
|
/external/libvorbis/doc/ |
H A D | 05-comment.tex | 50 2) [vendor_string] = read a UTF-8 vector as [vendor_length] octets 54 6) this iteration's user comment = read a UTF-8 vector as [length] octets 214 Vendor string length (32 bit unsigned quantity specifying number of octets) 217 Vendor string ([vendor string length] octets coded from beginning of string to end of string, not null terminated) 223 Comment field 0 length (if [Number of comment fields] $>0$; 32 bit unsigned quantity specifying number of octets) 226 Comment field 0 ([Comment field 0 length] octets coded from beginning of string to end of string, not null terminated)
|
H A D | 02-bitpacking.tex | 13 native word size of eight bits (octets), sixteen bits, thirty-two bits 19 \subsubsection{octets, bytes and words}
|
H A D | 04-codec.tex | 33 2) 0x76, 0x6f, 0x72, 0x62, 0x69, 0x73: the characters 'v','o','r','b','i','s' as six octets
|
/external/dropbear/libtomcrypt/ |
H A D | crypt.tex | 572 /** min keysize (octets) */ 575 /** max keysize (octets) */ 578 /** block size (octets) */ 908 In all cases, \textit{len} is the size of the buffer (as number of octets) to encrypt or decrypt. The CTR, OFB and CFB modes are order sensitive but not 1036 The key is specified as two strings the first key $K_1$ is the (normally AES) key and can be any length (typically 16, 24 or 32 octets long). The second key 1037 $K_2$ is the \textit{tweak} key and is always 16 octets long. The tweak value is \textbf{NOT} a nonce or IV value it must be random and secret. 1052 This will initialize the LRW context with the given (16 octet) \textit{IV}, cipher $K_1$ \textit{key} of length \textit{keylen} octets and the (16 octet) $K_2$ \textit{tweak}. 1071 These will encrypt (or decrypt) the plaintext to the ciphertext buffer (or vice versa). The length is specified by \textit{len} in octets but must be a multiple 1188 The \textit{key} parameter is the shared secret symmetric key of length \textit{keylen} octets. The \textit{nonce} parameter is the 1189 random public string of length \textit{noncelen} octets [all...] |
/external/dropbear/libtomcrypt/src/headers/ |
H A D | tomcrypt_pk.h | 157 /** The size of the curve in octets */ 306 /** The order of the sub-group used in octets */ 483 int der_length_ia5_string(const unsigned char *octets, unsigned long noctets, unsigned long *outlen); 493 int der_length_printable_string(const unsigned char *octets, unsigned long noctets, unsigned long *outlen);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
H A D | JDKPKCS12KeyStore.java | 844 byte[] octets = cryptData(false, d.getEncryptionAlgorithm(), 846 ASN1Sequence seq = (ASN1Sequence) ASN1Primitive.fromByteArray(octets);
|
/external/dropbear/libtommath/ |
H A D | bn.tex | 1741 This will return the number of bytes (octets) required to store the unsigned copy of the integer $a$. 1754 This will read in an unsigned big--endian array of bytes (octets) from $b$ of length $c$ into $a$. The resulting
|