Region-based optimization is an effective technique for restructuring a program to better reflect dynamic behavior and increase interprocedural optimization and scheduling opportunities in an ILP compiler. In this paper, we describe an algorithm that incorporates partial inlining into a region-based compilation framework to achieve the optimization benefits of full inlining but with the added benefit of reduced code growth.