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

  /src/external/gpl3/gcc/dist/gcc/
tree-complex.cc 47 /* For each complex ssa name, a lattice value. We're interested in finding
134 /* Compute a lattice value from the components of a complex type REAL
157 /* Compute a lattice value from gimple_val T. */
316 /* Evaluate statement STMT against the complex lattice defined above. */
357 /* We've set up the lattice values such that IOR neatly
388 /* Don't allow the lattice value to flip-flop indefinitely. */
411 /* Evaluate a PHI node against the complex lattice defined above. */
430 /* We've set up the lattice values such that IOR neatly models PHI meet. */
501 complex_lattice_t lattice = find_lattice_value (ssa_name); local
505 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)
547 complex_lattice_t lattice = find_lattice_value (ssa_name); local
    [all...]
ipa-modref.cc 2007 /* Lattice used during the eaf flags analysis dataflow. For a given SSA name
2008 we aim to compute its flags and escape points. We also use the lattice
2033 Each edge represents the fact that flags of current lattice should be
2034 propagated to lattice of SSA_NAME. */
2078 /* Dump lattice to OUT; indent with INDENT spaces. */
2276 /* Propagation lattice for individual ssa names. */
2292 LATTICE, DEPTH and ipa are same as in analyze_ssa_name.
2347 into flags for caller, update LATTICE of corresponding
2352 modref_lattice &lattice)
2364 lattice.merge (0)
2881 modref_lattice &lattice = m_lattice[SSA_NAME_VERSION (name)]; local
    [all...]
tree-ssa-forwprop.cc 195 /* Const-and-copy lattice. */
196 static vec<tree> lattice; variable
198 /* Set the lattice entry for NAME to VAL. */
204 if (SSA_NAME_VERSION (name) >= lattice.length ())
206 lattice.reserve (num_ssa_names - lattice.length ());
207 lattice.quick_grow_cleared (num_ssa_names);
209 lattice[SSA_NAME_VERSION (name)] = val;
213 /* Invalidate the lattice entry for NAME, done when releasing SSA names. */
219 && SSA_NAME_VERSION (name) < lattice.length ()
    [all...]
cfgexpand.cc 5724 unsigned int *lattice; /* Hold cost of each statement. */ local
5743 lattice = XNEWVEC (unsigned int, n);
5751 lattice[i] = cost;
5761 lattice[i] += lattice[gimple_uid (def_stmt)];
5778 if (!def0 || lattice[gimple_uid (def1)] > lattice[gimple_uid (def0)])
5787 def0 ? lattice[gimple_uid (def0)] : 0,
5788 lattice[gimple_uid (def1)]);
5794 XDELETE (lattice);
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-complex.cc 47 /* For each complex ssa name, a lattice value. We're interested in finding
134 /* Compute a lattice value from the components of a complex type REAL
157 /* Compute a lattice value from gimple_val T. */
311 /* Evaluate statement STMT against the complex lattice defined above. */
352 /* We've set up the lattice values such that IOR neatly
383 /* Don't allow the lattice value to flip-flop indefinitely. */
406 /* Evaluate a PHI node against the complex lattice defined above. */
425 /* We've set up the lattice values such that IOR neatly models PHI meet. */
496 complex_lattice_t lattice = find_lattice_value (ssa_name); local
500 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)
542 complex_lattice_t lattice = find_lattice_value (ssa_name); local
    [all...]
ipa-modref.cc 2004 /* Lattice used during the eaf flags analysis dataflow. For a given SSA name
2005 we aim to compute its flags and escape points. We also use the lattice
2030 Each edge represents the fact that flags of current lattice should be
2031 propagated to lattice of SSA_NAME. */
2075 /* Dump lattice to OUT; indent with INDENT spaces. */
2273 /* Propagation lattice for individual ssa names. */
2289 LATTICE, DEPTH and ipa are same as in analyze_ssa_name.
2344 into flags for caller, update LATTICE of corresponding
2349 modref_lattice &lattice)
2361 lattice.merge (0)
2878 modref_lattice &lattice = m_lattice[SSA_NAME_VERSION (name)]; local
    [all...]
tree-ssa-forwprop.cc 191 /* Const-and-copy lattice. */
192 static vec<tree> lattice; variable
194 /* Set the lattice entry for NAME to VAL. */
200 if (SSA_NAME_VERSION (name) >= lattice.length ())
202 lattice.reserve (num_ssa_names - lattice.length ());
203 lattice.quick_grow_cleared (num_ssa_names);
205 lattice[SSA_NAME_VERSION (name)] = val;
209 /* Invalidate the lattice entry for NAME, done when releasing SSA names. */
215 && SSA_NAME_VERSION (name) < lattice.length ()
    [all...]
cfgexpand.cc 5702 unsigned int *lattice; /* Hold cost of each statement. */ local
5721 lattice = XNEWVEC (unsigned int, n);
5729 lattice[i] = cost;
5739 lattice[i] += lattice[gimple_uid (def_stmt)];
5756 if (!def0 || lattice[gimple_uid (def1)] > lattice[gimple_uid (def0)])
5765 def0 ? lattice[gimple_uid (def0)] : 0,
5766 lattice[gimple_uid (def1)]);
5772 XDELETE (lattice);
    [all...]

Completed in 37 milliseconds