Context Navigation

source: src/ResolvExpr/ConversionCost.cc @ 07b59ec

Last change on this file since 07b59ec was 24d6572, checked in by Fangren Yu <f37yu@…>, 17 months ago
Merge branch 'master' into ast-experimental
Property mode set to `100644`
File size: 43.3 KB

Rev	Line
[a32b204]	1	//
	2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
	3	//
	4	// The contents of this file are covered under the licence agreement in the
	5	// file "LICENCE" distributed with Cforall.
	6	//
[a436947]	7	// ConversionCost.cc --
[a32b204]	8	//
	9	// Author : Richard C. Bilson
	10	// Created On : Sun May 17 07:06:19 2015
[fb2bde4]	11	// Last Modified By : Andrew Beach
[1d17939]	12	// Last Modified On : Wed Jul 29 16:11:00 2020
[cf32116]	13	// Update Count : 28
[a32b204]	14	//
[51b7345]	15
	16	#include "ConversionCost.h"
[ea6332d]	17
	18	#include <cassert> // for assert
	19	#include <list> // for list, list<>::const_iterator
	20	#include <string> // for operator==, string
	21
	22	#include "ResolvExpr/Cost.h" // for Cost
	23	#include "ResolvExpr/TypeEnvironment.h" // for EqvClass, TypeEnvironment
[5bf3976]	24	#include "ResolvExpr/Unify.h" // for typesCompatibleIgnoreQualifiers
	25	#include "ResolvExpr/PtrsAssignable.hpp" // for ptrsAssignable
[ea6332d]	26	#include "SymTab/Indexer.h" // for Indexer
	27	#include "SynTree/Declaration.h" // for TypeDecl, NamedTypeDecl
	28	#include "SynTree/Type.h" // for Type, BasicType, TypeInstType
