Searched refs:e1 (Results 1 - 25 of 103) sorted by relevance

12345

/freebsd-10.1-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/decls/
H A Dtst.pointers.d38 extern int e0, *e1, **e2, ***e3, ****e4, *****e5;
H A Dtst.basics.d39 extern void *e1;
/freebsd-10.1-release/sys/contrib/ngatm/netnatm/sig/
H A Dsig_verify.c147 struct uni_ierr *e1; local
150 FOREACH_ERR(e1, uni) {
152 " act=%u", e1->ie, e1->err, e1->man, e1->act);
164 FOREACH_ERR(e1, uni) {
165 if (e1->err == UNI_IERR_MIS) {
182 FOREACH_ERR(e1, uni) {
183 if (e1
396 struct uni_ierr *e1, *e0; local
430 struct uni_ierr *e1, *e0; local
[all...]
/freebsd-10.1-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/
H A Dtst.struct.d49 uint32_t e1;
55 uint64_t e1;
66 printf("e1 = \"%s\"\n", stringof(copyinstr(e32->e1)));
79 printf("e1 = \"%s\"\n", stringof(copyinstr(e64->e1)));
H A Dtst.typedef.d50 uint32_t e1;
56 uint64_t e1;
67 printf("e1 = \"%s\"\n", stringof(copyinstr(e32->e1)));
80 printf("e1 = \"%s\"\n", stringof(copyinstr(e64->e1)));
/freebsd-10.1-release/contrib/gdtoa/
H A DstrtoIg.c44 Long e1; local
52 e1 = exp[0];
78 if (++e1 > fpi->emax)
93 e1 = fpi->emax;
107 if (e1 == fpi->emin) {
117 --e1;
128 exp[0] = e1;
134 exp[1] = e1;
H A Dstrtodg.c326 int dsign, e, e1, e2, emin, esign, finished, i, inex, irv; local
530 e1 = e -= nf;
569 e1 -= e;
579 e1 -= i;
599 e1 -= e2;
607 e1 -= e;
612 e1 += nd - k;
614 /* Get starting approximation = rv * 10**e1 */
617 if (e1 > 0) {
618 if ( (i = e1
[all...]
H A Dgethex.c50 Long e, e1; local
140 e1 = n - 0x10;
142 if (e1 & 0xf8000000)
144 e1 = 10*e1 + n - 0x10;
147 e1 = -e1;
148 e += e1;
H A Dstrtod.c96 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign; local
340 e1 = e -= nf;
431 e1 += nd - k;
453 /* Get starting approximation = rv * 10**e1 */
455 if (e1 > 0) {
456 if ( (i = e1 & 15) !=0)
458 if (e1 &= ~15) {
459 if (e1 > DBL_MAX_10_EXP) {
500 e1 >>= 4;
501 for(j = 0; e1 >
[all...]
/freebsd-10.1-release/contrib/binutils/libiberty/
H A Dpartition.c78 struct partition_elem *e1; local
99 e1 = &(elements[elem1]);
113 old_next = e1->next;
114 e1->next = e2->next;
126 int e1 = * (const int *) elem1; local
128 if (e1 < e2)
130 else if (e1 > e2)
/freebsd-10.1-release/contrib/gcclibs/libiberty/
H A Dpartition.c78 struct partition_elem *e1; local
99 e1 = &(elements[elem1]);
113 old_next = e1->next;
114 e1->next = e2->next;
126 int e1 = * (const int *) elem1; local
128 if (e1 < e2)
130 else if (e1 > e2)
/freebsd-10.1-release/contrib/nvi/ex/
H A Dex_mkexrc.c81 goto e1;
83 goto e1;
85 goto e1;
87 goto e1;
96 e1: sverrno = errno;
/freebsd-10.1-release/contrib/gcc/
H A Dtree-ssa-phiopt.c159 edge e1, e2; local
170 e1 = EDGE_SUCC (bb, 0);
171 bb1 = e1->dest;
176 if ((e1->flags & EDGE_ABNORMAL) != 0
192 edge e_tmp = e1;
195 e1 = e2;
201 e1 = EDGE_SUCC (bb1, 0);
205 || (e1->flags & EDGE_FALLTHRU) == 0)
222 arg0 = PHI_ARG_DEF_TREE (phi, e1->dest_idx);
230 if (conditional_replacement (bb, bb1, e1, e
374 conditional_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
544 value_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
622 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
873 abs_replacement(basic_block cond_bb, basic_block middle_bb, edge e0 ATTRIBUTE_UNUSED, edge e1, tree phi, tree arg0, tree arg1) argument
[all...]
H A Dtracer.c100 better_p (edge e1, edge e2) argument
102 if (e1->count != e2->count)
103 return e1->count > e2->count;
104 if (e1->src->frequency * e1->probability !=
106 return (e1->src->frequency * e1->probability
110 if (e1->src != e2->src)
111 return e1->src->index > e2->src->index;
112 return e1
[all...]
H A Dtree-vn.c99 expressions_equal_p (tree e1, tree e2) argument
103 if (e1 == e2)
106 te1 = TREE_TYPE (e1);
109 if (TREE_CODE (e1) == TREE_LIST && TREE_CODE (e2) == TREE_LIST)
111 tree lop1 = e1;
113 for (lop1 = e1, lop2 = e2;
125 else if (TREE_CODE (e1) == TREE_CODE (e2)
127 && operand_equal_p (e1, e2, OEP_PURE_SAME))
H A Dloop-invariant.c310 invariant_expr_equal_p (rtx insn1, rtx e1, rtx insn2, rtx e2) argument
312 enum rtx_code code = GET_CODE (e1);
322 if (code != GET_CODE (e2) || GET_MODE (e1) != GET_MODE (e2))
332 return rtx_equal_p (e1, e2);
335 use1 = df_find_use (df, insn1, e1);
343 return rtx_equal_p (e1, e2);
361 sub1 = XEXP (e1, i);
370 if (XVECLEN (e1, i) != XVECLEN (e2, i))
373 for (j = 0; j < XVECLEN (e1, i); j++)
375 sub1 = XVECEXP (e1,
408 eq_invariant_expr(const void *e1, const void *e2) argument
[all...]
/freebsd-10.1-release/usr.bin/cmp/
H A Dregular.c62 u_char ch, *p1, *p2, *m1, *m2, *e1, *e2; local
104 e1 = m1 + MMAP_CHUNK;
125 if (++p1 == e1) {
131 e1 = m1 + MMAP_CHUNK;
/freebsd-10.1-release/usr.sbin/pkg_install/lib/
H A Dversion.c278 unsigned long e1, e2, r1, r2; local
281 v1 = split_version(pkg1, &ve1, &e1, &r1);
285 if (e1 != e2) {
286 result = (e1 < e2 ? -1 : 1);
/freebsd-10.1-release/usr.sbin/nscd/
H A Dconfig.c70 configuration_entry_sort_cmp(const void *e1, const void *e2) argument
72 return (strcmp((*((struct configuration_entry **)e1))->name,
78 configuration_entry_cmp(const void *e1, const void *e2) argument
80 return (strcmp((const char *)e1,
86 configuration_entry_cache_mp_sort_cmp(const void *e1, const void *e2) argument
88 return (strcmp((*((cache_entry *)e1))->params->entry_name,
94 configuration_entry_cache_mp_cmp(const void *e1, const void *e2) argument
96 return (strcmp((const char *)e1,
102 configuration_entry_cache_mp_part_cmp(const void *e1, const void *e2) argument
104 return (strncmp((const char *)e1,
[all...]
/freebsd-10.1-release/tools/regression/lib/libc/nss/
H A Dtestutil.h132 struct ent##_entry *e1, *e2; \
139 e1 = STAILQ_FIRST(&td1->snapshot_data); \
144 if ((e1 == NULL) || (e2 == NULL)) { \
145 if (e1 == e2) \
151 rv = cmp_func(&e1->data, &e2->data, mdata); \
152 e1 = STAILQ_NEXT(e1, entries); \
/freebsd-10.1-release/contrib/atf/atf-c/detail/
H A Dlist.c376 struct list_entry *e1, *e2, *ghost1, *ghost2; local
381 e1 = ghost1->m_prev;
387 e1->m_next = e2;
388 e2->m_prev = e1;
/freebsd-10.1-release/sys/geom/part/
H A Dg_part.c269 struct g_part_entry *e1, *e2; local
287 LIST_FOREACH(e1, &table->gpt_entry, gpe_entry) {
288 if (e1->gpe_deleted || e1->gpe_internal)
290 if (e1->gpe_start < table->gpt_first) {
292 "LBA: %jd < %jd\n", e1->gpe_index,
293 (intmax_t)e1->gpe_start,
297 if (e1->gpe_start > table->gpt_last) {
299 "LBA: %jd > %jd\n", e1->gpe_index,
300 (intmax_t)e1
[all...]
/freebsd-10.1-release/crypto/heimdal/lib/asn1/
H A Dcheck-gen.c277 KRB_ERROR e1; local
282 e1.pvno = 5;
283 e1.msg_type = 30;
284 e1.ctime = NULL;
285 e1.cusec = NULL;
286 e1.stime = 1069632679;
287 e1.susec = 322981;
288 e1.error_code = 31;
289 e1.crealm = &realm;
290 e1
[all...]
/freebsd-10.1-release/sys/netgraph/bluetooth/l2cap/
H A Dng_l2cap_main.c549 ng_l2cap_node_con_list_ep *e1 = NULL; local
561 sizeof(*e1) + n * sizeof(*e2), M_NOWAIT);
567 e1 = (ng_l2cap_node_con_list_ep *)(rsp->data);
568 e2 = (ng_l2cap_node_con_ep *)(e1 + 1);
570 e1->num_connections = n;
596 ng_l2cap_node_chan_list_ep *e1 = NULL; local
615 e1 = (ng_l2cap_node_chan_list_ep *)(rsp->data);
616 e2 = (ng_l2cap_node_chan_ep *)(e1 + 1);
618 e1->num_channels = n;
/freebsd-10.1-release/contrib/unbound/smallapp/
H A Dworker_cb.c224 int order_lock_cmp(const void* e1, const void* e2) argument
226 struct order_id* o1 = (struct order_id*)e1;

Completed in 508 milliseconds

12345