588   auto_vec<scc_entry,32> sccstack;  variable
698 	    max_local_entry = sccstack.length ();  in DFS()
699 	  sccstack.safe_push (e);  in DFS()
741 	  first = sccstack.length ();  in DFS()
744 	      x = sccstack[--first].t;  in DFS()
747 	  size = sccstack.length () - first;  in DFS()
761 		ob->local_trees->add (sccstack[first + i].t);  in DFS()
769 	      && TREE_CODE (sccstack[first].t) == TRANSLATION_UNIT_DECL)  in DFS()
783 		       && (sccstack[first + i].hash  in DFS()
784 			   == sccstack[first + from].hash); ++i)  in DFS()
793 		std::swap (sccstack[first + i],  in DFS()
794 			   sccstack[first + entry_start + i]);  in DFS()
823 		       || (TREE_CODE (sccstack[first].t) != IDENTIFIER_NODE  in DFS()
824 			   && (TREE_CODE (sccstack[first].t) != INTEGER_CST  in DFS()
825 			       || TREE_OVERFLOW (sccstack[first].t)))))  in DFS()
858 		  hashval_t hash = sccstack[first+i].hash;  in DFS()
859 		  tree t = sccstack[first+i].t;  in DFS()
876 		lto_write_tree_1 (ob, sccstack[first+i].t, ref_p);  in DFS()
880 	  sccstack.truncate (first);  in DFS()
1568     sccstack[first+i].hash  in hash_scc()
1569       = hash_tree (ob->writer_cache, NULL, sccstack[first+i].t);  in hash_scc()
1572     return sccstack[first].hash;  in hash_scc()
1597       qsort (&sccstack[first], size, sizeof (scc_entry), scc_entry_compare);  in hash_scc()
1604       if (sccstack[first].hash != sccstack[first+1].hash)  in hash_scc()
1607 	if (sccstack[first+i-1].hash != sccstack[first+i].hash)  in hash_scc()
1612 		    || sccstack[first+i+1].hash != sccstack[first+i].hash))  in hash_scc()
1636 		map.put (sccstack[first+i].t, sccstack[first+i].hash);  in hash_scc()
1638 	      DFS again (ob, sccstack[first+firstunique].t, ref_p, this_ref_p,  in hash_scc()
1640 	      gcc_assert (again.sccstack.length () == size);  in hash_scc()
1642 	      memcpy (sccstack.address () + first,  in hash_scc()
1643 		      again.sccstack.address (),  in hash_scc()
1650 	      sccstack[first].hash = *map.get (sccstack[first].t);  in hash_scc()
1651 	      scc_hash = sccstack[first].hash;  in hash_scc()
1654 		  sccstack[first+i].hash  in hash_scc()
1656 						*map.get (sccstack[first+i].t));  in hash_scc()
1659 						sccstack[first+i].hash);  in hash_scc()
1670 	      scc_hash = sccstack[first].hash;  in hash_scc()
1673 		  = iterative_hash_hashval_t (scc_hash, sccstack[first+i].hash);  in hash_scc()
1685 	    sccstack[first+i].hash  in hash_scc()
1686 	      = iterative_hash_hashval_t (sccstack[first+i].hash, scc_hash);  in hash_scc()
1698 	map.put (sccstack[first+i].t, sccstack[first+i].hash);  in hash_scc()
1701 	sccstack[first+i].hash  in hash_scc()
1702 	  = hash_tree (ob->writer_cache, &map, sccstack[first+i].t);  in hash_scc()
1730 	max_local_entry = sccstack.length () - 1;  in DFS_write_tree()