C / C++ / MFC

void sortarray(char str[],char * final)
{
	int i = 1,j, extra = 0;
	char * letters, *lerrptr;
	int * count, * cerrptr;
	int size = 0, flag = 0;

	// allocate memory for one array storing letter and one for storing it's appearance
	letters = (char *) malloc(sizeof(char) * 1);
	if(letters == NULL) exit(1);
	count = (int *) malloc(sizeof(int) * 1);
	if(count == NULL) exit(1);

	// fill the first letter to array
	letters[0] = str[0];
	count[0] = 1;
	size++;

	// scan the whole string
	while(str[i] != 0)
	{
		// initiate flag for new run
		flag = 0;

		for(j = 0 ; j < size ; j++)
		{
			// if the letter already appeared before just increment the count and raise the flag that no new allocating is necessary
			if(str[i] == letters[j]) 
			{
				count[j]++;
				flag = 1;
			}
		}	
		// if the flag of already appeared hasn't been raised make new allocation for new letter
		if(!flag)
		{
			flag = 0 ;
			size++;
			lerrptr = letters;
			letters = (char *) realloc(letters,sizeof(char) * size);
			if(letters == NULL)
			{
				free(lerrptr);
				free(count);
				exit(1);
			}
			cerrptr = count;
			count = (int *) realloc(count,sizeof(int) * size);
			if(letters == NULL)
			{
				free(cerrptr);
				free(letters);
				exit(1);
			}
			// insert new letter and 1 for the count
			letters[size-1] = str[i] ;
			count[size-1] = 1 ;
				
		}

		i++;
	}
		
	// bubble sort the letters 
	for(i = 0 ; i < size - 1; i++)
	{
		for(j = 0 ; j < size - 1 - i ; j++)
		{
			if(letters[j] < letters[j - 1])
			{
				letters[j] ^= letters[j+1];
				letters[j+1] ^= letters[j];
				letters[j] ^= letters[j+1];
				count[j] ^= count[j+1];
				count[j+1] ^= count[j];
				count[j] ^= count[j+1];
			}
		}
	}
	
	// check for more 9 appearances to reserve more letters for one more digit
	for(i = 0 ; i < size ; i++) if(count[i] > 9) extra++;

	// allocate the memory for the final array that is going to be printed
	final = (char *) malloc(sizeof(char) * (size * 4) + extra + 1);
	
	j = 0;
	for(i = 0 ; i < size ; i++)
	{
		// insert the letter
		final[i*4 + j] = letters[i];
		// insert space
		final[i*4 + 1 + j] = ' ';

		// if more then one digit used for the count of appearances
		if(count[i] > 9)
		{
			// first digit
			final[i*4 + 2 + j] = count[i]/10 + 48;
			j++;
			// second
			final[i*4 + 2 + j] = count[i]%10 + 48 ;
		}
		else final[i*4 + 2 + j] = count[i]  + 48;
		
		// print ; 
		final[i*4 + 3 + j] = ';';
	}

	// add terminating character
	final[i*4 + j] = 0;
	// print the result
	printf(" %s ", final);
}

MT4_EXPFUNC void _stdcall updateBuffer( history * history, double * buffer, int Bars, int IndicatorCounted, int ma_period )
{       
	for( int ii = 0; ii < Bars; ii++ )
	{	
	buffer[0] = history[ii].close;	
	}
}

#import "test.dll"
void    updateBuffer( double& history[][6], double& buffer[], int bars, int indicator_counted, int ma_period );
#import

// Import and declare the DLL, with its parameters defined
#import "test.dll"
// history and buffer are passed by reference, this means the dll will receive pointers to the arrays
void    updateBuffer( double& history[][6], double& buffer[], int bars, int indicator_counted, int period );
#import

int start(){ 
   updateBuffer(history, buffer, Bars, IndicatorCounted(), ma_period);
}

struct MyOverlapped
{
    OVERLAPPED Overlp;
    // my data goes below
};

GetQueuedCompletionStatus

PostQueuedCompletionStatus(..., (ULONG_PTR)myOver, ...);

MyOverlapped * myOver = NULL;
GetQueuedCompletionStatus(..., (PULONG_PTR)&myOver, ...);

PostQueuedCompletionStatus(..., (ULONG_PTR)0, &myOver->Overlp);

MyOverlapped * myOver = NULL;
ULONG_PTR Data;
LPWSAOVERLAPPED Overlapped = NULL;
GetQueuedCompletionStatus(..., (PULONG_PTR)&Data, (LPOVERLAPPED *)&Overlapped);
myOver = (MyOverlapped *)Overlapped;