Няшная – Страница 3

Няшная / Говнокод #29064

0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

/* Windows doesn't support the fork() call; so we fake it by invoking
   another copy of Wget with the same arguments with which we were
   invoked.  The child copy of Wget should perform the same initialization
   sequence as the parent; so we should have two processes that are
   essentially identical.  We create a specially named section object that
   allows the child to distinguish itself from the parent and is used to
   exchange information between the two processes.  We use an event object
   for synchronization.  */
static void
fake_fork (void)
{
  char exe[MAX_PATH + 1];
  DWORD exe_len, le;
  SECURITY_ATTRIBUTES sa;
  HANDLE section, event, h[2];
  STARTUPINFO si;
  PROCESS_INFORMATION pi;
  struct fake_fork_info *info;
  char *name;
  BOOL rv;

  section = pi.hProcess = pi.hThread = NULL;

  /* Get the fully qualified name of our executable.  This is more reliable
     than using argv[0].  */
  exe_len = GetModuleFileName (GetModuleHandle (NULL), exe, sizeof (exe));
  if (!exe_len || (exe_len >= sizeof (exe)))
    return;

  sa.nLength = sizeof (sa);
  sa.lpSecurityDescriptor = NULL;
  sa.bInheritHandle = TRUE;

  /* Create an anonymous inheritable event object that starts out
     non-signaled.  */
  event = CreateEvent (&sa, FALSE, FALSE, NULL);
  if (!event)
    return;

  /* Create the child process detached form the current console and in a
     suspended state.  */
  xzero (si);
  si.cb = sizeof (si);
  rv = CreateProcess (exe, GetCommandLine (), NULL, NULL, TRUE,
                      CREATE_SUSPENDED | DETACHED_PROCESS,
                      NULL, NULL, &si, &pi);
  if (!rv)
    goto cleanup;

  /* Create a named section object with a name based on the process id of
     the child.  */
  name = make_section_name (pi.dwProcessId);
  section =
      CreateFileMapping (INVALID_HANDLE_VALUE, NULL, PAGE_READWRITE, 0,
                         sizeof (struct fake_fork_info), name);
  le = GetLastError();
  xfree (name);
  /* Fail if the section object already exists (should not happen).  */
  if (!section || (le == ERROR_ALREADY_EXISTS))
    {
      rv = FALSE;
      goto cleanup;
    }

  /* Copy the event handle into the section object.  */
  info = MapViewOfFile (section, FILE_MAP_WRITE, 0, 0, 0);
  if (!info)
    {
      rv = FALSE;
      goto cleanup;
    }

  info->event = event;

  UnmapViewOfFile (info);

  /* Start the child process.  */
  rv = ResumeThread (pi.hThread);
  if (!rv)
    {
      TerminateProcess (pi.hProcess, (DWORD) -1);
      goto cleanup;
    }

  /* Wait for the child to signal to us that it has done its part.  If it
     terminates before signaling us it's an error.  */

  h[0] = event;
  h[1] = pi.hProcess;
  rv = WAIT_OBJECT_0 == WaitForMultipleObjects (2, h, FALSE, 5 * 60 * 1000);
  if (!rv)
    goto cleanup;

  info = MapViewOfFile (section, FILE_MAP_READ, 0, 0, 0);
  if (!info)
    {
      rv = FALSE;
      goto cleanup;
    }

Из исходников wget.

https://git.savannah.gnu.org/cgit/wget.git/tree/src/mswindows.c

rOBHOBO3Hblu_nemyx, 06.12.2024 (Updated 06.12.2024)

Комментарии (12, +12)

Няшная / Говнокод #29055

0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

int IsEven(long long int number){
	if (number == 0) return 0; 
	long long int loc_num = 0;
	update: 
	
	if (number == loc_num+1) {return 1;
	} else if (number == (loc_num+1)*(-1)) { return 1;
	} else {
		if (number == loc_num+2) {return 0;
		} else if (number == (loc_num+2)*(-1)) { return 0;
		} else {
			if (number == loc_num+3) {return 1;
			} else if (number == (loc_num+3)*(-1)) { return 1;
			} else {
				if (number == loc_num+4) {return 0;
				} else if (number == (loc_num+4)*(-1)) { return 0;
				} else {
					if (number == loc_num+5) {return 1;
					} else if (number == (loc_num+5)*(-1)) { return 1;
					} else {
						if (number == loc_num+6) {return 0;
						} else if (number == (loc_num+6)*(-1)) { return 0;
						} else {
							if (number == loc_num+7) {return 1;
							} else if (number == (loc_num+7)*(-1)) { return 1;
							} else {
								if (number == loc_num+8) {return 0;
								} else if (number == (loc_num+8)*(-1)) { return 0;
								} else {
									if (number == loc_num+9) {return 1;
									} else if (number == (loc_num+9)*(-1)) { return 1;
									} else {
										if (number == loc_num+10) {return 0;
										} else if (number == (loc_num+10)*(-1)) { return 0;
										} else {
												loc_num+=10; 
												goto update;
											}
										}
									}
								}
							}
						}
					}
				}
			}
		}
	}

TurboLyudoed, 14.11.2024 (Updated 14.11.2024)

Комментарии (3, +3)

Няшная / Говнокод #29034

0

1

Админ - уебок, хранивший пароли открытым текстом

Чекайте свои мыла в утечках, ебланы

aleksusklim, 26.10.2024 (Updated 26.10.2024)

Комментарии (0)

Няшная / Говнокод #29011

0

1

Удалите мой аккаунт

Удалите мой аккаунт

aleksusklim, 25.10.2024 (Updated 25.10.2024)

Комментарии (2, +2)

Няшная / Говнокод #29001

0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

// https://github.com/micropython/micropython/blob/1b89c503db690967d50699abe0bfa942f6f6b15e/ports/qemu/mcu/rv32/interrupts.c#L131

const char *lookup_cause(uint32_t mcause) {
    if (mcause & 0x80000000) {
        switch (mcause & 0x7FFFFFFF) {
            case 1:
                return exception_causes[1];
            case 3:
                return exception_causes[2];
            case 5:
                return exception_causes[3];
            case 7:
                return exception_causes[4];
            case 9:
                return exception_causes[5];
            case 11:
                return exception_causes[6];
            default:
                return (mcause >= 16) ?
                       exception_causes[7] :
                       exception_causes[0];
        }
    }

    switch (mcause) {
        case 0:
            return exception_causes[8];
        case 1:
            return exception_causes[9];
        case 2:
            return exception_causes[10];
        case 3:
            return exception_causes[11];
        case 4:
            return exception_causes[12];
        case 5:
            return exception_causes[13];
        case 6:
            return exception_causes[14];
        case 7:
            return exception_causes[15];
        case 8:
            return exception_causes[16];
        case 9:
            return exception_causes[17];
        case 11:
            return exception_causes[18];
        case 12:
            return exception_causes[19];
        case 13:
            return exception_causes[20];
        case 15:
            return exception_causes[21];
        default: {
            if ((mcause >= 24 && mcause <= 31) ||
                (mcause >= 48 && mcause <= 63)) {
                return exception_causes[22];
            }

            return exception_causes[0];
        }
    }
}

Микропитухон

j123123, 17.10.2024 (Updated 17.10.2024)

Комментарии (4, +4)

Няшная / Говнокод #28998

0

1
2
3
4
5
6
7
8
9

int iseven(long long int number)
{
	struct Num {
		unsigned int x:1;
		unsigned int y:31;
		unsigned int z:32;
	} num = (*(struct Num*)(&number));
	return num.x; //Если результат 1, то нечётное.
}

Функция определения чётности числа посредством возврата младшего бита.

TurboLyudoed, 11.10.2024 (Updated 11.10.2024)

Комментарии (6, +6)

Няшная / Говнокод #28995

0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90

longlong ** FUN_14000e5a0(longlong **param_1,LPCWSTR param_2,int param_3,uint param_4)

{
  uint uVar1;
  longlong **pplVar2;
  longlong **hFile;
  longlong *plVar3;
  longlong **pplVar4;
  DWORD DVar5;
  LONG local_38;
  undefined4 uStack_34;
  
  pplVar4 = (longlong **)0x0;
  uVar1 = param_4 & 0x1f;
  if ((param_4 & 0x1f) == 0) {
    uVar1 = 2;
  }
  pplVar2 = FUN_1400119f8(DAT_1400213a0,(longlong)param_1);
  if (pplVar2 == (longlong **)0x0) {
    return (longlong **)0x0;
  }
  if (param_3 == 1) {
    DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0);
    if ((param_4 >> 0x12 & 1) != 0) {
      DVar5 = 7;
    }
    hFile = (longlong **)
            CreateFileW(param_2,0x80000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,3,0x80,(HANDLE)0x0);
LAB_14000e70c:
    if (hFile == (longlong **)0xffffffffffffffff) goto LAB_14000e7ad;
  }
  else {
    if (param_3 == 2) {
      DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0);
      if ((param_4 >> 0x12 & 1) != 0) {
        DVar5 = 7;
      }
      hFile = (longlong **)
              CreateFileW(param_2,0xc0000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,4,0x80,(HANDLE)0x0);
      goto LAB_14000e70c;
    }
    if (param_3 != 3) {
      hFile = (longlong **)CONCAT44(uStack_34,local_38);
      goto LAB_14000e70c;
    }
    DVar5 = (DWORD)((param_4 >> 0x11 & 1) != 0);
    if ((param_4 >> 0x12 & 1) != 0) {
      DVar5 = 7;
    }
    hFile = (longlong **)
            CreateFileW(param_2,0xc0000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,2,0x80,(HANDLE)0x0);
    if (hFile == (longlong **)0xffffffffffffffff) {
      hFile = (longlong **)
              CreateFileW(param_2,0x40000000,DVar5,(LPSECURITY_ATTRIBUTES)0x0,5,0,(HANDLE)0x0);
      goto LAB_14000e70c;
    }
  }
  if (hFile != (longlong **)0x0) {
    if ((DAT_14001f140 == 0) || ((param_4 >> 0x13 & 1) != 0)) {
      pplVar2[1] = (longlong *)0x0;
    }
    else {
      plVar3 = (longlong *)HeapAlloc(DAT_1400204cc,0,(longlong)DAT_14001f140);
      pplVar2[1] = plVar3;
    }
    *pplVar2 = (longlong *)hFile;
    *(int *)(pplVar2 + 2) = DAT_14001f140;
    *(undefined4 *)((longlong)pplVar2 + 0x14) = 0;
    *(uint *)(pplVar2 + 4) = uVar1;
    *(uint *)((longlong)pplVar2 + 0x24) = (uint)(param_3 == 1);
    *(undefined4 *)((longlong)pplVar2 + 0x1c) = 1;
    if ((param_3 == 2) && ((param_4 >> 0x14 & 1) != 0)) {
      local_38 = 0;
      SetFilePointer(hFile,0,&local_38,2);
    }
    pplVar4 = hFile;
    if (param_1 == (longlong **)0xffffffffffffffff) {
      pplVar4 = pplVar2;
    }
    if (pplVar4 != (longlong **)0x0) {
      return pplVar4;
    }
  }