[51b7345]	29
[ef1da0e2]	30
[51b7345]	31	namespace ResolvExpr {
[c378e5e]	32	#if 0
[cdcddfe1]	33	const Cost Cost::zero = Cost{ 0, 0, 0, 0, 0, 0, 0 };
	34	const Cost Cost::infinity = Cost{ -1, -1, -1, -1, -1, 1, -1 };
	35	const Cost Cost::unsafe = Cost{ 1, 0, 0, 0, 0, 0, 0 };
	36	const Cost Cost::poly = Cost{ 0, 1, 0, 0, 0, 0, 0 };
	37	const Cost Cost::safe = Cost{ 0, 0, 1, 0, 0, 0, 0 };
	38	const Cost Cost::sign = Cost{ 0, 0, 0, 1, 0, 0, 0 };
	39	const Cost Cost::var = Cost{ 0, 0, 0, 0, 1, 0, 0 };
	40	const Cost Cost::spec = Cost{ 0, 0, 0, 0, 0, -1, 0 };
	41	const Cost Cost::reference = Cost{ 0, 0, 0, 0, 0, 0, 1 };
[c378e5e]	42	#endif
[b46e3bd]	43
[5ccb10d]	44	#if 0
	45	#define PRINT(x) x
	46	#else
	47	#define PRINT(x)
	48	#endif
[ada4575]	49
[7d01cf44]	50	Cost conversionCost( const Type * src, const Type * dest, bool srcIsLvalue,
	51	const SymTab::Indexer &indexer, const TypeEnvironment &env ) {
[7870799]	52	if ( const TypeInstType * destAsTypeInst = dynamic_cast< const TypeInstType * >( dest ) ) {
[eb0aedb]	53	PRINT( std::cerr << "type inst " << destAsTypeInst->name; )
[ef5b828]	54	if ( const EqvClass * eqvClass = env.lookup( destAsTypeInst->name ) ) {
[00ac42e]	55	if ( eqvClass->type ) {
[7d01cf44]	56	return conversionCost( src, eqvClass->type, srcIsLvalue, indexer, env );
[0b150ec]	57	} else {
	58	return Cost::infinity;
	59	}
[7870799]	60	} else if ( const NamedTypeDecl * namedType = indexer.lookupType( destAsTypeInst->name ) ) {
[5ccb10d]	61	PRINT( std::cerr << " found" << std::endl; )
[ef5b828]	62	const TypeDecl * type = dynamic_cast< const TypeDecl * >( namedType );
[a32b204]	63	// all typedefs should be gone by this point
	64	assert( type );
[eb0aedb]	65	if ( type->base ) {
[7d01cf44]	66	return conversionCost( src, type->base, srcIsLvalue, indexer, env )
	67	+ Cost::safe;
[a32b204]	68	} // if
	69	} // if
[5ccb10d]	70	PRINT( std::cerr << " not found" << std::endl; )
[a32b204]	71	} // if
[5ccb10d]	72	PRINT(
	73	std::cerr << "src is ";
	74	src->print( std::cerr );
	75	std::cerr << std::endl << "dest is ";
	76	dest->print( std::cerr );
	77	std::cerr << std::endl << "env is" << std::endl;
	78	env.print( std::cerr, 8 );
	79	)
[a32b204]	80	if ( typesCompatibleIgnoreQualifiers( src, dest, indexer, env ) ) {
[5ccb10d]	81	PRINT( std::cerr << "compatible!" << std::endl; )
[89be1c68]	82	return Cost::zero;
[7870799]	83	} else if ( dynamic_cast< const VoidType * >( dest ) ) {
[89be1c68]	84	return Cost::safe;
[7870799]	85	} else if ( const ReferenceType * refType = dynamic_cast< const ReferenceType * > ( dest ) ) {
[5ccb10d]	86	PRINT( std::cerr << "conversionCost: dest is reference" << std::endl; )
[7d01cf44]	87	return convertToReferenceCost( src, refType, srcIsLvalue, indexer, env, [](const Type * const t1, const Type * t2, const SymTab::Indexer &, const TypeEnvironment & env ){
[0c6596f]	88	return ptrsAssignable( t1, t2, env );
	89	});
[a32b204]	90	} else {
[7870799]	91	PassVisitor<ConversionCost> converter(
[7d01cf44]	92	dest, srcIsLvalue, indexer, env,
	93	(Cost ()(const Type , const Type *, bool, const SymTab::Indexer&, const TypeEnvironment&))
[9d5089e]	94	conversionCost );
[a32b204]	95	src->accept( converter );
[bd0b6b62]	96	if ( converter.pass.get_cost() == Cost::infinity ) {
[a32b204]	97	return Cost::infinity;
	98	} else {
[bd0b6b62]	99	return converter.pass.get_cost() + Cost::zero;
[a32b204]	100	} // if
	101	} // if
	102	}
	103
[7d01cf44]	104	static Cost convertToReferenceCost( const Type * src, const Type * dest, bool srcIsLvalue,
	105	int diff, const SymTab::Indexer & indexer, const TypeEnvironment & env, PtrsFunction func ) {
[6e027d6]	106	PRINT( std::cerr << "convert to reference cost... diff " << diff << " " << src << " / " << dest << std::endl; )
[89be1c68]	107	if ( diff > 0 ) {
	108	// TODO: document this
[7d01cf44]	109	Cost cost = convertToReferenceCost(
	110	strict_dynamic_cast< const ReferenceType * >( src )->base, dest, srcIsLvalue,
	111	diff-1, indexer, env, func );
[7ebaa56]	112	cost.incReference();
[89be1c68]	113	return cost;
	114	} else if ( diff < -1 ) {
	115	// TODO: document this
[7d01cf44]	116	Cost cost = convertToReferenceCost(
	117	src, strict_dynamic_cast< const ReferenceType * >( dest )->base, srcIsLvalue,
	118	diff+1, indexer, env, func );
[7ebaa56]	119	cost.incReference();
[89be1c68]	120	return cost;
	121	} else if ( diff == 0 ) {
[7870799]	122	const ReferenceType * srcAsRef = dynamic_cast< const ReferenceType * >( src );
	123	const ReferenceType * destAsRef = dynamic_cast< const ReferenceType * >( dest );
[89be1c68]	124	if ( srcAsRef && destAsRef ) { // pointer-like conversions between references
[5ccb10d]	125	PRINT( std::cerr << "converting between references" << std::endl; )
[7870799]	126	Type::Qualifiers tq1 = srcAsRef->base->tq;
	127	Type::Qualifiers tq2 = destAsRef->base->tq;
[eb0aedb]	128	if ( tq1 <= tq2 && typesCompatibleIgnoreQualifiers( srcAsRef->base, destAsRef->base, indexer, env ) ) {
[6e027d6]	129	PRINT( std::cerr << " :: compatible and good qualifiers" << std::endl; )
	130	if ( tq1 == tq2 ) {
	131	// types are the same
	132	return Cost::zero;
	133	} else {
	134	// types are the same, except otherPointer has more qualifiers
	135	return Cost::safe;
	136	}
[89be1c68]	137	} else { // xxx - this discards reference qualifiers from consideration -- reducing qualifiers is a safe conversion; is this right?
[721cd19f]	138	int assignResult = func( srcAsRef->base, destAsRef->base, indexer, env );
[5ccb10d]	139	PRINT( std::cerr << "comparing references: " << assignResult << " " << srcAsRef << " " << destAsRef << std::endl; )
[b0837e4]	140	if ( assignResult > 0 ) {
[89be1c68]	141	return Cost::safe;
[b0837e4]	142	} else if ( assignResult < 0 ) {
[89be1c68]	143	return Cost::unsafe;
	144	} // if
[2463d0e]	145	} // if
	146	} else {
[5ccb10d]	147	PRINT( std::cerr << "reference to rvalue conversion" << std::endl; )
[7870799]	148	PassVisitor<ConversionCost> converter(
[7d01cf44]	149	dest, srcIsLvalue, indexer, env,
	150	(Cost ()(const Type , const Type *, bool, const SymTab::Indexer&, const TypeEnvironment&))
[9d5089e]	151	conversionCost );
[89be1c68]	152	src->accept( converter );
[bd0b6b62]	153	return converter.pass.get_cost();
[89be1c68]	154	} // if
[2463d0e]	155	} else {
[7870799]	156	const ReferenceType * destAsRef = dynamic_cast< const ReferenceType * >( dest );
[89be1c68]	157	assert( diff == -1 && destAsRef );
[108f3cdb]	158	PRINT( std::cerr << "dest is: " << dest << " / src is: " << src << std::endl; )
[eb0aedb]	159	if ( typesCompatibleIgnoreQualifiers( src, destAsRef->base, indexer, env ) ) {
[5ccb10d]	160	PRINT( std::cerr << "converting compatible base type" << std::endl; )
[7d01cf44]	161	if ( srcIsLvalue ) {
[5ccb10d]	162	PRINT(
	163	std::cerr << "lvalue to reference conversion" << std::endl;
	164	std::cerr << src << " => " << destAsRef << std::endl;
	165	)
[89be1c68]	166	// lvalue-to-reference conversion: cv lvalue T => cv T &
[7870799]	167	if ( src->tq == destAsRef->base->tq ) {
[7ebaa56]	168	return Cost::reference; // cost needs to be non-zero to add cast
[7870799]	169	} if ( src->tq < destAsRef->base->tq ) {
[7ebaa56]	170	return Cost::safe; // cost needs to be higher than previous cast to differentiate adding qualifiers vs. keeping same
[89be1c68]	171	} else {
	172	return Cost::unsafe;
	173	} // if
[eb0aedb]	174	} else if ( destAsRef->base->get_const() ) {
[5ccb10d]	175	PRINT( std::cerr << "rvalue to const ref conversion" << std::endl; )
[89be1c68]	176	// rvalue-to-const-reference conversion: T => const T &
	177	return Cost::safe;
	178	} else {
[5ccb10d]	179	PRINT( std::cerr << "rvalue to non-const reference conversion" << std::endl; )
[89be1c68]	180	// rvalue-to-reference conversion: T => T &
	181	return Cost::unsafe;
	182	} // if
	183	} // if
[5ccb10d]	184	PRINT( std::cerr << "attempting to convert from incompatible base type -- fail" << std::endl; )
[2463d0e]	185	}
	186	return Cost::infinity;
	187	}
	188
[7d01cf44]	189	Cost convertToReferenceCost( const Type * src, const ReferenceType * dest, bool srcIsLvalue,
	190	const SymTab::Indexer & indexer, const TypeEnvironment & env, PtrsFunction func ) {
[89be1c68]	191	int sdepth = src->referenceDepth(), ddepth = dest->referenceDepth();
[7d01cf44]	192	Cost cost = convertToReferenceCost( src, dest, srcIsLvalue, sdepth-ddepth, indexer, env, func );
[eddb399]	193	PRINT( std::cerr << "convertToReferenceCost result: " << cost << std::endl; )
	194	return cost;
[89be1c68]	195	}
	196
[7d01cf44]	197	ConversionCost::ConversionCost( const Type * dest, bool srcIsLvalue, const SymTab::Indexer &indexer, const TypeEnvironment &env, CostFunction costFunc )
	198	: dest( dest ), srcIsLvalue( srcIsLvalue ), indexer( indexer ), cost( Cost::infinity ), env( env ), costFunc( costFunc ) {
[a32b204]	199	}
[4ee3b0c1]	200
[e15853c]	201	// GENERATED START, DO NOT EDIT
[6fd1955]	202	// GENERATED BY BasicTypes-gen.cc
[cdcddfe1]	203	/* EXTENDED INTEGRAL RANK HIERARCHY (root to leaves)
[e15853c]	204	_Bool
[7870799]	205	char signed char unsigned char
	206	signed short int unsigned short int
	207	signed int unsigned int
	208	signed long int unsigned long int
	209	signed long long int unsigned long long int
	210	__int128 unsigned __int128
	211	_Float16 _Float16 _Complex
	212	_Float32 _Float32 _Complex
	213	float float _Complex
	214	_Float32x _Float32x _Complex
	215	_Float64 _Float64 _Complex
	216	double double _Complex
	217	_Float64x _Float64x _Complex
[e15853c]	218	__float80
[7870799]	219	_Float128 _Float128 _Complex
[e15853c]	220	__float128
[7870799]	221	long double long double _Complex
	222	_Float128x _Float128x _Complex
[cdcddfe1]	223	*/
[e15853c]	224	// GENERATED END
[cdcddfe1]	225
[e15853c]	226	// GENERATED START, DO NOT EDIT
[6fd1955]	227	// GENERATED BY BasicTypes-gen.cc
[cdcddfe1]	228	static const int costMatrix[BasicType::NUMBER_OF_BASIC_TYPES][BasicType::NUMBER_OF_BASIC_TYPES] = { // path length from root to node
[3a55d9f]	229	/* B C SC UC SI SUI I UI LI LUI LLI LLUI IB UIB _FH _FH _F _FC F FC _FX _FXC FD _FDC D DC F80X_FDXC F80 _FB_FLDC FB LD LDC _FBX_FLDXC */
	230	/* B */ { 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 17, 16, 18, 17, },
	231	/* C */ { -1, 0, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 16, 15, 17, 16, },
	232	/* SC */ { -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 16, 15, 17, 16, },
	233	/* UC */ { -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 16, 15, 17, 16, },
	234	/* SI */ { -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 15, 14, 16, 15, },
	235	/* SUI */ { -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 15, 14, 16, 15, },
	236	/* I */ { -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 14, 13, 15, 14, },
	237	/* UI */ { -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 14, 13, 15, 14, },
	238	/* LI */ { -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 12, 14, 13, },
	239	/* LUI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 12, 14, 13, },
	240	/* LLI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 12, 11, 13, 12, },
	241	/* LLUI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 12, 11, 13, 12, },
	242	/* IB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 10, 12, 11, },
	243	/* UIB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 10, 12, 11, },
	244	/* _FH */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 10, 9, 11, 10, },
	245	/* _FH */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, 2, -1, 3, -1, 4, -1, 5, -1, 6, -1, -1, 7, -1, -1, 8, -1, 9, },
	246	/* _F */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 9, 8, 10, 9, },
	247	/* _FC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, 2, -1, 3, -1, 4, -1, 5, -1, -1, 6, -1, -1, 7, -1, 8, },
	248	/* F */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 7, 9, 8, },
	249	/* FC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, 2, -1, 3, -1, 4, -1, -1, 5, -1, -1, 6, -1, 7, },
	250	/* _FX */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 6, 8, 7, },
	251	/* _FXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, 2, -1, 3, -1, -1, 4, -1, -1, 5, -1, 6, },
	252	/* FD */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 5, 7, 6, },
	253	/* _FDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, 2, -1, -1, 3, -1, -1, 4, -1, 5, },
	254	/* D */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, 4, 5, 4, 6, 5, },
	255	/* DC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, -1, -1, 2, -1, -1, 3, -1, 4, },
	256	/* F80X */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 4, 3, 5, 4, },
	257	/* _FDXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, 1, -1, -1, 2, -1, 3, },
	258	/* F80 */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 0, 1, 2, 2, 3, 3, 4, 4, },
	259	/* _FB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, 2, 3, 3, },
	260	/* _FLDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, 1, -1, 2, },
	261	/* FB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 0, 1, 2, 2, 3, },
	262	/* LD */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 1, 2, },
	263	/* LDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 1, },
	264	/* _FBX */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, },
