C / C++ / MFC

CString CMainFrame::OnCompareAddress(CMySocket* pSocket)
{
	CString strAddress,strListAddress, strDns, strName;
	unsigned int iPort;
	
	pSocket->GetPeerName(strAddress, iPort);

	int iCount = m_array.GetSize();
	while(iCount > 0)
	{	
		ProcessMessages();

		sfriend pFriend; // Structure in my array
		pFriend = m_array.GetAt(iCount-1);
		CString strDns = pFriend.strDns;

		// Resolve the host name "DNS" name to a IP Address
		hostent *pHost = gethostbyname(strDns);
		if ( pHost != 0 )
		{
			// Copy the IP address into sockaddr_in structure
			// There is only one hostent structure per thread, so we need to copy it before we call the function
			// again.
			sockaddr_in addr;
			memset( &addr, 0, sizeof(addr) );
			addr.sin_family = AF_INET;
			memcpy( &addr.sin_addr, pHost->h_addr, pHost->h_length );
			
			strListAddress = inet_ntoa(addr.sin_addr);
		}
		else
			iCount = 0;

		// If the IP Addresses match, return the host name from our array;
		if(!strAddress.CompareNoCase(strListAddress))
		{
			strName = strDns;
			iCount = 0;
		}
		else
			iCount --;
	}

	if(!strName.IsEmpty())	// not empty, send DNS name..
		return strName;
	else					// Empty, send the ip address of the socket..
		return strAddress;
}

void CMainFrame::OnAccept()
{
	CMySocket* pSocket = new CMySocket();
	pSocket->SetParent(this);

	if (!m_sListen.Accept(*pSocket))
		delete pSocket;
	else
	{
		// Socket was Accepted successfully..

		// Put the pointer at the tail of our pointer list..
		m_pConnectionList.AddTail(pSocket);
		
		// Get the DNS name of the socket..
		CString strName = OnCompareAddress(pSocket); // If I make strName = DNS or IP address it works.. WEIRD

		int nFound = 0;
		
		int iCount = m_array.GetSize();
		while(iCount > 0)
		{
			sfriend pFriend;
			pFriend = m_array.GetAt(iCount-1);
			CString strDns = pFriend.strDns;
					
			if(!strDns.CompareNoCase(strName))	// We have a match
			{
				nFound = 1;
				iCount = 0;
			}
			else								// No match try again
				iCount --;
		}

		if(nFound = 0 /* Not Found */)
		{
			CString strMessage;
			strMessage = "(NOT_IN_LIST): ";
								
			int iLen = strMessage.GetLength();
			pSocket->Send((LPCSTR)strMessage,iLen);

			OnCloseConnection(pSocket);
		}
		else // We found the friend, lets send them our status..
			OnSendMyStatus(pSocket);
	}
}

<br />
	const double LOOP_MAX = 999;<br />
	LARGE_INTEGER tCS,tCE;<br />
	double Ang = 0,Res;<br />
<br />
	QueryPerformanceCounter(&tCS);<br />
	<br />
	while (Ang++ < LOOP_MAX)<br />
		CMObj::Function(Ang, Res);<br />
<br />
	QueryPerformanceCounter(&tCE);<br />
<br />
	tCS.QuadPart = tCE.QuadPart- tCS.QuadPart;<br />
	QueryPerformanceFrequency(&tCE);<br />
<br />
	double t = (double)tCS.QuadPart / tCE.QuadPart;<br />
<br />
	double ps = LOOP_MAX / t;<br />

