math: create new handle_bitwise_AND() function
[smatch.git] / smatch_capped.c
blobbe936606083e5d9b539ceb26d4a8ec130c6ebd6f
1 /*
2 * smatch/smatch_capped.c
4 * Copyright (C) 2011 Oracle. All rights reserved.
6 * Licensed under the Open Software License version 1.1
8 */
11 * This is trying to make a list of the variables which
12 * have capped values. Sometimes we don't know what the
13 * cap is, for example if we are comparing variables but
14 * we don't know the values of the variables. In that
15 * case we only know that our variable is capped and we
16 * sort that information here.
19 #include "smatch.h"
20 #include "smatch_slist.h"
22 static int my_id;
24 STATE(capped);
25 STATE(uncapped);
27 static int is_capped_macro(struct expression *expr)
29 char *name;
31 name = get_macro_name(expr->pos);
32 if (!name)
33 return 0;
35 if (strcmp(name, "min") == 0)
36 return 1;
37 if (strcmp(name, "MIN") == 0)
38 return 1;
39 if (strcmp(name, "min_t") == 0)
40 return 1;
42 return 0;
45 int is_capped(struct expression *expr)
47 sval_t dummy;
49 expr = strip_expr(expr);
50 if (!expr)
51 return 0;
53 if (get_implied_value(expr, &dummy))
54 return 1;
56 if (is_capped_macro(expr))
57 return 1;
59 if (expr->type == EXPR_BINOP) {
60 if (expr->op == '&')
61 return 1;
62 if (expr->op == SPECIAL_RIGHTSHIFT)
63 return 1;
64 if (expr->op == '%')
65 return is_capped(expr->right);
66 if (!is_capped(expr->left))
67 return 0;
68 if (expr->op == '/')
69 return 1;
70 if (!is_capped(expr->right))
71 return 0;
72 return 1;
74 if (get_state_expr(my_id, expr) == &capped)
75 return 1;
76 return 0;
79 void set_param_capped_data(const char *name, struct symbol *sym, char *key, char *value)
81 char fullname[256];
83 if (strncmp(key, "$$", 2))
84 return;
85 snprintf(fullname, 256, "%s%s", name, key + 2);
86 set_state(my_id, fullname, sym, &capped);
89 static void match_condition(struct expression *expr)
91 struct smatch_state *left_true = NULL;
92 struct smatch_state *left_false = NULL;
93 struct smatch_state *right_true = NULL;
94 struct smatch_state *right_false = NULL;
97 if (expr->type != EXPR_COMPARE)
98 return;
100 switch (expr->op) {
101 case '<':
102 case SPECIAL_LTE:
103 case SPECIAL_UNSIGNED_LT:
104 case SPECIAL_UNSIGNED_LTE:
105 left_true = &capped;
106 right_false = &capped;
107 break;
108 case '>':
109 case SPECIAL_GTE:
110 case SPECIAL_UNSIGNED_GT:
111 case SPECIAL_UNSIGNED_GTE:
112 left_false = &capped;
113 right_true = &capped;
114 break;
115 case SPECIAL_EQUAL:
116 left_true = &capped;
117 right_true = &capped;
118 break;
119 case SPECIAL_NOTEQUAL:
120 left_false = &capped;
121 right_false = &capped;
122 break;
124 default:
125 return;
128 set_true_false_states_expr(my_id, expr->right, right_true, right_false);
129 set_true_false_states_expr(my_id, expr->left, left_true, left_false);
132 static void match_assign(struct expression *expr)
134 if (is_capped(expr->right)) {
135 set_state_expr(my_id, expr->left, &capped);
136 } else {
137 if (get_state_expr(my_id, expr->left))
138 set_state_expr(my_id, expr->left, &uncapped);
142 static void match_caller_info(struct expression *expr)
144 struct expression *tmp;
145 int i;
147 i = 0;
148 FOR_EACH_PTR(expr->args, tmp) {
149 if (is_capped(tmp))
150 sql_insert_caller_info(expr, CAPPED_DATA, i, "$$", "1");
151 i++;
152 } END_FOR_EACH_PTR(tmp);
155 static void struct_member_callback(struct expression *call, int param, char *printed_name, struct smatch_state *state)
157 if (state != &capped)
158 return;
159 sql_insert_caller_info(call, CAPPED_DATA, param, printed_name, "1");
162 void register_capped(int id)
164 my_id = id;
166 add_definition_db_callback(set_param_capped_data, CAPPED_DATA);
167 add_hook(&match_condition, CONDITION_HOOK);
168 add_hook(&match_assign, ASSIGNMENT_HOOK);
170 add_hook(&match_caller_info, FUNCTION_CALL_HOOK);
171 add_member_info_callback(my_id, struct_member_callback);