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

  /src/external/gpl3/binutils/dist/gas/config/
tc-rl78.c 59 int n_ops; member in struct:rl78_bytesT
90 rl78_bytes.relax[rl78_bytes.n_relax].val_ofs = rl78_bytes.n_base + rl78_bytes.n_ops;
184 char * ip = rl78_bytes.ops + rl78_bytes.n_ops;
191 rl78_bytes.n_ops += 4;
198 rl78_bytes.ops[rl78_bytes.n_ops++] =v & 0xff;
219 rl78_op_fixup (exp, rl78_bytes.n_ops * 8, nbytes * 8, type);
220 memset (rl78_bytes.ops + rl78_bytes.n_ops, 0, nbytes);
221 rl78_bytes.n_ops += nbytes;
564 int olen = rl78_bytes.n_prefix + rl78_bytes.n_base + rl78_bytes.n_ops;
584 bytes = frag_more (rl78_bytes.n_prefix + rl78_bytes.n_base + rl78_bytes.n_ops);
    [all...]
tc-rx.c 709 int n_ops;
736 /* We set n_ops to be "size of next opcode" if the next opcode doesn't relax. */
767 rx_bytes.relax[rx_bytes.n_relax].val_ofs = rx_bytes.n_base + rx_bytes.n_ops;
961 rx_bytes.n_ops = 2;
964 #define OP(x) rx_bytes.ops[rx_bytes.n_ops++] = (x)
981 char * ip = rx_bytes.ops + rx_bytes.n_ops;
995 rx_bytes.n_ops += 4;
1019 rx_op_fixup (exp, rx_bytes.n_ops * 8, nbytes * 8, type);
1020 memset (rx_bytes.ops + rx_bytes.n_ops, 0, nbytes);
1021 rx_bytes.n_ops += nbytes
708 int n_ops; member in struct:rx_bytesT
    [all...]
  /src/external/gpl3/binutils.old/dist/gas/config/
tc-rl78.c 59 int n_ops; member in struct:rl78_bytesT
90 rl78_bytes.relax[rl78_bytes.n_relax].val_ofs = rl78_bytes.n_base + rl78_bytes.n_ops;
184 char * ip = rl78_bytes.ops + rl78_bytes.n_ops;
191 rl78_bytes.n_ops += 4;
198 rl78_bytes.ops[rl78_bytes.n_ops++] =v & 0xff;
219 rl78_op_fixup (exp, rl78_bytes.n_ops * 8, nbytes * 8, type);
220 memset (rl78_bytes.ops + rl78_bytes.n_ops, 0, nbytes);
221 rl78_bytes.n_ops += nbytes;
564 int olen = rl78_bytes.n_prefix + rl78_bytes.n_base + rl78_bytes.n_ops;
584 bytes = frag_more (rl78_bytes.n_prefix + rl78_bytes.n_base + rl78_bytes.n_ops);
    [all...]
tc-rx.c 709 int n_ops;
736 /* We set n_ops to be "size of next opcode" if the next opcode doesn't relax. */
767 rx_bytes.relax[rx_bytes.n_relax].val_ofs = rx_bytes.n_base + rx_bytes.n_ops;
961 rx_bytes.n_ops = 2;
964 #define OP(x) rx_bytes.ops[rx_bytes.n_ops++] = (x)
981 char * ip = rx_bytes.ops + rx_bytes.n_ops;
995 rx_bytes.n_ops += 4;
1019 rx_op_fixup (exp, rx_bytes.n_ops * 8, nbytes * 8, type);
1020 memset (rx_bytes.ops + rx_bytes.n_ops, 0, nbytes);
1021 rx_bytes.n_ops += nbytes
708 int n_ops; member in struct:rx_bytesT
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
regcprop.cc 774 int n_ops, i, predicated; local
839 n_ops = recog_data.n_operands;
846 for (i = 0; i < n_ops; ++i)
859 for (i = 0; i < n_ops; i++)
873 for (i = 0; i < n_ops; i++)
1001 for (i = 0; i < n_ops; i++)
regrename.cc 1543 /* Hide operands of the current insn (of which there are N_OPS) by
1551 hide_operands (int n_ops, rtx *old_operands, rtx *old_dups,
1556 for (i = 0; i < n_ops; i++)
1586 restore_operands (rtx_insn *insn, int n_ops, rtx *old_operands, rtx *old_dups)
1591 for (i = 0; i < n_ops; i++)
1605 int n_ops = recog_data.n_operands; local
1610 for (i = 0; i < n_ops + recog_data.n_dups; i++)
1612 int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops];
1613 rtx *loc = (i < n_ops
1664 int n_ops; local
    [all...]
genmatch.cc 2972 unsigned n_ops = e->ops.length (); local
2978 for (unsigned i = 0; i < n_ops; ++i)
3060 unsigned n_ops = e->ops.length (); local
3065 for (unsigned i = 0; i < n_ops; ++i)
gimple-ssa-store-merging.cc 212 - number of expressions N_OPS bitwise ored together to represent
235 int n_ops; member in struct:__anon13746::symbolic_number
354 n->n_ops = 1;
594 n->n_ops = n1->n_ops + n2->n_ops;
1080 if (!n->base_addr && n->n == cmpnop && n->n_ops == 1)
3034 if (n.n == cmpnop && (unsigned) n.n_ops == last - first + 1)
sel-sched.cc 989 int i, n_ops;
993 n_ops = recog_data.n_operands;
998 for (i = 0; i < n_ops; i++)
1014 for (i = 0; i < n_ops + recog_data.n_dups; i++)
1016 int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops];
983 int i, n_ops; local
  /src/external/gpl3/gcc.old/dist/gcc/
regcprop.cc 764 int n_ops, i, predicated; local
829 n_ops = recog_data.n_operands;
836 for (i = 0; i < n_ops; ++i)
849 for (i = 0; i < n_ops; i++)
863 for (i = 0; i < n_ops; i++)
986 for (i = 0; i < n_ops; i++)
regrename.cc 1543 /* Hide operands of the current insn (of which there are N_OPS) by
1551 hide_operands (int n_ops, rtx *old_operands, rtx *old_dups,
1556 for (i = 0; i < n_ops; i++)
1586 restore_operands (rtx_insn *insn, int n_ops, rtx *old_operands, rtx *old_dups)
1591 for (i = 0; i < n_ops; i++)
1605 int n_ops = recog_data.n_operands; local
1610 for (i = 0; i < n_ops + recog_data.n_dups; i++)
1612 int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops];
1613 rtx *loc = (i < n_ops
1664 int n_ops; local
    [all...]
genmatch.cc 2811 unsigned n_ops = e->ops.length (); local
2814 for (unsigned i = 0; i < n_ops; ++i)
2895 unsigned n_ops = e->ops.length (); local
2897 for (unsigned i = 0; i < n_ops; ++i)
gimple-ssa-store-merging.cc 212 - number of expressions N_OPS bitwise ored together to represent
235 int n_ops; member in struct:__anon16174::symbolic_number
354 n->n_ops = 1;
594 n->n_ops = n1->n_ops + n2->n_ops;
1013 if (!n->base_addr && n->n == cmpnop && n->n_ops == 1)
2950 if (n.n == cmpnop && (unsigned) n.n_ops == last - first + 1)
sel-sched.cc 989 int i, n_ops;
993 n_ops = recog_data.n_operands;
998 for (i = 0; i < n_ops; i++)
1014 for (i = 0; i < n_ops + recog_data.n_dups; i++)
1016 int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops];
983 int i, n_ops; local

Completed in 68 milliseconds