| /external/chromium_org/net/quic/crypto/ |
| H A D | curve25519_key_exchange.cc | 24 Curve25519KeyExchange* ka; local
29 sizeof(ka->private_key_) == crypto::curve25519::kScalarBytes,
31 COMPILE_ASSERT(sizeof(ka->public_key_) == crypto::curve25519::kBytes,
38 ka = new Curve25519KeyExchange();
39 memcpy(ka->private_key_, private_key.data(),
41 crypto::curve25519::ScalarBaseMult(ka->private_key_, ka->public_key_);
42 return ka;
|
| H A D | quic_crypto_server_config.cc | 1306 scoped_ptr<KeyExchange> ka; local
1309 ka.reset(Curve25519KeyExchange::New(private_key));
1310 if (!ka.get()) {
1317 ka.reset(P256KeyExchange::New(private_key));
1318 if (!ka.get()) {
1338 config->key_exchanges.push_back(ka.release());
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/htmlfiles/ |
| H A D | jquery-1.4.3.min.js | 18 a.handleObj=f.handleObj;D=f.handleObj.origHandler.apply(f.elem,arguments);if(D===false||a.isPropagationStopped()){d=f.level;if(D===false)b=false}}return b}}function Y(a,b){return(a&&a!=="*"?a+".":"")+b.replace(Ha,"`").replace(Ia,"&")}function ka(a,b,d){if(c.isFunction(b))return c.grep(a,function(f,h){return!!b.call(f,h,f)===d});else if(b.nodeType)return c.grep(a,function(f){return f===b===d});else if(typeof b==="string"){var e=c.grep(a,function(f){return f.nodeType===1});if(Ja.test(b))return c.filter(b,
104 "find",a),d=0,e=0,f=this.length;e<f;e++){d=b.length;c.find(a,this[e],b);if(e>0)for(var h=d;h<b.length;h++)for(var k=0;k<d;k++)if(b[k]===b[h]){b.splice(h--,1);break}}return b},has:function(a){var b=c(a);return this.filter(function(){for(var d=0,e=b.length;d<e;d++)if(c.contains(this,b[d]))return true})},not:function(a){return this.pushStack(ka(this,a,false),"not",a)},filter:function(a){return this.pushStack(ka(this,a,true),"filter",a)},is:function(a){return!!a&&c.filter(a,this).length>0},closest:function(a,
|
| /external/ipsec-tools/src/racoon/ |
| H A D | nattraversal.c | 323 natt_keepalive_delete (struct natt_ka_addrs *ka) argument
325 TAILQ_REMOVE (&ka_tree, ka, chain);
326 racoon_free (ka->src);
327 racoon_free (ka->dst);
328 racoon_free (ka);
335 struct natt_ka_addrs *ka, *next = NULL; local
340 for (ka = TAILQ_FIRST(&ka_tree); ka; ka = next) {
341 next = TAILQ_NEXT(ka, chai
373 struct natt_ka_addrs *ka = NULL, *new_addr; local
430 struct natt_ka_addrs *ka, *next = NULL; local
[all...] |
| /external/wpa_supplicant_8/hostapd/src/eap_common/ |
| H A D | eap_eke_common.h | 71 u8 ka[EAP_EKE_MAX_KA_LEN]; member in struct:eap_eke_session
|
| /external/wpa_supplicant_8/src/eap_common/ |
| H A D | eap_eke_common.h | 71 u8 ka[EAP_EKE_MAX_KA_LEN]; member in struct:eap_eke_session
|
| /external/wpa_supplicant_8/wpa_supplicant/src/eap_common/ |
| H A D | eap_eke_common.h | 71 u8 ka[EAP_EKE_MAX_KA_LEN]; member in struct:eap_eke_session
|
| /external/chromium_org/base/third_party/dmg_fp/ |
| H A D | dtoa.cc | 1420 int k, ka, kb; variable
1422 dval(&da) = b2d(a, &ka);
1425 k = ka - kb + 32*(a->wds - b->wds);
1427 k = ka - kb + 16*(a->wds - b->wds);
|
| /external/mdnsresponder/mDNSShared/ |
| H A D | dnsextd.c | 1824 CacheRecord *cr, *NewAnswers, **na, **ka; // "new answer", "known answer" local
1835 for (ka = &a->KnownAnswers; *ka; ka = &(*ka)->next)
1836 (*ka)->resrec.rroriginalttl = (unsigned)-1; // -1 means delete
1839 for (ka = &a->KnownAnswers; *ka; ka = &(*ka)
[all...] |
| /external/mdnsresponder/mDNSCore/ |
| H A D | mDNS.c | 651 // CacheRecord *ka is the CacheRecord from the known answer list in the query.
658 mDNSlocal mDNSBool ShouldSuppressKnownAnswer(const CacheRecord *const ka, const AuthRecord *const rr) argument
661 if (!IdenticalResourceRecord(&ka->resrec, &rr->resrec)) return(mDNSfalse);
672 return(mDNSBool)(ka->resrec.rroriginalttl >= rr->resrec.rroriginalttl / 2);
2582 CacheRecord **ka = *kalistptrptr; // Make a working copy of the pointer we're going to update local
2587 rr->NextInKAList == mDNSNULL && ka != &rr->NextInKAList && // which is not already in the known answer list
2599 *ka = rr; // Link this record into our known answer chain
2600 ka = &rr->NextInKAList;
2610 ka = *kalistptrptr; // Go back to where we started and retract these answer records
2611 while (*ka) { CacheRecor
3138 CacheRecord *ka = KnownAnswerList; local
[all...] |