| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-range-infer.cc | 28 #include "ssa.h"
53 tree ssa = TREE_OPERAND (op, 0); local
54 ((gimple_infer_range *)data)->add_nonzero (ssa);
188 // If there is an element which matches SSA, return a pointer to the element.
192 infer_range_manager::exit_range_head::find_ptr (tree ssa)
194 // Return NULL if SSA is not in this list.
195 if (!m_names || !bitmap_bit_p (m_names, SSA_NAME_VERSION (ssa)))
198 if (ptr->name == ssa)
221 // Non-zero elements are very common, so cache them for each ssa-name.
|
| gimple-range-path.cc | 32 #include "ssa.h"
369 // this block. This can happen on interdependent SSA/phis in loops.
482 // SSA names used to calculate the final conditional along the path.
525 tree ssa[3]; local
526 unsigned count = gimple_range_ssa_names (ssa, 3, ass);
528 if (add_to_exit_dependencies (ssa[j], dependencies))
529 worklist.safe_push (ssa[j]);
546 // DEPENDENCIES are path exit dependencies. They are the set of SSA
|
| gimple-range-fold.cc | 29 #include "ssa.h"
39 #include "tree-ssa-loop.h"
250 // Do not use the vector for non-ssa-names, or if it has been emptied.
760 tree ssa = TREE_OPERAND (base, 0); local
762 if (lhs && gimple_range_ssa_p (ssa) && src.gori ())
763 src.gori ()->register_dependency (lhs, ssa);
764 src.get_operand (r, ssa);
1150 // Both stmts will need to have 2 ssa names in the stmt.
|
| gimple-range-gori.cc | 28 #include "ssa.h"
59 /* RANGE_DEF_CHAIN is used to determine which SSA names in a block can
68 within this bitmap to indicate SSA names that are defined in the
69 SAME block and used to calculate this SSA name.
257 tree ssa[3]; local
273 unsigned count = gimple_range_ssa_names (ssa, 3, stmt);
285 // Increase the depth if we have a pair of ssa-names.
290 register_dependency (name, ssa[x], gimple_bb (stmt));
338 /* GORI_MAP is used to accumulate what SSA names in a block can
353 entire def_chain of all SSA names used in the last statement of th
[all...] |
| gimple-range-op.cc | 29 #include "ssa.h"
39 #include "tree-ssa-loop.h"
49 // Given stmt S, fill VEC, up to VEC_SIZE elements, with relevant ssa-names
51 // elements for the vector. Return the number of ssa-names.
56 tree ssa; local
63 if ((ssa = gimple_range_ssa_p (handler.operand1 ())))
64 vec[count++] = ssa;
65 if ((ssa = gimple_range_ssa_p (handler.operand2 ())))
66 vec[count++] = ssa;
73 if ((ssa = gimple_range_ssa_p (gimple_assign_rhs1 (st)))
149 tree ssa = TREE_OPERAND (m_op1, 0); local
[all...] |
| tree-ssa-threadbackward.cc | 0 /* SSA Jump Threading
31 #include "tree-ssa-threadupdate.h"
32 #include "tree-ssa-loop.h"
35 #include "gimple-ssa.h"
41 #include "tree-ssa-threadedge.h"
43 #include "ssa.h"
124 // The set of SSA names, any of which could potentially change the
131 // Set to TRUE if unknown SSA names along a path should be resolved
132 // with the ranger. Otherwise, unknown SSA names are assumed to be
340 // Find jump threading paths to any of the SSA names in th
428 tree ssa[3]; local
[all...] |
| value-relation.cc | 27 #include "ssa.h"
258 // If no range is available, create a varying range for each SSA name and
281 tree ssa = ssa_name (i); local
282 if (ssa && !SSA_NAME_IN_FREE_LIST (ssa))
284 const_bitmap ssa_equiv = equiv_set (ssa, bb);
301 // If SSA has an equivalence in this list, find and return it.
305 equiv_chain::find (unsigned ssa)
308 // If there are equiv sets and SSA is in one in this list, find it.
310 if (bitmap_bit_p (m_names, ssa))
[all...] |
| tree-vrp.cc | 34 #include "ssa.h"
40 #include "tree-ssa-loop-manip.h"
41 #include "tree-ssa-loop-niter.h"
42 #include "tree-into-ssa.h"
45 #include "tree-ssa-propagate.h"
54 #include "tree-ssa-dce.h"
150 // commoning opportunities later. See tree-ssa/ssa-pre-34.c.
180 // to the unreachable call must dominate all uses of those ssa-names, with
238 tree ssa = lhs_p ? gimple_cond_lhs (s) : gimple_cond_rhs (s) local
[all...] |
| tree-profile.cc | 37 #include "ssa.h"
48 #include "tree-into-ssa.h"
934 /* Stores the incoming edge and previous counters (in SSA form) on that edge
957 /* Resolve the SSA for a specific counter KIND. If it is not modified by any
975 tree ssa = make_ssa_name (gcov_type_node); local
976 gphi *phi = create_phi_node (ssa, fst.e->dest);
991 return ssa;
|
| value-range.cc | 28 #include "ssa.h"
3056 tree ssa = make_temp_ssa_name (float_type_node, NULL, "blah"); local
3059 set_range_info (ssa, r0);
3060 get_global_range_query ()->range_of_expr (r1, ssa);
|
| ipa-prop.cc | 29 #include "ssa.h"
970 SSA name (its dereference will become the base and the offset is assumed to
1485 tree op1, tc_ssa, base, ssa; local
1550 ssa = TREE_OPERAND (base, 0);
1551 if (TREE_CODE (ssa) != SSA_NAME
1552 || !SSA_NAME_IS_DEFAULT_DEF (ssa)
1557 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (ssa));
1560 parm_ref_data_pass_through_p (fbi, index, call, ssa),
1569 The base of the MEM_REF must be a default definition SSA NAME of a
1897 /* Skip SSA copies. *
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/ |
| filter.c | 378 SubstringsAssertion ssa; local
389 ssa.sa_desc = NULL;
390 ssa.sa_initial.bv_val = NULL;
391 ssa.sa_any = NULL;
392 ssa.sa_final.bv_val = NULL;
394 rc = slap_bv2ad( &desc, &ssa.sa_desc, text );
398 rc = slap_bv2undef_ad( &desc, &ssa.sa_desc, text,
406 ssa.sa_desc = slap_bv2tmp_ad( &desc, op->o_tmpmemctx );
416 if ( ssa.sa_desc->ad_type->sat_substr == NULL ) {
441 if ( ssa.sa_initial.bv_val != NUL
[all...] |
| /src/sys/compat/linux/common/ |
| linux_sched.c | 756 struct sys__sched_setaffinity_args ssa; local
781 memset(&ssa, 0, sizeof(ssa));
782 SCARG(&ssa, pid) = pid;
783 SCARG(&ssa, lid) = lid;
784 SCARG(&ssa, size) = size;
785 SCARG(&ssa, cpuset) = (cpuset_t *)SCARG(uap, mask);
787 return sys__sched_setaffinity(l, &ssa, retval);
|
| /src/external/cddl/osnet/dist/lib/libzfs/common/ |
| libzfs_iter.c | 319 snapspec_arg_t *ssa = arg; local
323 if (ssa->ssa_seenlast)
328 if (!ssa->ssa_seenfirst && strcmp(shortsnapname, ssa->ssa_first) == 0)
329 ssa->ssa_seenfirst = B_TRUE;
331 if (ssa->ssa_seenfirst) {
332 err = ssa->ssa_func(zhp, ssa->ssa_arg);
337 if (strcmp(shortsnapname, ssa->ssa_last) == 0)
338 ssa->ssa_seenlast = B_TRUE
372 snapspec_arg_t ssa = { 0 }; local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.guile/ |
| scm-pretty-print.c | 262 struct ss ssa[2]; local
283 init_ss(ssa+0, 3, 4);
284 init_ss(ssa+1, 5, 6);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.guile/ |
| scm-pretty-print.c | 262 struct ss ssa[2]; local
283 init_ss(ssa+0, 3, 4);
284 init_ss(ssa+1, 5, 6);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-relation.cc | 27 #include "ssa.h"
201 tree ssa = ssa_name (i); local
202 const_bitmap ssa_equiv = equiv_set (ssa, bb);
218 // If SSA has an equivalence in this list, find and return it.
222 equiv_chain::find (unsigned ssa)
225 // If there are equiv sets and SSA is in one in this list, find it.
227 if (bitmap_bit_p (m_names, ssa))
230 if (bitmap_bit_p (ptr->m_names, ssa))
283 // Find and return the equivalency set for SSA along the dominators of BB.
287 equiv_oracle::equiv_set (tree ssa, basic_block bb
[all...] |
| gimple-range-cache.cc | 1 /* Gimple ranger SSA cache implementation.
28 #include "ssa.h"
708 unsigned temporal_value (unsigned ssa) const;
728 // Return the timestamp value for SSA, or 0 if there isnt one.
731 temporal_cache::temporal_value (unsigned ssa) const
733 if (ssa >= m_timestamp.length ())
735 return m_timestamp[ssa];
1548 tree ssa = TREE_OPERAND (op, 0); local
1550 ((ranger_cache *)data)->update_to_nonnull (bb, ssa);
|
| gimple-range-fold.cc | 29 #include "ssa.h"
38 #include "tree-ssa-loop.h"
500 tree ssa = TREE_OPERAND (base, 0); local
501 if (TREE_CODE (ssa) == SSA_NAME)
502 return ssa;
703 tree ssa = TREE_OPERAND (base, 0); local
705 if (lhs && gimple_range_ssa_p (ssa) && src.gori ())
706 src.gori ()->register_dependency (lhs, ssa);
707 gcc_checking_assert (irange::supports_type_p (TREE_TYPE (ssa)));
708 src.get_operand (r, ssa);
[all...] |
| value-range.cc | 28 #include "ssa.h"
2296 tree ssa = make_ssa_name (integer_type_node); local
2297 value_range legacy_range (ssa, INT (25));
2303 legacy_range = value_range (ssa, ssa, VR_ANTI_RANGE);
|
| ipa-prop.cc | 29 #include "ssa.h"
867 SSA name (its dereference will become the base and the offset is assumed to
1378 tree op1, tc_ssa, base, ssa; local
1443 ssa = TREE_OPERAND (base, 0);
1444 if (TREE_CODE (ssa) != SSA_NAME
1445 || !SSA_NAME_IS_DEFAULT_DEF (ssa)
1450 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (ssa));
1453 parm_ref_data_pass_through_p (fbi, index, call, ssa),
1462 The base of the MEM_REF must be a default definition SSA NAME of a
1791 /* Skip SSA copies. *
[all...] |
| cfgexpand.cc | 32 #include "ssa.h"
59 #include "tree-ssa.h"
66 #include "tree-ssa-live.h"
67 #include "tree-outof-ssa.h"
73 #include "tree-ssa-address.h"
86 /* This variable holds information helping the rewriting of SSA trees
174 SSA name this is exactly SET_DECL_RTL, otherwise make the
517 /* Partitions containing an SSA name result from gimple registers
755 Two SSA names are compared by their version, SSA names come befor
1417 tree ssa = ssa_default_def (cfun, parm); local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/ |
| py-prettyprint.c | 297 struct ss ssa[2]; local
319 init_ss(ssa+0, 3, 4);
320 init_ss(ssa+1, 5, 6);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.python/ |
| py-prettyprint.c | 297 struct ss ssa[2]; local
319 init_ss(ssa+0, 3, 4);
320 init_ss(ssa+1, 5, 6);
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| zfs_ctldir.c | 808 snapshot_setup_arg_t *ssa = arg; local
814 ssa->snap_name, ZFSCTL_INO_SNAPDIR, ssa->snap_id);
875 snapshot_setup_arg_t ssa; local
877 ssa.snap_name = name;
878 ssa.snap_id = snap_id;
881 zfsctl_snapshot_vnode_setup, &ssa, vpp);
|
