Searched refs:names (Results 1 - 4 of 4) sorted by relevance
| /bionic/benchmarks/ |
| H A D | property_benchmark.cpp | 65 names = new char* [nprops];
76 names[i] = new char[PROP_NAME_MAX + 1];
79 if (j == 0 || names[i][j-1] == '.' || j == name_lens[i] - 1) {
89 names[i][j] = prop_name_chars[random() % prop_name_len];
91 names[i][name_lens[i]] = 0;
100 if (__system_property_add(names[i], name_lens[i], values[i], value_lens[i]) < 0) {
102 printf("%s = %.*s\n", names[i], value_lens[i], values[i]);
121 delete names[i];
124 delete[] names;
132 char** names; member in struct:LocalPropertyTestState
[all...] |
| H A D | math_benchmark.cpp | 23 static const char* names[] = { "1234.0", "nan", "HUGE_VAL", "0.0" }; variable
28 state.SetLabel(names[state.range_x()]);
|
| /bionic/libc/bionic/ |
| H A D | scandir.cpp | 114 ScandirResult names; local
117 // If we have a filter, skip names that don't match.
121 names.Add(entry);
124 names.Sort(comparator);
126 size_t size = names.size();
127 *name_list = names.release();
|
| /bionic/tests/ |
| H A D | dirent_test.cpp | 31 static void CheckProcSelf(std::set<std::string>& names) { argument
33 ASSERT_TRUE(names.find(".") != names.end());
34 ASSERT_TRUE(names.find("..") != names.end());
35 ASSERT_TRUE(names.find("cmdline") != names.end());
36 ASSERT_TRUE(names.find("fd") != names.end());
37 ASSERT_TRUE(names
[all...] |
Completed in 124 milliseconds