| /src/usr.bin/chpass/ |
| table.c | 46 char e2[] = ":,"; variable
56 { "full name", p_gecos, 0, 9, e2, ""},
57 { "office phone", p_gecos, 0, 12, e2, ""},
58 { "home phone", p_gecos, 0, 10, e2, ""},
59 { "location", p_gecos, 0, 8, e2, ""},
|
| /src/external/bsd/libarchive/dist/libarchive/test/ |
| test_link_resolver.c | 29 struct archive_entry *entry, *e2; local
44 archive_entry_linkify(resolver, &entry, &e2);
47 assert(e2 == NULL);
55 archive_entry_linkify(resolver, &entry, &e2);
57 assert(e2 == NULL);
63 archive_entry_linkify(resolver, &entry, &e2);
64 assert(e2 == NULL);
76 archive_entry_linkify(resolver, &entry, &e2);
78 assert(e2 == NULL);
83 archive_entry_linkify(resolver, &entry, &e2);
94 struct archive_entry *entry, *e2; local
129 struct archive_entry *entry, *e2; local
[all...] |
| test_entry.c | 59 struct archive_entry *e, *e2; local
525 e2 = archive_entry_clone(e);
528 assertEqualInt(archive_entry_atime(e2), 13579);
529 assertEqualInt(archive_entry_atime_nsec(e2), 24680);
530 assertEqualInt(archive_entry_birthtime(e2), 13779);
531 assertEqualInt(archive_entry_birthtime_nsec(e2), 24990);
532 assertEqualInt(archive_entry_ctime(e2), 13580);
533 assertEqualInt(archive_entry_ctime_nsec(e2), 24681);
534 assertEqualInt(archive_entry_dev(e2), 235);
538 assertEqualInt(archive_entry_gid(e2), 204)
[all...] |
| /src/tests/usr.bin/xlint/lint1/ |
| msg_242.c | 18 enum E e2 = e; local
30 sink_enum(e2);
|
| msg_277.c | 18 enum E e2 = e; local
25 sink_enum(e2);
|
| msg_333.c | 18 static typedef_color e2; variable
36 if (e2)
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| partition.c | 79 struct partition_elem *e2; local
100 e2 = &(elements[elem2]);
104 += elements[e2->class_element].class_count;
107 e2->class_element = class_element;
108 for (p = e2->next; p != e2; p = p->next)
114 e1->next = e2->next;
115 e2->next = old_next;
127 int e2 = * (const int *) elem2; local
128 if (e1 < e2)
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| partition.c | 79 struct partition_elem *e2; local
100 e2 = &(elements[elem2]);
104 += elements[e2->class_element].class_count;
107 e2->class_element = class_element;
108 for (p = e2->next; p != e2; p = p->next)
114 e1->next = e2->next;
115 e2->next = old_next;
127 int e2 = * (const int *) elem2; local
128 if (e1 < e2)
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| partition.c | 79 struct partition_elem *e2; local
100 e2 = &(elements[elem2]);
104 += elements[e2->class_element].class_count;
107 e2->class_element = class_element;
108 for (p = e2->next; p != e2; p = p->next)
114 e1->next = e2->next;
115 e2->next = old_next;
127 int e2 = * (const int *) elem2; local
128 if (e1 < e2)
[all...] |
| /src/usr.bin/make/ |
| str.c | 345 unsigned char e2 = (unsigned char)pat[2]; local
346 if ((e1 <= c && c <= e2)
347 || (e2 <= c && c <= e1))
|
| /src/external/gpl2/texinfo/dist/info/ |
| nodemenu.c | 119 char **e2 = (char **) entry2; local
121 return (strcasecmp (*e1, *e2));
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| matchexp.cc | 131 gfc_expr *e2; local
133 e2 = gfc_get_operator_expr (&e->where, INTRINSIC_PARENTHESES, e, NULL);
134 e2->ts = e->ts;
135 e2->rank = e->rank;
137 return e2;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sort.cc | 81 reorder23 (sort_ctx *c, char *e0, char *e1, char *e2)
90 memmove (out + 2*STRIDE, e2 + OFFSET, sizeof (TYPE));\
112 reorder45 (sort_ctx *c, char *e0, char *e1, char *e2, char *e3, char *e4)
119 memcpy (&t2, e2 + OFFSET, sizeof (TYPE)); \
169 char *e0 = in, *e1 = e0 + c->size, *e2 = e1 + c->size; local
173 CMP (e1, e2);
177 return reorder23 (c, e0, e1, e2);
178 char *e3 = e2 + c->size, *e4 = e3 + c->size;
182 CMP (e2, e4);
184 CMP (e2, e3)
[all...] |
| hw-doloop.cc | 202 edge e2; local
211 FOR_EACH_EDGE (e2, ei2, e->src->preds)
212 vec_safe_push (loop->incoming, e2);
|
| tree-ssa-ifcombine.cc | 163 edge e2 = find_edge (bb2, dest); local
171 PHI_ARG_DEF_FROM_EDGE (phi, e2), 0))
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/ryu/ |
| generic_128.c | 68 int32_t e2; local
74 e2 = 1 - bias - mantissaBits + 1 - 2;
76 e2 = ieeeExponent - bias - mantissaBits + 1 - 2;
81 e2 = 1 - bias - mantissaBits - 2;
84 e2 = ieeeExponent - bias - mantissaBits - 2;
92 printf("-> %s %s * 2^%d\n", ieeeSign ? "-" : "+", s(m2), e2 + 2);
107 if (e2 >= 0) {
109 // This expression is slightly faster than max(0, log10Pow2(e2) - 1).
110 const uint32_t q = log10Pow2(e2) - (e2 > 3)
[all...] |
| d2s.c | 80 int32_t e2; local
84 e2 = 1 - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS - 2;
87 e2 = (int32_t) ieeeExponent - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS - 2;
94 printf("-> %" PRIu64 " * 2^%d\n", m2, e2 + 2);
110 if (e2 >= 0) {
112 // This expression is slightly faster than max(0, log10Pow2(e2) - 1).
113 const uint32_t q = log10Pow2(e2) - (e2 > 3);
116 const int32_t i = -e2 + (int32_t) q + k;
125 printf("%" PRIu64 " * 2^%d / 10^%u\n", mv, e2, q)
413 const int32_t e2 = (int32_t) ieeeExponent - DOUBLE_BIAS - DOUBLE_MANTISSA_BITS; local
[all...] |
| f2s.c | 41 int32_t e2; local
45 e2 = 1 - FLOAT_BIAS - FLOAT_MANTISSA_BITS - 2;
48 e2 = (int32_t) ieeeExponent - FLOAT_BIAS - FLOAT_MANTISSA_BITS - 2;
55 printf("-> %u * 2^%d\n", m2, e2 + 2);
71 if (e2 >= 0) {
72 const uint32_t q = log10Pow2(e2);
75 const int32_t i = -e2 + (int32_t) q + k;
80 printf("%u * 2^%d / 10^%u\n", mv, e2, q);
88 lastRemovedDigit = (uint8_t) (mulPow5InvDivPow2(mv, q - 1, -e2 + (int32_t) q - 1 + l) % 10);
102 const uint32_t q = log10Pow5(-e2);
[all...] |
| /src/tests/lib/libm/ |
| t_log.c | 260 volatile long double e2 = local
279 ATF_CHECK_MSG((fabsf((log10f(e2) - (float)log10e2)/(float)log10e2) <
282 log10f(e2), log10f(e2), (float)log10e2, (float)log10e2);
283 ATF_CHECK_MSG((fabs((log10(e2) - (double)log10e2)/(double)log10e2) <
286 log10(e2), log10(e2), (double)log10e2, (double)log10e2);
287 ATF_CHECK_MSG((fabsl((log10l(e2) - log10e2)/log10e2) < 2*LDBL_EPSILON),
289 log10l(e2), log10l(e2), log10e2, log10e2)
578 volatile long double e2 = local
698 volatile long double e2 = local
[all...] |
| /src/usr.bin/infocmp/ |
| infocmp.c | 354 TIENT *e1, *e2, ee; local
371 e2 = &ents2[i2++];
374 e2 = ⅇ
379 e2 = &ents2[i2++];
380 ee.id = e2->id;
381 ee.type = e2->type;
386 if (e1->flag == e2->flag)
390 if (e1->flag == e2->flag)
395 if (e1->num == e2->num)
400 if (e1->num == e2->num
[all...] |
| /src/external/bsd/atf/dist/atf-c/detail/ |
| list.c | 376 struct list_entry *e1, *e2, *ghost1, *ghost2; local
382 e2 = ghost2->m_next;
387 e1->m_next = e2;
388 e2->m_prev = e1;
|
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| DbeJarFile.cc | 108 ZipEntry *e2 = *((ZipEntry **) b); local
109 return e1->compare (e2);
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| DbeJarFile.cc | 108 ZipEntry *e2 = *((ZipEntry **) b); local
109 return e1->compare (e2);
|
| /src/external/gpl3/gcc.old/dist/gcc/lto/ |
| lto-dump.cc | 136 const symbol_entry *e2 = *(const symbol_entry * const*) b; local
138 return e1->get_size () - e2->get_size ();
146 const symbol_entry *e2 = *(const symbol_entry * const*) b; local
148 return strcmp (e1->get_name (), e2->get_name ());
|
| /src/lib/libc/gdtoa/ |
| strtodg.c | 333 int dsign, e, e1, e2, emin, esign, finished, i, inex, irv; local
347 e2 = 0; /* XXX gcc */
576 e2 = e - i;
586 /* adj = */ rounded_product(dval(&adj), tens[e2]);
593 /* rv = */ rounded_product(dval(&rv), tens[e2]);
597 e1 -= e2;
614 e2 = 0;
621 e2 += ((word0(&rv) & Exp_mask)
628 e2 += ((word0(&rv) & Exp_mask) >> Exp_shift1) - Bias;
643 e2 += ((word0(&rv) & Exp_mask
[all...] |
