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

  /src/external/gpl2/mkhybrid/dist/
match.c 31 static char *mat[MAXMATCH]; variable
38 for (i=0; mat[i] && i<MAXMATCH; i++);
45 mat[i] = (char *) malloc(strlen(fn)+1);
46 if (! mat[i]) {
51 strcpy(mat[i],fn);
62 for (i=0; mat[i] && i<MAXMATCH; i++) {
63 if (fnmatch(mat[i], fn, FNM_PATHNAME) != FNM_NOMATCH) {
  /src/external/mit/isl/dist/
isl_local.c 37 __isl_give isl_local *isl_local_alloc_from_mat(__isl_take isl_mat *mat)
39 return mat;
65 isl_mat *mat = local; local
70 return isl_mat_rows(mat);
72 isl_size cols = isl_mat_cols(mat);
112 isl_mat *mat = local; local
116 return isl_bool_ok(isl_int_is_zero(mat->row[pos][0]));
131 isl_mat *mat = local; local
141 cols = isl_mat_cols(mat);
149 if (isl_int_is_zero(mat->row[pos][off + i])
268 isl_mat *mat; local
303 isl_mat *mat = local; local
330 isl_mat *mat = local; local
368 isl_mat *mat = local; local
    [all...]
isl_morph.c 617 * to the affine transformation matrix "mat" and
621 __isl_take isl_mat *mat)
627 ctx = isl_mat_get_ctx(mat);
628 n_row = isl_mat_rows(mat);
629 n_col = isl_mat_cols(mat);
635 return isl_multi_aff_from_aff_mat(space, mat);
746 isl_mat *mat; local
756 mat = morph->map;
758 morph->inv = mat;
isl_tab.h 16 #include <isl/mat.h>
136 struct isl_mat *mat; member in struct:isl_tab
isl_mat.c 25 isl_ctx *isl_mat_get_ctx(__isl_keep isl_mat *mat)
27 return mat ? mat->ctx : NULL;
30 /* Return a hash value that digests "mat".
32 uint32_t isl_mat_get_hash(__isl_keep isl_mat *mat)
37 if (!mat)
41 isl_hash_byte(hash, mat->n_row & 0xFF);
42 isl_hash_byte(hash, mat->n_col & 0xFF);
43 for (i = 0; i < mat->n_row; ++i) {
46 row_hash = isl_seq_get_hash(mat->row[i], mat->n_col)
57 struct isl_mat *mat; local
152 struct isl_mat *mat; local
389 struct isl_mat *mat; local
408 isl_mat *mat; local
925 isl_mat *mat; local
1768 struct isl_mat *mat; local
1821 struct isl_mat *mat; local
2091 isl_mat *mat; local
    [all...]
isl_coalesce.c 1168 * mat contains the wrapping constraints
1174 isl_mat *mat; member in struct:isl_wraps
1222 static isl_stat wraps_init(struct isl_wraps *wraps, __isl_take isl_mat *mat,
1229 wraps->mat = mat;
1230 if (!mat)
1232 wraps->mat->n_row = 0;
1233 ctx = isl_mat_get_ctx(mat);
1251 isl_mat_free(wraps->mat);
1276 for (i = 1; i < wraps->mat->n_col; ++i
1636 isl_mat *mat; local
1764 isl_mat *mat; local
1948 isl_mat *mat; local
2304 isl_mat *mat; local
    [all...]
isl_convex_hull.c 2818 * a pointer to its opposite, which is first copied to "mat".
2819 * "ineq" and "mat" are assumed to have been preallocated to the right size
2823 static __isl_give isl_mat *collect_inequalities(__isl_take isl_mat *mat,
2830 if (!mat || n < 0)
2831 return isl_mat_free(mat);
2839 return isl_mat_free(mat);
2841 ineq[n_ineq++] = mat->row[n_eq];
2843 isl_seq_neg(mat->row[n_eq++], bset->eq[j], mat->n_col);
2850 return mat;
2888 isl_mat *mat = NULL; local
    [all...]
isl_tab.c 43 tab->mat = isl_mat_alloc(ctx, n_row, off + n_var);
44 if (!tab->mat)
102 return tab ? isl_mat_get_ctx(tab->mat) : NULL;
117 con = isl_realloc_array(tab->mat->ctx, tab->con,
124 if (tab->mat->n_row < tab->n_row + n_new) {
127 tab->mat = isl_mat_extend(tab->mat,
129 if (!tab->mat)
131 row_var = isl_realloc_array(tab->mat->ctx, tab->row_var,
132 int, tab->mat->n_row)
1047 struct isl_mat *mat = tab->mat; local
1131 struct isl_mat *mat = tab->mat; local
1639 struct isl_mat *mat = tab->mat; local
3448 isl_mat *mat = tab->mat; local
    [all...]
isl_polynomial.c 2620 * current div "div" and also in the affine expressions in the rows of "mat"
2624 __isl_keep isl_mat **mat)
2638 *mat = isl_mat_col_addmul(*mat, i, v, 1 + total + div);
2678 * later divs and in the rows of "mat"). After calling this function, the
2682 __isl_keep isl_mat **mat)
2691 *mat = isl_mat_col_neg(*mat, 1 + total + div);
2714 isl_mat *mat; local
2725 mat = isl_mat_zero(ctx, n_div, 1 + total)
4608 isl_mat *mat, *diag; local
    [all...]
isl_scheduler.c 2875 isl_mat *mat; local
2885 mat = isl_mat_alloc(ctx, n, 2 * n_var);
2886 if (!mat)
2891 isl_int_neg(mat->row[i][2 * nj], indep->row[i][j]);
2892 isl_int_set(mat->row[i][2 * nj + 1], indep->row[i][j]);
2896 return mat;
isl_tab_pip.c 638 static void scale_rows(struct isl_mat *mat, isl_int m, int n_row)
646 isl_seq_scale(mat->row[i], mat->row[i], m, mat->n_col);
701 struct isl_mat *mat = NULL; local
723 mat = isl_mat_alloc(tab->mat->ctx, 1 + sol->n_out,
725 if (!mat)
730 isl_seq_clr(mat->row[0] + 1, mat->n_col - 1)
    [all...]
isl_map.c 7592 /* Apply a preimage specified by "mat" on the parameters of "bset".
7596 __isl_take isl_basic_set *bset, __isl_take isl_mat *mat)
7601 if (nparam < 0 || !mat)
7608 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
7612 bset = isl_basic_set_preimage(bset, mat);
7619 isl_mat_free(mat);
7624 /* Apply a preimage specified by "mat" on the parameters of "set".
7628 __isl_take isl_mat *mat)
7634 if (nparam < 0 || !mat)
7637 if (mat->n_row != 1 + nparam
12936 struct isl_mat *mat; local
12969 struct isl_mat *mat; local
    [all...]
  /src/external/bsd/openldap/dist/contrib/slapd-modules/lastmod/
lastmod.c 90 }, mat[] = { variable in typeref:struct:m_s
742 for ( i = 0; mat[i].schema; i++ ) {
745 ((AttributeDescription **)&(((char *)&lastmod_schema)[mat[i].offset]));
748 code = register_at( mat[i].schema, ad, 0 );
754 (*ad)->ad_type->sat_flags |= mat[i].flags;
  /src/external/bsd/openldap/dist/servers/slapd/back-monitor/
init.c 1717 }, mat[] = { local
2024 for ( i = 0; mat[ i ].schema; i++ ) {
2027 ((AttributeDescription **)&(((char *)mi)[ mat[ i ].offset ]));
2030 code = register_at( mat[ i ].schema, ad, 0 );
2037 (*ad)->ad_type->sat_flags |= mat[ i ].flags;
  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.h 782 lambda_matrix mat;
785 mat = XOBNEWVEC (lambda_obstack, lambda_vector, m);
788 mat[i] = XOBNEWVEC (lambda_obstack, lambda_int, n);
790 return mat;
781 lambda_matrix mat; local
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.h 782 lambda_matrix mat;
785 mat = XOBNEWVEC (lambda_obstack, lambda_vector, m);
788 mat[i] = XOBNEWVEC (lambda_obstack, lambda_int, n);
790 return mat;
781 lambda_matrix mat; local
  /src/sys/netinet/
sctp_input.c 1735 struct mbuf *mat; local
1736 mat = m;
1738 while (mat != NULL) {
1739 size_of_pkt += mat->m_len;
1740 mat = mat->m_next;
sctp_output.c 2913 struct mbuf *mat, *op_err; local
2920 mat = in_initpkt;
2931 phdr = sctp_get_next_param(mat, at, &params, sizeof(params));
3007 phdr = sctp_get_next_param(mat, at, (struct sctp_paramhdr *)tempbuf, plen);
3064 phdr = sctp_get_next_param(mat, at, (struct sctp_paramhdr *)tempbuf, plen);
3091 phdr = sctp_get_next_param(mat, at, &params, sizeof(params));
3113 struct mbuf *mat; local
3168 mat = in_initpkt;
3171 phdr = sctp_get_next_param(mat, offset, &params, sizeof(params));
3178 phdr = sctp_get_next_param(mat, offset
5982 struct mbuf *mat; local
6037 struct mbuf *cookie, *mat; local
    [all...]
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
metaslab.c 2628 metaslab_alloc_trace_t *mat = local
2630 list_link_init(&mat->mat_list_node);
2631 mat->mat_mg = mg;
2632 mat->mat_msp = msp;
2633 mat->mat_size = psize;
2634 mat->mat_dva_id = dva_id;
2635 mat->mat_offset = offset;
2636 mat->mat_weight = 0;
2639 mat->mat_weight = msp->ms_weight;
2645 list_insert_tail(&zal->zal_list, mat);
2662 metaslab_alloc_trace_t *mat; local
    [all...]
  /src/external/gpl2/gettext/dist/gettext-tools/libgrep/
dfa.c 1039 regmatch_t mat; local
1043 if (regexec (&re, buf, 1, &mat, 0) == REG_NOERROR
1044 && mat.rm_so == 0 && mat.rm_eo == 1)
  /src/external/gpl2/grep/dist/src/
dfa.c 1063 regmatch_t mat; local
1064 if (regexec (&re, buf, 1, &mat, 0) == REG_NOERROR
1065 && mat.rm_so == 0 && mat.rm_eo == 1)

Completed in 49 milliseconds