| /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/libc/arch-arm/denver/bionic/ |
| D | memset.S | 88 it ne
92 it ne
96 it mi
155 it ne
160 it cs
163 it mi
176 it mi
179 it mi
|
| /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/malloc_debug/ |
| D | MapData.cpp | 127 auto it = entries_.find(entry); in ReadMaps() local
128 if (it == entries_.end()) { in ReadMaps()
151 auto it = entries_.find(&pc_entry); in find() local
152 if (it == entries_.end()) { in find()
155 it = entries_.find(&pc_entry); in find()
156 if (it == entries_.end()) { in find()
160 MapEntry* 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/tools/versioner/src/ |
| 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()
194 bool future = avail.arch_availability[*it.second.begin()].future; in generateGuardCondition()
209 to_string(*it.second.begin()).c_str(), to_string(arch).c_str()); in generateGuardCondition()
231 for (const auto& it : individual_archs) { in generateGuardCondition() local
232 const std::string& arch_expr = it.second; in generateGuardCondition()
[all …]
|
| D | DeclarationDatabase.cpp | 179 if (auto it = prefix_map.find(fragments[0]); it != prefix_map.end()) { in VisitDeclaratorDecl() local
186 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()
389 for (const auto& it : decl_av.arch_availability) { in to_string() local
390 if (!it.second.empty()) { in to_string()
391 ss << to_string(it.first) << ": " << to_string(it.second) << ", "; in to_string()
|
| D | DeclarationDatabase.h | 75 for (const auto& it : arch_availability) { in empty() local
76 if (!it.second.empty()) { in empty()
189 for (auto& it : declarations) {
190 it.second.dump(base_path, out, 4);
|
| D | versioner.cpp | 145 for (const auto& it : header_blacklist) { in collectRequirements() local
146 if (it.second.find(arch) == it.second.end()) { in collectRequirements()
150 if (header.endswith("/" + it.first)) { in collectRequirements()
267 for (const auto& it : decl->availability) { in getCompilationTypes() local
268 result.insert(it.first); in getCompilationTypes()
422 for (const auto& it : symbol_database) { in checkVersions() local
423 const std::string& symbol_name = it.first; in checkVersions()
|
| /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 | 65 it eq
107 it cs
109 it eq
151 it cs
181 it eq
229 it eq
244 it ne
274 it eq
306 it cs
|
| /bionic/linker/ |
| D | linker_config.cpp | 338 auto it = find_property(name, lineno); in get_strings() local
339 if (it == properties_.end()) { in get_strings()
344 std::vector<std::string> strings = android::base::Split(it->second.value(), ","); in get_strings()
354 auto it = find_property(name, lineno); in get_bool() local
355 if (it == properties_.end()) { in get_bool()
359 return it->second.value() == "true"; in get_bool()
363 auto it = find_property(name, lineno); in get_string() local
364 return (it == properties_.end()) ? "" : it->second.value(); in get_string()
407 auto it = properties_.find(name); in find_property() local
408 if (it != properties_.end() && lineno != nullptr) { in find_property()
[all …]
|
| D | linker_config.h | 138 auto it = namespace_configs_map_.find("default"); in default_namespace_config() local
139 return it == namespace_configs_map_.end() ? nullptr : it->second; in default_namespace_config()
|
| D | linker_allocator.cpp | 180 linker_vector_t::iterator it = std::lower_bound( in find_page_record() local
183 if (it == page_records_.end() || it->page_addr != addr) { in find_page_record()
188 return it; in find_page_record()
197 linker_vector_t::iterator it = std::lower_bound( in create_page_record() local
199 page_records_.insert(it, record); in create_page_record()
|
| /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 | 140 it eq
291 it eq
298 it eq
358 it ls
399 it eq
447 it eq
462 it ne
492 it eq
533 it cs
|
| D | __strcpy_chk.S | 86 it ne
110 it ne
|
| /bionic/libc/arch-arm/krait/bionic/ |
| D | strcmp.S | 140 it eq
291 it eq
298 it eq
371 it ls
411 it eq
426 it ne
466 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
|
| D | .gitignore | 31 # before PyInstaller builds the exe, so as to inject date/other infos into it.
|
| /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
|