Windows 7 environment, written in vs2013 global keyboard hook, encapsulated in a DLL, to write a program to load the DLL, the program runs within about 1 min zhong, hooks are effective,

Hook is losing control, and is not effective, what is the problem?


I'm in the proc function of keyboard hook (DLL) callback of the function of the application, print the string in the function,


See the problem before someone touching the processing time is hook, I this hook processing speed quickly, there is no timeout situation, I hope you can give me analysis analysis,

CodePudding user response:

Could be the DLL design, leading to a timeout or other active

Don't try to hook in any operation directly CallNextHookEx parameter passing down, see if it will collapse,

CodePudding user response:

One way to check whether resource leaks:
In the process of the task manager to see inside the column selection: memory, virtual memory size, handle number, number of threads, the USER object, GDI objects
Make your program (process) don't quit, cycle through main process many times, the more the better, like 1000000 times or even an infinite loop, record the above numerical, it through at least one hour, as long as possible, such as a month, to record more than the value, if the above two groups of numerical differential is bigger or increasing over time, will certainly have a corresponding resources resource leaks!

Search "GDI leak detection"

CodePudding user response:

Collapse will surely not, said as to the second floor of the GDI leaks, carefully checked the code, and use tools, 1 min around the clock, memory can indeed reduce,

CodePudding user response:

Sometimes not to "call a function name + each parameter value, after entering the function of each parameter values, intermediate variable values, exit the function return value of preparation, return to the function to call after the function value of the parameter name + + return value" this information to write logs to a file is where no matter how to also can not find the problem, including capture all kinds of abnormal, writing log to the screen and single step or set a breakpoint or generating core or DMP file,... These methods are not! Write logs to a file reference below:

//loop to a function sends a length of 200 bytes (this is the fixed) buffer, 
//a function need to incoming buffer, the circulation of 240 bytes (fixed) new buffer for processing, 
//when dealing with each new printing takes two bytes of the buffer 
# ifdef _MSC_VER 
# pragma warning (4996) disable: 
# endif 
#include  
#include  
#include  
# ifdef _MSC_VER 
#include  
#include  
#include  
# define MYVOID void 
# define vsnprintf _vsnprintf 
# the else 
#include  
#include  
#include  
# define CRITICAL_SECTION pthread_mutex_t 
# define MYVOID void * 
# endif 
//the Log {
# define MAXLOGSIZE 20000000 
# define MAXLINSIZE 16000 
#include  
#include  
#include  
Char logfilename1 []="MyLog1. Log"; 
Char logfilename2 []="MyLog2. Log"; 
The static char logstr [MAXLINSIZE + 1]; 
Char datestr [16]. 
Char timestr [16]. 
Char MSS [4]. 
CRITICAL_SECTION cs_log; 
The FILE * flog; 
# ifdef _MSC_VER 
The Lock (CRITICAL_SECTION void * l) {
The EnterCriticalSection (l); 
} 
Void Unlock (CRITICAL_SECTION * l) {
LeaveCriticalSection (l); 
} 
Void sleep_ms (int) ms {
Sleep (ms). 
} 
# the else 
The Lock (CRITICAL_SECTION void * l) {
Pthread_mutex_lock (l); 
} 
Void Unlock (CRITICAL_SECTION * l) {
Pthread_mutex_unlock (l); 
} 
Void sleep_ms (int) ms {
Usleep (ms * 1000); 
} 
# endif 
Void LogV (const char * pszFmt, va_list argp) {
* struct tm now; 
Struct timeb TB; 

If (NULL==pszFmt | | 0==pszFmt [0]) return; 
Vsnprintf (logstr, MAXLINSIZE pszFmt, argp); 
Ftime (& amp; TB); 
Now=localtime (& amp; TB. Time); 
Sprintf (datestr, "% d % % 4 d - 02-02 d", now - & gt; Tm_year + 1900, now - & gt; Tm_mon + 1, now - & gt; Tm_mday); 
Sprintf (timestr, "02 02 02 % d: % d: % d", now - & gt; Tm_hour, now - & gt; Tm_min, now - & gt; Tm_sec); 
Sprintf (MSS, "% 3 d", TB. Millitm); 
Printf (" % s % s. % s % s ", datestr, timestr, MSS, logstr); 
Flog=fopen (logfilename1, "a"); 
If (NULL! Flog)={
Fprintf (flog, "% s % s. % s % s", datestr, timestr, MSS, logstr); 
If (ftell (flog) & gt; MAXLOGSIZE) {
The fclose (flog); 
If (rename (logfilename1 logfilename2)) {
Remove (logfilename2); 
Rename (logfilename1 logfilename2); 
} 
} else {
The fclose (flog); 
} 
} 
} 
Void the Log (const char * pszFmt,... ) {
Va_list argp; 

The Lock (& amp; Cs_log); 
Va_start (argp, pszFmt); 
LogV (pszFmt argp); 
Va_end (argp); 
Unlock (& amp; Cs_log); 
} 
//the Log} 
# define ASIZE 200 
# define BSIZE 240 
# define CSIZE 2 
Char Abuf [ASIZE]; 
Char Cbuf [CSIZE]; 
CRITICAL_SECTION cs_HEX; 
CRITICAL_SECTION cs_BBB; 
Struct FIFO_BUFFER {
Int the head; 
Int tail; 
Int size; 
Char data [BSIZE]; 
} BBB; 
Int No_Loop=0; 
Void HexDump) (int cn, char * buf, int len) {
Int I, j, k; 
Char binstr [80]. 

The Lock (& amp; Cs_HEX); 
for (i=0; iIf (0==16) (I %) {
Sprintf (binstr, "% 3 d % 4 x -", cn, I); 
Sprintf (binstr, "% s % 02 x", binstr, buf (unsigned char) [I]); 
} else if (15==16) (I %) {
Sprintf (binstr, "% s % 02 x", binstr, buf (unsigned char) [I]); 
Sprintf (binstr, "% s", binstr); 
For (j=I - 15; J<=i; J++) {
Sprintf (binstr, "% s % c," binstr, ('! '& lt; Buf [j] & amp; & Buf [j] <='~')? Buf [j] : '. '); 
} 
The Log (" % s \ n ", binstr); 
} else {
Sprintf (binstr, "% s % 02 x", binstr, buf (unsigned char) [I]); 
} 
} 
If (0! 16)=(I %) {
16 k=16 - (I %); 
For (j=0; JSprintf (binstr, "% s", binstr); 
} 
Sprintf (binstr, "% s", binstr); 
K=16 - k; 
For (j=I - k; JSprintf (binstr, "% s % c," binstr, ('! '& lt; Buf [j] & amp; & Buf [j] <='~')? Buf [j] : '. '); 
} 
The Log (" % s \ n ", binstr); 
} 
Unlock (& amp; Cs_HEX); 
} 
nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull