ast_optimizations.h File Reference

This graph shows which files directly or indirectly include this file:

Functions
void	optimizations_on_AST (ast_node_t *top)
info_ast_visit_t *	constantFold (ast_node_t *node)

Function Documentation

info_ast_visit_t* constantFold ( ast_node_t * node )

Definition at line 116 of file ast_optimizations.c.

00118 00119 00120 00121 00122 00123 00124         { 00125 00126 00127         } 00128 00129         { 00130 00131 00132 00133 00134 00135 00136 00137 00138 00139 00140 00141 00142 00143 00144 00145 00146 00147 00148 00149 00150 00151 00152 00153 00154 00155 00156 00157 00158 00159 00160 00161 00162 00163 00164 00165 00166 00167 00168 00169 00170 00171 00172 00173 00174 00175 00176 00177 00178 00179 00180 00181 00182 00183 00184 00185 00186 00187 00188 00189 00190 00191 00192 00193 00194 00195 00196 00197 00198 00199 00200 00201 00202 00203 00204 00205 00206 00207 00208 00209 00210 00211 00212 00213 00214 00215 00216 00217 00218 00219 00220 00221 00222 00223 00224 00225 00226 00227 00228 00229 00230 00231 00232 00233 00234 00235 00236 00237 00238 00239 00240 00241 00242 00243 00244 00245 00246 00247 00248 00249 00250 00251 00252 00253 00254 00255 00256 00257 00258 00259 00260 00261 00262 00263 00264 00265 00266 00267 00268 00269 00270 00271 00272 00273 00274 00275 00276 00277 00278 00279 00280 00281 00282 00283 00284 00285 00286 00287 00288 00289 00290 00291 00292 00293 00294 00295 00296 00297 00298 00299 00300 00301 00302 00303 00304 00305 00306 00307 00308 00309 00310 00311 00312 00313 00314 00315 00316 00317 00318 00319 00320 00321 00322 00323 00324 00325 00326 00327 00328 00329 00330 00331 00332 00333 00334 00335 00336 00337 00338 00339 00340 00341         } 00342 00343 00344 }

class="fragment">00117 { int i; info_ast_visit_t *node_details = NULL; info_ast_visit_t **children_info = NULL; short free_myself = FALSE; if (node == NULL) /* print out the node and label details */ return NULL; else switch(node->type) { case NUMBERS: /* we're looking for constant expression reductions */ /* allocate the return structure */ node_details = (info_ast_visit_t*)calloc(1, sizeof(info_ast_visit_t)); oassert(node_details); /* check if it's a constant depending on the number type */ switch (node->types.number.base) { case(DEC): if (node_details->value != -1) { node_details->is_constant = TRUE; node_details->value = node->types.number.value; } break; case(HEX): if (node_details->value != -1) { node_details->is_constant = TRUE; node_details->value = node->types.number.value; } break; case(OCT): if (node_details->value != -1) { node_details->is_constant = TRUE; node_details->value = node->types.number.value; } break; case(BIN): if (node_details->value != -1) { node_details->is_constant = TRUE; node_details->value = node->types.number.value; } break; case(LONG_LONG): node_details->is_constant = TRUE; node_details->value = node->types.number.value; break; } if (node_details->is_constant == TRUE) { /* if this is a constant then set up all the other information in the return */ node_details->me = node; node_details->from = NULL; } else { free(node_details); node_details = NULL; } break; default: break; } /* allocate the information for all the returned children info */ children_info = (info_ast_visit_t**)malloc(sizeof(info_ast_visit_t*)*node->num_children); /* traverse all the children */ for (i = 0; i < node->num_children; i++) { /* recursively call through the tree going to each instance. This is depth first search. */ children_info[i] = constantFold(node->children[i]); } /* post process the children */ switch(node->type) { case UNARY_OPERATION: if ((children_info[0] != NULL) && (children_info[0]->is_constant == TRUE)) { /* check if we can do a reduction */ long long new_value; short is_reduction = TRUE; /* IF can reduce to number constant */ ast_node_t *new_node; /* do the operation and store in new node */ switch (node->types.operation.op) { case LOGICAL_NOT: new_value = !children_info[0]->value; break; case BITWISE_NOT: new_value = ~children_info[0]->value; break; case MINUS: new_value = -children_info[0]->value; break; default: is_reduction = FALSE; } if (is_reduction == TRUE) { node_details = (info_ast_visit_t*)calloc(1, sizeof(info_ast_visit_t)); /* store details about the node */ node_details->is_constant_folded = TRUE; node_details->me = node; /* create the new node */ new_node = create_tree_node_long_long_number(new_value, node->line_number, node->file_number); /* record that this node can be eliminated */ free_myself = TRUE; /* replaces from to this new number */ node_details->from = new_node; } } break; case BINARY_OPERATION: if ((children_info[0] != NULL) && (children_info[1] != NULL) && (children_info[0]->is_constant == TRUE) && (children_info[1]->is_constant == TRUE)) { /* check if we can do a reduction */ long long new_value; short is_reduction = TRUE; /* IF can reduce to number constant */ ast_node_t *new_node; /* do the operation and store in new node */ switch (node->types.operation.op) { case ADD: new_value = children_info[0]->value + children_info[1]->value; break; case MINUS: new_value = children_info[0]->value - children_info[1]->value; break; case MULTIPLY: new_value = children_info[0]->value * children_info[1]->value; break; case BITWISE_XOR: new_value = children_info[0]->value ^ children_info[1]->value; break; case BITWISE_XNOR: new_value = ~(children_info[0]->value ^ children_info[1]->value); break; case BITWISE_AND: new_value = children_info[0]->value & children_info[1]->value; break; case BITWISE_NAND: new_value = ~(children_info[0]->value & children_info[1]->value); break; case BITWISE_OR: new_value = children_info[0]->value | children_info[1]->value; break; case BITWISE_NOR: new_value = ~(children_info[0]->value | children_info[1]->value); break; case SL: new_value = children_info[0]->value << children_info[1]->value; break; case SR: new_value = children_info[0]->value >> children_info[1]->value; break; case LOGICAL_AND: new_value = children_info[0]->value && children_info[1]->value; break; case LOGICAL_OR: new_value = children_info[0]->value || children_info[1]->value; break; default: is_reduction = FALSE; } if (is_reduction == TRUE) { node_details = (info_ast_visit_t*)calloc(1, sizeof(info_ast_visit_t)); /* store details about the node */ node_details->is_constant_folded = TRUE; node_details->me = node; /* create the new node */ new_node = create_tree_node_long_long_number(new_value, node->line_number, node->file_number); /* record that this node can be eliminated */ free_myself = TRUE; /* return from to this new number */ node_details->from = new_node; } } break; default: break; } /* clean up the allocations in the downward traversal */ for (i = 0; i < node->num_children; i++) { if(children_info[i] != NULL) free(children_info[i]); } if (children_info != NULL) free(children_info); if (free_myself == TRUE) /* remove the node */ free_ast_node(node); return node_details;

Here is the call graph for this function:

Here is the caller graph for this function:

void optimizations_on_AST ( ast_node_t * top )

Definition at line 49 of file ast_optimizations.c.

00050 {
00051         /* clean up the hard blocks in the AST */
00052         cleanup_hard_blocks();
00053         reduceAST_traverse_node(top, NULL, -1);
00054 }

Here is the call graph for this function:

Here is the caller graph for this function:

ast_optimizations.h File Reference

Functions

Function Documentation