内存整理的原理是??

2ccc.com有个示例程序,自己去看看

就RAM数据到HDD，然后腾空RAM////////////////////////////////////////////////////////////////////////////////
// Jazarsoft VCL Pack (JVP)                                                   //
////////////////////////////////////////////////////////////////////////////////
//                                                                            //
// TITLE        : MaxMem                                                      //
// CLASS        : TjsMaxMem                                                   //
// VERSION      : 1.2                                                         //
// AUTHOR       : Jazarsoft VCL Development Team                              //
// CREATED      : 20 October 2000                                             //
// MODIFIED     : 23 December 2001                                            //
// WEBSITE      : http://www.jazarsoft.com/                                   //
// WEB-SUPPORT  : http://www.jazarsoft.com/vcl/forum/                         //
// EMAIL-SUPPORT: [email protected], [email protected]              //
// LEGAL        : Copyright (C) 2000-2001 Jazarsoft, All Rights Reserved.     //
//                                                                            //
////////////////////////////////////////////////////////////////////////////////
//                                                                            //
// This code may be used and modified by anyone so long as  this header and   //
// copyright  information remains intact.                                     //
//                                                                            //
// The code is provided "AS-IS" and without WARRANTY OF ANY KIND,             //
// expressed, implied or otherwise, including and without limitation, any     //
// warranty of merchantability or fitness for a  particular purpose.?        //
//                                                                            //
// In no event shall the author be liable for any special, incidental,        //
// indirect or consequential damages whatsoever (including, without           //
// limitation, damages for loss of profits, business interruption, loss       //
// of information, or any other loss), whether or not advised of the          //
// possibility of damage, and on any theory of liability, arising out of      //
// or in connection with the use or inability to use this software.牋         //
//                                                                            //
////////////////////////////////////////////////////////////////////////////////
//                                                                            //
// HISTORY:                                                                   //
// 1.0 - [o] Initial Development                                              //
// 1.1 - [+] Abort Procedure                                                  //
//     - [+] DefragAll Procedure                                              //
// 1.2 - [o] Change classname to TjsMaxMem                                    //
//                                                                            //
// LEGEND:                                                                    //
// [o] : Information                                                          //
// [+] : Add something                                                        //
// [-] : Remove something                                                     //
// [*] : Fix                                                                  //
//                                                                            //
////////////////////////////////////////////////////////////////////////////////{$WARNINGS OFF}
{$HINTS OFF}
unit jsMaxMem;interfaceuses
  Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs;type
  TOnProgress = procedure(Sender: TObject;Progress:Integer) of object;  TjsMaxMem = class(TComponent)
  private
    FAbort             : Boolean;
    FTotalMemory       : Integer; { Your Computer RAM in Bytes }
    FWorking           : Boolean;
    FOnProgress        : TOnProgress;
    FOnBeforeDefrag    ,
    FOnAfterDefrag     : TNotifyEvent;
    Function GetFreeMemory:Integer; { In Bytes }
  protected
  public
    constructor Create(AOwner: TComponent); override;
    destructor  Destroy; override;
    procedure   DefragMemory(MemoryLimit:Integer); { Watchout! In MEGABYTES }
    Procedure   Abort;
    Procedure   DefragAll;
  published
    property    TotalMemory : Integer Read FTotalMemory;
    property    FreeMemory  : Integer Read GetFreeMemory;    { Events }
    property    OnBeforeDefrag : tNotifyEvent Read FOnBeforeDefrag Write FOnBeforeDefrag;
    property    OnProgress  : TOnProgress Read FOnProgress Write FOnProgress;
    property    OnAfterDefrag : tNotifyEvent Read FOnAfterDefrag Write FOnAfterDefrag;
  end;procedure Register;implementationconstructor TjsMaxMem.Create(AOwner: TComponent);
var MS : tMemoryStatus;
Begin
  inherited Create(AOwner);
  MS.dwLength:=sizeof(MS);
  GlobalMemoryStatus(MS);
  FTotalMemory:=MS.dwTotalPhys;
End;destructor TjsMaxMem.Destroy;
Begin
  inherited Destroy;
End;Procedure TjsMaxMem.Abort;
Begin
  FAbort:=True;
End;
Procedure TjsMaxMem.DefragAll;
Begin
  DefragMemory(TotalMemory div (1024*1024));
End;Function TjsMaxMem.GetFreeMemory:Integer;
var MS : tMemoryStatus;
Begin
  MS.dwLength:=sizeof(MS);
  GlobalMemoryStatus(MS);
  Result:=MS.dwAvailPhys;
End;procedure TjsMaxMem.DefragMemory(MemoryLimit:Integer);
var
Pointers : Array [0..1024] of Pointer;
Limit    ,
I2,
I        : Integer;
P        : Pointer;
Step     : Integer;
Steps    : Integer;
begin
FAbort := False;
If FWorking then Exit;
FWorking:=True;
Limit:=MemoryLimit;
If Limit>1024 then Limit:=1024;
If Assigned(FOnBeforeDefrag) then FOnBeforeDefrag(Self);
{ Calculating how many steps...}
Steps:=(MemoryLimit*2); Step:=0; { Clean pointer...}
For I:= 0 to Limit do Pointers[I]:=nil; { Allocating Memory }
For I:=0 to Limit-1 do
Begin
  P:=VirtualAlloc(nil, 1024*1024, MEM_COMMIT, PAGE_READWRITE + PAGE_NOCACHE);
  Pointers[I]:=p;
  asm
   pushad
   pushfd
   mov   edi, p
   mov   ecx, 1024*1024/4
   xor   eax, eax
   cld
   repz  stosd
   popfd
   popad
  end;
  Inc(Step);
  If Assigned(FOnProgress) then OnProgress(Self,Round((Step/Steps)*100));
  If FAbort then
  Begin
    For I2:=0 to I do
    Begin
     VirtualFree(Pointers[I2], 0, MEM_RELEASE);
    End;
    Step:=(MemoryLimit*2);
    FWorking:=False;
    If Assigned(FOnAfterDefrag) then FOnAfterDefrag(Self);
    Exit;
  End;
end; { DeAllocating Memory } For I:=0 to Limit-1 do
Begin
  VirtualFree(Pointers[i], 0, MEM_RELEASE);
  Inc(Step);
  If Assigned(FOnProgress) then OnProgress(Self,Round((Step/Steps)*100));
  If FAbort then
  Begin
    { Warning! : Force abort, w/o de-allocating memory }
    Step:=(MemoryLimit*2);
    FWorking:=False;
    If Assigned(FOnAfterDefrag) then FOnAfterDefrag(Self);
    Exit;
  End;
End; FWorking:=False; If Assigned(FOnAfterDefrag) then FOnAfterDefrag(Self);
End;
procedure Register;
begin
  RegisterComponents('Jazarsoft', [TjsMaxMem]);
end;end.

to ly_liuyang(Liu Yang)你的代码是不是这样的:    一兆一兆得把内存分配过来
    然后清零以便操作系统把这些内存分配到实际内存中
    然后再释放所有分配的内存我想问，为什么这样能起到内存整理？

这个是Windows的机制重入物理RAM的数据都是连续有序的，系统会分配连续的空间，这样就没碎片了http://lysoft.7u7.net

调试易

内存整理的原理是??

解决方案 »