Searched refs:e1 (Results 1 – 4 of 4) sorted by relevance
| /bionic/libc/stdlib/ |
| D | strtod.c | 1237 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign; local
1400 e1 = e -= nf;
1465 e1 += nd - k;
1469 if (e1 > 0) {
1470 if ((i = e1 & 15) != 0)
1472 if (e1 &= ~15) {
1473 if (e1 > DBL_MAX_10_EXP) {
1481 if ((e1 = (unsigned int)e1 >> 4) != 0) {
1482 for(j = 0; e1 > 1; j++,
1483 e1 = (unsigned int)e1 >> 1)
[all …]
|
| /bionic/libc/bionic/ |
| D | malloc_leak.c | 106 HashEntry* e1 = *(HashEntry**)arg1; in hash_entry_compare() local
109 size_t nbAlloc1 = e1->allocations; in hash_entry_compare()
111 size_t size1 = e1->size & ~SIZE_FLAG_MASK; in hash_entry_compare()
353 HashEntry* e1 = gHashTable.slots[i]; in is_valid_entry() local
355 while (e1 != NULL) { in is_valid_entry()
356 if (e1 == entry) { in is_valid_entry()
360 e1 = e1->next; in is_valid_entry()
|
| /bionic/libc/netbsd/resolv/ |
| D | res_cache.c | 1081 entry_equals( const Entry* e1, const Entry* e2 ) in entry_equals() argument
1085 if (e1->querylen != e2->querylen) { in entry_equals()
1088 _dnsPacket_init(pack1, e1->query, e1->querylen); in entry_equals()
|
| /bionic/libc/kernel/tools/ |
| D | cpp.py | 1238 e1, i2 = c
1249 return (t.id, e1, e2), i3
1426 def is_equal_node(self,e1,e2): argument
1427 if e1[0] != e2[0] or len(e1) != len(e2):
1430 op = e1[0]
1432 return e1[0] == e2[0]
1434 return self.is_equal_node(e1[1],e2[1]) and self.is_equal_node(e1[2],e2[2])
|