Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2014 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #include <fcntl.h> |
Mark Salyzyn | 696817d | 2014-04-18 14:49:28 -0700 | [diff] [blame] | 18 | #include <poll.h> |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 19 | #include <signal.h> |
| 20 | #include <stdio.h> |
| 21 | #include <string.h> |
| 22 | |
| 23 | #include <gtest/gtest.h> |
| 24 | |
| 25 | #include "cutils/sockets.h" |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 26 | #include "log/log.h" |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 27 | #include "log/logger.h" |
| 28 | |
| 29 | #define __unused __attribute__((__unused__)) |
| 30 | |
| 31 | /* |
| 32 | * returns statistics |
| 33 | */ |
| 34 | static void my_android_logger_get_statistics(char *buf, size_t len) |
| 35 | { |
Mark Salyzyn | 99f47a9 | 2014-04-07 14:58:08 -0700 | [diff] [blame] | 36 | snprintf(buf, len, "getStatistics 0 1 2 3 4"); |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 37 | int sock = socket_local_client("logd", |
| 38 | ANDROID_SOCKET_NAMESPACE_RESERVED, |
| 39 | SOCK_STREAM); |
| 40 | if (sock >= 0) { |
| 41 | if (write(sock, buf, strlen(buf) + 1) > 0) { |
Mark Salyzyn | 696817d | 2014-04-18 14:49:28 -0700 | [diff] [blame] | 42 | ssize_t ret; |
| 43 | while ((ret = read(sock, buf, len)) > 0) { |
| 44 | if ((size_t)ret == len) { |
| 45 | break; |
| 46 | } |
| 47 | len -= ret; |
| 48 | buf += ret; |
| 49 | |
| 50 | struct pollfd p = { |
| 51 | .fd = sock, |
| 52 | .events = POLLIN, |
| 53 | .revents = 0 |
| 54 | }; |
| 55 | |
| 56 | ret = poll(&p, 1, 20); |
| 57 | if ((ret <= 0) || !(p.revents & POLLIN)) { |
| 58 | break; |
| 59 | } |
| 60 | } |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 61 | } |
| 62 | close(sock); |
| 63 | } |
| 64 | } |
| 65 | |
| 66 | static void alloc_statistics(char **buffer, size_t *length) |
| 67 | { |
| 68 | size_t len = 8192; |
| 69 | char *buf; |
| 70 | |
| 71 | for(int retry = 32; (retry >= 0); delete [] buf, --retry) { |
| 72 | buf = new char [len]; |
| 73 | my_android_logger_get_statistics(buf, len); |
| 74 | |
| 75 | buf[len-1] = '\0'; |
| 76 | size_t ret = atol(buf) + 1; |
| 77 | if (ret < 4) { |
| 78 | delete [] buf; |
| 79 | buf = NULL; |
| 80 | break; |
| 81 | } |
| 82 | bool check = ret <= len; |
| 83 | len = ret; |
| 84 | if (check) { |
| 85 | break; |
| 86 | } |
| 87 | len += len / 8; // allow for some slop |
| 88 | } |
| 89 | *buffer = buf; |
| 90 | *length = len; |
| 91 | } |
| 92 | |
| 93 | static char *find_benchmark_spam(char *cp) |
| 94 | { |
| 95 | // liblog_benchmarks has been run designed to SPAM. The signature of |
| 96 | // a noisiest UID statistics is one of the following: |
| 97 | // |
| 98 | // main: UID/PID Total size/num Now UID/PID[?] Total |
| 99 | // 0 7500306/304207 71608/3183 0/4225? 7454388/303656 |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 100 | // <wrap> 93432/1012 |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 101 | // -or- |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 102 | // 0/gone 7454388/303656 93432/1012 |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 103 | // |
| 104 | // basically if we see a *large* number of 0/????? entries |
| 105 | unsigned long value; |
| 106 | do { |
| 107 | char *benchmark = strstr(cp, " 0/"); |
| 108 | char *benchmark_newline = strstr(cp, "\n0/"); |
| 109 | if (!benchmark) { |
| 110 | benchmark = benchmark_newline; |
| 111 | } |
| 112 | if (benchmark_newline && (benchmark > benchmark_newline)) { |
| 113 | benchmark = benchmark_newline; |
| 114 | } |
| 115 | cp = benchmark; |
| 116 | if (!cp) { |
| 117 | break; |
| 118 | } |
| 119 | cp += 3; |
| 120 | while (isdigit(*cp) || (*cp == 'g') || (*cp == 'o') || (*cp == 'n')) { |
| 121 | ++cp; |
| 122 | } |
| 123 | value = 0; |
| 124 | // ###? or gone |
| 125 | if ((*cp == '?') || (*cp == 'e')) { |
| 126 | while (*++cp == ' '); |
| 127 | while (isdigit(*cp)) { |
| 128 | value = value * 10ULL + *cp - '0'; |
| 129 | ++cp; |
| 130 | } |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 131 | if (*cp != '/') { |
| 132 | value = 0; |
| 133 | continue; |
| 134 | } |
| 135 | while (isdigit(*++cp)); |
| 136 | while (*cp == ' ') ++cp; |
| 137 | if (!isdigit(*cp)) { |
| 138 | value = 0; |
| 139 | } |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 140 | } |
| 141 | } while ((value < 900000ULL) && *cp); |
| 142 | return cp; |
| 143 | } |
| 144 | |
| 145 | TEST(logd, statistics) { |
| 146 | size_t len; |
| 147 | char *buf; |
| 148 | |
| 149 | alloc_statistics(&buf, &len); |
| 150 | |
| 151 | #ifdef TARGET_USES_LOGD |
| 152 | ASSERT_TRUE(NULL != buf); |
| 153 | #else |
| 154 | if (!buf) { |
| 155 | return; |
| 156 | } |
| 157 | #endif |
| 158 | |
| 159 | // remove trailing FF |
| 160 | char *cp = buf + len - 1; |
| 161 | *cp = '\0'; |
| 162 | bool truncated = *--cp != '\f'; |
| 163 | if (!truncated) { |
| 164 | *cp = '\0'; |
| 165 | } |
| 166 | |
| 167 | // squash out the byte count |
| 168 | cp = buf; |
| 169 | if (!truncated) { |
| 170 | while (isdigit(*cp) || (*cp == '\n')) { |
| 171 | ++cp; |
| 172 | } |
| 173 | } |
| 174 | |
| 175 | fprintf(stderr, "%s", cp); |
| 176 | |
| 177 | EXPECT_LT((size_t)64, strlen(cp)); |
| 178 | |
| 179 | EXPECT_EQ(0, truncated); |
| 180 | |
| 181 | #ifdef TARGET_USES_LOGD |
| 182 | char *main_logs = strstr(cp, "\nmain:"); |
| 183 | EXPECT_TRUE(NULL != main_logs); |
| 184 | |
| 185 | char *radio_logs = strstr(cp, "\nradio:"); |
| 186 | EXPECT_TRUE(NULL != radio_logs); |
| 187 | |
| 188 | char *system_logs = strstr(cp, "\nsystem:"); |
| 189 | EXPECT_TRUE(NULL != system_logs); |
| 190 | |
| 191 | char *events_logs = strstr(cp, "\nevents:"); |
| 192 | EXPECT_TRUE(NULL != events_logs); |
| 193 | #endif |
| 194 | |
| 195 | // Parse timing stats |
| 196 | |
| 197 | cp = strstr(cp, "Minimum time between log events per dgram_qlen:"); |
| 198 | |
| 199 | char *log_events_per_span = cp; |
| 200 | |
| 201 | if (cp) { |
| 202 | while (*cp && (*cp != '\n')) { |
| 203 | ++cp; |
| 204 | } |
| 205 | if (*cp == '\n') { |
| 206 | ++cp; |
| 207 | } |
| 208 | |
| 209 | char *list_of_spans = cp; |
| 210 | EXPECT_NE('\0', *list_of_spans); |
| 211 | |
| 212 | unsigned short number_of_buckets = 0; |
| 213 | unsigned short *dgram_qlen = NULL; |
| 214 | unsigned short bucket = 0; |
| 215 | while (*cp && (*cp != '\n')) { |
| 216 | bucket = 0; |
| 217 | while (isdigit(*cp)) { |
| 218 | bucket = bucket * 10 + *cp - '0'; |
| 219 | ++cp; |
| 220 | } |
| 221 | while (*cp == ' ') { |
| 222 | ++cp; |
| 223 | } |
| 224 | if (!bucket) { |
| 225 | break; |
| 226 | } |
| 227 | unsigned short *new_dgram_qlen = new unsigned short[number_of_buckets + 1]; |
| 228 | EXPECT_TRUE(new_dgram_qlen != NULL); |
| 229 | if (dgram_qlen) { |
| 230 | memcpy(new_dgram_qlen, dgram_qlen, sizeof(*dgram_qlen) * number_of_buckets); |
| 231 | delete [] dgram_qlen; |
| 232 | } |
| 233 | |
| 234 | dgram_qlen = new_dgram_qlen; |
| 235 | dgram_qlen[number_of_buckets++] = bucket; |
| 236 | } |
| 237 | |
| 238 | char *end_of_spans = cp; |
| 239 | EXPECT_NE('\0', *end_of_spans); |
| 240 | |
| 241 | EXPECT_LT(5, number_of_buckets); |
| 242 | |
| 243 | unsigned long long *times = new unsigned long long [number_of_buckets]; |
| 244 | ASSERT_TRUE(times != NULL); |
| 245 | |
| 246 | memset(times, 0, sizeof(*times) * number_of_buckets); |
| 247 | |
| 248 | while (*cp == '\n') { |
| 249 | ++cp; |
| 250 | } |
| 251 | |
| 252 | unsigned short number_of_values = 0; |
| 253 | unsigned long long value; |
| 254 | while (*cp && (*cp != '\n')) { |
| 255 | EXPECT_GE(number_of_buckets, number_of_values); |
| 256 | |
| 257 | value = 0; |
| 258 | while (isdigit(*cp)) { |
| 259 | value = value * 10ULL + *cp - '0'; |
| 260 | ++cp; |
| 261 | } |
| 262 | |
| 263 | switch(*cp) { |
| 264 | case ' ': |
| 265 | case '\n': |
| 266 | value *= 1000ULL; |
| 267 | /* FALLTHRU */ |
| 268 | case 'm': |
| 269 | value *= 1000ULL; |
| 270 | /* FALLTHRU */ |
| 271 | case 'u': |
| 272 | value *= 1000ULL; |
| 273 | /* FALLTHRU */ |
| 274 | case 'n': |
| 275 | default: |
| 276 | break; |
| 277 | } |
| 278 | while (*++cp == ' '); |
| 279 | |
| 280 | if (!value) { |
| 281 | break; |
| 282 | } |
| 283 | |
| 284 | times[number_of_values] = value; |
| 285 | ++number_of_values; |
| 286 | } |
| 287 | |
| 288 | #ifdef TARGET_USES_LOGD |
| 289 | EXPECT_EQ(number_of_values, number_of_buckets); |
| 290 | #endif |
| 291 | |
| 292 | FILE *fp; |
| 293 | ASSERT_TRUE(NULL != (fp = fopen("/proc/sys/net/unix/max_dgram_qlen", "r"))); |
| 294 | |
| 295 | unsigned max_dgram_qlen = 0; |
| 296 | fscanf(fp, "%u", &max_dgram_qlen); |
| 297 | |
| 298 | fclose(fp); |
| 299 | |
| 300 | // Find launch point |
| 301 | unsigned short launch = 0; |
| 302 | unsigned long long total = 0; |
| 303 | do { |
| 304 | total += times[launch]; |
| 305 | } while (((++launch < number_of_buckets) |
| 306 | && ((total / launch) >= (times[launch] / 8ULL))) |
| 307 | || (launch == 1)); // too soon |
| 308 | |
| 309 | bool failure = number_of_buckets <= launch; |
| 310 | if (!failure) { |
| 311 | unsigned short l = launch; |
| 312 | if (l >= number_of_buckets) { |
| 313 | l = number_of_buckets - 1; |
| 314 | } |
| 315 | failure = max_dgram_qlen < dgram_qlen[l]; |
| 316 | } |
| 317 | |
| 318 | // We can get failure if at any time liblog_benchmarks has been run |
| 319 | // because designed to overload /proc/sys/net/unix/max_dgram_qlen even |
| 320 | // at excessive values like 20000. It does so to measure the raw processing |
| 321 | // performance of logd. |
| 322 | if (failure) { |
| 323 | cp = find_benchmark_spam(cp); |
| 324 | } |
| 325 | |
| 326 | if (cp) { |
| 327 | // Fake a failure, but without the failure code |
| 328 | if (number_of_buckets <= launch) { |
| 329 | printf ("Expected: number_of_buckets > launch, actual: %u vs %u\n", |
| 330 | number_of_buckets, launch); |
| 331 | } |
| 332 | if (launch >= number_of_buckets) { |
| 333 | launch = number_of_buckets - 1; |
| 334 | } |
| 335 | if (max_dgram_qlen < dgram_qlen[launch]) { |
| 336 | printf ("Expected: max_dgram_qlen >= dgram_qlen[%d]," |
| 337 | " actual: %u vs %u\n", |
| 338 | launch, max_dgram_qlen, dgram_qlen[launch]); |
| 339 | } |
| 340 | } else |
| 341 | #ifndef TARGET_USES_LOGD |
| 342 | if (total) |
| 343 | #endif |
| 344 | { |
| 345 | EXPECT_GT(number_of_buckets, launch); |
| 346 | if (launch >= number_of_buckets) { |
| 347 | launch = number_of_buckets - 1; |
| 348 | } |
| 349 | EXPECT_GE(max_dgram_qlen, dgram_qlen[launch]); |
| 350 | } |
| 351 | |
| 352 | delete [] dgram_qlen; |
| 353 | delete [] times; |
| 354 | } |
| 355 | delete [] buf; |
| 356 | } |
| 357 | |
| 358 | static void caught_signal(int signum __unused) { } |
| 359 | |
| 360 | static void dump_log_msg(const char *prefix, |
| 361 | log_msg *msg, unsigned int version, int lid) { |
| 362 | switch(msg->entry.hdr_size) { |
| 363 | case 0: |
| 364 | version = 1; |
| 365 | break; |
| 366 | |
| 367 | case sizeof(msg->entry_v2): |
| 368 | if (version == 0) { |
| 369 | version = 2; |
| 370 | } |
| 371 | break; |
| 372 | } |
| 373 | |
| 374 | fprintf(stderr, "%s: v%u[%u] ", prefix, version, msg->len()); |
| 375 | if (version != 1) { |
| 376 | fprintf(stderr, "hdr_size=%u ", msg->entry.hdr_size); |
| 377 | } |
| 378 | fprintf(stderr, "pid=%u tid=%u %u.%09u ", |
| 379 | msg->entry.pid, msg->entry.tid, msg->entry.sec, msg->entry.nsec); |
| 380 | switch(version) { |
| 381 | case 1: |
| 382 | break; |
| 383 | case 2: |
| 384 | fprintf(stderr, "euid=%u ", msg->entry_v2.euid); |
| 385 | break; |
| 386 | case 3: |
| 387 | default: |
| 388 | lid = msg->entry.lid; |
| 389 | break; |
| 390 | } |
| 391 | |
| 392 | switch(lid) { |
| 393 | case 0: |
| 394 | fprintf(stderr, "lid=main "); |
| 395 | break; |
| 396 | case 1: |
| 397 | fprintf(stderr, "lid=radio "); |
| 398 | break; |
| 399 | case 2: |
| 400 | fprintf(stderr, "lid=events "); |
| 401 | break; |
| 402 | case 3: |
| 403 | fprintf(stderr, "lid=system "); |
| 404 | break; |
| 405 | default: |
| 406 | if (lid >= 0) { |
| 407 | fprintf(stderr, "lid=%d ", lid); |
| 408 | } |
| 409 | } |
| 410 | |
| 411 | unsigned int len = msg->entry.len; |
| 412 | fprintf(stderr, "msg[%u]={", len); |
| 413 | unsigned char *cp = reinterpret_cast<unsigned char *>(msg->msg()); |
| 414 | while(len) { |
| 415 | unsigned char *p = cp; |
| 416 | while (*p && (((' ' <= *p) && (*p < 0x7F)) || (*p == '\n'))) { |
| 417 | ++p; |
| 418 | } |
| 419 | if (((p - cp) > 3) && !*p && ((unsigned int)(p - cp) < len)) { |
| 420 | fprintf(stderr, "\""); |
| 421 | while (*cp) { |
| 422 | fprintf(stderr, (*cp != '\n') ? "%c" : "\\n", *cp); |
| 423 | ++cp; |
| 424 | --len; |
| 425 | } |
| 426 | fprintf(stderr, "\""); |
| 427 | } else { |
| 428 | fprintf(stderr, "%02x", *cp); |
| 429 | } |
| 430 | ++cp; |
| 431 | if (--len) { |
| 432 | fprintf(stderr, ", "); |
| 433 | } |
| 434 | } |
| 435 | fprintf(stderr, "}\n"); |
| 436 | } |
| 437 | |
| 438 | TEST(logd, both) { |
| 439 | log_msg msg; |
| 440 | |
| 441 | // check if we can read any logs from logd |
| 442 | bool user_logger_available = false; |
| 443 | bool user_logger_content = false; |
| 444 | |
| 445 | int fd = socket_local_client("logdr", |
| 446 | ANDROID_SOCKET_NAMESPACE_RESERVED, |
| 447 | SOCK_SEQPACKET); |
| 448 | if (fd >= 0) { |
| 449 | struct sigaction ignore, old_sigaction; |
| 450 | memset(&ignore, 0, sizeof(ignore)); |
| 451 | ignore.sa_handler = caught_signal; |
| 452 | sigemptyset(&ignore.sa_mask); |
| 453 | sigaction(SIGALRM, &ignore, &old_sigaction); |
| 454 | unsigned int old_alarm = alarm(10); |
| 455 | |
| 456 | static const char ask[] = "dumpAndClose lids=0,1,2,3"; |
| 457 | user_logger_available = write(fd, ask, sizeof(ask)) == sizeof(ask); |
| 458 | |
| 459 | user_logger_content = recv(fd, msg.buf, sizeof(msg), 0) > 0; |
| 460 | |
| 461 | if (user_logger_content) { |
| 462 | dump_log_msg("user", &msg, 3, -1); |
| 463 | } |
| 464 | |
| 465 | alarm(0); |
| 466 | sigaction(SIGALRM, &old_sigaction, NULL); |
| 467 | |
| 468 | close(fd); |
| 469 | } |
| 470 | |
| 471 | // check if we can read any logs from kernel logger |
| 472 | bool kernel_logger_available = false; |
| 473 | bool kernel_logger_content = false; |
| 474 | |
| 475 | static const char *loggers[] = { |
| 476 | "/dev/log/main", "/dev/log_main", |
| 477 | "/dev/log/radio", "/dev/log_radio", |
| 478 | "/dev/log/events", "/dev/log_events", |
| 479 | "/dev/log/system", "/dev/log_system", |
| 480 | }; |
| 481 | |
| 482 | for (unsigned int i = 0; i < (sizeof(loggers) / sizeof(loggers[0])); ++i) { |
| 483 | fd = open(loggers[i], O_RDONLY); |
| 484 | if (fd < 0) { |
| 485 | continue; |
| 486 | } |
| 487 | kernel_logger_available = true; |
| 488 | fcntl(fd, F_SETFL, O_RDONLY | O_NONBLOCK); |
| 489 | int result = TEMP_FAILURE_RETRY(read(fd, msg.buf, sizeof(msg))); |
| 490 | if (result > 0) { |
| 491 | kernel_logger_content = true; |
| 492 | dump_log_msg("kernel", &msg, 0, i / 2); |
| 493 | } |
| 494 | close(fd); |
| 495 | } |
| 496 | |
| 497 | static const char yes[] = "\xE2\x9C\x93"; |
| 498 | static const char no[] = "\xE2\x9c\x98"; |
| 499 | fprintf(stderr, |
| 500 | "LOGGER Available Content\n" |
| 501 | "user %-13s%s\n" |
| 502 | "kernel %-13s%s\n" |
| 503 | " status %-11s%s\n", |
| 504 | (user_logger_available) ? yes : no, |
| 505 | (user_logger_content) ? yes : no, |
| 506 | (kernel_logger_available) ? yes : no, |
| 507 | (kernel_logger_content) ? yes : no, |
| 508 | (user_logger_available && kernel_logger_available) ? "WARNING" : "ok", |
| 509 | (user_logger_content && kernel_logger_content) ? "ERROR" : "ok"); |
| 510 | |
| 511 | if (user_logger_available && kernel_logger_available) { |
| 512 | printf("WARNING: kernel & user logger; both consuming resources!!!\n"); |
| 513 | } |
| 514 | |
| 515 | EXPECT_EQ(0, user_logger_content && kernel_logger_content); |
| 516 | EXPECT_EQ(0, !user_logger_content && !kernel_logger_content); |
| 517 | } |
| 518 | |
| 519 | // BAD ROBOT |
| 520 | // Benchmark threshold are generally considered bad form unless there is |
| 521 | // is some human love applied to the continued maintenance and whether the |
| 522 | // thresholds are tuned on a per-target basis. Here we check if the values |
| 523 | // are more than double what is expected. Doubling will not prevent failure |
| 524 | // on busy or low-end systems that could have a tendency to stretch values. |
| 525 | // |
| 526 | // The primary goal of this test is to simulate a spammy app (benchmark |
| 527 | // being the worst) and check to make sure the logger can deal with it |
| 528 | // appropriately by checking all the statistics are in an expected range. |
| 529 | // |
| 530 | TEST(logd, benchmark) { |
| 531 | size_t len; |
| 532 | char *buf; |
| 533 | |
| 534 | alloc_statistics(&buf, &len); |
| 535 | bool benchmark_already_run = buf && find_benchmark_spam(buf); |
| 536 | delete [] buf; |
| 537 | |
| 538 | if (benchmark_already_run) { |
| 539 | fprintf(stderr, "WARNING: spam already present and too much history\n" |
| 540 | " false OK for prune by worst UID check\n"); |
| 541 | } |
| 542 | |
| 543 | FILE *fp; |
| 544 | |
| 545 | // Introduce some extreme spam for the worst UID filter |
| 546 | ASSERT_TRUE(NULL != (fp = popen( |
| 547 | "/data/nativetest/liblog-benchmarks/liblog-benchmarks", |
| 548 | "r"))); |
| 549 | |
| 550 | char buffer[5120]; |
| 551 | |
| 552 | static const char *benchmarks[] = { |
| 553 | "BM_log_maximum_retry ", |
| 554 | "BM_log_maximum ", |
| 555 | "BM_clock_overhead ", |
| 556 | "BM_log_overhead ", |
| 557 | "BM_log_latency ", |
| 558 | "BM_log_delay " |
| 559 | }; |
| 560 | static const unsigned int log_maximum_retry = 0; |
| 561 | static const unsigned int log_maximum = 1; |
| 562 | static const unsigned int clock_overhead = 2; |
| 563 | static const unsigned int log_overhead = 3; |
| 564 | static const unsigned int log_latency = 4; |
| 565 | static const unsigned int log_delay = 5; |
| 566 | |
| 567 | unsigned long ns[sizeof(benchmarks) / sizeof(benchmarks[0])]; |
| 568 | |
| 569 | memset(ns, 0, sizeof(ns)); |
| 570 | |
| 571 | while (fgets(buffer, sizeof(buffer), fp)) { |
| 572 | for (unsigned i = 0; i < sizeof(ns) / sizeof(ns[0]); ++i) { |
| 573 | if (strncmp(benchmarks[i], buffer, strlen(benchmarks[i]))) { |
| 574 | continue; |
| 575 | } |
| 576 | sscanf(buffer, "%*s %lu %lu", &ns[i], &ns[i]); |
| 577 | fprintf(stderr, "%-22s%8lu\n", benchmarks[i], ns[i]); |
| 578 | } |
| 579 | } |
| 580 | int ret = pclose(fp); |
| 581 | |
| 582 | if (!WIFEXITED(ret) || (WEXITSTATUS(ret) == 127)) { |
| 583 | fprintf(stderr, |
| 584 | "WARNING: " |
| 585 | "/data/nativetest/liblog-benchmarks/liblog-benchmarks missing\n" |
| 586 | " can not perform test\n"); |
| 587 | return; |
| 588 | } |
| 589 | |
| 590 | #ifdef TARGET_USES_LOGD |
| 591 | EXPECT_GE(100000UL, ns[log_maximum_retry]); // 42777 user |
| 592 | #else |
| 593 | EXPECT_GE(10000UL, ns[log_maximum_retry]); // 5636 kernel |
| 594 | #endif |
| 595 | |
| 596 | #ifdef TARGET_USES_LOGD |
| 597 | EXPECT_GE(25000UL, ns[log_maximum]); // 14055 user |
| 598 | #else |
| 599 | EXPECT_GE(10000UL, ns[log_maximum]); // 5637 kernel |
| 600 | #endif |
| 601 | |
| 602 | EXPECT_GE(4000UL, ns[clock_overhead]); // 2008 |
| 603 | |
| 604 | #ifdef TARGET_USES_LOGD |
| 605 | EXPECT_GE(250000UL, ns[log_overhead]); // 113219 user |
| 606 | #else |
| 607 | EXPECT_GE(100000UL, ns[log_overhead]); // 50945 kernel |
| 608 | #endif |
| 609 | |
| 610 | #ifdef TARGET_USES_LOGD |
| 611 | EXPECT_GE(7500UL, ns[log_latency]); // 3718 user space |
| 612 | #else |
| 613 | EXPECT_GE(500000UL, ns[log_latency]); // 254200 kernel |
| 614 | #endif |
| 615 | |
| 616 | #ifdef TARGET_USES_LOGD |
| 617 | EXPECT_GE(20000000UL, ns[log_delay]); // 9542541 user |
| 618 | #else |
| 619 | EXPECT_GE(55000UL, ns[log_delay]); // 27341 kernel |
| 620 | #endif |
| 621 | |
| 622 | for (unsigned i = 0; i < sizeof(ns) / sizeof(ns[0]); ++i) { |
| 623 | EXPECT_NE(0UL, ns[i]); |
| 624 | } |
| 625 | |
| 626 | alloc_statistics(&buf, &len); |
| 627 | |
| 628 | #ifdef TARGET_USES_LOGD |
| 629 | bool collected_statistics = !!buf; |
| 630 | EXPECT_EQ(true, collected_statistics); |
| 631 | #else |
| 632 | if (!buf) { |
| 633 | return; |
| 634 | } |
| 635 | #endif |
| 636 | |
| 637 | ASSERT_TRUE(NULL != buf); |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 638 | |
| 639 | char *benchmark_statistics_found = find_benchmark_spam(buf); |
| 640 | ASSERT_TRUE(benchmark_statistics_found != NULL); |
| 641 | |
| 642 | // Check how effective the SPAM filter is, parse out Now size. |
| 643 | // Total Now |
| 644 | // 0/4225? 7454388/303656 31488/755 |
| 645 | // ^-- benchmark_statistics_found |
| 646 | |
| 647 | unsigned long nowSize = atol(benchmark_statistics_found); |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 648 | |
| 649 | delete [] buf; |
Mark Salyzyn | e821dac | 2014-04-09 10:02:23 -0700 | [diff] [blame^] | 650 | |
| 651 | ASSERT_NE(0UL, nowSize); |
| 652 | |
| 653 | int sock = socket_local_client("logd", |
| 654 | ANDROID_SOCKET_NAMESPACE_RESERVED, |
| 655 | SOCK_STREAM); |
| 656 | static const unsigned long expected_absolute_minimum_log_size = 65536UL; |
| 657 | unsigned long totalSize = expected_absolute_minimum_log_size; |
| 658 | if (sock >= 0) { |
| 659 | static const char getSize[] = { |
| 660 | 'g', 'e', 't', 'L', 'o', 'g', 'S', 'i', 'z', 'e', ' ', |
| 661 | LOG_ID_MAIN + '0', '\0' |
| 662 | }; |
| 663 | if (write(sock, getSize, sizeof(getSize)) > 0) { |
| 664 | char buffer[80]; |
| 665 | memset(buffer, 0, sizeof(buffer)); |
| 666 | read(sock, buffer, sizeof(buffer)); |
| 667 | totalSize = atol(buffer); |
| 668 | if (totalSize < expected_absolute_minimum_log_size) { |
| 669 | totalSize = expected_absolute_minimum_log_size; |
| 670 | } |
| 671 | } |
| 672 | close(sock); |
| 673 | } |
| 674 | // logd allows excursions to 110% of total size |
| 675 | totalSize = (totalSize * 11 ) / 10; |
| 676 | |
| 677 | // 50% threshold for SPAM filter (<20% typical, lots of engineering margin) |
| 678 | ASSERT_GT(totalSize, nowSize * 2); |
Mark Salyzyn | d3ba665 | 2014-02-28 13:44:12 -0800 | [diff] [blame] | 679 | } |