| /bionic/libc/bionic/ |
| D | pthread_atfork.cpp | 52 for (atfork_t* it = first_; it != nullptr; it = it->next) { in walk_forward() local
53 f(it); in walk_forward()
59 for (atfork_t* it = last_; it != nullptr; it = it->prev) { in walk_backwards() local
60 f(it); in walk_backwards()
78 atfork_t* it = first_; in remove_if() local
79 while (it != nullptr) { in remove_if()
80 if (predicate(it)) { in remove_if()
81 atfork_t* entry = it; in remove_if()
82 it = it->next; in remove_if()
85 it = it->next; in remove_if()
[all …]
|
| D | net_if.cpp | 88 if_list* it = list; in Free() local
89 list = it->next; in Free()
90 if (names_too) free(it->data.if_name); in Free()
91 free(it); in Free()
130 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex() local
138 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex() local
139 out->if_index = it->data.if_index; in if_nameindex()
140 out->if_name = it->data.if_name; in if_nameindex()
|
| /bionic/tests/ |
| D | net_if_test.cpp | 48 for (struct if_nameindex* it = list; it->if_index != 0; ++it) { in TEST() local
49 fprintf(stderr, "\t%d\t%s\n", it->if_index, it->if_name); in TEST()
50 if_nameindex_names.insert(it->if_name); in TEST()
51 EXPECT_EQ(it->if_index, if_nametoindex(it->if_name)); in TEST()
52 EXPECT_STREQ(it->if_name, if_indextoname(it->if_index, buf)); in TEST()
53 if (strcmp(it->if_name, "lo") == 0) saw_lo = true; in TEST()
61 for (ifaddrs* it = ifa; it != nullptr; it = it->ifa_next) { in TEST() local
62 getifaddrs_names.insert(it->ifa_name); in TEST()
|
| D | ifaddrs_test.cpp | 159 for (const auto& it : inet_addrs) CheckAddressIsInSet(it.first, true, it.second); in TEST() local
160 for (const auto& it : broad_addrs) CheckAddressIsInSet(it.first, false, it.second); in TEST() local
|
| /bionic/tools/versioner/src/ |
| D | Arch.cpp | 57 auto it = arch_name_map.find(name); in arch_from_string() local
58 if (it == arch_name_map.end()) { in arch_from_string()
61 return std::make_optional(it->second); in arch_from_string()
|
| D | Preprocessor.cpp | 56 for (const auto& it : declaration.availability) { in calculateRequiredGuard() local
57 const CompilationType& type = it.first; in calculateRequiredGuard()
185 for (const auto& it : arch_sets) { in generateGuardCondition() local
186 const std::string& arch_expr = it.first; in generateGuardCondition()
187 const std::set<Arch>& archs = it.second; in generateGuardCondition()
191 int version = avail.arch_availability[*it.second.begin()].introduced; in generateGuardCondition()
202 to_string(*it.second.begin()).c_str(), to_string(arch).c_str()); in generateGuardCondition()
224 for (const auto& it : individual_archs) { in generateGuardCondition() local
225 const std::string& arch_expr = it.second; in generateGuardCondition()
226 int introduced = avail.arch_availability[it.first].introduced; in generateGuardCondition()
[all …]
|
| D | DeclarationDatabase.cpp | 176 if (auto it = prefix_map.find(fragments[0]); it != prefix_map.end()) { in VisitDeclaratorDecl() local
183 for (int* ptr : it->second) { in VisitDeclaratorDecl()
294 for (const auto& it : this->availability) { in calculateAvailability()
295 if (!avail.merge(it.second)) { in calculateAvailability()
305 for (const auto& it : this->declarations) { in calculateAvailability()
307 if (it.second.is_definition) { in calculateAvailability()
312 if (!it.second.calculateAvailability(&decl_availability)) { in calculateAvailability()
382 for (const auto& it : decl_av.arch_availability) { in to_string() local
383 if (!it.second.empty()) { in to_string()
384 ss << to_string(it.first) << ": " << to_string(it.second) << ", "; in to_string()
|
| D | SymbolDatabase.cpp | 110 for (const auto& it : symbols) { in parsePlatforms() local
111 result[it.first][type] = it.second; in parsePlatforms()
|
| D | DeclarationDatabase.h | 74 for (const auto& it : arch_availability) { in empty() local
75 if (!it.second.empty()) { in empty()
188 for (auto& it : declarations) {
189 it.second.dump(base_path, out, 4);
|
| D | versioner.cpp | 144 for (const auto& it : header_blacklist) { in collectRequirements() local
145 if (it.second.find(arch) == it.second.end()) { in collectRequirements()
149 if (header.endswith("/" + it.first)) { in collectRequirements()
266 for (const auto& it : decl->availability) { in getCompilationTypes() local
267 result.insert(it.first); in getCompilationTypes()
417 for (const auto& it : symbol_database) { in checkVersions() local
418 const std::string& symbol_name = it.first; in checkVersions()
|
| /bionic/libc/malloc_debug/ |
| D | MapData.cpp | 158 auto it = entries_.find(entry); in ReadMaps() local
159 if (it == entries_.end()) { in ReadMaps()
182 auto it = entries_.find(&pc_entry); in find() local
183 if (it == entries_.end()) { in find()
186 it = entries_.find(&pc_entry); in find()
187 if (it == entries_.end()) { in find()
191 MapEntry* entry = *it; in find()
197 if (!entry->valid && it != entries_.begin()) { in find()
198 MapEntry* prev_entry = *--it; in find()
|
| D | README_marshmallow_and_earlier.md | 9 functional until API level 19, so using it on a version older than that
19 When malloc debug is enabled, it works by adding a shim layer that replaces
87 When a pointer is freed, do not free the memory right away, but add it to
94 on the list is removed and verified that it still contains the pattern 0xef.
100 are printed to the log as leaks. This isn't very useful since it tends
106 Do not use this option value, it only works on the emulator. It has not
107 been verified, so it may or may not work.
|
| /bionic/libc/upstream-openbsd/lib/libc/gen/ |
| D | alarm.c | 37 struct itimerval it, oitv; in alarm() local
38 struct itimerval *itp = ⁢ in alarm()
|
| /bionic/libc/arch-arm/cortex-a7/bionic/ |
| D | memset.S | 112 it ne
131 it mi
142 it mi
157 it mi
|
| /bionic/libc/arch-arm/generic/bionic/ |
| D | strcmp.S | 69 it eq
111 it cs
113 it eq
155 it cs
185 it eq
233 it eq
248 it ne
278 it eq
310 it cs
|
| /bionic/linker/ |
| D | linker_config.cpp | 368 auto it = find_property(name, lineno); in get_strings() local
369 if (it == properties_.end()) { in get_strings()
374 std::vector<std::string> strings = android::base::Split(it->second.value(), ","); in get_strings()
384 auto it = find_property(name, lineno); in get_bool() local
385 if (it == properties_.end()) { in get_bool()
389 return it->second.value() == "true"; in get_bool()
393 auto it = find_property(name, lineno); in get_string() local
394 return (it == properties_.end()) ? "" : it->second.value(); in get_string()
437 auto it = properties_.find(name); in find_property() local
438 if (it != properties_.end() && lineno != nullptr) { in find_property()
[all …]
|
| D | linker_config.h | 148 auto it = namespace_configs_map_.find("default"); in default_namespace_config() local
149 return it == namespace_configs_map_.end() ? nullptr : it->second; in default_namespace_config()
|
| /bionic/libc/arch-arm/cortex-a15/bionic/ |
| D | memset.S | 133 it ne
146 it mi
167 it mi
|
| D | strcmp.S | 144 it eq
295 it eq
302 it eq
376 it ls
|
| /bionic/libc/arch-arm/cortex-a9/bionic/ |
| D | strcmp.S | 144 it eq
295 it eq
302 it eq
362 it ls
403 it eq
451 it eq
466 it ne
496 it eq
537 it cs
|
| D | __strcpy_chk.S | 90 it ne
114 it ne
|
| /bionic/libc/arch-arm/krait/bionic/ |
| D | strcmp.S | 144 it eq
295 it eq
302 it eq
375 it ls
415 it eq
430 it ne
470 it cs
|
| /bionic/tools/bionicbb/ |
| D | README.md | 57 it finds interesting. This is a rather ugly hack, but it seems to be the
61 but it is only available over an SSH conection to gerrit, and the AOSP gerrit
65 change every time to see if it should be built, whereas project watches allow us
68 One drawback to this approach is that it's a hassle to set up the project
|
| /bionic/libc/malloc_hooks/ |
| D | README.md | 11 When malloc hooks is enabled, it works by adding a shim layer that replaces
62 the caller must guarantee that it does not depend on allocations/frees
69 app does intercept the allocation/free calls, it will eventually call
71 it runs the risk of crashing whenever a malloc\_usable\_size call is made.
115 of 32. This meant that to create a wrap property with the name of the app, it
|
| /bionic/docs/ |
| D | elf-tls.md | 37 Variant 1 places the static TLS block after the TP, whereas variant 2 places it before the TP.
41 it can correctly relocate TLS accesses. Both variants are incompatible with Bionic's current
45 if it hasn't been allocated yet). If the executable has a TLS segment, then it will always be module
105 module's TLS block. Before it can do this, it ensures that the module's TLS block is allocated. A
165 // tls_var could be defined in the executable, or it could be defined
214 use it, which can break `dlopen` if the surplus area is exhausted. See:
262 Static TLS Block, it can use a simple resolver function:
285 * In general, the resolver function must call `__tls_get_addr`, so it must save and restore all
334 than the compiler, so it can "relax" TLS accesses to more efficient models. For example, if an
365 can't link code using TLSDESC at all, except on arm64, where it's used by default.
[all …]
|