Lines Matching refs:dynamic_type

567 // (dynamic_ptr, dynamic_type) are the run time type of the complete object
572 // (dynamic_ptr, dynamic_type) is the root of a DAG that grows upward. Each
586 // There is at least one path from the root (dynamic_ptr, dynamic_type) to
592 // there is only one node with dynamic_type. And if dynamic_type == dst_type,
601 // dynamic_type != static_type: The compiler computes the dynamic_cast in this case too.
608 // (dynamic_ptr, dynamic_type) to (static_ptr, static_type) and a public
609 // path from (dynamic_ptr, dynamic_type) to the one dst_type, then return
612 // if there is a public path from (dynamic_ptr, dynamic_type) to
613 // (static_ptr, static_type) and a public path from (dynamic_ptr, dynamic_type)
617 // If dynamic_type == dst_type, then the above algorithm collapses to the
620 // If there is a public path from (dynamic_ptr, dynamic_type) to
631 // Get (dynamic_ptr, dynamic_type) from static_ptr
635 const __class_type_info* dynamic_type = static_cast<const __class_type_info*>(vtable[-1]);
645 if (is_equal(dynamic_type, dst_type, false))
650 dynamic_type->search_above_dst(&info, dynamic_ptr, dynamic_ptr, public_path, false);
660 ", %s.\n", static_type->name(), dynamic_type->name());
664 dynamic_type->search_above_dst(&info, dynamic_ptr, dynamic_ptr, public_path, true);
674 dynamic_type->search_below_dst(&info, dynamic_ptr, public_path, false);
683 " %s, %s, %s.\n", static_type->name(), dynamic_type->name(),
687 dynamic_type->search_below_dst(&info, dynamic_ptr, public_path, true);
775 // Record the path (public or not) from (dynamic_ptr, dynamic_type) to here. There may be
776 // multiple paths from (dynamic_ptr, dynamic_type) to here, record the "most public" one.
784 // Record the most public path from (dynamic_ptr, dynamic_type) to
930 // (dynamic_ptr, dynamic_type) to dst_type is now ambiguous,
1068 // (dynamic_ptr, dynamic_type) to dst_type is now ambiguous.
1126 // (dynamic_ptr, dynamic_type) to dst_type is now ambiguous.