IBM Z Software
Hide about this portal


This portal is to open public enhancement requests against IBM Z Software products. To view all of your ideas submitted to IBM, create and manage groups of Ideas, or create an idea explicitly set to be either visible by all (public) or visible only to you and IBM (private), use the IBM Unified Ideas Portal (https://ideas.ibm.com).


Shape the future of IBM!

We invite you to shape the future of IBM, including product roadmaps, by submitting ideas that matter to you the most. Here's how it works:

Search existing ideas

Start by searching and reviewing ideas and requests to enhance a product or service. Take a look at ideas others have posted, and add a comment, vote, or subscribe to updates on them if they matter to you. If you can't find what you are looking for,

Post your ideas

  1. Post an idea.

  2. Get feedback from the IBM team and other customers to refine your idea.

  3. Follow the idea through the IBM Ideas process.


Specific links you will want to bookmark for future use

Welcome to the IBM Ideas Portal (https://www.ibm.com/ideas) - Use this site to find out additional information and details about the IBM Ideas process and statuses.

IBM Unified Ideas Portal (https://ideas.ibm.com) - Use this site to view all of your ideas, create new ideas for any IBM product, or search for ideas across all of IBM.

ideasibm@us.ibm.com - Use this email to suggest enhancements to the Ideas process or request help from IBM for submitting your Ideas.

Add a new idea Subscribe
Status Planned for future release
Workspace C/C++ and Fortran Compilers
Categories Fortran
Created by Guest
Created on Jul 18, 2019

RELATED IDEAS

XLF: Support for Fortran 2008 feature move_alloc

See this idea on ideas.ibm.com

The feature is described in section "5.3 Allocatable components of recursive type" from the Fortran 2008 summary document available at https://wg5-fortran.org/N1801-N1850/N1828.pdf and appended here:

A recursive type is permitted to be based on allocatable components. Here is a simple example
of a type that holds a stack

type entry
real :: value
integer :: index
type(entry), allocatable :: next
end type entry

Here is how to add a new entry at the top of the stack:

type (entry), allocatable :: top
top = entry ( new_value, new_index, top )

Alternative code is as follows:

type (entry), allocatable :: top, temp
temp = entry ( new_value, new_index, temp )
call move_alloc(top,temp%next)
call move_alloc(temp,top)

which avoids the possiblity of a deep copy being made into a temporary variable followed by
another deep copy from it. It is reasonable to expect the compiler, when presented with the
first version to perform the equivalent of the second, but it cannot be guaranteed. Similar
considerations apply to the removal of the top entry by the code

top = top%entry

or

call move_alloc(top%next,temp)
call move_alloc(temp,top)

The usual efficiencies associated with allocatables are available: contiguous arrays, no aliasing
(unless given the target attribute), and no memory leaks.

Idea priority High
  • Guest
    Reply
    |     Aug 23, 2019

    This RFE has been implemented.

By clicking the "Post Comment" or "Submit Idea" button, you are agreeing to the IBM Ideas Portal Terms of Use.
Do not place IBM confidential, company confidential, or personal information into any field.