LAB_14000e7ad:
  if (param_1 == (longlong **)0xffffffffffffffff) {
    param_1 = pplVar2;
  }
  FUN_14001192c(DAT_1400213a0,(longlong)param_1);
  return pplVar4;
}

BelCodeMonkey, 06.10.2024 (Updated 06.10.2024)

Комментарии (6, +6)

Няшная / Говнокод #28988

0

1

char main[] = { 0xf0, 0x0f, 0xc7, 0xc8 };

DartPower, 10.09.2024 (Updated 10.09.2024)

Комментарии (4, +4)

Няшная / Говнокод #28984

0

1

Блять, какое же это всё таки говнецо, этот Ваш си++

doomginho, 22.08.2024 (Updated 22.08.2024)

Комментарии (0)

Няшная / Говнокод #28950

0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100

/*
 Brainfuck-C ( http://github.com/kgabis/brainfuck-c )
 Copyright (c) 2012 Krzysztof Gabis
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
 in the Software without restriction, including without limitation the rights
 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:
 
 The above copyright notice and this permission notice shall be included in
 all copies or substantial portions of the Software.
 
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
*/

#include <stdio.h>

#define OP_END          0
#define OP_INC_DP       1
#define OP_DEC_DP       2
#define OP_INC_VAL      3
#define OP_DEC_VAL      4
#define OP_OUT          5
#define OP_IN           6
#define OP_JMP_FWD      7
#define OP_JMP_BCK      8

