Exemplo n.º 1
0
  private void setVariables(VariableScope varList, String[] parameters)
      throws IOException, RuleException, VariableNotDefinedRuleException {
    int nb = parameters.length;

    for (int i = 0; i < nb; i++) {
      String parameter = parameters[i];
      int index = parameter.indexOf('=');
      if (index == -1) {
        String msg = NoEqualCharacterRuleException.buildMessage(i, parameter);
        throw new NoEqualCharacterRuleException(msg);
      } // end if

      // get varname and value
      String varname = parameter.substring(0, index);
      String value = parameter.substring(index + 1);

      // set varname to value
      boolean isExtern = false;
      VariableDecl.declare(
          varList, varname, VariableDecl.STRING, "\"" + value + "\"", isExtern); // NOT LOCALIZABLE
      Template templ = new Template(null, value, new Rule[] {}, null, new Modifier[] {});
      SetVariable variable =
          new SetVariable(SetVariable.SET_VARIABLE, varList, null, varname, templ);
      Writer writer = null;
      Serializable object = null;
      RuleOptions options = null;
      variable.expand(writer, object, options);
    } // end for
  } // end setVariables
Exemplo n.º 2
0
  @Test
  public void test() throws Exception {
    Node id = new Node(new Tuple(Token.ID.toString(), "IDTEST"), true, false, null, new Position());
    Node type =
        new Node(
            new Tuple(Reserved.INT.getWord(), Reserved.INT.getWord()),
            true,
            false,
            null,
            new Position());
    Node array = new Node(new Tuple("EPSILON", "EPSILON"), true, false, null, new Position());

    VariableDecl v = new VariableDecl(id, type, array);
    assertTrue(v.getName().equals("IDTEST"));
    assertTrue(v.getType().equals(Reserved.INT.getWord()));
    assertTrue(v.getSize().size() == 0);
    assertTrue(v.isPrimitive());
  }
Exemplo n.º 3
0
  /**
   * Compute the reference groups for this loop. Two array references are in the same group with
   * respect to this loop if - there is a loop-independent dependence between them, or - the
   * dependence distance(dependence vector entry dl) for this loop is less than some constant
   * *dist*, and all other dependence vector entries are 0. - the two array refer to the same array
   * and differ by at most *dist2* in the first subscript dimension, where d is less than or equal
   * to the cache line size in terms of array elements. All other subscripts must be identical.
   * Notes: Here we assume dist1 = dist2 = 2
   */
  private void computeRefGroups(
      int level,
      int dist1,
      int dist2,
      Table<Declaration, SubscriptExpr> arrayRefs,
      Vector<RefGroup> refGroups) {
    if (arrayRefs == null) return;

    Enumeration<Declaration> ek = arrayRefs.keys();
    while (ek.hasMoreElements()) {
      VariableDecl vd = (VariableDecl) ek.nextElement();
      String s = vd.getName(); // array name
      Object[] v = arrayRefs.getRowArray(vd); // vector of SubscriptExpr's
      int vi = v.length;

      for (int j = vi - 1; j >= 0; j--) {
        SubscriptExpr sr = (SubscriptExpr) v[j];
        Vector<LoopHeaderChord> allRelatedLoops =
            sr.allRelatedLoops(); // ** Incorrect when something like a[(j+i][j]
        int arls = allRelatedLoops.size();
        int firstsub = arls - 1; // ** Making an invalid assumption here

        // Process the list of references r' with which r has a data
        // dependence, and  r is the source(data flows from r to r').

        RefGroup rg = new RefGroup(s, sr);
        Object[] edges = graph.getEdges(sr);
        int len = edges.length;

        for (int i = 0; i < len; i++) {
          DDEdge edge = (DDEdge) edges[i];

          if (edge.isSpatial()) continue;

          // Condition(1)-(a) in McKinley's paper

          if (edge.isLoopIndependentDependency()) { // add rP to the RefGroup of r:
            rg.add(edge);
            continue;
          }

          // Condition(1)-(b) in McKinley's paper

          computeEdgeRefs(edge, rg, level, dist1);

          if (arls <= 0) continue;

          // Condition(2) in McKinley's paper
          // rlevel is the level of the loop related to the first subscript.

          int rlevel = allRelatedLoops.elementAt(firstsub).getNestedLevel();

          computeEdgeRefs(edge, rg, rlevel, dist2);
        }

        boolean isInExistingRefGroups = false;
        int rgl = refGroups.size();
        for (int i = 0; i < rgl; i++) {
          RefGroup rg2 = refGroups.elementAt(i);
          if (!rg2.getName().equals(s)) continue;

          isInExistingRefGroups = rg2.contains(rg);

          if (isInExistingRefGroups) {
            rg2.add(rg);
            break;
          }
        }

        if (!isInExistingRefGroups) refGroups.addElement(rg);
      }
    }
  }