Searched refs:lattice (Results 1 - 3 of 3) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-forwprop.c224 /* Const-and-copy lattice. */
225 static vec<tree> lattice; variable
227 /* Set the lattice entry for NAME to VAL. */
233 if (SSA_NAME_VERSION (name) >= lattice.length ())
235 lattice.reserve (num_ssa_names - lattice.length ());
236 lattice.quick_grow_cleared (num_ssa_names);
238 lattice[SSA_NAME_VERSION (name)] = val;
242 /* Invalidate the lattice entry for NAME, done when releasing SSA names. */
248 && SSA_NAME_VERSION (name) < lattice
[all...]
H A Dtree-complex.c81 /* For each complex ssa name, a lattice value. We're interested in finding
155 /* Compute a lattice value from the components of a complex type REAL
178 /* Compute a lattice value from gimple_val T. */
332 /* Evaluate statement STMT against the complex lattice defined above. */
373 /* We've set up the lattice values such that IOR neatly
404 /* Don't allow the lattice value to flip-flop indefinitely. */
427 /* Evaluate a PHI node against the complex lattice defined above. */
443 /* We've set up the lattice values such that IOR neatly models PHI meet. */
514 complex_lattice_t lattice = find_lattice_value (ssa_name); local
518 if (lattice
560 complex_lattice_t lattice = find_lattice_value (ssa_name); local
[all...]
H A Dcfgexpand.c5136 unsigned int *lattice; /* Hold cost of each statement. */ local
5155 lattice = XNEWVEC (unsigned int, n);
5163 lattice[i] = cost;
5173 lattice[i] += lattice[gimple_uid (def_stmt)];
5190 if (!def0 || lattice[gimple_uid (def1)] > lattice[gimple_uid (def0)])
5199 def0 ? lattice[gimple_uid (def0)] : 0,
5200 lattice[gimple_uid (def1)]);
5206 XDELETE (lattice);
[all...]

Completed in 111 milliseconds