#define SUCCESS         0
#define FAILURE         1

#define PROGRAM_SIZE    4096
#define STACK_SIZE      512
#define DATA_SIZE       65535

#define STACK_PUSH(A)   (STACK[SP++] = A)
#define STACK_POP()     (STACK[--SP])
#define STACK_EMPTY()   (SP == 0)
#define STACK_FULL()    (SP == STACK_SIZE)

struct instruction_t {
    unsigned short operator;
    unsigned short operand;
};

static struct instruction_t PROGRAM[PROGRAM_SIZE];
static unsigned short STACK[STACK_SIZE];
static unsigned int SP = 0;

int compile_bf(FILE* fp) {
    unsigned short pc = 0, jmp_pc;
    int c;
    while ((c = getc(fp)) != EOF && pc < PROGRAM_SIZE) {
        switch (c) {
            case '>': PROGRAM[pc].operator = OP_INC_DP; break;
            case '<': PROGRAM[pc].operator = OP_DEC_DP; break;
            case '+': PROGRAM[pc].operator = OP_INC_VAL; break;
            case '-': PROGRAM[pc].operator = OP_DEC_VAL; break;
            case '.': PROGRAM[pc].operator = OP_OUT; break;
            case ',': PROGRAM[pc].operator = OP_IN; break;
            case '[':
                PROGRAM[pc].operator = OP_JMP_FWD;
                if (STACK_FULL()) {
                    return FAILURE;
                }
                STACK_PUSH(pc);
                break;
            case ']':
                if (STACK_EMPTY()) {
                    return FAILURE;
                }
                jmp_pc = STACK_POP();
                PROGRAM[pc].operator =  OP_JMP_BCK;
                PROGRAM[pc].operand = jmp_pc;
                PROGRAM[jmp_pc].operand = pc;
                break;
            default: pc--; break;
        }
        pc++;
    }
    if (!STACK_EMPTY() || pc == PROGRAM_SIZE) {
        return FAILURE;
    }
    PROGRAM[pc].operator = OP_END;
    return SUCCESS;
}

int execute_bf() {
    unsigned short data[DATA_SIZE], pc = 0;
    unsigned int ptr = DATA_SIZE;
    while (--ptr) { data[ptr] = 0; }
    while (PROGRAM[pc].operator != OP_END && ptr < DATA_SIZE) {
// (...)

Интерпретатор Brainfuck.

Полный код можно посмотреть тута:
https://github.com/kgabis/brainfuck-c/blob/master/brainfuck.c

kNode, 02.07.2024 (Updated 02.07.2024)

Комментарии (6, +6)