HomeSort by: relevance | last modified time | path
    Searched defs:n_op (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/pcc/dist/pcc/mip/
node.h 66 int n_op; member in struct:node
  /src/external/bsd/pcc/dist/pcc/cc/ccom/
pass1.h 239 int n_op; member in struct:p1node
  /src/external/gpl3/gcc/dist/gcc/
tree-vectorizer.cc 1781 tree n_op = gimple_assign_rhs1 (stmt);
1782 if ((stmt = dyn_cast<gassign *> (SSA_NAME_DEF_STMT (n_op))))
1779 tree n_op = gimple_assign_rhs1 (stmt); local
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vectorizer.cc 1748 tree n_op = gimple_assign_rhs1 (stmt);
1749 if ((stmt = dyn_cast<gassign *> (SSA_NAME_DEF_STMT (n_op))))
1746 tree n_op = gimple_assign_rhs1 (stmt); local
  /src/external/mit/isl/dist/
isl_tab_pip.c 5065 * "n_op" is the number of initial coordinates to optimize,
5081 int n_op; member in struct:isl_lexmin_data
5113 * n_op entries are zero.
5115 static int is_optimal(__isl_keep isl_vec *sol, int n_op)
5119 for (i = 0; i < n_op; ++i)
5127 * relevant (within first n_op) non-zero coefficient and force it (along
5135 * This function assumes that at least 2 * (n_op - n_zero) more rows and
5136 * at least 2 * (n_op - n_zero) more elements in the constraint array
5140 __isl_keep isl_vec *sol, int n_op, int n_zero)
5149 for (i = n_zero; i < n_op; ++i
    [all...]

Completed in 43 milliseconds