Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 25 of 145) sorted by relevance

123456

/onnv-gate/usr/src/cmd/fm/eversholt/files/sparc/sun4v/
H A Dn2piu.esc70 event fault.io.n2.soc@hostbridge/pciexrc,
72 event fault.io.n2.crossbar@hostbridge/pciexrc,
74 event fault.io.n2.dmu@hostbridge/pciexrc,
76 event fault.io.n2.ncu@hostbridge/pciexrc,
78 event fault.io.n2.siu@hostbridge/pciexrc,
80 event fault.io.n2.niu@hostbridge/pciexrc,
90 event ereport.io.n2.dmu.iotsbdesc_dpe@hostbridge/pciexrc{within(5s)};
95 event ereport.io.n2.peu.err_sds_los@hostbridge/pciexrc{within(5s)};
96 event ereport.io.n2.peu.lwc@hostbridge/pciexrc{within(5s)};
97 event ereport.io.n2.peu.nfp@hostbridge/pciexrc{within(5s)};
[all …]
/onnv-gate/usr/src/common/openssl/crypto/bn/
H A Dbn_mul.c392 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
395 int n=n2/2,c1,c2; in bn_mul_recursive()
401 fprintf(stderr," bn_mul_recursive %d * %d\n",n2,n2); in bn_mul_recursive()
405 if (n2 == 4) in bn_mul_recursive()
414 if (n2 == 8 && dna == 0 && dnb == 0) in bn_mul_recursive()
421 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) in bn_mul_recursive()
423 bn_mul_normal(r,a,n2+dna,b,n2+dnb); in bn_mul_recursive()
425 memset(&r[2*n2 + dna + dnb], 0, in bn_mul_recursive()
471 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
473 memset(&(t[n2]),0,8*sizeof(BN_ULONG)); in bn_mul_recursive()
[all …]
H A Dbn_sqr.c206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) in bn_sqr_recursive() argument
208 int n=n2/2; in bn_sqr_recursive()
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2); in bn_sqr_recursive()
215 if (n2 == 4) in bn_sqr_recursive()
224 else if (n2 == 8) in bn_sqr_recursive()
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) in bn_sqr_recursive()
235 bn_sqr_normal(r,a,n2,t); in bn_sqr_recursive()
249 p= &(t[n2*2]); in bn_sqr_recursive()
252 bn_sqr_recursive(&(t[n2]),t,n,p); in bn_sqr_recursive()
254 memset(&(t[n2]),0,n2*sizeof(BN_ULONG)); in bn_sqr_recursive()
[all …]
/onnv-gate/usr/src/cmd/crypt/
H A Dcrypt.c108 int i, n1, n2, nchar; in main() local
166 n2 = (int)((header.offset >> 8) &MASK); in main()
174 n2)&MASK] - n2)&MASK] - n1; in main()
178 n2++; in main()
179 if (n2 == ROTORSZ) n2 = 0; in main()
190 n2 = 0; in main()
193 i = t2[(t3[(t1[(i+n1)&MASK]+n2)&MASK]-n2)&MASK]-n1; in main()
198 n2++; in main()
199 if (n2 == ROTORSZ) n2 = 0; in main()
/onnv-gate/usr/src/cmd/cron/
H A Delm.c238 struct notice *n, *n2; local
273 n2 = k->notice;
274 for (i = 1; i <= NLIM/2; i++) n2 = n2->left;
277 k2->time = n2->time;
279 k2->notice = n2;
284 n2->key = k2; /* have n2 point back to k2 */
293 n2 = k->notice;
294 while (n2->time > time) n2 = n2->left;
295 n->right = n2->right;
296 n->left = n2;
[all …]
/onnv-gate/usr/src/lib/libtnfctl/
H A Ddbg.h57 #define DBG_TNF_PROBE_2(a, b, c, t1, n1, v1, t2, n2, v2) \ argument
58 TNF_PROBE_2(a, b, c, t1, n1, v1, t2, n2, v2)
59 #define DBG_TNF_PROBE_3(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3) \ argument
60 TNF_PROBE_3(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3)
62 #define DBG_TNF_PROBE_4(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3, t4, n4, v4) \ argument
63 TNF_PROBE_4(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3, t4, n4, v4)
71 #define DBG_TNF_PROBE_2(a, b, c, t1, n1, v1, t2, n2, v2) \
73 #define DBG_TNF_PROBE_3(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3) \
76 #define DBG_TNF_PROBE_4(a, b, c, t1, n1, v1, t2, n2, v2, t3, n3, v3, t4, n4, v4) \
/onnv-gate/usr/src/lib/libcmd/common/
H A Dcomm.c69 register int n1, n2, n, comp; in comm() local
73 n2 = sfvalue(in2); in comm()
76 n=(n1<n2?n1:n2); in comm()
77 if((comp=memcmp(cp1,cp2,n-1))==0 && (comp=n1-n2)==0) in comm()
93 n2 = sfvalue(in2); in comm()
101 if(sfwrite(out,cp2,n2) < 0) in comm()
105 n2 = sfvalue(in2); in comm()
120 n1 = n2; in comm()
H A Djoin.c645 register int n2; in join() local
656 n2 = jp->file[1].fieldlen; in join()
660 n = n1 < n2 ? n1 : n2; in join()
662 …if (!n && !(cmp = n1 < n2 ? -1 : (n1 > n2)) || n && !(cmp = (int)*cp1 - (int)*cp2) && !(cmp = jp->… in join()
663 cmp = n1 - n2; in join()
667 …n2 ? -1 : (n1 > n2)) || n && !(cmp = (int)*cp1 - (int)*cp2) && !(cmp = jp->ignorecase ? strncasecm… in join()
699 n2 = jp->file[1].fieldlen; in join()
712 if (n2 > jp->samesize) in join()
714 jp->samesize = roundof(n2, 16); in join()
721 memcpy(jp->same, cp2, o2 = n2); in join()
[all …]
/onnv-gate/usr/src/common/openssl/crypto/rand/
H A Drandtest.c73 unsigned long n2[16]; in main() local
87 for (i=0; i<16; i++) n2[i]=0; in main()
97 n2[j&0x0f]++; in main()
98 n2[(j>>4)&0x0f]++; in main()
137 d+=n2[i]*n2[i]; in main()
147 d+=n2[i]*n2[i]; in main()
/onnv-gate/usr/src/lib/libxcurses/h/
H A Dmks.h310 #define VARARG2(t1, n1, t2, n2) (t1 n1, t2 n2, ...) argument
311 #define VARARG3(t1, n1, t2, n2, t3, n3) (t1 n1, t2 n2, t3 n3, ...) argument
312 #define VARARG4(t1, n1, t2, n2, t3, n3, t4, n4) \ argument
313 (t1 n1, t2 n2, t3 n3, t4 n4, ...)
314 #define VARARG5(t1, n1, t2, n2, t3, n3, t4, n4, t5, n5) \ argument
315 (t1 n1, t2 n2, t3 n3, t4 n4, t5 n5, ...)
318 #define VARARG2(t1, n1, t2, n2) (n1, n2, va_alist) t1 n1; t2 n2; int va_alist argument
319 #define VARARG3(t1, n1, t2, n2, t3, n3) (n1, n2, n3, va_alist) \ argument
320 t1 n1; t2 n2; t3 n3; int va_alist
321 #define VARARG4(t1, n1, t2, n2, t3, n3, t4, n4) (n1, n2, n3, n4, va_alist) \ argument
[all …]
/onnv-gate/usr/src/cmd/fm/modules/common/fabric-xlate/
H A Dfabric-xlate.conf35 subscribe ereport.io.n2.dmu.iotsbdesc_inv
36 subscribe ereport.io.n2.dmu.sun4v_adj_va_uf
37 subscribe ereport.io.n2.dmu.sun4v_inv_pg_sz
38 subscribe ereport.io.n2.dmu.sun4v_key_err
39 subscribe ereport.io.n2.dmu.sun4v_va_oor
/onnv-gate/usr/src/lib/libcmdutils/common/
H A Davltree.c136 tree_node_t *n2 = (tree_node_t *)p2; in tnode_compare() local
139 if (n1->node_dev < n2->node_dev) { in tnode_compare()
141 } else if (n1->node_dev == n2->node_dev) { in tnode_compare()
143 if (n1->node_ino < n2->node_ino) { in tnode_compare()
145 } else if (n1->node_ino == n2->node_ino) { in tnode_compare()
/onnv-gate/usr/src/common/openssl/crypto/idea/
H A Di_skey.c129 long n1,n2,q,r,b1,b2,t; in inverse() local
136 n2=xin; in inverse()
141 r=(n1%n2); in inverse()
142 q=(n1-r)/n2; in inverse()
147 n1=n2; in inverse()
148 n2=r; in inverse()
/onnv-gate/usr/src/lib/libsldap/common/
H A Dns_crypt.c169 int i, n1, n2; in modvalue() local
176 n2 = 0; in modvalue()
179 s[i] = t2[(t3[(t1[(str[i]+n1)&MASK]+n2)&MASK]-n2)&MASK]-n1; in modvalue()
184 n2++; in modvalue()
185 if (n2 == ROTORSIZE) n2 = 0; in modvalue()
/onnv-gate/usr/src/cmd/mdb/common/mdb/
H A Dmdb_pipeio.c107 size_t n2 = n - n1; in pio_read() local
109 ASSERT(n2 <= pd->pipe_wrndx); in pio_read()
112 bcopy(&pd->pipe_buf[0], buf, n2); in pio_read()
113 buf = (char *)buf + n2; in pio_read()
171 size_t n2 = n - n1; in pio_write() local
173 ASSERT(n2 <= pd->pipe_rdndx); in pio_write()
177 bcopy(buf, &pd->pipe_buf[0], n2); in pio_write()
178 buf = (const char *)buf + n2; in pio_write()
/onnv-gate/usr/src/lib/libsqlite/src/
H A Dhash.c77 static int intCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in intCompare() argument
78 return n2 - n1; in intCompare()
89 static int ptrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
102 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in strCompare() argument
103 if( n1!=n2 ) return n2-n1; in strCompare()
118 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in binCompare() argument
119 if( n1!=n2 ) return n2-n1; in binCompare()
/onnv-gate/usr/src/cmd/isns/isnsd/
H A Dsched.c467 el_notice_t *n, *n2; in el_remove() local
496 n2 = n; in el_remove()
497 k = n2->key; in el_remove()
499 n2 = n2->sucd; in el_remove()
500 k = n2->key; in el_remove()
530 n2 = n->sucd; in el_remove()
531 while (n2 != NULL && n2->isdummy) { in el_remove()
532 n2 = n2->sucd; in el_remove()
534 curr = n2; in el_remove()
/onnv-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dchk_trans.c49 const krb5_data *n1, const krb5_data *n2) { in process_intermediates() argument
54 (int) n1->length, n1->data, (int) n2->length, n2->data)); in process_intermediates()
57 len2 = n2->length; in process_intermediates()
67 n1 = n2; in process_intermediates()
68 n2 = p; in process_intermediates()
72 if (memcmp (n1->data, n2->data, len1)) { in process_intermediates()
74 (int) n1->length, n1->data, (int) n2->length, n2->data)); in process_intermediates()
85 p2 = n2->data; in process_intermediates()
/onnv-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/
H A Dutil_ordering.c90 after(gssint_uint64 n1, gssint_uint64 n2, gssint_uint64 mask) in after() argument
101 if (n1 == n2) in after()
106 if (n1 > n2) { in after()
107 diff = n1 - n2; in after()
110 diff = n2 - n1; in after()
/onnv-gate/usr/src/lib/lvm/libmeta/common/
H A Dmeta_mh.c589 const char *n2 = di2->dif_name; in compare_drives() local
596 if (n2 == NULL) in compare_drives()
597 n2 = ""; in compare_drives()
610 if ((n2 = strrchr(n2, '/')) == NULL) in compare_drives()
612 n2 += (n2[1] != 'c') ? 2 : 1; in compare_drives()
613 cl = strlen(n2); in compare_drives()
614 if ((sscanf(n2, "c%ut%ud%us%u%n", &c2, &t2, &d2, &s2, &l) != 4 && in compare_drives()
615 sscanf(n2, "c%ud%us%u%n", &c2, &d2, &s2, &l) != 3 && in compare_drives()
616 sscanf(n2, "c%ut%ud%u%n", &c2, &t2, &d2, &l) != 3 && in compare_drives()
617 sscanf(n2, "c%ud%u%n", &c2, &d2, &l) != 2) || (l != cl)) in compare_drives()
/onnv-gate/usr/src/cmd/idmap/idmapd/
H A Didmapd.c528 trace_str(nvlist_t *entry, char *n1, char *n2, char *str) in trace_str() argument
533 if (n2 != NULL) in trace_str()
534 (void) strlcat(name, n2, sizeof (name)); in trace_str()
540 trace_int(nvlist_t *entry, char *n1, char *n2, int64_t i) in trace_int() argument
545 if (n2 != NULL) in trace_int()
546 (void) strlcat(name, n2, sizeof (name)); in trace_int()
552 trace_sid(nvlist_t *entry, char *n1, char *n2, idmap_sid *sid) in trace_sid() argument
560 trace_str(entry, n1, n2, str); in trace_sid()
/onnv-gate/usr/src/cmd/nscd/
H A Dgetnode.c79 ipaddr_compar(const void *n1, const void *n2) { in ipaddr_compar() argument
84 e2 = (nsc_entry_t *)n2; in ipaddr_compar()
119 ipname_compar(const void *n1, const void *n2) { in ipname_compar() argument
124 e2 = (nsc_entry_t *)n2; in ipname_compar()
H A Dgetserv.c71 servname_compar(const void *n1, const void *n2) { in servname_compar() argument
76 e2 = (nsc_entry_t *)n2; in servname_compar()
117 servport_compar(const void *n1, const void *n2) { in servport_compar() argument
122 e2 = (nsc_entry_t *)n2; in servport_compar()
/onnv-gate/usr/src/common/openssl/doc/crypto/
H A Dbn_internal.pod36 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
41 int n2, BN_ULONG *tmp);
43 int n2, BN_ULONG *tmp);
46 void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *tmp);
155 bn_mul_recursive(B<r>, B<a>, B<b>, B<n2>, B<dna>, B<dnb>, B<t>) operates
156 on the word arrays B<a> and B<b> of length B<n2>+B<dna> and B<n2>+B<dnb>
157 (B<dna> and B<dnb> are currently allowed to be 0 or negative) and the 2*B<n2>
158 word arrays B<r> and B<t>. B<n2> must be a power of 2. It computes
165 bn_mul_low_recursive(B<r>, B<a>, B<b>, B<n2>, B<tmp>) operates on the
166 B<n2> word arrays B<r> and B<tmp> and the B<n2>/2 word arrays B<a>
[all …]
/onnv-gate/usr/src/uts/common/sys/
H A Dtnf_probe.h203 #define TNF_DEFINE_RECORD_2(ctype, ctype_record, t1, n1, t2, n2) argument
208 #define TNF_DEFINE_RECORD_2(ctype, ctype_record, t1, n1, t2, n2) \ argument
222 ""#n2, \
257 buffer->data_2 = t2(ops, the_ctype->n2, \
267 #define TNF_DEFINE_RECORD_3(ctype, ctype_record, t1, n1, t2, n2, t3, n3) argument
272 #define TNF_DEFINE_RECORD_3(ctype, ctype_record, t1, n1, t2, n2, t3, n3) \ argument
288 ""#n2, \
324 buffer->data_2 = t2(ops, the_ctype->n2, \
336 #define TNF_DEFINE_RECORD_4(ctype, ctype_record, t1, n1, t2, n2, t3, n3, t4, n4) argument
341 #define TNF_DEFINE_RECORD_4(ctype, ctype_record, t1, n1, t2, n2, t3, n3, t4, n4) \ argument
[all …]

123456