#include<iostream.h><br />
class Queue<br />
{<br />
private:<br />
  int *input;<br />
  int Array_Size;<br />
  int first;//memory location<br />
  int last;//memory location<br />
public:<br />
  Queue(int);<br />
  ~Queue();<br />
  void push(int);<br />
  int pop();<br />
  void show();<br />
};<br />
<br />
Queue::Queue(int data)<br />
{<br />
  Array_Size=data + 1;<br />
  // Allocates the proper amount + 1 for error checking<br />
  input = new int[Array_Size];<br />
  first=Array_Size;<br />
  last=0;<br />
}<br />
<br />
Queue::~Queue()<br />
{<br />
  delete input; // Clean up<br />
}<br />
//Entering students in the queue<br />
void Queue::push(int info)<br />
{<br />
  if ( first == last + 1 ) <br />
  {<br />
    cout<<"Queue is full\n";<br />
    return;<br />
  }<br />
<br />
  input[last++] = info; // Insert<br />
  last %= Array_Size; // Wrap the queue<br />
}<br />
//Viewing of students seen or error message<br />
int Queue::pop()<br />
{<br />
  if ( first % Array_Size == last ) <br />
  {<br />
    cout<<"\n\nNo students waiting in the queue\n";<br />
    return -1;<br />
  }<br />
<br />
  first %= Array_Size; // Wrap the queue<br />
  return input[first++]; // Remove<br />
}<br />
<br />
//Allows the viewing of the queue or returns to main menu if none to show<br />
void Queue::show()<br />
{<br />
	 int it = first;<br />
   while  ( it != last )<br />
  {<br />
    it %= Array_Size;<br />
    cout<<"|"; cout<<input[it++]; cout<<"| ";<br />
  }<br />
<br />
}<br />
<br />
int menu()<br />
{<br />
  //Main menu view as a switch<br />
	int choice = 0;<br />
  cout<<"\n\n\t\t**MAIN MENU**";<br />
  cout<<"\n\n\t1\tStudent number to join the queue";<br />
  cout<<"\n\t2\tStudent seen (Remove from queue)";<br />
  cout<<"\n\t3\tView the students in the queue";<br />
  cout<<"\n\t4\tEXIT";<br />
  cout<<"\n\n\tPlease enter your choice : ";<br />
  cin>>choice;<br />
  return choice;<br />
}<br />
<br />
int main()<br />
{<br />
  int StudentID = 0; //initalise to 0 allowing error checking in menu option 3<br />
  int qsize;<br />
  int option;<br />
  int set=0;<br />
  <br />
  cout<<"\n\tPlease enter the length of the Queue : ";<br />
  cin>>qsize;<br />
  set = qsize;<br />
  //error checking for invalid queue size<br />
  while (qsize<1 ||qsize>15)<br />
  {	<br />
	cout<<"\nNot a valid queue size, must be between 1 and 15";<br />
	cout<<"\nTry again: ";<br />
	cin>>qsize;<br />
  }<br />
  Queue q(qsize);<br />
  do<br />
  {<br />
    option = menu();<br />
    switch(option)<br />
    {<br />
    case 1:<br />
		//error checking for invalid StudentID input<br />
	  cout<<"\n\t* * Valid student numbers between 1 and 500 only * *\n";<br />
      cout<<"\nEnter the student number : ";<br />
      cin>>StudentID;<br />
      while  (StudentID < 1 || StudentID > 500)<br />
      {<br />
        cout<<"Invalid entry try again: ";<br />
        cin>>StudentID;<br />
      }<br />
	  //Storing the StudentID in a location and output to screen<br />
	  q.push(StudentID);<br />
      cout<<"\nStudent "<<StudentID<<" has been inserted into queue.";<br />
      break;<br />
    case 2:<br />
		/*Error checking for deleting student if not = to -1 then delete<br />
		 show error message from the pop*/<br />
      if ( ( StudentID = q.pop() ) != -1 )<br />
		  cout<<"\nStudent "<<StudentID<<" has been deleted from the queue.";<br />
	   break;<br />
    case 3:<br />
		/*Error checking if no students entered at all<br />
		the if -1 allows for if option 2 is pressed first<br />
		as StudentID is set to this at that stage*/<br />
		if (StudentID==0||StudentID==-1)<br />
		{<br />
			cout<<"\nNo students entered yet!";<br />
			break;<br />
		}<br />
<br />
			//Show the queue if StudentID stored<br />
			//Return to menu if no StudentID's stored<br />
      q.show();<br />
      break;<br />
    case 4:<br />
		//Exit mode<br />
		cout<<"\n** GOODBYE **\n";<br />
      break;<br />
    default://message if input not valid by use of while command below<br />
      cout<<"\nIncorrect entry, try again with 1,2,3 or 4.";<br />
    }<br />
  }<br />
  while (option!=4);<br />
}

sock.sin_family      = PF_INET;<br />
sock.sin_addr.s_addr = htonl(INADDR_ANY);<br />
sock.sin_port        = htons((u_short)0);<br />
     <br />
if (bind(*lpSock,(LPSOCKADDR)&sock,sizeof(sock)) != SOCKET_ERROR)<br />
    nRet = ENOERROR;