| /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 | 78 if_list* it = list; in Free() local
79 list = it->next; in Free()
80 if (names_too) free(it->data.if_name); in Free()
81 free(it); in Free()
120 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex() local
128 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex() local
129 out->if_index = it->data.if_index; in if_nameindex()
130 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 | mntent_test.cpp | 52 auto it = std::find(fsnames.begin(), fsnames.end(), "proc"); in TEST() local
53 ASSERT_TRUE(it != fsnames.end()); in TEST()
54 size_t proc_index = it - fsnames.begin(); in TEST()
|
| D | ifaddrs_test.cpp | 164 for (const auto& it : inet_addrs) CheckAddressIsInSet(it.first, true, it.second); in TEST() local
165 for (const auto& it : broad_addrs) CheckAddressIsInSet(it.first, false, it.second); in TEST() local
|
| /bionic/tools/versioner/src/ |
| D | Preprocessor.cpp | 56 for (const auto& it : declaration.availability) { in calculateRequiredGuard() local
57 const CompilationType& type = it.first; in calculateRequiredGuard()
186 for (const auto& it : arch_sets) { in generateGuardCondition() local
187 const std::string& arch_expr = it.first; in generateGuardCondition()
188 const std::set<Arch>& archs = it.second; in generateGuardCondition()
204 to_string(*it.second.begin()).c_str(), to_string(arch).c_str()); in generateGuardCondition()
217 to_string(*it.second.begin()).c_str(), to_string(arch).c_str()); in generateGuardCondition()
235 for (const auto& it : individual_archs) { in generateGuardCondition() local
236 const std::string& arch_expr = it.second; in generateGuardCondition()
237 int introduced = avail.arch_availability[it.first].introduced; in generateGuardCondition()
[all …]
|
| D | DeclarationDatabase.cpp | 177 if (auto it = prefix_map.find(fragments[0].str()); it != prefix_map.end()) { in VisitDeclaratorDecl() local
184 for (int* ptr : it->second) { in VisitDeclaratorDecl()
297 for (const auto& it : this->availability) { in calculateAvailability()
298 if (!avail.merge(it.second)) { in calculateAvailability()
308 for (const auto& it : this->declarations) { in calculateAvailability()
310 if (it.second.is_definition) { in calculateAvailability()
315 if (!it.second.calculateAvailability(&decl_availability)) { in calculateAvailability()
385 for (const auto& it : decl_av.arch_availability) { in to_string() local
386 if (!it.second.empty()) { in to_string()
387 ss << to_string(it.first) << ": " << to_string(it.second) << ", "; in to_string()
|
| D | Arch.cpp | 53 auto it = arch_name_map.find(name); in arch_from_string() local
54 if (it == arch_name_map.end()) { in arch_from_string()
57 return std::make_optional(it->second); in arch_from_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()
192 for (auto& it : declarations) {
193 it.second.dump(base_path, out, 4);
|
| D | versioner.cpp | 144 for (const auto& it : ignored_headers) { 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()
419 for (const auto& it : symbol_database) { in checkVersions() local
420 const std::string& symbol_name = it.first; in checkVersions()
|
| /bionic/linker/ |
| D | linker_translate_path.cpp | 63 if (auto it = in translateSystemPathToApexPath() local
65 it != std::end(kPathTranslationQ)) { in translateSystemPathToApexPath()
66 *out_name_to_apex = (*it)[1]; in translateSystemPathToApexPath()
|
| D | linker_config.cpp | 365 auto it = find_property(name, lineno); in get_strings() local
366 if (it == properties_.end()) { in get_strings()
371 std::vector<std::string> strings = android::base::Split(it->second.value(), ","); in get_strings()
381 auto it = find_property(name, lineno); in get_bool() local
382 if (it == properties_.end()) { in get_bool()
386 return it->second.value() == "true"; in get_bool()
390 auto it = find_property(name, lineno); in get_string() local
391 return (it == properties_.end()) ? "" : it->second.value(); in get_string()
449 auto it = properties_.find(name); in find_property() local
450 if (it != properties_.end() && lineno != nullptr) { in find_property()
[all …]
|
| D | linker_config.h | 153 auto it = namespace_configs_map_.find("default"); in default_namespace_config() local
154 return it == namespace_configs_map_.end() ? nullptr : it->second; in default_namespace_config()
|
| D | linker.cpp | 785 auto it = soinfo_list.find(caller); in ElfW() local
786 CHECK (it != soinfo_list.end()); in ElfW()
787 start = ++it; in ElfW()
792 for (auto it = start, end = soinfo_list.end(); it != end; ++it) { in ElfW() local
793 soinfo* si = *it; in ElfW()
890 auto it = cache_.find(key); in get_or_open() local
891 if (it != cache_.end()) { in get_or_open()
892 *handle = it->second; in get_or_open()
912 for (const auto& it : cache_) { in ~ZipArchiveCache() local
913 CloseArchive(it.second); in ~ZipArchiveCache()
[all …]
|
| /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/libc/malloc_debug/ |
| D | MapData.cpp | 175 auto it = entries_.find(&pc_entry); in find() local
176 if (it == entries_.end()) { in find()
180 MapEntry* entry = *it; in find()
186 if (!entry->valid() && it != entries_.begin()) { in find()
187 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/arch-arm/cortex-a7/bionic/ |
| D | memset.S | 112 it ne
131 it mi
142 it mi
157 it mi
|
| /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 the module's TLS block. Before it can do this, it ensures that the module's TLS block is allocated.
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 …]
|
| D | clang_fortify_anatomy.md | 1 *This document was originally written for a broad audience, and it was*
2 *determined that it'd be good to hold in Bionic's docs, too. Due to the*
3 *ever-changing nature of code, it tries to link to a stable tag of*
35 increasingly strict versions of it. In general, FORTIFY doesn't require user
38 because FORTIFY has significant flexibility in what it considers to be an
135 FORTIFY'ed function from Bionic. From the user's perspective, it supports a few
151 is Android-specific (and orthogonal to FORTIFY anyway), so it will be ignored.
194 So let's walk through this step by step, to see how FORTIFY does what it says on
207 First, it's critical to notice that `mempcpy` is marked `overloadable`. This
219 is generally needed by FORTIFY, but it carries the side-effect that functions
[all …]
|
| D | native_allocator.md | 55 When set to zero, `mallopt(M_DECAY_TIME, 0)`, it is expected that an
62 implementation, but it should be a reasonable amount of time. The jemalloc
73 made by default. The idea is that it allows application frees to run a
79 possible, this call should clear thread cached memory if it exists. The
100 The allocation tests are not meant to be complete, so it is expected
147 For all of these benchmark runs, it can be useful to add these two options:
175 single allocation, touching every page in the allocation to make it resident
201 Only the time it takes to do the allocations is recorded, the frees are not
225 benchmark, only the time it takes to do the allocations is tracked, the
283 mallinfo benchmark, it's not necessary for this to be better than the previous
[all …]
|
| /bionic/libc/arch-arm/cortex-a15/bionic/ |
| D | memset.S | 133 it ne
146 it mi
167 it mi
|
| /bionic/libc/async_safe/ |
| D | README.md | 6 it among threads, whereas these functions connect to liblog for each log message. While it's
|
| /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
|