| /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-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-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
|
| 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...] |
| 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...] |
| /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...] |
| 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);
|
| 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...] |
| 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);
|
| 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);
|
| 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...] |
| 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...] |
| /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);
|
