00001 /* 00002 00003 Copyright (C) 2000, 2001 Silicon Graphics, Inc. All Rights Reserved. 00004 00005 This program is free software; you can redistribute it and/or modify it 00006 under the terms of version 2 of the GNU General Public License as 00007 published by the Free Software Foundation. 00008 00009 This program is distributed in the hope that it would be useful, but 00010 WITHOUT ANY WARRANTY; without even the implied warranty of 00011 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 00012 00013 Further, this software is distributed without any warranty that it is 00014 free of the rightful claim of any third person regarding infringement 00015 or the like. Any license provided herein, whether implied or 00016 otherwise, applies only to this software file. Patent licenses, if 00017 any, provided herein do not apply to combinations of this program with 00018 other software, or any other product whatsoever. 00019 00020 You should have received a copy of the GNU General Public License along 00021 with this program; if not, write the Free Software Foundation, Inc., 59 00022 Temple Place - Suite 330, Boston MA 02111-1307, USA. 00023 00024 Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pky, 00025 Mountain View, CA 94043, or: 00026 00027 http://www.sgi.com 00028 00029 For further information regarding this notice, see: 00030 00031 http://oss.sgi.com/projects/GenInfo/NoticeExplan 00032 00033 */ 00034 00035 00036 static const char source_file[] = __FILE__; 00037 static const char rcs_id[] = "$Source: /proj/osprey/CVS/open64/osprey1.0/common/targ_info/access/ti_res.c,v $ $Revision: 1.1.1.1 $"; 00038 00039 #include <alloca.h> 00040 00041 #include "defs.h" 00042 #include "targ_proc.h" 00043 #include "targ_proc_properties.h" 00044 #include "ti_si.h" 00045 00046 #include "ti_res.h" 00047 00048 00049 /* ==================================================================== 00050 * 00051 * TI_RES_Can_Dual_Issue 00052 * 00053 * See interface description 00054 * 00055 * ==================================================================== 00056 */ 00057 BOOL TI_RES_Can_Dual_Issue( 00058 TOP opcode1, 00059 TOP opcode2 00060 ) 00061 { 00062 INT min_length, i; 00063 SI_RR rr1, rr2; 00064 00065 /* Quick check to see if we could ever dual issue something. 00066 */ 00067 if (!PROC_has_same_cycle_branch_shadow()) return FALSE; 00068 00069 /* Resource requirements for each. 00070 */ 00071 rr1 = TSI_Resource_Requirement(opcode1); 00072 rr2 = TSI_Resource_Requirement(opcode2); 00073 00074 /* We only have to check up to the end of the shorter of the two resource 00075 * requests. 00076 */ 00077 if ( SI_RR_Length(rr1) < SI_RR_Length(rr2) ) 00078 min_length = SI_RR_Length(rr1); 00079 else 00080 min_length = SI_RR_Length(rr2); 00081 00082 /* Check each cycle. 00083 */ 00084 for ( i = 0; i < min_length; ++i ) { 00085 SI_RRW rrw = SI_RRW_Initial(); 00086 00087 rrw = SI_RRW_Reserve(rrw,SI_RR_Cycle_RRW(rr1,i)); 00088 rrw = SI_RRW_Reserve(rrw,SI_RR_Cycle_RRW(rr2,i)); 00089 00090 if ( SI_RRW_Has_Overuse(rrw) ) return FALSE; 00091 } 00092 00093 return TRUE; 00094 }
1.5.6