[ef5b828]	265	/* _FLDXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, },
[e15853c]	266	}; // costMatrix
[1c9568f0]	267	static const int maxIntCost = 15;
[e15853c]	268	// GENERATED END
[cdcddfe1]	269	static_assert(
[ef5b828]	270	sizeof(costMatrix)/sizeof(costMatrix[0][0]) == BasicType::NUMBER_OF_BASIC_TYPES * BasicType::NUMBER_OF_BASIC_TYPES,
[cdcddfe1]	271	"Missing row in the cost matrix"
	272	);
	273
[e15853c]	274	// GENERATED START, DO NOT EDIT
[6fd1955]	275	// GENERATED BY BasicTypes-gen.cc
[cdcddfe1]	276	static const int signMatrix[BasicType::NUMBER_OF_BASIC_TYPES][BasicType::NUMBER_OF_BASIC_TYPES] = { // number of sign changes in safe conversion
[3a55d9f]	277	/* B C SC UC SI SUI I UI LI LUI LLI LLUI IB UIB _FH _FH _F _FC F FC _FX _FXC FD _FDC D DC F80X_FDXC F80 _FB_FLDC FB LD LDC _FBX_FLDXC */
	278	/* B */ { 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	279	/* C */ { -1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	280	/* SC */ { -1, -1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	281	/* UC */ { -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	282	/* SI */ { -1, -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	283	/* SUI */ { -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	284	/* I */ { -1, -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	285	/* UI */ { -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	286	/* LI */ { -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	287	/* LUI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	288	/* LLI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	289	/* LLUI */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	290	/* IB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	291	/* UIB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	292	/* _FH */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	293	/* _FH */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	294	/* _F */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	295	/* _FC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	296	/* F */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	297	/* FC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	298	/* _FX */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	299	/* _FXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	300	/* FD */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	301	/* _FDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	302	/* D */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	303	/* DC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	304	/* F80X */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	305	/* _FDXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, 0, -1, -1, 0, -1, 0, },
	306	/* F80 */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, },
	307	/* _FB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, },
	308	/* _FLDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, 0, -1, 0, },
	309	/* FB */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, },
	310	/* LD */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, },
	311	/* LDC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 0, },
	312	/* _FBX */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, },
[ef5b828]	313	/* _FLDXC */ { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, },
[e15853c]	314	}; // signMatrix
	315	// GENERATED END
[cdcddfe1]	316	static_assert(
[ef5b828]	317	sizeof(signMatrix)/sizeof(signMatrix[0][0]) == BasicType::NUMBER_OF_BASIC_TYPES * BasicType::NUMBER_OF_BASIC_TYPES,
[cdcddfe1]	318	"Missing row in the sign matrix"
	319	);
[a32b204]	320
[7870799]	321	void ConversionCost::postvisit( const VoidType * ) {
[a32b204]	322	cost = Cost::infinity;
	323	}
	324
[fc134a48]	325	// refactor for code resue
	326	void ConversionCost::conversionCostFromBasicToBasic(const BasicType * src, const BasicType * dest) {
	327	int tableResult = costMatrix[ src->kind ][ dest->kind ];
	328	if ( tableResult == -1 ) {
	329	cost = Cost::unsafe;
	330	} else {
	331	cost = Cost::zero;
	332	cost.incSafe( tableResult );
	333	cost.incSign( signMatrix[ src->kind ][ dest->kind ] );
	334	} // if
	335	} // ConversionCost::conversionCostFromBasicToBasic
	336
[ef5b828]	337	void ConversionCost::postvisit(const BasicType * basicType) {
	338	if ( const BasicType * destAsBasic = dynamic_cast< const BasicType * >( dest ) ) {
[fc134a48]	339	conversionCostFromBasicToBasic(basicType, destAsBasic);
	340	} else if ( const EnumInstType * enumInst = dynamic_cast< const EnumInstType * >( dest ) ) {
	341	const EnumDecl * base_enum = enumInst->baseEnum;
[b0d9ff7]	342	if ( const Type * base = base_enum->base ) {
[fc134a48]	343	if ( const BasicType * enumBaseAstBasic = dynamic_cast< const BasicType *> (base) ) {
	344	conversionCostFromBasicToBasic(basicType, enumBaseAstBasic);
	345	} else {
	346	cost = Cost::infinity;
	347	} // if
[f238fcc2]	348	} else {
	349	cost = Cost::unsafe;
	350	} // if
[89e6ffc]	351	} // if
[98278b3a]	352	// no cases for zero_t/one_t because it should not be possible to convert int, etc. to zero_t/one_t.
[a32b204]	353	}
	354
[7870799]	355	void ConversionCost::postvisit( const PointerType * pointerType ) {
[ef5b828]	356	if ( const PointerType * destAsPtr = dynamic_cast< const PointerType * >( dest ) ) {
[6e027d6]	357	PRINT( std::cerr << pointerType << " ===> " << destAsPtr << std::endl; )
[7870799]	358	Type::Qualifiers tq1 = pointerType->base->tq;
	359	Type::Qualifiers tq2 = destAsPtr->base->tq;
[eb0aedb]	360	if ( tq1 <= tq2 && typesCompatibleIgnoreQualifiers( pointerType->base, destAsPtr->base, indexer, env ) ) {
[6e027d6]	361	PRINT( std::cerr << " :: compatible and good qualifiers" << std::endl; )
[cb43451]	362	if ( tq1 == tq2 ) {
	363	// types are the same
	364	cost = Cost::zero;
	365	} else {
	366	// types are the same, except otherPointer has more qualifiers
	367	cost = Cost::safe;
[cdcddfe1]	368	} // if
[b8b075cd]	369	} else {
[b0837e4]	370	int assignResult = ptrsAssignable( pointerType->base, destAsPtr->base, env );
[5ccb10d]	371	PRINT( std::cerr << " :: " << assignResult << std::endl; )
[b8b075cd]	372	if ( assignResult > 0 && tq1 <= tq2 ) {
	373	// xxx - want the case where qualifiers are added to be more expensive than the case where qualifiers are the same. Is 1 safe vs. 2 safe correct?
	374	if ( tq1 == tq2 ) {
	375	cost = Cost::safe;
	376	} else if ( tq1 < tq2 ) {
	377	cost = Cost::safe+Cost::safe;
	378	}
[b0837e4]	379	} else if ( assignResult < 0 ) {
[89be1c68]	380	cost = Cost::unsafe;
[a32b204]	381	} // if
[cb43451]	382	// assignResult == 0 means Cost::Infinity
[a32b204]	383	} // if
[98278b3a]	384	// case case for zero_t because it should not be possible to convert pointers to zero_t.
[a32b204]	385	} // if
	386	}
	387
[7870799]	388	void ConversionCost::postvisit( const ArrayType * ) {}
[2463d0e]	389
[7870799]	390	void ConversionCost::postvisit( const ReferenceType * refType ) {
[2463d0e]	391	// Note: dest can never be a reference, since it would have been caught in an earlier check
[7870799]	392	assert( ! dynamic_cast< const ReferenceType * >( dest ) );
[2463d0e]	393	// convert reference to rvalue: cv T1 & => T2
	394	// recursively compute conversion cost from T1 to T2.
	395	// cv can be safely dropped because of 'implicit dereference' behavior.
[7d01cf44]	396	cost = costFunc( refType->base, dest, srcIsLvalue, indexer, env );
[7870799]	397	if ( refType->base->tq == dest->tq ) {
[cb43451]	398	cost.incReference(); // prefer exact qualifiers
[7870799]	399	} else if ( refType->base->tq < dest->tq ) {
[cb43451]	400	cost.incSafe(); // then gaining qualifiers
	401	} else {
	402	cost.incUnsafe(); // lose qualifiers as last resort
	403	}
[5ccb10d]	404	PRINT( std::cerr << refType << " ==> " << dest << " " << cost << std::endl; )
[2463d0e]	405	}
	406
[7870799]	407	void ConversionCost::postvisit( const FunctionType * ) {}
[a32b204]	408
[fc134a48]	409	void ConversionCost::postvisit( const EnumInstType * enumInst) {
	410	const EnumDecl * enumDecl = enumInst -> baseEnum;
	411	if ( const Type * enumType = enumDecl -> base ) { // if it is a typed enum
	412	cost = costFunc( enumType, dest, srcIsLvalue, indexer, env );
	413	} else {
	414	static Type::Qualifiers q;
	415	static BasicType integer( q, BasicType::SignedInt );
	416	cost = costFunc( &integer, dest, srcIsLvalue, indexer, env ); // safe if dest >= int
	417	} // if
[89be1c68]	418	if ( cost < Cost::unsafe ) {
[fc134a48]	419	cost.incSafe();
[a32b204]	420	} // if
	421	}
	422
[7870799]	423	void ConversionCost::postvisit( const TraitInstType * ) {}
[a32b204]	424
[ef5b828]	425	void ConversionCost::postvisit( const TypeInstType * inst ) {
	426	if ( const EqvClass * eqvClass = env.lookup( inst->name ) ) {
[7d01cf44]	427	cost = costFunc( eqvClass->type, dest, srcIsLvalue, indexer, env );
[ef5b828]	428	} else if ( const TypeInstType * destAsInst = dynamic_cast< const TypeInstType * >( dest ) ) {
[eb0aedb]	429	if ( inst->name == destAsInst->name ) {
[a32b204]	430	cost = Cost::zero;
	431	}
[ef5b828]	432	} else if ( const NamedTypeDecl * namedType = indexer.lookupType( inst->name ) ) {
	433	const TypeDecl * type = dynamic_cast< const TypeDecl * >( namedType );
[a32b204]	434	// all typedefs should be gone by this point
	435	assert( type );
[eb0aedb]	436	if ( type->base ) {
[7d01cf44]	437	cost = costFunc( type->base, dest, srcIsLvalue, indexer, env ) + Cost::safe;
[a32b204]	438	} // if
	439	} // if
	440	}
	441
[7870799]	442	void ConversionCost::postvisit( const TupleType * tupleType ) {
[89be1c68]	443	Cost c = Cost::zero;
[7870799]	444	if ( const TupleType * destAsTuple = dynamic_cast< const TupleType * >( dest ) ) {
[eb0aedb]	445	std::list< Type * >::const_iterator srcIt = tupleType->types.begin();
	446	std::list< Type * >::const_iterator destIt = destAsTuple->types.begin();
	447	while ( srcIt != tupleType->types.end() && destIt != destAsTuple->types.end() ) {
[7d01cf44]	448	Cost newCost = costFunc( * srcIt++, * destIt++, srcIsLvalue, indexer, env );
[a32b204]	449	if ( newCost == Cost::infinity ) {
	450	return;
	451	} // if
	452	c += newCost;
	453	} // while
[eb0aedb]	454	if ( destIt != destAsTuple->types.end() ) {
[a32b204]	455	cost = Cost::infinity;
	456	} else {
	457	cost = c;
	458	} // if
	459	} // if
	460	}
[44b7088]	461
[7870799]	462	void ConversionCost::postvisit( const VarArgsType * ) {
[ef5b828]	463	if ( dynamic_cast< const VarArgsType * >( dest ) ) {
[44b7088]	464	cost = Cost::zero;
	465	}
	466	}
[89e6ffc]	467
[7870799]	468	void ConversionCost::postvisit( const ZeroType * ) {
	469	if ( dynamic_cast< const ZeroType * >( dest ) ) {
[89e6ffc]	470	cost = Cost::zero;
[ef5b828]	471	} else if ( const BasicType * destAsBasic = dynamic_cast< const BasicType * >( dest ) ) {
	472	// copied from visit(BasicType *) for signed int, but +1 for safe conversions
[7870799]	473	int tableResult = costMatrix[ BasicType::SignedInt ][ destAsBasic->kind ];
[89e6ffc]	474	if ( tableResult == -1 ) {
[89be1c68]	475	cost = Cost::unsafe;
[89e6ffc]	476	} else {
[89be1c68]	477	cost = Cost::zero;
	478	cost.incSafe( tableResult + 1 );
[7870799]	479	cost.incSign( signMatrix[ BasicType::SignedInt ][ destAsBasic->kind ] );
[cdcddfe1]	480	} // if
[ef5b828]	481	} else if ( dynamic_cast< const PointerType * >( dest ) ) {
[1c9568f0]	482	cost = Cost::zero;
	483	cost.incSafe( maxIntCost + 2 ); // +1 for zero_t -> int, +1 for disambiguation
[cdcddfe1]	484	} // if
[89e6ffc]	485	}
	486
[7870799]	487	void ConversionCost::postvisit( const OneType * ) {
	488	if ( dynamic_cast< const OneType * >( dest ) ) {
[89e6ffc]	489	cost = Cost::zero;
[7870799]	490	} else if ( const BasicType * destAsBasic = dynamic_cast< const BasicType * >( dest ) ) {
[ef5b828]	491	// copied from visit(BasicType *) for signed int, but +1 for safe conversions
[7870799]	492	int tableResult = costMatrix[ BasicType::SignedInt ][ destAsBasic->kind ];
[89e6ffc]	493	if ( tableResult == -1 ) {
[89be1c68]	494	cost = Cost::unsafe;
[89e6ffc]	495	} else {
[89be1c68]	496	cost = Cost::zero;
	497	cost.incSafe( tableResult + 1 );
[7870799]	498	cost.incSign( signMatrix[ BasicType::SignedInt ][ destAsBasic->kind ] );
[cdcddfe1]	499	} // if
	500	} // if
[89e6ffc]	501	}
[9d5089e]	502
[cf32116]	503	namespace {
	504	# warning For overload resolution between the two versions.
	505	int localPtrsAssignable(const ast::Type * t1, const ast::Type * t2,
	506	const ast::SymbolTable &, const ast::TypeEnvironment & env ) {
	507	return ptrsAssignable( t1, t2, env );
	508	}
	509	Cost localConversionCost(
	510	const ast::Type * src, const ast::Type * dst, bool srcIsLvalue,
	511	const ast::SymbolTable & symtab, const ast::TypeEnvironment & env
	512	) { return conversionCost( src, dst, srcIsLvalue, symtab, env ); }
[fb2bde4]	513	}
	514
	515	Cost conversionCost(
[cf32116]	516	const ast::Type * src, const ast::Type * dst, bool srcIsLvalue,
	517	const ast::SymbolTable & symtab, const ast::TypeEnvironment & env
[fb2bde4]	518	) {
	519	if ( const ast::TypeInstType * inst = dynamic_cast< const ast::TypeInstType * >( dst ) ) {
[3e5dd913]	520	if ( const ast::EqvClass * eqv = env.lookup( *inst ) ) {
[fb2bde4]	521	if ( eqv->bound ) {
[cf32116]	522	return conversionCost(src, eqv->bound, srcIsLvalue, symtab, env );
[fb2bde4]	523	} else {
	524	return Cost::infinity;
	525	}
	526	} else if ( const ast::NamedTypeDecl * named = symtab.lookupType( inst->name ) ) {
	527	const ast::TypeDecl * type = dynamic_cast< const ast::TypeDecl * >( named );
	528	assertf( type, "Unexpected typedef." );
	529	if ( type->base ) {
[cf32116]	530	return conversionCost( src, type->base, srcIsLvalue, symtab, env ) + Cost::safe;
[fb2bde4]	531	}
	532	}
	533	}
[251ce80]	534	if ( typesCompatibleIgnoreQualifiers( src, dst, env ) ) {
[9d5089e]	535	return Cost::zero;
[fb2bde4]	536	} else if ( dynamic_cast< const ast::VoidType * >( dst ) ) {
	537	return Cost::safe;
	538	} else if ( const ast::ReferenceType * refType =
	539	dynamic_cast< const ast::ReferenceType * >( dst ) ) {
[cf32116]	540	return convertToReferenceCost( src, refType, srcIsLvalue, symtab, env, localPtrsAssignable );
[fb2bde4]	541	} else {
[e6b42e7]	542	return ast::Pass<ConversionCost_new>::read( src, dst, srcIsLvalue, symtab, env, localConversionCost );
[fb2bde4]	543	}
	544	}
	545
[cf32116]	546	static Cost convertToReferenceCost( const ast::Type * src, const ast::Type * dst, bool srcIsLvalue,
[0f19f5e5]	547	int diff, const ast::SymbolTable & symtab, const ast::TypeEnvironment & env,
[cf32116]	548	PtrsCalculation func ) {
[fb2bde4]	549	if ( 0 < diff ) {
	550	Cost cost = convertToReferenceCost(
[cf32116]	551	strict_dynamic_cast< const ast::ReferenceType * >( src )->base, dst,
	552	srcIsLvalue, (diff - 1), symtab, env, func );
[fb2bde4]	553	cost.incReference();
	554	return cost;
	555	} else if ( diff < -1 ) {
	556	Cost cost = convertToReferenceCost(
	557	src, strict_dynamic_cast< const ast::ReferenceType * >( dst )->base,
[cf32116]	558	srcIsLvalue, (diff + 1), symtab, env, func );
[fb2bde4]	559	cost.incReference();
	560	return cost;
	561	} else if ( 0 == diff ) {
	562	const ast::ReferenceType * srcAsRef = dynamic_cast< const ast::ReferenceType * >( src );
	563	const ast::ReferenceType * dstAsRef = dynamic_cast< const ast::ReferenceType * >( dst );
	564	if ( srcAsRef && dstAsRef ) {
	565	ast::CV::Qualifiers tq1 = srcAsRef->base->qualifiers;
	566	ast::CV::Qualifiers tq2 = dstAsRef->base->qualifiers;
	567	if ( tq1 <= tq2 && typesCompatibleIgnoreQualifiers(
[251ce80]	568	srcAsRef->base, dstAsRef->base, env ) ) {
[fb2bde4]	569	if ( tq1 == tq2 ) {
	570	return Cost::zero;
	571	} else {
	572	return Cost::safe;
	573	}
	574	} else {
	575	int assignResult = func( srcAsRef->base, dstAsRef->base, symtab, env );
	576	if ( 0 < assignResult ) {
	577	return Cost::safe;
	578	} else if ( assignResult < 0 ) {
	579	return Cost::unsafe;
	580	}
	581	}
	582	} else {
[e6b42e7]	583	return ast::Pass<ConversionCost_new>::read( src, dst, srcIsLvalue, symtab, env, localConversionCost );
[fb2bde4]	584	}
	585	} else {
	586	assert( -1 == diff );
	587	const ast::ReferenceType * dstAsRef = dynamic_cast< const ast::ReferenceType * >( dst );
	588	assert( dstAsRef );
[251ce80]	589	if ( typesCompatibleIgnoreQualifiers( src, dstAsRef->base, env ) ) {
[cf32116]	590	if ( srcIsLvalue ) {
[fb2bde4]	591	if ( src->qualifiers == dstAsRef->base->qualifiers ) {
	592	return Cost::reference;
	593	} else if ( src->qualifiers < dstAsRef->base->qualifiers ) {
	594	return Cost::safe;
	595	} else {
	596	return Cost::unsafe;
	597	}
	598	} else if ( dstAsRef->base->is_const() ) {
	599	return Cost::safe;
	600	} else {
	601	return Cost::unsafe;
	602	}
	603	}
	604	}
	605	return Cost::infinity;
	606	}
	607
	608	Cost convertToReferenceCost( const ast::Type * src, const ast::ReferenceType * dst,
[cf32116]	609	bool srcIsLvalue, const ast::SymbolTable & symtab, const ast::TypeEnvironment & env,
	610	PtrsCalculation func ) {
[fb2bde4]	611	int sdepth = src->referenceDepth(), ddepth = dst->referenceDepth();
[cf32116]	612	return convertToReferenceCost( src, dst, srcIsLvalue, sdepth - ddepth, symtab, env, func );
[fb2bde4]	613	}
	614
	615	void ConversionCost_new::postvisit( const ast::VoidType * voidType ) {
	616	(void)voidType;
	617	cost = Cost::infinity;
	618	}
	619
[fc134a48]	620	void ConversionCost_new::conversionCostFromBasicToBasic( const ast::BasicType * src, const ast::BasicType* dest ) {
	621	int tableResult = costMatrix[ src->kind ][ dest->kind ];
	622	if ( tableResult == -1 ) {
	623	cost = Cost::unsafe;
	624	} else {
	625	cost = Cost::zero;
	626	cost.incSafe( tableResult );
	627	cost.incSign( signMatrix[ src->kind ][ dest->kind ] );
	628	}
	629	}
	630
[fb2bde4]	631	void ConversionCost_new::postvisit( const ast::BasicType * basicType ) {
	632	if ( const ast::BasicType * dstAsBasic = dynamic_cast< const ast::BasicType * >( dst ) ) {
[fc134a48]	633	conversionCostFromBasicToBasic( basicType, dstAsBasic );
	634	} else if ( const ast::EnumInstType * enumInst = dynamic_cast< const ast::EnumInstType * >( dst ) ) {
	635	const ast::EnumDecl * enumDecl = enumInst->base.get();
[b0d9ff7]	636	if ( enumDecl->isTyped && !enumDecl->base.get() ) {
	637	cost = Cost::infinity;
	638	} else if ( const ast::Type * enumType = enumDecl->base.get() ) {
[fc134a48]	639	if ( const ast::BasicType * enumTypeAsBasic = dynamic_cast<const ast::BasicType *>(enumType) ) {
	640	conversionCostFromBasicToBasic( basicType, enumTypeAsBasic );
	641	} else {
	642	cost = Cost::infinity;
	643	}
[fb2bde4]	644	} else {
[fc134a48]	645	cost = Cost::unsafe;
[fb2bde4]	646	}
	647	}
	648	}
	649
	650	void ConversionCost_new::postvisit( const ast::PointerType * pointerType ) {
	651	if ( const ast::PointerType * dstAsPtr = dynamic_cast< const ast::PointerType * >( dst ) ) {
	652	ast::CV::Qualifiers tq1 = pointerType->base->qualifiers;
	653	ast::CV::Qualifiers tq2 = dstAsPtr->base->qualifiers;
	654	if ( tq1 <= tq2 && typesCompatibleIgnoreQualifiers(
[251ce80]	655	pointerType->base, dstAsPtr->base, env ) ) {
[fb2bde4]	656	if ( tq1 == tq2 ) {
	657	cost = Cost::zero;
	658	} else {
	659	cost = Cost::safe;
	660	}
[ef1da0e2]	661	}
	662	/*
	663	else if ( const ast::FunctionType * dstFunc = dstAsPtr->base.as<ast::FunctionType>()) {
	664	if (const ast::FunctionType * srcFunc = pointerType->base.as<ast::FunctionType>()) {
	665	if (dstFunc->params.empty() && dstFunc->isVarArgs ) {
	666	cost = Cost::unsafe; // assign any function to variadic fptr
	667	}
	668	}
	669	else {
	670	ast::AssertionSet need, have; // unused
	671	ast::OpenVarSet open;
	672	env.extractOpenVars(open);
	673	ast::TypeEnvironment tenv = env;
	674	if ( unify(dstAsPtr->base, pointerType->base, tenv, need, have, open, symtab) ) {
	675	cost = Cost::safe;
	676	}
	677	}
	678	// else infinity
	679	}
	680	*/
	681	else {
[fb2bde4]	682	int assignResult = ptrsAssignable( pointerType->base, dstAsPtr->base, env );
	683	if ( 0 < assignResult && tq1 <= tq2 ) {
	684	if ( tq1 == tq2 ) {
	685	cost = Cost::safe;
	686	} else {
	687	cost = Cost::safe + Cost::safe;
	688	}
	689	} else if ( assignResult < 0 ) {
	690	cost = Cost::unsafe;
	691	} // else Cost::infinity
	692	}
	693	}
	694	}
	695
	696	void ConversionCost_new::postvisit( const ast::ArrayType * arrayType ) {
	697	(void)arrayType;
	698	}
	699
	700	void ConversionCost_new::postvisit( const ast::ReferenceType * refType ) {
	701	assert( nullptr == dynamic_cast< const ast::ReferenceType * >( dst ) );
	702
[cf32116]	703	cost = costCalc( refType->base, dst, srcIsLvalue, symtab, env );
[46da46b]	704
	705	// xxx - should qualifiers be considered in pass-by-value?
	706	/*
[fb2bde4]	707	if ( refType->base->qualifiers == dst->qualifiers ) {
	708	cost.incReference();
	709	} else if ( refType->base->qualifiers < dst->qualifiers ) {
	710	cost.incSafe();
	711	} else {
	712	cost.incUnsafe();
	713	}
[46da46b]	714	*/
	715	cost.incReference();
[fb2bde4]	716	}
	717
	718	void ConversionCost_new::postvisit( const ast::FunctionType * functionType ) {
	719	(void)functionType;
	720	}
	721
	722	void ConversionCost_new::postvisit( const ast::EnumInstType * enumInstType ) {
[fc134a48]	723	const ast::EnumDecl * baseEnum = enumInstType->base;
	724	if ( const ast::Type * baseType = baseEnum->base ) {
[b0d9ff7]	725	costCalc( baseType, dst, srcIsLvalue, symtab, env );
[fc134a48]	726	} else {
	727	static ast::ptr<ast::BasicType> integer = { new ast::BasicType( ast::BasicType::SignedInt ) };
	728	cost = costCalc( integer, dst, srcIsLvalue, symtab, env );
	729	}
[fb2bde4]	730	if ( cost < Cost::unsafe ) {
	731	cost.incSafe();
	732	}
	733	}
	734
	735	void ConversionCost_new::postvisit( const ast::TraitInstType * traitInstType ) {
	736	(void)traitInstType;
	737	}
	738
	739	void ConversionCost_new::postvisit( const ast::TypeInstType * typeInstType ) {
[3e5dd913]	740	if ( const ast::EqvClass * eqv = env.lookup( *typeInstType ) ) {
[cf32116]	741	cost = costCalc( eqv->bound, dst, srcIsLvalue, symtab, env );
[fb2bde4]	742	} else if ( const ast::TypeInstType * dstAsInst =
	743	dynamic_cast< const ast::TypeInstType * >( dst ) ) {
[3e5dd913]	744	if ( typeInstType == dstAsInst ) {
[fb2bde4]	745	cost = Cost::zero;
	746	}
	747	} else if ( const ast::NamedTypeDecl * namedType = symtab.lookupType( typeInstType->name ) ) {
	748	const ast::TypeDecl * type = dynamic_cast< const ast::TypeDecl * >( namedType );
	749	assertf( type, "Unexpected typedef.");
	750	if ( type->base ) {
[cf32116]	751	cost = costCalc( type->base, dst, srcIsLvalue, symtab, env ) + Cost::safe;
[fb2bde4]	752	}
	753	}
	754	}
	755
	756	void ConversionCost_new::postvisit( const ast::TupleType * tupleType ) {
	757	Cost c = Cost::zero;
	758	if ( const ast::TupleType * dstAsTuple = dynamic_cast< const ast::TupleType * >( dst ) ) {
	759	auto srcIt = tupleType->types.begin();
	760	auto dstIt = dstAsTuple->types.begin();
	761	auto srcEnd = tupleType->types.end();
	762	auto dstEnd = dstAsTuple->types.end();
	763	while ( srcIt != srcEnd && dstIt != dstEnd ) {
[cf32116]	764	Cost newCost = costCalc( * srcIt++, * dstIt++, srcIsLvalue, symtab, env );
[fb2bde4]	765	if ( newCost == Cost::infinity ) {
	766	return;
	767	}
	768	c += newCost;
	769	}
	770	if ( dstIt != dstEnd ) {
	771	cost = Cost::infinity;
	772	} else {
	773	cost = c;
	774	}
	775	}
	776	}
	777
	778	void ConversionCost_new::postvisit( const ast::VarArgsType * varArgsType ) {
	779	(void)varArgsType;
	780	if ( dynamic_cast< const ast::VarArgsType * >( dst ) ) {
	781	cost = Cost::zero;
	782	}
	783	}
	784
	785	void ConversionCost_new::postvisit( const ast::ZeroType * zeroType ) {
	786	(void)zeroType;
	787	if ( dynamic_cast< const ast::ZeroType * >( dst ) ) {
	788	cost = Cost::zero;
	789	} else if ( const ast::BasicType * dstAsBasic =
	790	dynamic_cast< const ast::BasicType * >( dst ) ) {
	791	int tableResult = costMatrix[ ast::BasicType::SignedInt ][ dstAsBasic->kind ];
	792	if ( -1 == tableResult ) {
	793	cost = Cost::unsafe;
	794	} else {
	795	cost = Cost::zero;
	796	cost.incSafe( tableResult + 1 );
	797	cost.incSign( signMatrix[ ast::BasicType::SignedInt ][ dstAsBasic->kind ] );
	798	}
[46da46b]	799	// this has the effect of letting any expr such as x+0, x+1 to be typed
	800	// the same as x, instead of at least int. are we willing to sacrifice this little
	801	// bit of coherence with C?
	802	// TODO: currently this does not work when no zero/one overloads exist. Find a fix for it.
	803	// cost = Cost::zero;
[2f98fb2]	804	} else if ( dynamic_cast< const ast::PointerType * >( dst ) ) {
	805	cost = Cost::zero;
	806	// +1 for zero_t ->, +1 for disambiguation
	807	cost.incSafe( maxIntCost + 2 );
[46da46b]	808	// assuming 0p is supposed to be used for pointers?
[fb2bde4]	809	}
	810	}
	811
	812	void ConversionCost_new::postvisit( const ast::OneType * oneType ) {
	813	(void)oneType;
	814	if ( dynamic_cast< const ast::OneType * >( dst ) ) {
	815	cost = Cost::zero;
	816	} else if ( const ast::BasicType * dstAsBasic =
[46da46b]	817	dynamic_cast< const ast::BasicType * >( dst ) ) {
[fb2bde4]	818	int tableResult = costMatrix[ ast::BasicType::SignedInt ][ dstAsBasic->kind ];
	819	if ( -1 == tableResult ) {
	820	cost = Cost::unsafe;
	821	} else {
	822	cost = Cost::zero;
	823	cost.incSafe( tableResult + 1 );
	824	cost.incSign( signMatrix[ ast::BasicType::SignedInt ][ dstAsBasic->kind ] );
	825	}
[46da46b]	826
	827	// cost = Cost::zero;
[9d5089e]	828	}
[fb2bde4]	829	}
[0d070ca]	830	// size_t ConversionCost_new::traceId = Stats::Heap::new_stacktrace_id("ConversionCost");
[fb2bde4]	831
[51b7345]	832	} // namespace ResolvExpr
[a32b204]	833
	834	// Local Variables: //
	835	// tab-width: 4 //
	836	// mode: c++ //
	837	// compile-command: "make install" //
	838	// End: //

Note: See TracBrowser for help on using the repository browser.

Download in other formats: