在VC中折騰註冊表

來源:互聯網
上載者:User

   碰到的問題:用遍曆註冊表函數RegEnumValue所得出的字串老是被截斷。這是剛開始所用的代碼:

DWORD retCode;
HKEY regHKey;
CHAR achKey[MAX_PATH];
DWORD ccValue=MAX_PATH;

if(::RegOpenKeyEx(HKEY_CURRENT_USER,"Software\\OKI\\CCons33\\UNITTYPE",0,KEY_READ,&regHKey)==ERROR_SUCCESS)
{
  for(i=0,retCode=ERROR_SUCCESS;retCode!=ERROR_NO_MORE_ITEMS;i++)
 {
    retCode = ::RegEnumValue(regHKey, i,achKey,&ccValue, NULL,NULL,NULL, NULL);
    
    for(int j=0;j<strlen(achKey);j++)
    cout<<achKey[j];    

    cout<<endl;                  
  }
}

   例如“MediaPathUnexpanded”的項名,它只返回其中前面部分,就好像“MediaPathUn”,後面的就不見了,我百思不知其所,

  
  解決方案:
      正如
http://topic.csdn.net/t/20040701/00/3136042.html這篇文章所說:
      
通過RegQueryInfoKey可以獲得value   name的最大長度的(參數lpcMaxValueNameLen),RegEnumValue中lpValueName開闢的空間比lpcMaxValueNameLen大就行了

     以下是解決的代碼:
   

 1LPCSTR lp="Software\\OKI\\CCons33\\UNITTYPE";
 2                HKEY regHKey;
 3                if(::RegOpenKeyEx(HKEY_CURRENT_USER,"Software\\OKI\\CCons33\\UNITTYPE",0,KEY_READ,&regHKey)==ERROR_SUCCESS)
 4                {
 5                /**//*    ::RegQueryValueEx(regHKey,"GateKeeper#1",NULL,&nType,lpData,&size);
 6                CString str;
 7                str.Format("%s",(LPCSTR)lpData);
 8                for(int i=0;i<str.GetLength();i++)
 9                cout<<str[i];
10                    */
11                    
12                    //int i;
13                    DWORD dwIndex = 0;
14                    TCHAR *tcKeyName = NULL;
15                    DWORD dwKeyType;
16                    DWORD dwKeyDataLength,dwKeyNameLen;
17                    LPBYTE pbbinKeyData = NULL; 
18                    LONG lResult;
19                    //LPDWORD max_Path;
20                    DWORD ccValue=MAX_PATH;
21                    DWORD lNoOfValues   =   0;   
22                    DWORD lLongestKeyNameLen   =   1;   
23                    DWORD lLongestDataLen   =   1;   
24                    lResult = RegQueryInfoKey(regHKey,NULL,NULL,NULL,NULL,NULL,NULL,&lNoOfValues,
25                                    &lLongestKeyNameLen,&lLongestDataLen,NULL,NULL);   
26                    
27                    lLongestKeyNameLen++;
28                    lLongestDataLen++;
29                    tcKeyName = new TCHAR[lLongestKeyNameLen];
30                    pbbinKeyData = new BYTE[lLongestDataLen];  
31                    tcKeyName = new TCHAR[lLongestKeyNameLen];   
32                    pbbinKeyData =new BYTE[lLongestDataLen];   
33                    CString cstrFinalData,cstrTemp;   
34                    while(TRUE)   
35                    {
36                        memset(pbbinKeyData,0,lLongestDataLen);
37                        memset(tcKeyName,0,lLongestKeyNameLen);
38                        dwKeyType = dwKeyDataLength = dwKeyNameLen=0;
39                        dwKeyNameLen = lLongestKeyNameLen;
40                        dwKeyDataLength=lLongestDataLen;
41                        lResult=RegEnumValue(regHKey,dwIndex,tcKeyName,&dwKeyNameLen,NULL,&dwKeyType,pbbinKeyData,&dwKeyDataLength);
42                        if(lResult   ==   ERROR_NO_MORE_ITEMS)   
43                            break;   
44                        cout<<tcKeyName<<endl;
45                        //dRegistryItem(tcKeyName,dwKeyType,pbbinKeyData,dwKeyDataLength,dwIndex);//?帵悢悩槹ListView   
46                        dwIndex++;
47                    }
48                    RegCloseKey(regHKey);
49                    delete tcKeyName;   
50                    delete pbbinKeyData;

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.