Searched refs:n2 (Results 26 - 50 of 216) sorted by relevance

123456789

/macosx-10.10/ruby-106/ruby/test/rexml/
H A Dtest_notationdecl_parsetest.rb11 <!NOTATION n2 PUBLIC '-//HM//NOTATION TEST2//EN' "urn:x-henrikmartensson.org:test6">
20 assert(@doctype.notation('n2'), "Testing notation n2")
/macosx-10.10/bc-21/bc/h/
H A Dnumber.h120 _PROTOTYPE(int bc_compare, (bc_num n1, bc_num n2));
128 _PROTOTYPE(void bc_add, (bc_num n1, bc_num n2, bc_num *result, int scale_min));
130 _PROTOTYPE(void bc_sub, (bc_num n1, bc_num n2, bc_num *result, int scale_min));
132 _PROTOTYPE(void bc_multiply, (bc_num n1, bc_num n2, bc_num *prod, int scale));
134 _PROTOTYPE(int bc_divide, (bc_num n1, bc_num n2, bc_num *quot, int scale));
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/math/
H A Dbessel.tcl152 set n2 [expr {$n+8}] ;# Note: just a guess that this will be enough
158 while { $n2 > 0 } {
159 set ynm1 [expr {$ynp1+2.0*$n2*$yn/$x}]
161 if { $n2 == $n+1 } {
166 incr n2 -1
/macosx-10.10/bc-21/bc/lib/
H A Dtestmul.c134 int n1, n2; local
175 t2 = timeit (num, num, &n2);
176 permul2 = (float)t2/(float)n2;
184 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2);
223 t2 = timeit (big, num, &n2);
224 permul2 = (float)t2/(float)n2;
232 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2);
/macosx-10.10/Libc-1044.1.2/stdio/FreeBSD/
H A Dprintf-pos.c191 int n2; local
193 n2 = 0;
196 n2 = 10 * n2 + to_digit(*cp);
201 types->nextarg = n2;
217 int n2; local
219 n2 = 0;
222 n2 = 10 * n2 + to_digit(*cp);
227 types->nextarg = n2;
[all...]
H A Dxprintf_float.c73 n2 = (ep) - (p); \
74 if (n2 > (len)) \
75 n2 = (len); \
76 if (n2 > 0) \
77 ret += __printf_puts(io, (p), n2); \
78 ret += __printf_pad(io, (len) - (n2 > 0 ? n2 : 0), (with)); \
187 int n2; /* XXX: for PRINTANDPAD */ local
/macosx-10.10/OpenSSL098-52/src/fips/aes/
H A Dfips_aesavs.c252 int i, j, n, n1, n2; local
427 for (n1 = 0, n2 = nkeysz-1; n1 < nkeysz; ++n1, --n2)
428 ciphertext[n1] = ctext[j-n2][0];
432 for(n1=0,n2=akeysz-1 ; n1 < akeysz ; ++n1,--n2)
433 sb(ciphertext,n1,gb(ctext[j-n2],0));
455 for (n1 = 0, n2 = nkeysz-1; n1 < nkeysz; ++n1, --n2)
456 ciphertext[n1] = ptext[j-n2][
[all...]
/macosx-10.10/OpenSSL098-52/src/test/
H A Dfips_aesavs.c252 int i, j, n, n1, n2; local
427 for (n1 = 0, n2 = nkeysz-1; n1 < nkeysz; ++n1, --n2)
428 ciphertext[n1] = ctext[j-n2][0];
432 for(n1=0,n2=akeysz-1 ; n1 < akeysz ; ++n1,--n2)
433 sb(ciphertext,n1,gb(ctext[j-n2],0));
455 for (n1 = 0, n2 = nkeysz-1; n1 < nkeysz; ++n1, --n2)
456 ciphertext[n1] = ptext[j-n2][
[all...]
H A Dcms-test.pl438 $n2 = sysread $fp2, $rd2, 4096;
439 last if ( $n1 != $n2 );
/macosx-10.10/tcl-105/tcl_ext/incrtcl/incrTcl/itcl/tests/old/
H A Dtestlib.tcl102 set n2 [lindex $list2 $i]
104 if {![test_cmp_nums $n1 $n2]} {
/macosx-10.10/cxxfilt-11/cxxfilt/binutils/testsuite/binutils-all/
H A Dar.exp40 set n2 "abcdefghijklmnopqrstuvwxyz2"
42 set file2 tmpdir/$n2
60 set status [catch "set f [open tmpdir/$n2 w]" errs]
62 verbose -log "open tmpdir/$n2 returned $errs"
102 remote_file build delete tmpdir/$n2
106 if ![string match "$n1*$n2" $got] {
127 remote_upload host $n2 tmpdir/$n2
129 set file2 tmpdir/$n2
132 set file2 $n2
[all...]
/macosx-10.10/cups-408/cups/cgi-bin/
H A Dhelp-index.c1239 help_node_t *n2) /* I - Second node */
1244 DEBUG_printf(("2help_sort_by_name(n1=%p(%s#%s), n2=%p(%s#%s)",
1246 n2, n2->filename, n2->anchor));
1248 if ((diff = strcmp(n1->filename, n2->filename)) != 0)
1251 if (!n1->anchor && !n2->anchor)
1255 else if (!n2->anchor)
1258 return (strcmp(n1->anchor, n2->anchor));
1268 help_node_t *n2) /*
1238 help_sort_by_name(help_node_t *n1, help_node_t *n2) argument
1267 help_sort_by_score(help_node_t *n1, help_node_t *n2) argument
[all...]
/macosx-10.10/Security-57031.1.35/Security/include/security_cryptkit/
H A DgiantFFT.c274 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_cryptkit/lib/
H A DgiantFFT.c274 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/ICU-531.30/icuSources/common/
H A Dunormcmp.cpp538 UBool _normalize(const Normalizer2 *n2, const UChar *s, int32_t length, argument
543 int32_t spanQCYes=n2->spanQuickCheckYes(str, *pErrorCode);
558 n2->normalizeSecondAndAppend(normalized, unnormalized, *pErrorCode);
606 const Normalizer2 *n2; local
608 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
610 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
618 FilteredNormalizer2 fn2(*n2, *uni32);
628 if(_normalize(n2, s1, length1, fcd1, pErrorCode)) {
632 if(_normalize(n2, s2, length2, fcd2, pErrorCode)) {
H A Dnormlzr.cpp139 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
142 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
145 n2->normalize(source, *dest, status);
174 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
177 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
180 return n2->quickCheck(source, status);
191 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
194 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
197 return n2->isNormalized(source, status);
225 const Normalizer2 *n2 local
[all...]
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/
H A DGraph.h129 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/Heimdal-398.1.2/lib/hx509/
H A Dtest_name.c298 hx509_name n1, n2; local
303 ret = hx509_cert_get_subject(c2, &n2);
306 *l = hx509_name_cmp(n1, n2);
308 hx509_name_free(&n2);
/macosx-10.10/bash-94.1.2/bash-3.2/examples/scripts/
H A Ddd-ex.sh68 # add variable n1 n2 n3...
69 # assigns n1+n2+n3+... to variable
91 # subtract variable n1 n2
92 # subtracts n2 from n1, assigns result to variable
106 # multiply variable n1 n2
107 # variable = n1 * n2
118 # divide variable n1 n2
119 # variable = int( n1 / n2 )
130 # compare variable n1 n2 sets variable to lt if n1<n2, g
[all...]
/macosx-10.10/JavaScriptCore-7600.1.17/runtime/
H A DOperations.h122 double n2; local
129 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
131 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
136 return n1 < n2;
156 double n2; local
163 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
165 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
170 return n1 <= n2;
/macosx-10.10/Heimdal-398.1.2/tests/gss/
H A Dcheck-gssmask.in54 gssmaskn2="${gssmask} -p 8890 --spn=host/n2.test.h5l.se@${R} --logfile=n2.log"
76 ${kadmin} add -p p2 --use-defaults host/n2.test.h5l.se@${R} || exit 1
79 ${kadmin} ext -k ${keytab} host/n2.test.h5l.se@${R} || exit 1
109 ${gssmaskn2} --moniker=n2 &
/macosx-10.10/emacs-93/emacs/lisp/eshell/
H A Desh-ext.el75 suffixes n1 n2 file)
80 (setq n2 (concat n1 (car suffixes)))
81 (if (and (or (file-executable-p n2)
83 (file-readable-p n2)))
84 (not (file-directory-p n2)))
85 (setq file n2 suffixes nil list nil))
/macosx-10.10/system_cmds-643.1.1/sa.tproj/
H A Dmain.c521 double n1, n2; local
528 n2 = (double) c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1);
531 n2 = c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1);
534 if (n1 < n2)
536 else if (n1 == n2)
569 double n1, n2; local
579 n2 = (double) c2.ci_mem / (double) (t2 ? t2 : 1);
582 n2 = c2.ci_mem / (t2 ? t2 : 1);
585 if (n1 < n2)
587 else if (n1 == n2)
[all...]
/macosx-10.10/OpenSSH-189/osslshim/ossl/
H A Dossl-bn.c3228 /* r is 2*n2 words in size,
3229 * a and b are both n2 words in size.
3230 * n2 must be a power of 2.
3232 * t must be 2*n2 words in size
3238 /* dnX may not be positive, but n2/2+dnX has to be */
3239 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
3242 int n = n2/2, c1, c2;
3248 fprintf(stderr, " bn_mul_recursive %d%+d * %d%+d\n", n2, dna, n2, dnb);
3252 if (n2
3401 int i, j, n2 = n*2; local
3559 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
3589 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument
5413 bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
[all...]
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h189 &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 =

Completed in 419 milliseconds

123456789