howvec.c (9c03aa87e52567f6c9a7bf456e5dd94dc84088de) | howvec.c (402587419993d86638f1f81fc4e55625a320ad2f) |
---|---|
1/* 2 * Copyright (C) 2019, Alex Bennée <alex.bennee@linaro.org> 3 * 4 * How vectorised is this code? 5 * 6 * Attempt to measure the amount of vectorisation that has been done 7 * on some code by counting classes of instruction. 8 * --- 319 unchanged lines hidden (view full) --- 328 class_table = entry->table; 329 class_table_sz = entry->table_sz; 330 break; 331 } 332 } 333 334 for (i = 0; i < argc; i++) { 335 char *p = argv[i]; | 1/* 2 * Copyright (C) 2019, Alex Bennée <alex.bennee@linaro.org> 3 * 4 * How vectorised is this code? 5 * 6 * Attempt to measure the amount of vectorisation that has been done 7 * on some code by counting classes of instruction. 8 * --- 319 unchanged lines hidden (view full) --- 328 class_table = entry->table; 329 class_table_sz = entry->table_sz; 330 break; 331 } 332 } 333 334 for (i = 0; i < argc; i++) { 335 char *p = argv[i]; |
336 g_autofree char **tokens = g_strsplit(p, "=", -1); | 336 g_auto(GStrv) tokens = g_strsplit(p, "=", -1); |
337 if (g_strcmp0(tokens[0], "inline") == 0) { 338 if (!qemu_plugin_bool_parse(tokens[0], tokens[1], &do_inline)) { 339 fprintf(stderr, "boolean argument parsing failed: %s\n", p); 340 return -1; 341 } 342 } else if (g_strcmp0(tokens[0], "verbose") == 0) { 343 if (!qemu_plugin_bool_parse(tokens[0], tokens[1], &verbose)) { 344 fprintf(stderr, "boolean argument parsing failed: %s\n", p); --- 28 unchanged lines hidden --- | 337 if (g_strcmp0(tokens[0], "inline") == 0) { 338 if (!qemu_plugin_bool_parse(tokens[0], tokens[1], &do_inline)) { 339 fprintf(stderr, "boolean argument parsing failed: %s\n", p); 340 return -1; 341 } 342 } else if (g_strcmp0(tokens[0], "verbose") == 0) { 343 if (!qemu_plugin_bool_parse(tokens[0], tokens[1], &verbose)) { 344 fprintf(stderr, "boolean argument parsing failed: %s\n", p); --- 28 unchanged lines hidden --- |