edi 837

Learn about edi 837, we have the largest and most updated edi 837 information on alibabacloud.com

Memcpy implementation in Linux x86 Kernel

Static _ always_inline void * _ memcpy (void * To, const void * From, size_t N) {int D0, D1, D2; ASM volatile ("rep; movsl \ n \ t "" movl % 4, % ECx \ n \ t "" andl $3, % ECx \ n \ t "" JZ 1f \ n \ t "" rep; movsb \ n \ t "" 1: ":" = C "(D0 ), "= D" (D1), "= S" (D2): "0" (N/4), "G" (N ), "1" (long) to), "2" (long) from): "Memory"); return to;}/** this looks uugly, but the compiler can optimize it totally, * as the Count is const Ant. */static _ always_inline void * _ constant_memcpy (void *

Linux-0.11 Kernel Memory Management get_free_page () function analysis

/**author:davidlin*date:2014-11-11pm*email: [email protected] or [email protected]*world:the City of SZ, in China*ver:000.000.001*history:editor time do1) Linpeng 2014-11-11 created this file!2)*/Linux-0.11 Memory Management module is more difficult to understand in the source code part, now the author's personal understanding publishedFirst hair Linux-0.11 kernel memory management get_free_page () function analysisHave time to write other functions or files:)/** Get Physical Address of first (a

Linux-0.11 Kernel Memory Management get_free_page () function analysis

/**author:davidlin*date:2014-11-11pm*email: [email protected] or [email protected]*world:the City of SZ, in China*ver:000.000.001*history:editor time do1) Linpeng 2014-11-11 created this file!2)*/Linux-0.11 Memory Management module is more difficult to understand in the source code part, now the author's personal understanding publishedFirst hair Linux-0.11 kernel memory management get_free_page () function analysisHave time to write other functions or files:)/** Get Physical Address of first (a

Analysis of a Trojan sample

It's free. Let's take a look.ODLoad directly as follows: 00414000> $ E8 00000000 call 0041400500414005 $ 5B pop ebx // locate the code00414006.81EB05024000 sub ebx, 00400205 // The code segment length, followed by a variable0041400C. 64: 8B3D 30000000 mov edi, dword ptr fs: [30] // FS [30]-> PEB, locate kernel32.dll00414013. 8B7F 0C mov edi, dword ptr [edi + C] /

Linux Platform x86 compilation (VI): Transfer of data

EAX register to the memory location specified by value. Use the memory location of the variable address. as follows, multi-memory specifies multiple values in one command:values:. int 10,20,30,40,50,60,70this creates a series of data values that are contiguous in memory (similar to an array of high-level languages). When referencing data in an array, you must use the system to determine which memory location you want to access. The memory location is determined by the following expression:base_

C + +: My understanding of the return statement

If you returned a struct object, what would the return statement do? Here is the test code #include using namespace Std;struct BIG{Char buf[100];int i;Long D;}B,B2;Big Bigfun (Big B){b.i=100;return b;}int main (){B2=bigfun (B);return 0;}To set a breakpoint at the beginning and end of main8:int Main ()19: {004012A0 Push EBP004012A1 mov Ebp,esp004012a3 Sub esp,118hPuzzled at first, and analyzed for a long timeThe original (118h-40h) remaining memory block holds two big variablesLow address put bi

Program loading and Execution (iii)--"x86 assembly language: From the actual mode to the protection mode" Reading notes 23

Loading and execution of programs (iii)--reading notes 23And then the last time the content said.load_relocate_programthe explanation of the process is not over yet, so create a stack segment descriptor and reposition symbol table.Allocating stack space and creating a stack segment descriptor462 ; Creating a program stack segment descriptor463 movecx,[edi+0x0c]; 4KB magnification464 movEbx0x000fffff465 SubEbx,ecxTo get

function calling convention

__stdcall __cdecl __fastcall vc6.0:int __stdcall/__cdecl/__fastcall Add (int x, int y){return x+y;}void Main (){Add (2,3);}1.__stdcall:1:int __stdcall Add (int x, int y)2: {00401020 Push EBP00401021 mov Ebp,esp00401023 Sub esp,40h00401026 push EBX00401027 push ESI00401028 Push EDI00401029 Lea edi,[ebp-40h]0040102C mov ecx,10h00401031 mov eax,0cccccccch00401036 Rep stos dword ptr [edi]3:return X

Shellcode Getting Started (win)

esi, [edx + 0x3c]; Lea ESI, [edx + esi]; mov esi, [esi + 0x78]; Lea ESI, [edx + esi]; mov edi, [esi + 0x1c]; Lea EDI, [edx + edi]; MOV[EBP-0X04], EDI; mov

Coinitialize Analysis 1

Everyone knows that to use COM components in a program, you must first call coinitialize. This function is mainly used to initialize the com runtime environment. But does the function scope take the thread as the unit or the process as the unit? Maybe you have figured out the answer through the test program. That's right, it's a thread. Today, we will go into a bit more detail and confirm our ideas by analyzing the specific implementation of coinitialize. Let's take a look at coinitialize compil

Making cross-platform Shellcode

]; Lea ESI, [edx + esi]; mov esi, [esi + 0x78]; Lea ESI, [edx + esi]; mov edi, [esi + 0x1c]; Lea EDI, [edx + edi]; MOV[EBP-0X04], EDI; mov edi

Secure return method of Symantec Firewall kernel overflow exploit

that shellcode will be much larger. At the summit because Flashsky Daniel refused to disclose source code, so had to do their own, ample clothing. This period of time due to review make-up (last semester accidentally hung 4 #_#), so dragged for so long. In fact, the code was written very early, is not bothered to write this document. This morning finally made up my mind to spend the morning to finish this document, it is inevitable that there are some mistakes, I hope you point out. Shellcode

Security checks based on Checkstackvars

accounted for 10 bytes, to 4-byte alignment, so you need to complement two bytes, so two 0xcc, resulting in a 10 byte between the BF and array. The one next to the above array should be two 0xcc to complement the alignment. It was deliberately marked to the back. The purpose of this identification here is to illustrate the principle of checkstackvars this inspection. OK, clear the memory distribution, then checkstackvars at what time to perform the check, in C + + code can not be displayed to

Krypton0.5 main program shelling

is filled, the cmp [Addr] And 0xff will be used to determine whether to check the encryption option for processing. There is Magic JUMP, but the Shell API address has been redirected, and the Patch code needs to be restored.>The code is not optimized, and there is no time to optimize it. There are too many records to analyze the main program.The Patch code is as follows:Code:00B60000 60 pushad00B60001 9C pushfd00B60002 BE 00104000 mov esi, 0x401000 Code segment Addr00B60007 BF 00404000 mov

[Analysis] summarizes three methods of using heap overflow in windows.

at the various flags. Let's take a look at the key points in rtlfreeheap. Key Aspect 1001b: 77fcc829 8a4605 mov Al, [ESI + 05] // ESI points to the start address of the buf2 8-byte management structure, namely, the Al flag001b: 77fcc82c a801 test Al, 01 // whether the flag value contains heap_entry_busy001b: 77fcc82e 0f84a40e0000 JZ 77fcd6d8 // skip if not included. Skip here001b: 77fcc834 f6c207 test DL, 07001b: 77fcc837 0f859b0e0000 jnz 77fcd6d8001b: 77fcc83d 807e0440 CMP byte PTR [ESI + 04],

Multi-precision PI computing Assembly implementation

returned.XOR eax, eaxMoV ESI, LPXMoV ECx, n@@:MoV edX, [ESI + eax * 4]Test edX, EDXJnz exitINC eaxCMP eax, ECxJl @ BMoV eax, 1RETExit:XOR eax, eaxRET_ Iszero endp;-----------------------------------------------------------_ Add proc N: DWORD, LPX: DWORD, lpy: DWORD; X + = yMoV EDI, LPXMoV ESI, lpyXOR ECx, ECx; carryMoV eax, nDec eax; n-1 subscript@@:MoV edX, [ESI + eax * 4]Add edX, ECxAdd edX, [EDI + eax *

"Lao Liu Talk about algorithm 003" command-line parameter processing and obtaining--ARGCL function implementation analysis

Lucifer.; #########################################################################. 386. Model flat, stdcall; -bit memory model option Casemap:none; Case sensitive include \masm32\include\kernel32.inc; ------------------------------------ ; Please read the final usage of the text; ------------------------------------ARGCL PROTO:D Word,:D Word. Code; ######################################################################## #ArgCl proc Argnum:dword, ItemBuffer:D Word local cmdline:D word local c

Summary of issues related to partitioned tables in Oracle (next)

---------------------------------------------------------- 0 Recursive calls 0 db Block gets 38236 consistent gets 0 physical Reads 0 Redo Size 15092711 Bytes sent via sql*net to client 370304 bytes received via sql*net from client 33631 sql*net roundtrips To/from Client 0 Sorts (memory) 0 Sorts (disk) 504448 rows processed Sql> select * from t where object_id 504448 rows have been selected. Time used: 00:00:09.85 Execution plan -------------------------------------------------

NT kernel process scheduling Analysis notes

+ 00000128] In this case, EAX = NextThread (ETHREAD structure) 0008: 80467E17 sub esp, 0C0008: 80467E1A MOV [ESP + 08], ESI0008: 80467E1E MOV [ESP + 04], EDI0008: 80467E22 MOV [ESP], EBP0008: 80467E25 mov esi, EAX0008: 80467E27 mov edi, [EBX + 00000124] Note: CurrentThread (ETHREAD structure)0008: 80467E2D mov dword ptr [EBX + 00000128], 000000000008: 80467E37 MOV [EBX + 00000124], ESI0008: 80467E3D mov ecx, EDI0008: 80467E3F CALL 8042F944 Note: KiRe

Hook swapcontext enumeration of hidden processes (learning notes 4)

Author: bzhkl Time: 2008-12-11,12: 01 Chain: http://bbs.pediy.com/showthread.php? T = 78464 Previously, I tried to detect a hidden process and then solved it with the method of brute force enumeration. But the hook swapcontext didn't see complete code. So I collected some useful modules on the Internet and integrated them to implement support. xp3, xp2 should be supported even if it is not tested. Complete project code Difficulty: there are still some details about obtaining the swapcontext ad

Total Pages: 15 1 .... 5 6 7 8 9 .... 15 Go to: Go

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

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.