I can rewrite this function with parameters which transfer by link.
void GetSomeIDs( int* &val )
{
	…
   	if ( !val )
      	   val = new int[8];
…
}
example of run this function
int *pVal  = NULL;
GetSomeIDs( pVal );
After started this function pVal will contain new address(pointer to new memory vector). You should free memory in the end of use.

Maybe I don’t understood questions but my mind code below can realize functionality  described in your question

typedef struct {
   char* alias;   /* '\0'-terminated C string */
   int   specific_id;
   } aliasID;

int *array = NULL;

/* How many structures should be pointed to by the array
 */
int GetNumberOfAliases(void)
{
   if ( array ) {
      int i = 0;
      while ( array [i++] != 0 );
      return i;
   }
   return -1;
}
//---------------------------------------------------------------------------
/* Get a pointer to the next structure.  The structure itself
 * will be filled with data.
 * Caller is responsible for the cleanup of the returned structure
 *     and its content. The latter are allocated in
 *     dynamic memory.
 */
//---------------------------------------------------------------------------
aliasID * GetNextAlias(void)
{
   aliasID *paliasID = (aliasID *)malloc (sizeof(aliasID));
   if ( array ) {
      int vCnt = GetNumberOfAliases();
      array = (int *)realloc ( array, (vCnt + 1) * sizeof(int) );
      if (array) {
         array[ vCnt - 1 ] = (int) paliasID;
         array[ vCnt ] = 0;
      } else {
          free( (aliasID *) paliasID );
          return NULL;
      }

   }
   else {
      array = (int *)malloc ( sizeof (int) * 2 );
      if ( array ) {
         array[0] = (int) paliasID;
         array[1] = 0;
      } else {
         free( (aliasID *) paliasID );
         return NULL;
      }
   }
   return paliasID;
}
//---------------------------------------------------------------------------
int* GetSomeIDs(int arrSize, int &vSize )
{
   for (int i = 0; i < arrSize; i++ ) {
      aliasID * val = GetNextAlias();
      if ( val ) {
         val->alias = new char [10];
         sprintf(val->alias, "val%d\0", i);
         val->specific_id = i;
      } else
         printf("Error memory allocate");
   }
   vSize = GetNumberOfAliases() - 1;
   return array;
}void main ()
{
   int vSize = 0;
   int *val = GetSomeIDs( 8, vSize );
   if ( vSize == 8)
      printf ("all is good");
}

void FreeArray()
{
   int vSize = 0, i = 0;
   int *val = GetSomeIDs( 2, vSize );
   char specific_id_buf[11] = {'\0'};

   while ( val[i] != 0 ) {
      printf( ((aliasID * )val[i])->alias );
      free (((aliasID * )val[i])->alias);
      ((aliasID * )val[i])->alias = NULL;
      memset(specific_id_buf, '\0', 11);
      sprintf( specific_id_buf, "specific_id = %d", ((aliasID * )val[i])->specific_id );
      aliasID *pVal = (aliasID * )val[i];
      free( pVal );
      val[i++] = 0;
   }
   free ((int *) val);
   val = NULL;
}

typedef void (*anyfunc)( int &val );

void UserFunc ( int &val ){ val++; }

void RecalcArray(int *val, anyfunc func )
{
   int i = 0;
   while ( val[i] != 0 ) {
      func (val[i++]);
   }
}

void main()
{
   int val[10] = {1,2,3,4,6,7,8,9,0};
   RecalcArray (val, UserFunc);
}

ListID* AddToList ( ListID *pList, int arr_val )
{
   if ( pList ) {
      ListID *cList = new ListID;
      cList->arr_id = arr_val;
      cList->prevVal = pList;
      cList->nextVal = NULL;
      pList->nextVal = cList;
      return cList;
   } else {
      pList = new ListID;
      pList->arr_id = arr_val;
      pList->prevVal = NULL;
      pList->nextVal = NULL;
      return pList;
   }
}
ListID* ConvertArrayToList( int *array )
{
   int i = 0;
   ListID* lHead = NULL;
   while ( array[i] != 0 )
      lHead = AddToList ( lHead, array[i++] );
   return lHead;
}
void main ()
{
   int val[10] = {1,2,3,4,5,6,7,8,9,0};
   ListID *lPointer = ConvertArrayToList( val ); // return pointer on last list item
}

val = new int[8];
aliasID *paliasID = (aliasID *)malloc (sizeof(aliasID));
printf ("all is good");
void main()
free( (aliasID *) paliasID );

         val->alias = new char [10];  //int_max = 2 147 483 647
         sprintf(val->alias, "val%d\0", i);

val = new int[8];
aliasID *paliasID = (aliasID *)malloc (sizeof(aliasID));
printf ("all is good");
void main()
free( (aliasID *) paliasID );

         val->alias = new char [10];  //int_max = 2 147 483 647
         sprintf(val->alias, "val%d\0", i);