| /macosx-10.10/xnu-2782.1.97/osfmk/i386/ |
| H A D | i386_lock.s | 55 #define LEAF_ENTRY2(n1,n2) \
57 Entry(n2)
68 #define NONLEAF_ENTRY2(n1,n2) \
70 Entry(n2); \
|
| /macosx-10.10/llvmCore-3425.0.34/unittests/VMCore/ |
| H A D | MetadataTest.cpp | 92 MDNode *n2 = MDNode::get(Context, c1); local
93 Value *const c2 = n2;
98 EXPECT_NE(n1, n2);
105 EXPECT_EQ(n5, n2);
113 EXPECT_EQ(1u, n2->getNumOperands());
114 EXPECT_EQ(n1, n2->getOperand(0));
138 MDNode *n2 = MDNode::get(Context, V2); local
144 NMD->addOperand(n2);
|
| /macosx-10.10/llvmCore-3425.0.34/lib/Support/ |
| H A D | APInt.cpp | 490 unsigned n2 = RHS.getActiveBits(); local
493 if (n1 != n2)
522 unsigned n2 = RHS.getActiveBits(); local
525 if (n1 < n2)
529 if (n2 < n1)
533 if (n1 <= APINT_BITS_PER_WORD && n2 <= APINT_BITS_PER_WORD)
537 unsigned topWord = whichWord(std::max(n1,n2)-1);
|
| /macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
| H A D | ProfileInfo.cpp | 378 Edge n2 = getEdge(NewBB, SecondBB); local
402 ECs[n2] += neww;
|
| /macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 129 NodeEntry &n2 = getNode(ne.getNode2()); local
132 (n2.getCosts().getLength() == ne.getCosts().getCols()) &&
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
339 NodeEntry &n2 = getNode(e.getNode2()); local
341 n2.removeEdge(e.getNode2AEItr());
373 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr)); local
374 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
376 os << "\n" << n1 << " " << n2 << "\n"
427 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
428 return &*n1 < &*n2;
[all...] |
| /macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/Heuristics/ |
| H A D | Briggs.h | 189 &n2 = getHeuristicNodeData(n2Itr); local
193 if (n2.isHeuristic)
219 &n2 = getHeuristicNodeData(n2Itr); local
223 if (!n1.isHeuristic && !n2.isHeuristic)
242 if (n2.isHeuristic) {
243 bool n2WasAllocable = n2.isAllocable;
246 if (n2WasAllocable && !n2.isAllocable) {
247 rnAllocableList.erase(n2.rnaItr);
248 n2.rnuItr =
|
| /macosx-10.10/ipsec-286.1.1/ipsec-tools/racoon/ |
| H A D | crypto_openssl.c | 254 eay_cmp_asn1dn(n1, n2)
255 vchar_t *n1, *n2;
264 p = n2->v;
265 if (!d2i_X509_NAME(&b, (void *)&p, n2->l))
|
| /macosx-10.10/configd-699.1.5/SystemConfiguration.fproj/reachability/ |
| H A D | SCNetworkReachabilityServer_client.c | 67 _rbt_compare_transaction_nodes(void *context, const void *n1, const void *n2) argument
70 uint64_t b = (uintptr_t)(((reach_request_t *)n2)->target);
|
| H A D | SCNetworkReachabilityServer_server.c | 544 _rbt_compare_transaction_nodes(void *context, const void *n1, const void *n2) argument
547 uint64_t b = (uintptr_t)((reach_client_t *)n2)->connection;
|
| /macosx-10.10/configd-699.1.5/SystemConfiguration.fproj/ |
| H A D | SCNetworkInterface.c | 1074 CFIndex n2; local
1080 n2 = CFArrayGetCount(elements2);
1082 n = (n1 <= n2) ? n1 : n2;
1131 if (n1 < n2) {
1133 } else if (n1 < n2) {
|
| /macosx-10.10/configd-699.1.5/Plugins/IPMonitor/ |
| H A D | dns-configuration.c | 1300 CFIndex n2; local
1347 n2 = CFArrayGetCount(labels2);
1349 while ((n1 > 0) && (n2 > 0)) {
1351 CFStringRef label2 = CFArrayGetValueAtIndex(labels2, --n2);
1361 if (n1 > n2) {
1364 } else if (n1 < n2) {
|
| /macosx-10.10/Security-57031.1.35/Security/include/security_cryptkit/ |
| H A D | giantFFT.c | 274 register int n2, n4, n8, i, j; local
292 n2 = 2;
294 n2 <<= 1;
295 n4 = n2>>2;
296 n8 = n2>>3;
298 iD = n2<<1;
321 is = (iD<<1) - n2;
324 dil = n/n2;
336 iD = n2<<1;
368 is = (iD<<1) - n2;
385 int n2, n4, n8, i, j; local
[all...] |
| /macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/bn/ |
| H A D | bn_mul.c | 85 /* r is 2*n2 words in size,
86 * a and b are both n2 words in size.
87 * n2 must be a power of 2.
89 * t must be 2*n2 words in size
95 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
98 int n=n2/2,c1,c2;
103 printf(" bn_mul_recursive %d * %d\n",n2,n2);
107 if (n2 == 4)
113 if (n2
244 int i,j,n2=n*2; local
412 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
443 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument
[all...] |
| H A D | bn_sqr.c | 218 void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *t) argument
220 int n=n2/2;
225 printf(" bn_sqr_recursive %d * %d\n",n2,n2);
227 if (n2 == 4)
236 else if (n2 == 8)
245 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
247 bn_sqr_normal(r,a,n2,t);
261 p= &(t[n2*2]);
264 bn_sqr_recursive(&(t[n2]),
[all...] |
| H A D | bn_lcl.h | 405 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
408 void bn_sqr_recursive(BN_ULONG *r,BN_ULONG *a, int n2, BN_ULONG *t);
410 void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,
412 void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2,
|
| /macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/lhash/ |
| H A D | lhash.c | 316 LHASH_NODE **n,**n1,**n2,*np; local
324 n2= &(lh->b[p+(int)lh->pmax]);
325 *n2=NULL; /* 27/07/92 - eay - undefined pointer bug */
339 np->next= *n2;
340 *n2=np;
|
| /macosx-10.10/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
| H A D | giantFFT.c | 274 register int n2, n4, n8, i, j; local
292 n2 = 2;
294 n2 <<= 1;
295 n4 = n2>>2;
296 n8 = n2>>3;
298 iD = n2<<1;
321 is = (iD<<1) - n2;
324 dil = n/n2;
336 iD = n2<<1;
368 is = (iD<<1) - n2;
385 int n2, n4, n8, i, j; local
[all...] |
| /macosx-10.10/OpenLDAP-499.27/OpenLDAP/libraries/libldap/ |
| H A D | rb_response.c | 52 const struct rb_node *n2 )
55 const ber_int_t msgid2 = RBNODE_TO_LM(n2)->lm_msgid;
|
| /macosx-10.10/OpenSSL098-52/src/test/ |
| H A D | cms-test.pl | 438 $n2 = sysread $fp2, $rd2, 4096;
439 last if ( $n1 != $n2 );
|
| H A D | tx509 | 38 $cmd -in f.n -inform n -outform n >ff.n2
65 cmp f.n ff.n2
|
| /macosx-10.10/WebCore-7600.1.25/xml/ |
| H A D | XPathParser.cpp | 255 String n2; local
256 if (!lexNCName(n2))
259 name = n1 + ":" + n2;
365 String n2; local
366 if (!lexNCName(n2))
369 name = name + ":" + n2;
|
| /macosx-10.10/Security-57031.1.35/Security/include/security_cryptkit/CurveParamDocs/ |
| H A D | giants.c | 2902 register int n2, n4, n8, i, j; local
2923 n2 = 2;
2926 n2 <<= 1;
2927 n4 = n2>>2;
2928 n8 = n2>>3;
2930 id = n2<<1;
2956 is = (id<<1) - n2;
2959 dil = n/n2;
2972 id = n2<<1;
3006 is = (id<<1) - n2;
3029 int n2, n4, n8, i, j; local
[all...] |
| H A D | schoof.c | 750 elladdp(poly n1, poly d1, poly m1, poly c1, poly n2, poly d2, poly m2, poly c2, poly n0, poly d0, poly m0, poly c0) { argument
756 ptop(n2, md); mulmod(d1, md);
764 ptop(n2, d0); mulmod(d1, d0);
|
| H A D | schoofs.c | 729 elladdp(poly n1, poly d1, poly m1, poly c1, poly n2, poly d2, poly m2, poly c2, poly n0, poly d0, poly m0, poly c0) { argument
735 ptop(n2, md); mulmod(d1, md);
743 ptop(n2, d0); mulmod(d1, d0);
|
| /macosx-10.10/Security-57031.1.35/Security/libsecurity_cryptkit/lib/CurveParamDocs/ |
| H A D | giants.c | 2902 register int n2, n4, n8, i, j; local
2923 n2 = 2;
2926 n2 <<= 1;
2927 n4 = n2>>2;
2928 n8 = n2>>3;
2930 id = n2<<1;
2956 is = (id<<1) - n2;
2959 dil = n/n2;
2972 id = n2<<1;
3006 is = (id<<1) - n2;
3029 int n2, n4, n8, i, j; local
[all...] |