Список говнокодов пользователя j123123

Всего: 331

Си / Говнокод #27792

0

01
02
03
04
05
06
07
08
09
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

// https://github.com/dxFeed/dxfeed-c-api/blob/8f24055298c9751344db72da03ab8eb37dfeb6a5/src/DXAlgorithms.h#L63

#define CHECKED_CALL(func, param) \
	do { \
		if (!func(param)) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_0(func) \
	do { \
		if (!func()) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_1(func, param1) \
	do { \
		if (!func(param1)) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_2(func, param1, param2) \
	do { \
		if (!func(param1, param2)) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_3(func, param1, param2, param3) \
	do { \
		if (!func(param1, param2, param3)) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_4(func, param1, param2, param3, param4) \
	do { \
		if (!func(param1, param2, param3, param4)) { \
			return false; \
		} \
	} while (false)

#define CHECKED_CALL_5(func, param1, param2, param3, param4, param5) \
	do { \
		if (!func(param1, param2, param3, param4, param5)) { \
			return false; \
		} \
	} while (false)

Мокроебства

j123123, 05 Ноября 2021

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

Си / Говнокод #27760

0

01
02
03
04
05
06
07
08
09
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

/* https://github.com/v7unix/v7unix/blob/ed636a47207476db76d53b7869447889dee3bbad/v7/usr/src/cmd/sh/mac.h */

#
/*
 *	UNIX shell
 *
 *	S. R. Bourne
 *	Bell Telephone Laboratories
 *
 */

#define LOCAL	static
#define PROC	extern
#define TYPE	typedef
#define STRUCT	TYPE struct
#define UNION	TYPE union
#define REG	register

#define IF	if(
#define THEN	){
#define ELSE	} else {
#define ELIF	} else if (
#define FI	;}

#define BEGIN	{
#define END	}
#define SWITCH	switch(
#define IN	){
#define ENDSW	}
#define FOR	for(
#define WHILE	while(
#define DO	){
#define OD	;}
#define REP	do{
#define PER	}while(
#define DONE	);
#define LOOP	for(;;){
#define POOL	}


#define SKIP	;
#define DIV	/
#define REM	%
#define NEQ	^
#define ANDF	&&
#define ORF	||

#define TRUE	(-1)
#define FALSE	0
#define LOBYTE	0377
#define STRIP	0177
#define QUOTE	0200

#define EOF	0
#define NL	'\n'
#define SP	' '
#define LQ	'`'
#define RQ	'\''
#define MINUS	'-'
#define COLON	':'

#define MAX(a,b)	((a)>(b)?(a):(b))

j123123, 20 Октября 2021

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

Си / Говнокод #27753

0

01
02
03
04
05
06
07
08
09
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

// https://github.com/x42/darc.lv2/blob/7f1f42b879777e570c83fd566ac28cbfdd51e6fc/src/lv2.c#L508
static void
create_pattern (Darc* self, const double w)
{
	const int x0 = floor (w * 0.05);
	const int x1 = ceil (w * 0.95);
	const int wd = x1 - x0;

#define DEF(x) ((x0 + wd * ((x) + 20.) / 60.) / w)

	cairo_pattern_t* pat = cairo_pattern_create_linear (0.0, 0.0, w, 0);
	/* clang-format off */
	cairo_pattern_add_color_stop_rgba (pat, 1.0,       .0, .5, .0, 0);
	cairo_pattern_add_color_stop_rgba (pat, DEF (40),  .0, .5, .0, 0.5);
	cairo_pattern_add_color_stop_rgba (pat, DEF (5),   .0, .5, .0, 0.5);
	cairo_pattern_add_color_stop_rgba (pat, DEF (-5),  .5, .0, .0, 0.5);
	cairo_pattern_add_color_stop_rgba (pat, DEF (-20), .5, .0, .0, 0.5);
	cairo_pattern_add_color_stop_rgba (pat, 0.0,       .5, .0, .0, 0);
	/* clang-format on */
	self->mpat = pat;

	pat = cairo_pattern_create_linear (0.0, 0.0, w, 0);
	/* clang-format off */
	cairo_pattern_add_color_stop_rgba (pat, 1.0,       .1, .9, .1, 0);
	cairo_pattern_add_color_stop_rgba (pat, DEF (40),  .1, .9, .1, 1);
	cairo_pattern_add_color_stop_rgba (pat, DEF (5),   .1, .9, .1, 1);
	cairo_pattern_add_color_stop_rgba (pat, DEF (-5),  .9, .9, .1, 1);
	cairo_pattern_add_color_stop_rgba (pat, DEF (-20), .9, .9, .1, 1);
	cairo_pattern_add_color_stop_rgba (pat, 0.0,       .9, .9, .1, 0);
	/* clang-format on */
	self->cpat = pat;

#undef DEF
}

Отключаем и включаем clang-формат, чтобы отступы красиво были. Да еще и такой вот локальный дефайн!

j123123, 17 Октября 2021

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

Куча / Говнокод #27668

+2

01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22

(* https://coq.inria.fr/library/Coq.Init.Datatypes.html *)

(* Basic boolean operators *)

Definition andb (b1 b2:bool) : bool := if b1 then b2 else false.

Definition orb (b1 b2:bool) : bool := if b1 then true else b2.

Definition implb (b1 b2:bool) : bool := if b1 then b2 else true.

Definition xorb (b1 b2:bool) : bool :=
  match b1, b2 with
    | true, true => false
    | true, false => true
    | false, true => true
    | false, false => false
  end.

Definition negb (b:bool) := if b then false else true.

Infix "||" := orb : bool_scope.
Infix "&&" := andb : bool_scope.

На первый взгляд этот ваш Coq (питух) выглядит как очередной ML-язычок.

j123123, 16 Сентября 2021

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

Си / Говнокод #27641

+1

01
02
03
04
05
06
07
08
09
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

// https://github.com/layerfsd/WorkPlatForm/blob/f14a8cdd2bc3772ea4bd37a0381f5f8305a0a2c2/Common/BuilDefine.h

// source file build_defs.h

#ifndef BUILD_DEFS_H

#define BUILD_DEFS_H

#define VERSION_MAJOR 1
// Example of __DATE__ string: "Jul 27 2012"
//                              01234567890

#define BUILD_YEAR_CH0 (__DATE__[ 7])
#define BUILD_YEAR_CH1 (__DATE__[ 8])
#define BUILD_YEAR_CH2 (__DATE__[ 9])
#define BUILD_YEAR_CH3 (__DATE__[10])


#define BUILD_MONTH_IS_JAN (__DATE__[0] == 'J' && __DATE__[1] == 'a' && __DATE__[2] == 'n')
#define BUILD_MONTH_IS_FEB (__DATE__[0] == 'F')
#define BUILD_MONTH_IS_MAR (__DATE__[0] == 'M' && __DATE__[1] == 'a' && __DATE__[2] == 'r')
#define BUILD_MONTH_IS_APR (__DATE__[0] == 'A' && __DATE__[1] == 'p')
#define BUILD_MONTH_IS_MAY (__DATE__[0] == 'M' && __DATE__[1] == 'a' && __DATE__[2] == 'y')
#define BUILD_MONTH_IS_JUN (__DATE__[0] == 'J' && __DATE__[1] == 'u' && __DATE__[2] == 'n')
#define BUILD_MONTH_IS_JUL (__DATE__[0] == 'J' && __DATE__[1] == 'u' && __DATE__[2] == 'l')
#define BUILD_MONTH_IS_AUG (__DATE__[0] == 'A' && __DATE__[1] == 'u')
#define BUILD_MONTH_IS_SEP (__DATE__[0] == 'S')
#define BUILD_MONTH_IS_OCT (__DATE__[0] == 'O')
#define BUILD_MONTH_IS_NOV (__DATE__[0] == 'N')
#define BUILD_MONTH_IS_DEC (__DATE__[0] == 'D')


#define BUILD_MONTH_CH0 \
	((BUILD_MONTH_IS_OCT || BUILD_MONTH_IS_NOV || BUILD_MONTH_IS_DEC) ? '1' : '0')

#define BUILD_MONTH_CH1 \
	( \
	(BUILD_MONTH_IS_JAN) ? '1' : \
	(BUILD_MONTH_IS_FEB) ? '2' : \
	(BUILD_MONTH_IS_MAR) ? '3' : \
	(BUILD_MONTH_IS_APR) ? '4' : \
	(BUILD_MONTH_IS_MAY) ? '5' : \
	(BUILD_MONTH_IS_JUN) ? '6' : \
	(BUILD_MONTH_IS_JUL) ? '7' : \
	(BUILD_MONTH_IS_AUG) ? '8' : \
	(BUILD_MONTH_IS_SEP) ? '9' : \
	(BUILD_MONTH_IS_OCT) ? '0' : \
	(BUILD_MONTH_IS_NOV) ? '1' : \
	(BUILD_MONTH_IS_DEC) ? '2' : \
	/* error default */    '?' \
	)

#define BUILD_DAY_CH0 ((__DATE__[4] >= '0') ? (__DATE__[4]) : '0')
#define BUILD_DAY_CH1 (__DATE__[ 5])


#define BUILD_HOUR_CH0 (__TIME__[0])
#define BUILD_HOUR_CH1 (__TIME__[1])

#define BUILD_MIN_CH0 (__TIME__[3])
#define BUILD_MIN_CH1 (__TIME__[4])

#define BUILD_SEC_CH0 (__TIME__[6])
#define BUILD_SEC_CH1 (__TIME__[7])


#if VERSION_MAJOR > 100

#define VERSION_MAJOR_INIT \
	((VERSION_MAJOR / 100) + '0'), \
	(((VERSION_MAJOR % 100) / 10) + '0'), \
	((VERSION_MAJOR % 10) + '0')

#elif VERSION_MAJOR > 10

#define VERSION_MAJOR_INIT \
	((VERSION_MAJOR / 10) + '0'), \
	((VERSION_MAJOR % 10) + '0')

#else

#define VERSION_MAJOR_INIT \
	(VERSION_MAJOR + '0')

#endif


#endif // BUILD_DEFS_H

Генерация даты через разковыривание макроса __DATE__

j123123, 03 Сентября 2021

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

Куча / Говнокод #27633

+2

001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100

// https://wandbox.org/permlink/rAilQ54oYBNsHJ3W

struct blob_p(T,alias t_xmalloc,alias t_free)
{
  blob!(T)* bl_p;

  size_t
  getlen
  (
  ) @trusted
  in
  {
    assert(bl_p != null);
  }
  do
  {
    return bl_p.len;
  }

  T*
  getdata
  (
  ) @trusted
  in
  {
    assert(this.bl_p != null);
  }
  do
  {
    return cast(T*)bl_p.data;
  }


  static bool
  cmp
  (
    typeof(this) a,
    typeof(this) b
  ) @trusted
  in
  {
    assert(a.bl_p != null);
    assert(b.bl_p != null);
  }
  do
  {
    if (a.bl_p.len != b.bl_p.len)
    {
      return false;
    }
    if(memcmp(cast(void*)a.bl_p.data, cast(void*)b.bl_p.data, a.bl_p.len * T.sizeof) != 0)
    {
      return false;
    }
    return true;
  }

  bool
  cmp
  (
    typeof(this) a
  ) @trusted
  in
  {
    assert(a.bl_p != null);
    assert(this.bl_p != null);
  }
  do
  {
    if (a.bl_p.len != this.bl_p.len)
    {
      return false;
    }
    if(memcmp(cast(void*)a.bl_p.data, cast(void*)bl_p.data, a.bl_p.len * T.sizeof) != 0)
    {
      return false;
    }
    return true;
  }

  T opIndex(size_t i)
  in
  {
    assert(bl_p != null);
    assert(bl_p.len > i);
  }
  do
  {
    return getdata()[i];
  }

  ~this()
  /*in
  {
    assert (cast(void*)bl_p != null);
  }
  do*/
  {
    t_free(cast(void*)bl_p);
  }

Попробовал написать на "D" своего рода "массив" с известно каким размером

j123123, 31 Августа 2021

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

Си / Говнокод #27629

+1

01
02
03
04
05
06
07
08
09
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

// https://github.com/mailru/confetti/blob/63ed82c65a7fbcd2baf8a67f1b7410e044dfd1dd/h_dump.c#L44

static void
dumpParamDef(FILE *fh, char* name, ParamDef *def) {
	
	dumpComment(fh, def, 1);
	
	switch(def->paramType) {
		case	int32Type:
			fprintf(fh, "\tint32_t\t%s;\n", def->name);
			break;
		case	uint32Type:
			fprintf(fh, "\tu_int32_t\t%s;\n", def->name);
			break;
		case	int64Type:
			fprintf(fh, "\tint64_t\t%s;\n", def->name);
			break;
		case	uint64Type:
			fprintf(fh, "\tu_int64_t\t%s;\n", def->name);
			break;
		case	doubleType:
			fprintf(fh, "\tdouble\t%s;\n", def->name);
			break;
		case	stringType:
			fprintf(fh, "\tchar*\t%s;\n", def->name);
			break;
		case	boolType:
			fprintf(fh, "\tconfetti_bool_t\t%s;\n", def->name);
			break;
		case	commentType:
			fprintf(stderr, "Unexpected comment"); 
			break;
		case	structType:
			fprintf(fh, "\t%s", name);
			dumpStructName(fh, def->paramValue.structval, "_");
			fprintf(fh, "*\t%s;\n", def->name);
			break;
		case	arrayType:
			fprintf(fh, "\t%s", name);
			dumpStructName(fh, def->paramValue.arrayval->paramValue.structval, "_");
			fprintf(fh, "**\t%s;\n", def->name);
			break;
		case 	builtinType:
			break;
		default:
			fprintf(stderr,"Unknown paramType (%d)\n", def->paramType);
			exit(1);
	}
}

Какое же говно эта ваша сишка. А в крестоговне эта задача легко и элегантно решается, правда ведь?

j123123, 30 Августа 2021

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

C++ / Говнокод #27568

+2

01
02
03
04
05
06
07
08
09
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

// https://github.com/seanbaxter/circle/blob/master/examples/README.md#tldr
// ...
// Circle's primary syntactic element is the @meta keyword, which runs the prefixed statement
// during source translation (or during template instantiation in dependent contexts).

// https://github.com/seanbaxter/circle/blob/master/examples/README.md#same-language-reflection
// duff1.cxx

void duff_copy1(char* dest, const char* source, size_t count) {
  const char* end = source + count;
  while(size_t count = end - source) {
    switch(count % 8) {
      case 0: *dest++ = *source++; // Fall-through to case 7
      case 7: *dest++ = *source++; // Fall-through to case 6...
      case 6: *dest++ = *source++;
      case 5: *dest++ = *source++;
      case 4: *dest++ = *source++;
      case 3: *dest++ = *source++;
      case 2: *dest++ = *source++;
      case 1: *dest++ = *source++;
      break;
    }
  }
}

// Reproduced above is a simplified version of Duff's device, an infamous memcpy function designed
// to reduce the amount of branching in the operation. (The loop is optimally interleaved with the switch,
// but I'm trying to illustrate some other points and don't want to add to the confusion.) Once we enter the
// switch, perform an assignment and unconditionally progress to the next case statement. This algorithm
// cries out for automation. The case statements have indices that run from 8 down to 1, modulo 8. Can we give it the Circle treatment?

// duff2.cxx

void duff_copy2(char* dest, const char* source, size_t count) {
  const char* end = source + count;
  while(size_t count = end - source) {
    switch(count % 8) {
      @meta for(int i = 8; i > 0; --i)
        case i % 8: *dest++ = *source++;
      break;
    }
  }

Но гомоиконности таким подкостыливанием вы естественно не добавите!

j123123, 14 Августа 2021

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

Си / Говнокод #27559

+3

01
02
03
04
05
06
07
08
09
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

#include <stdlib.h>
#include <stdio.h>
#include <inttypes.h>

#define STRING 0
#define INTEGER 1


#define CAT(x,y) x ## _ ## y
#define J(x,y)  CAT(x,y)


typedef union
{
  char *J(v, STRING);
  int J(v,INTEGER);
} Un;

typedef struct
{
  uint8_t Obj_t;
  Un u;
} Object;

#define IF_INSTOF(var, t, newvar) \
if(var.Obj_t == t) \
{ \
  typeof(var.u.J(v,t)) *newvar = &var.u.J(v,t);

int main(void)
{
  Object obj1 = {STRING, {.J(v,STRING) = "1"}};
  
  IF_INSTOF(obj1,STRING,str)
    printf("String: %s\n", *str);
  }
  else
  {
    printf("Not a string\n");
  }

  Object obj2 = {INTEGER, {.J(v,INTEGER) = 1}};
  IF_INSTOF(obj2,INTEGER,i)
    printf("Integer: %d\n", *i);
  }
  else
  {
    printf("Not an Integer\n");
  }

  return EXIT_SUCCESS;
}

Вот такие смарткасты через препроцессор.

https://govnokod.ru/27556#comment655527

j123123, 13 Августа 2021

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

Си / Говнокод #27541

0

01
02
03
04
05
06
07
08
09
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

/* https://fstarlang.github.io/lowstar/html/Introduction.html#the-essence-of-low

Consider the following very simple program:

module Intro

module P = LowStar.Printf
module C = LowStar.Comment
module B = LowStar.Buffer

open FStar.HyperStack.ST
open LowStar.BufferOps

let main (): St Int32.t =
  push_frame ();
  let b: B.buffer UInt32.t = B.alloca 0ul 8ul in
  b.(0ul) <- 255ul;
  C.comment "Calls to printf are desugared via meta-programming";
  let s = "from Low*!" in
  P.(printf "Hello from %s\nbuffer contents: %xul\n"
    s 8ul b done);
  pop_frame ();
  0l

....

Once compiled by the KreMLin compiler, we obtain the following C code:
*/

int32_t main()
{
  uint32_t b[8U] = { 0U };
  b[0U] = (uint32_t)255U;
  /* Calls to printf are desugared via meta-programming */
  Prims_string s = "from Low*!";
  LowStar_Printf_print_string("Hello from ");
  LowStar_Printf_print_string(s);
  LowStar_Printf_print_string("\nbuffer contents: ");
  LowStar_Printf_print_lmbuffer_u32((uint32_t)8U, (uint32_t *)b);
  LowStar_Printf_print_string("\n");
  return (int32_t)0;
}

Какая-то компилируемая в сишку хренотень с завтипами, разрабатываемая в Microsoft Research

j123123, 29 Июля 2021

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

Говнокод: по колено в коде.