contrib/gcc/cfgexpand.c

108   /* Initially, the size of the variable.  Later, the size of the partition,
110   HOST_WIDE_INT size;
113      size, the alignment for this partition.  */
130 /* An array of indicies such that stack_vars[stack_vars_sorted[i]].size
174 alloc_stack_frame_space (HOST_WIDE_INT size, HOST_WIDE_INT align)
181       new_frame_offset -= size + frame_phase;
193       new_frame_offset += size;
219   stack_vars[stack_vars_num].size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
250   size_t size = triangular_index (n-1, n-1) + 1;
252   if (size <= stack_vars_conflict_alloc)
255   stack_vars_conflict = XRESIZEVEC (bool, stack_vars_conflict, size);
257 	  (size - stack_vars_conflict_alloc) * sizeof (bool));
258   stack_vars_conflict_alloc = size;
346    sorting an array of indicies by the size of the object.  */
351   HOST_WIDE_INT sa = stack_vars[*(const size_t *)a].size;
352   HOST_WIDE_INT sb = stack_vars[*(const size_t *)b].size;
360   /* For stack variables of the same size use the uid of the decl
406 	Sort the objects by size.
408 	  S = size(A)
411 	    Look for the largest non-conflicting object B with size <= S.
414 	    O += size(B)
415 	    S -= size(B)
446       HOST_WIDE_INT isize = stack_vars[i].size;
452 	  HOST_WIDE_INT jsize = stack_vars[j].size;
505       fprintf (dump_file, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC
506 	       " align %u\n", (unsigned long) i, stack_vars[i].size,
575       offset = alloc_stack_frame_space (stack_vars[i].size,
592   HOST_WIDE_INT size, offset, align;
594   size = tree_low_cst (DECL_SIZE_UNIT (var), 1);
596   offset = alloc_stack_frame_space (size, align);
693    for coalescing, which reduces the size of the quadratic problem.  */
713      other hand, we don't want the function's stack frame size to