Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 | // SPDX-License-Identifier: GPL-2.0 #include <stdbool.h> #include <assert.h> #include <errno.h> #include <stdlib.h> #include <string.h> #include "metricgroup.h" #include "debug.h" #include "expr.h" #include "expr-bison.h" #include "expr-flex.h" #include <linux/kernel.h> #include <linux/zalloc.h> #include <ctype.h> #ifdef PARSER_DEBUG extern int expr_debug; #endif static size_t key_hash(const void *key, void *ctx __maybe_unused) { const char *str = (const char *)key; size_t hash = 0; while (*str != '\0') { hash *= 31; hash += *str; str++; } return hash; } static bool key_equal(const void *key1, const void *key2, void *ctx __maybe_unused) { return !strcmp((const char *)key1, (const char *)key2); } /* Caller must make sure id is allocated */ int expr__add_id(struct expr_parse_ctx *ctx, const char *id) { struct expr_id_data *data_ptr = NULL, *old_data = NULL; char *old_key = NULL; int ret; data_ptr = malloc(sizeof(*data_ptr)); if (!data_ptr) return -ENOMEM; data_ptr->parent = ctx->parent; ret = hashmap__set(&ctx->ids, id, data_ptr, (const void **)&old_key, (void **)&old_data); if (ret) free(data_ptr); free(old_key); free(old_data); return ret; } /* Caller must make sure id is allocated */ int expr__add_id_val(struct expr_parse_ctx *ctx, const char *id, double val) { struct expr_id_data *data_ptr = NULL, *old_data = NULL; char *old_key = NULL; int ret; data_ptr = malloc(sizeof(*data_ptr)); if (!data_ptr) return -ENOMEM; data_ptr->val = val; data_ptr->is_ref = false; ret = hashmap__set(&ctx->ids, id, data_ptr, (const void **)&old_key, (void **)&old_data); if (ret) free(data_ptr); free(old_key); free(old_data); return ret; } int expr__add_ref(struct expr_parse_ctx *ctx, struct metric_ref *ref) { struct expr_id_data *data_ptr = NULL, *old_data = NULL; char *old_key = NULL; char *name, *p; int ret; data_ptr = zalloc(sizeof(*data_ptr)); if (!data_ptr) return -ENOMEM; name = strdup(ref->metric_name); if (!name) { free(data_ptr); return -ENOMEM; } /* * The jevents tool converts all metric expressions * to lowercase, including metric references, hence * we need to add lowercase name for metric, so it's * properly found. */ for (p = name; *p; p++) *p = tolower(*p); /* * Intentionally passing just const char pointers, * originally from 'struct pmu_event' object. * We don't need to change them, so there's no * need to create our own copy. */ data_ptr->ref.metric_name = ref->metric_name; data_ptr->ref.metric_expr = ref->metric_expr; data_ptr->ref.counted = false; data_ptr->is_ref = true; ret = hashmap__set(&ctx->ids, name, data_ptr, (const void **)&old_key, (void **)&old_data); if (ret) free(data_ptr); pr_debug2("adding ref metric %s: %s\n", ref->metric_name, ref->metric_expr); free(old_key); free(old_data); return ret; } int expr__get_id(struct expr_parse_ctx *ctx, const char *id, struct expr_id_data **data) { return hashmap__find(&ctx->ids, id, (void **)data) ? 0 : -1; } int expr__resolve_id(struct expr_parse_ctx *ctx, const char *id, struct expr_id_data **datap) { struct expr_id_data *data; if (expr__get_id(ctx, id, datap) || !*datap) { pr_debug("%s not found\n", id); return -1; } data = *datap; pr_debug2("lookup: is_ref %d, counted %d, val %f: %s\n", data->is_ref, data->ref.counted, data->val, id); if (data->is_ref && !data->ref.counted) { data->ref.counted = true; pr_debug("processing metric: %s ENTRY\n", id); if (expr__parse(&data->val, ctx, data->ref.metric_expr, 1)) { pr_debug("%s failed to count\n", id); return -1; } pr_debug("processing metric: %s EXIT: %f\n", id, data->val); } return 0; } void expr__del_id(struct expr_parse_ctx *ctx, const char *id) { struct expr_id_data *old_val = NULL; char *old_key = NULL; hashmap__delete(&ctx->ids, id, (const void **)&old_key, (void **)&old_val); free(old_key); free(old_val); } void expr__ctx_init(struct expr_parse_ctx *ctx) { hashmap__init(&ctx->ids, key_hash, key_equal, NULL); } void expr__ctx_clear(struct expr_parse_ctx *ctx) { struct hashmap_entry *cur; size_t bkt; hashmap__for_each_entry((&ctx->ids), cur, bkt) { free((char *)cur->key); free(cur->value); } hashmap__clear(&ctx->ids); } static int __expr__parse(double *val, struct expr_parse_ctx *ctx, const char *expr, int start, int runtime) { struct expr_scanner_ctx scanner_ctx = { .start_token = start, .runtime = runtime, }; YY_BUFFER_STATE buffer; void *scanner; int ret; pr_debug2("parsing metric: %s\n", expr); ret = expr_lex_init_extra(&scanner_ctx, &scanner); if (ret) return ret; buffer = expr__scan_string(expr, scanner); #ifdef PARSER_DEBUG expr_debug = 1; expr_set_debug(1, scanner); #endif ret = expr_parse(val, ctx, scanner); expr__flush_buffer(buffer, scanner); expr__delete_buffer(buffer, scanner); expr_lex_destroy(scanner); return ret; } int expr__parse(double *final_val, struct expr_parse_ctx *ctx, const char *expr, int runtime) { return __expr__parse(final_val, ctx, expr, EXPR_PARSE, runtime) ? -1 : 0; } int expr__find_other(const char *expr, const char *one, struct expr_parse_ctx *ctx, int runtime) { int ret = __expr__parse(NULL, ctx, expr, EXPR_OTHER, runtime); if (one) expr__del_id(ctx, one); return ret; } |