| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-range-equiv.h | 32 /* Deep-copies equiv bitmap argument. */
35 /* Shallow-copies equiv bitmap. */
37 /* Shallow-copies equiv bitmap. */
40 /* Move equiv bitmap from source range. */
43 /* Leaves equiv bitmap alone. */
45 /* Deep-copies equiv bitmap argument. */
60 bitmap equiv () const { return m_equiv; } function
|
| tree-ssa-uncprop.cc | 320 /* Pop the topmost value off the equiv stack. */
353 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux; local
354 record_equiv (equiv->rhs, equiv->lhs);
382 tree equiv = (*equivalences)[j]; local
384 if (gimple_can_coalesce_p (equiv, res))
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
396 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux; local
397 remove_equivalence (equiv->rhs);
418 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux local
[all...] |
| value-relation.cc | 191 // Given an equivalence set EQUIV, set all the bits in B that are still valid
192 // members of EQUIV in basic block BB.
225 // If there are equiv sets and SSA is in one in this list, find it.
290 equiv_chain *equiv = find_equiv_dom (ssa, bb); local
291 if (equiv)
292 return equiv->m_names;
294 // Otherwise return a cached equiv set containing just this SSA.
312 // If the 2 ssa names share the same equiv set, they are equal.
324 // If the 2 ssa names share the same equiv set, they are equal.
365 // Register equivalance between ssa_name V and set EQUIV in block BB
[all...] |
| reload.cc | 5920 rtx equiv = (MEM_P (XEXP (x, 0))
5926 || (equiv
5927 && memory_operand (equiv, GET_MODE (equiv))
5929 && insn_operand_matches (icode, 0, equiv)
5930 && insn_operand_matches (icode, 1, equiv))))
5901 rtx equiv = (MEM_P (XEXP (x, 0)) local
|
| optabs.cc | 4147 to TARGET, which is logically equivalent to EQUIV.
4153 note with an operand of EQUIV. */
4156 emit_libcall_block_1 (rtx_insn *insns, rtx target, rtx result, rtx equiv,
4171 && (equiv_may_trap || may_trap_p (equiv)))
4247 if (equiv)
4248 set_dst_reg_note (last, REG_EQUAL, copy_rtx (equiv), target);
4255 emit_libcall_block (rtx_insn *insns, rtx target, rtx result, rtx equiv)
4257 emit_libcall_block_1 (insns, target, result, equiv, false);
4726 rtx value, target, equiv;
4814 equiv = simplify_gen_relational (NE, cmp_mode, mode, y, y)
4710 rtx value, target, equiv; local
[all...] |
| reload1.cc | 1122 rtx equiv = 0;
1126 equiv = reg_equiv_constant (i);
1128 equiv = reg_equiv_invariant (i);
1130 equiv = targetm.delegitimize_address (reg);
1132 equiv = reg;
1134 if (equiv == reg)
1149 if (!equiv)
1157 reg, equiv);
6646 rtx equiv
6651 if (equiv != 0
1117 rtx equiv = 0; local
6622 rtx equiv local
[all...] |
| /src/external/bsd/ntp/dist/sntp/libopts/ |
| streqvcmp.c | 246 unsigned char equiv = (unsigned char)*s; local
248 charmap[(unsigned char)*(s++)] = equiv;
|
| /src/usr.bin/tr/ |
| str.c | 58 int equiv[2]; /* equivalence set */ member in struct:str
85 s->equiv[0] = 0;
86 s->equiv[1] = OOBCH;
96 if (s->set != NULL && s->set != s->equiv) {
162 if (s->set != s->equiv) {
194 case '=': /* "[=equiv=]" */
313 s->equiv[0] = backslash(s);
315 s->equiv[0] = ch;
329 s->set = s->equiv;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-uncprop.cc | 320 /* Pop the topmost value off the equiv stack. */
353 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux; local
354 record_equiv (equiv->rhs, equiv->lhs);
382 tree equiv = (*equivalences)[j]; local
384 if (gimple_can_coalesce_p (equiv, res))
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
396 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux; local
397 remove_equivalence (equiv->rhs);
418 struct edge_equivalency *equiv = (struct edge_equivalency *) e->aux local
[all...] |
| value-relation.cc | 271 // Given an equivalence set EQUIV, set all the bits in B that are still valid
272 // members of EQUIV in basic block BB.
308 // If there are equiv sets and SSA is in one in this list, find it.
488 equiv_chain *equiv = find_equiv_dom (ssa, bb); local
489 if (equiv)
490 return equiv->m_names;
492 // Otherwise return a cached equiv set containing just this SSA.
510 // If the 2 ssa names share the same equiv set, they are equal.
524 // If the 2 ssa names share the same equiv set, they are equal.
565 // Register equivalence between ssa_name V and set EQUIV in block BB
[all...] |
| reload.cc | 5921 rtx equiv = (MEM_P (XEXP (x, 0))
5927 || (equiv
5928 && memory_operand (equiv, GET_MODE (equiv))
5930 && insn_operand_matches (icode, 0, equiv)
5931 && insn_operand_matches (icode, 1, equiv))))
5902 rtx equiv = (MEM_P (XEXP (x, 0)) local
|
| reload1.cc | 1122 rtx equiv = 0;
1126 equiv = reg_equiv_constant (i);
1128 equiv = reg_equiv_invariant (i);
1130 equiv = targetm.delegitimize_address (reg);
1132 equiv = reg;
1134 if (equiv == reg)
1149 if (!equiv)
1157 reg, equiv);
6646 rtx equiv
6651 if (equiv != 0
1117 rtx equiv = 0; local
6622 rtx equiv local
[all...] |
| optabs.cc | 4207 to TARGET, which is logically equivalent to EQUIV.
4213 note with an operand of EQUIV. */
4216 emit_libcall_block_1 (rtx_insn *insns, rtx target, rtx result, rtx equiv,
4231 && (equiv_may_trap || may_trap_p (equiv)))
4307 if (equiv)
4308 set_dst_reg_note (last, REG_EQUAL, copy_rtx (equiv), target);
4315 emit_libcall_block (rtx_insn *insns, rtx target, rtx result, rtx equiv)
4317 emit_libcall_block_1 (insns, target, result, equiv, false);
4910 rtx value, target, equiv;
4998 equiv = simplify_gen_relational (NE, cmp_mode, mode, y, y)
4895 rtx value, target, equiv; local
[all...] |
| /src/usr.bin/fgen/ |
| fgen.h | 56 const char *equiv; member in struct:macro
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| rb.c | 749 node_t equiv; local
750 equiv.magic = NODE_MAGIC;
751 equiv.key = nodes[i].key;
752 equiv.allow_duplicates = true;
755 search_filtered = tree_search_filtered(tree, &equiv,
762 nsearch_filtered = tree_nsearch_filtered(tree, &equiv,
769 psearch_filtered = tree_psearch_filtered(tree, &equiv,
|
| /src/usr.bin/diff/ |
| diffreg.c | 107 * file1 together. Subroutine equiv replaces the value of each line in
109 * (the reordered) file1. To save space equiv squeezes file1 into a single
183 static void equiv(struct line *, int, struct line *, int, int *);
393 equiv(sfile[0], slen[0], sfile[1], slen[1], member);
552 equiv(struct line *a, int n, struct line *b, int m, int *c) function
|
| /src/external/cddl/osnet/dist/tools/ctf/cvt/ |
| merge.c | 140 int (*equiv)(tdesc_t *, tdesc_t *, equiv_data_t *); member in struct:tdesc_ops
352 int (*equiv)(tdesc_t *, tdesc_t *, equiv_data_t *);
387 if ((equiv = tdesc_ops[ctdp->t_type].equiv) != NULL)
388 return (equiv(ctdp, mtdp, ed));
|
| /src/external/bsd/openldap/dist/libraries/liblunicode/ure/ |
| ure.c | 237 _ure_equiv_t *equiv; member in struct:_ure_buffer_t
1567 (b->equiv[tmp].l != l || b->equiv[tmp].r != r);
1575 b->equiv = (_ure_equiv_t *) malloc(sizeof(_ure_equiv_t) << 3);
1577 b->equiv = (_ure_equiv_t *) realloc((char *) b->equiv,
1582 b->equiv[b->equiv_used].l = l;
1583 b->equiv[b->equiv_used].r = r;
1607 ls = b->states.states + b->equiv[eq].l;
1608 rs = b->states.states + b->equiv[eq].r
[all...] |
| /src/crypto/external/bsd/netpgp/dist/bindings/perl/ |
| netpgpperl_wrap.c | 351 int equiv = 0; local
354 while (!equiv && *ne) {
358 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
361 return equiv;
370 int equiv = 0; local
373 while (!equiv && *ne) {
377 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
380 return equiv;
4093 swig_cast_info *equiv; local
4101 equiv = swig_module.types[i]->cast
[all...] |
| /src/crypto/external/bsd/netpgp/dist/bindings/tcl/ |
| netpgptcl_wrap.c | 357 int equiv = 0; local
360 while (!equiv && *ne) {
364 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
367 return equiv;
376 int equiv = 0; local
379 while (!equiv && *ne) {
383 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
386 return equiv;
3358 swig_cast_info *equiv; local
3366 equiv = swig_module.types[i]->cast
[all...] |
| /src/crypto/external/bsd/netpgp/dist/bindings/python/ |
| netpgppython_wrap.c | 355 int equiv = 0; local
358 while (!equiv && *ne) {
362 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
365 return equiv;
374 int equiv = 0; local
377 while (!equiv && *ne) {
381 equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
384 return equiv;
4869 swig_cast_info *equiv; local
4877 equiv = swig_module.types[i]->cast
[all...] |
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| module.cc | 4981 gfc_equiv *head, *tail, *end, *eq, *equiv; local
4987 end = gfc_current_ns->equiv;
5011 for (equiv = gfc_current_ns->equiv; equiv; equiv = equiv->next)
5013 if (equiv->module && head->module
5014 && strcmp (equiv->module, head->module) == 0)
5032 gfc_current_ns->equiv = head
[all...] |
| gfortran.h | 2163 struct gfc_equiv *equiv, *old_equiv; member in struct:gfc_namespace
2802 gfc_equiv_info *equiv; member in struct:gfc_equiv_list
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| module.cc | 4962 gfc_equiv *head, *tail, *end, *eq, *equiv; local
4968 end = gfc_current_ns->equiv;
4992 for (equiv = gfc_current_ns->equiv; equiv; equiv = equiv->next)
4994 if (equiv->module && head->module
4995 && strcmp (equiv->module, head->module) == 0)
5013 gfc_current_ns->equiv = head
[all...] |
| /src/external/gpl3/gcc/dist/gcc/c/ |
| c-typeck.cc | 1419 bool equiv;
1489 data.equiv = true;
1624 if (data->equiv)
1840 if (data->equiv && (C_TYPE_VARIABLE_SIZE (t1) || C_TYPE_VARIABLE_SIZE (t2)))
1868 if (data->equiv
1414 bool equiv; member in struct:comptypes_data
|
