Cross Reference: /openjdk7/hotspot/src/share/vm/adlc/dfa.cpp

Lines Matching defs:result
41 static const char *knownInvalid = "knownInvalid";    // The result does NOT have a rule defined
42 static const char *knownValid   = "knownValid";      // The result must be produced by a rule
50 // Track the status of productions for a particular result
60   Production(const char *result, const char *constraint, const char *valid);
78   Dict _production;    // map result of production, char*, to information or NULL
91   const char *valid(const char *result);   // unknownValid, or status for this production
92   void    set_valid(const char *result);   // if not constrained, set status to knownValid
94   Expr           *cost_lb(const char *result);
95   Expr           *cost_ub(const char *result);
96   void    set_cost_bounds(const char *result, const Expr *cost, bool has_state_check, bool has_cost_check);
98   // Return the Production associated with the result,
100   Production *getProduction(const char *result);
325     const char *result, *cost, *rule;
326     for(lst->reset(); (lst->iter(result,cost,rule)) == true; ) {
328       if( operands_chained_from[result] != NULL ) {
339           // printf("   result=%s cost=%s rule=%s\n", result, total_cost, rule);
342           cost_check(fp, indent, ArchDesc::getMachOperEnum(result), total_cost, reduce_rule, status);
343           chain_rule(fp, indent, result, total_cost, irule, operands_chained_from, status);
345           // printf("   result=%s cost=%s rule=%s\n", result, total_cost, rule);
347           cost_check(fp, indent, ArchDesc::getMachOperEnum(result), total_cost, rule, status);
348           chain_rule(fp, indent, result, total_cost, rule, operands_chained_from, status);
352         expand_opclass( fp, indent, total_cost, result, status );
399   // #define DFA_PRODUCTION(result, rule, cost)\
400   //   _cost[ (result) ] = cost; _rule[ (result) ] = rule;
401   fprintf(fp, "#define %s(result, rule, cost)\\\n", dfa_production);
402   fprintf(fp, "  _cost[ (result) ] = cost; _rule[ (result) ] = rule;\n");
405   // #define DFA_PRODUCTION__SET_VALID(result, rule, cost)\
406   //     DFA_PRODUCTION( (result), (rule), (cost) ); STATE__SET_VALID( (result) );
407   fprintf(fp, "#define %s(result, rule, cost)\\\n", dfa_production_set_valid);
408   fprintf(fp, "  %s( (result), (rule), (cost) ); STATE__SET_VALID( (result) );\n", dfa_production);
536           bool result = dfa_shared_preds::cse_predicate(predicate, shared_pred, shared_pred_var);
537           if( result ) dfa_shared_preds::set_found(index, true);
546     bool result = false;
564         result = true;
567     return result;
716   const char * result = NULL;
725     result = strdup(string_buffer);
735     result = strdup(string_buffer);
737   return result;
760   int result = c1->_min_value + c2->_min_value;
761   assert( result >= 0, "Invalid cost computation");
763   return result;
767   int result = c1->_max_value + c2->_max_value;
768   if( result < 0 ) {  // check for overflow
769     result = Expr::Max;
772   return result;
917 Production::Production(const char *result, const char *constraint, const char *valid) {
919   _result     = result;
958 Production *ProductionState::getProduction(const char *result) {
959   Production *p = (Production *)_production[result];
961     p = new Production(result, _constraint, knownInvalid);
962     _production.Insert(result, p);
972 const char *ProductionState::valid(const char *result) {
973   return getProduction(result)->valid();
976 void ProductionState::set_valid(const char *result) {
977   Production *p = getProduction(result);
989 Expr *ProductionState::cost_lb(const char *result) {
990   return getProduction(result)->cost_lb();
993 Expr *ProductionState::cost_ub(const char *result) {
994   return getProduction(result)->cost_ub();
997 void ProductionState::set_cost_bounds(const char *result, const Expr *cost, bool has_state_check, bool has_cost_check) {
998   Production *p = getProduction(result);