HomeSort by relevance Sort by last modified time
    Searched defs:ka (Results 1 - 16 of 16) sorted by null

  /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/func/
KeyAgreementThread.java 55 KeyAgreement ka = KeyAgreement.getInstance("DH"); local
56 ka.init(privateKey);
57 ka.doPhase(pubKey, true);
59 return ka.generateSecret();
  /external/chromium_org/net/quic/crypto/
curve25519_key_exchange.cc 23 Curve25519KeyExchange* ka; local
28 sizeof(ka->private_key_) == crypto::curve25519::kScalarBytes,
30 COMPILE_ASSERT(sizeof(ka->public_key_) == crypto::curve25519::kBytes,
37 ka = new Curve25519KeyExchange();
38 memcpy(ka->private_key_, private_key.data(),
40 crypto::curve25519::ScalarBaseMult(ka->private_key_, ka->public_key_);
41 return ka;
crypto_server_config.cc 850 scoped_ptr<KeyExchange> ka; local
853 ka.reset(Curve25519KeyExchange::New(private_key));
854 if (!ka.get()) {
861 ka.reset(P256KeyExchange::New(private_key));
862 if (!ka.get()) {
882 config->key_exchanges.push_back(ka.release());
    [all...]
  /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/
KeyAgreementTest.java 102 KeyAgreement[] ka = new KeyAgreement[3]; local
103 ka[0] = KeyAgreement.getInstance(defaultAlgorithm);
104 ka[1] = KeyAgreement.getInstance(defaultAlgorithm, defaultProvider);
105 ka[2] = KeyAgreement.getInstance(defaultAlgorithm,
107 return ka;
617 KeyAgreement ka = KeyAgreement.getInstance("DH"); local
621 ka.generateSecret(bb1, 0);
626 ka.init(privKey);
627 ka.doPhase(publKey, true);
629 ka.generateSecret(bb1, 0)
643 KeyAgreement ka = KeyAgreement.getInstance("DH"); local
669 KeyAgreement ka = KeyAgreement.getInstance("DH"); local
    [all...]
  /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/htmlfiles/
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,
19 e,!d);else b=c.filter(b,e)}return c.grep(a,function(f){return c.inArray(f,b)>=0===d})}function la(a,b){var d=0;b.each(function(){if(this.nodeName===(a[d]&&a[d].nodeName)){var e=c.data(a[d++]),f=c.data(this,e);if(e=e&&e.events){delete f.handle;f.events={};for(var h in e)for(var k in e[h])c.event.add(this,h,e[h][k],e[h][k].data)}}})}function Ka(a,b){b.src?c.ajax({url:b.src,async:false,dataType:"script"}):c.globalEval(b.text||b.textContent||b.innerHTML||"");b.parentNode&&b.parentNode.removeChild(b)}
    [all...]
  /external/ipsec-tools/src/racoon/
nattraversal.c 323 natt_keepalive_delete (struct natt_ka_addrs *ka)
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, chain)
373 struct natt_ka_addrs *ka = NULL, *new_addr; local
430 struct natt_ka_addrs *ka, *next = NULL; local
    [all...]
  /external/jmonkeyengine/engine/src/networking/com/jme3/network/base/
DefaultServer.java 157 for( KernelAdapter ka : channels ) {
158 ka.initialize();
162 for( KernelAdapter ka : channels ) {
163 ka.start();
181 for( KernelAdapter ka : channels ) {
182 ka.close();
302 protected int getChannel( KernelAdapter ka )
304 return channels.indexOf(ka);
307 protected void registerClient( KernelAdapter ka, Endpoint p, ClientRegistrationMessage m )
328 int channel = getChannel(ka);
    [all...]
  /external/apache-harmony/crypto/src/test/api/java/org/apache/harmony/crypto/tests/javax/crypto/
KeyAgreementTest.java 100 KeyAgreement[] ka = new KeyAgreement[3]; local
101 ka[0] = KeyAgreement.getInstance(defaultAlgorithm);
102 ka[1] = KeyAgreement.getInstance(defaultAlgorithm, defaultProvider);
103 ka[2] = KeyAgreement.getInstance(defaultAlgorithm,
105 return ka;
  /external/dropbear/libtomcrypt/src/ciphers/safer/
safer.c 114 unsigned char ka[SAFER_BLOCK_LEN + 1]; local
120 ka[SAFER_BLOCK_LEN] = (unsigned char)0;
124 ka[j] = ROL8(userkey_1[j], 5);
125 ka[SAFER_BLOCK_LEN] ^= ka[j];
131 ka[j] = ROL8(ka[j], 6);
140 *key++ = (ka[k]
144 *key++ = (ka[j] + safer_ebox[(int)safer_ebox[(int)((18 * i + j + 1)&0xFF)]]) & 0xFF;
163 zeromem(ka, sizeof(ka))
    [all...]
  /external/wpa_supplicant_8/src/eap_common/
eap_eke_common.h 71 u8 ka[EAP_EKE_MAX_KA_LEN]; member in struct:eap_eke_session
  /cts/suite/pts/deviceTests/browserbench/assets/octane/
box2d.js 34 arguments);this.constructor===fa&&this.b2Contact.apply(this,arguments)}function ga(){ga.b2ContactConstraint.apply(this,arguments);this.constructor===ga&&this.b2ContactConstraint.apply(this,arguments)}function Ha(){Ha.b2ContactConstraintPoint.apply(this,arguments)}function Ia(){Ia.b2ContactEdge.apply(this,arguments)}function ha(){ha.b2ContactFactory.apply(this,arguments);this.constructor===ha&&this.b2ContactFactory.apply(this,arguments)}function Ja(){Ja.b2ContactRegister.apply(this,arguments)}function Ka(){Ka.b2ContactResult.apply(this,
35 arguments)}function ia(){ia.b2ContactSolver.apply(this,arguments);this.constructor===ia&&this.b2ContactSolver.apply(this,arguments)}function La(){La.b2EdgeAndCircleContact.apply(this,arguments)}function ja(){ja.b2NullContact.apply(this,arguments);this.constructor===ja&&this.b2NullContact.apply(this,arguments)}function Ma(){Ma.b2PolyAndCircleContact.apply(this,arguments)}function Na(){Na.b2PolyAndEdgeContact.apply(this,arguments)}function Oa(){Oa.b2PolygonContact.apply(this,arguments)}function ka(){ka.b2PositionSolverManifold.apply(this,
36 arguments);this.constructor===ka&&this.b2PositionSolverManifold.apply(this,arguments)}function Pa(){Pa.b2BuoyancyController.apply(this,arguments)}function Qa(){Qa.b2ConstantAccelController.apply(this,arguments)}function Ra(){Ra.b2ConstantForceController.apply(this,arguments)}function Sa(){Sa.b2Controller.apply(this,arguments)}function Ta(){Ta.b2ControllerEdge.apply(this,arguments)}function Ua(){Ua.b2GravityController.apply(this,arguments)}function Va(){Va.b2TensorDampingController.apply(this,arguments)}
46 ha;Box2D.Dynamics.Contacts.b2ContactRegister=Ja;Box2D.Dynamics.Contacts.b2ContactResult=Ka;Box2D.Dynamics.Contacts.b2ContactSolver=ia;Box2D.Dynamics.Contacts.b2EdgeAndCircleContact=La;Box2D.Dynamics.Contacts.b2NullContact=ja;Box2D.Dynamics.Contacts.b2PolyAndCircleContact=Ma;Box2D.Dynamics.Contacts.b2PolyAndEdgeContact=Na;Box2D.Dynamics.Contacts.b2PolygonContact=Oa;Box2D.Dynamics.Contacts.b2PositionSolverManifold=ka;Box2D.Dynamics.Controllers.b2BuoyancyController=Pa;Box2D.Dynamics.Controllers.b2ConstantAccelController=
    [all...]
  /bionic/libc/stdlib/
strtod.c 1270 int k, ka, kb; local
1275 value(da) = b2d(a, &ka);
1278 k = ka - kb + 32*(a->wds - b->wds);
1280 k = ka - kb + 16*(a->wds - b->wds);
    [all...]
  /external/mdnsresponder/mDNSShared/
dnsextd.c 1824 CacheRecord *cr, *NewAnswers, **na, **ka; \/\/ "new answer", "known answer" local
    [all...]
  /external/chromium/base/third_party/dmg_fp/
dtoa.cc 1407 int k, ka, kb; variable
1409 dval(&da) = b2d(a, &ka);
1412 k = ka - kb + 32*(a->wds - b->wds);
1414 k = ka - kb + 16*(a->wds - b->wds);
    [all...]
  /external/chromium_org/base/third_party/dmg_fp/
dtoa.cc 1407 int k, ka, kb; variable
1409 dval(&da) = b2d(a, &ka);
1412 k = ka - kb + 32*(a->wds - b->wds);
1414 k = ka - kb + 16*(a->wds - b->wds);
    [all...]
  /external/mdnsresponder/mDNSCore/
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)
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
3138 CacheRecord *ka = KnownAnswerList; local
    [all...]

Completed in 664 milliseconds