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

  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-pre.cc 243 NARY,
252 vn_nary_op_t nary; member in union:pre_expr_union
270 #define PRE_EXPR_NARY(e) (e)->u.nary
289 case NARY:
310 case NARY:
422 /* Given an NARY, get or create a pre_expr to represent it. Assign
427 get_or_alloc_expr_for_nary (vn_nary_op_t nary, unsigned value_id,
436 expr.kind = NARY;
438 nary->hashcode = vn_nary_op_compute_hash (nary);
450 memcpy (PRE_EXPR_NARY (result), nary, sizeof_vn_nary_op (nary->length)); local
845 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1053 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1200 vn_nary_op_t nary = PRE_EXPR_NARY (e); local
1418 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1948 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
2059 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
    [all...]
tree-ssa-sccvn.cc 155 /* Return the computed hashcode for nary operation P1. */
163 /* Compare nary operations P1 and P2 and return true if they are
319 vn_nary_op_table_type *nary; member in struct:vn_tables_s
491 vn_nary_op_t nary; local
493 nary = alloc_vn_nary_op_noinit (2, &vn_tables_insert_obstack);
494 init_vn_nary_op_from_pieces (nary, 2, NE_EXPR,
496 nary->predicated_values = 0;
497 nary->u.result = boolean_true_node;
498 vn_nary_op_insert_into (nary, valid_info->nary);
2567 vn_nary_op_t nary = NULL; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-pre.cc 243 NARY,
252 vn_nary_op_t nary; member in union:pre_expr_union
270 #define PRE_EXPR_NARY(e) (e)->u.nary
289 case NARY:
310 case NARY:
434 /* Given an NARY, get or create a pre_expr to represent it. Assign
439 get_or_alloc_expr_for_nary (vn_nary_op_t nary, unsigned value_id,
448 expr.kind = NARY;
450 nary->hashcode = vn_nary_op_compute_hash (nary);
462 memcpy (PRE_EXPR_NARY (result), nary, sizeof_vn_nary_op (nary->length)); local
857 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1065 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1212 vn_nary_op_t nary = PRE_EXPR_NARY (e); local
1430 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
1959 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
2069 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
2948 vn_nary_op_t nary = PRE_EXPR_NARY (expr); local
4069 vn_nary_op_t nary; local
    [all...]
tree-ssa-sccvn.cc 149 /* Return the computed hashcode for nary operation P1. */
157 /* Compare nary operations P1 and P2 and return true if they are
313 vn_nary_op_table_type *nary; member in struct:vn_tables_s
485 vn_nary_op_t nary; local
487 nary = alloc_vn_nary_op_noinit (2, &vn_tables_insert_obstack);
488 init_vn_nary_op_from_pieces (nary, 2, NE_EXPR,
490 nary->predicated_values = 0;
491 nary->u.result = boolean_true_node;
492 vn_nary_op_insert_into (nary, valid_info->nary);
2471 vn_nary_op_t nary = NULL; local
    [all...]
  /src/external/bsd/pcc/dist/pcc/mip/
reader.c 1025 NODE *q, **nary; local
1032 nary = tmpcalloc(sizeof(NODE *)*(n+1));
1036 nary[--o] = q->n_right;
1039 nary[--o] = q;
1041 nary = 0;
1049 else if (XASM_TARGARG(w, nary))
1055 q = nary[(int)w[2]-'0'];
1064 q = nary[(int)w[1]-'0' - 1]; /* XXX */
1066 q = nary[(int)w[1]-'0'];

Completed in 30 milliseconds