repo_name stringlengths 6 97 | path stringlengths 3 341 | text stringlengths 8 1.02M |
|---|---|---|
RonxBulld/anvm | src/Gpu.h | #pragma once
#include <map>
using namespace std;
class Gpu
{
private:
SDL_Surface *SurfacePool[9];
SDL_Renderer *DrawRenderer[10];
Point StartDrawPoint[10];
map<int, SDL_Surface*> ResPool;
SDL_Surface *CreateSurface(int width, int height);
int RequestResourceHandle();
SDL_Surface *GetSurface(int handle);
Uint3... |
RonxBulld/anvm | src/Storage.h | #pragma once
#include <map>
using namespace std;
class Storage
{
private:
map<int, FILE*> FilePool;
public:
void OpenFile(const char *FileName, const int Handle);
void CloseFile(const int Handle);
int ReadFile_Int(const int Handle, const int Offset);
float ReadFile_Float(const int Handle, const int Offset);
unsi... |
RonxBulld/anvm | src/CoreConst.h | #pragma once
#define Z 1
#define B 2
#define BE 3
#define A 4
#define AE 5
#define NZ 6
#define RP 0
#define RF 1
#define RS 2
#define RB 3
#define R0 4
#define R1 5
#define R2 6
#define R3 7
#define REG 0
#define REG_EX 1
#define IMM 2
#define IMM_EX 3
#define DWORD 0
#define WORD 1
#define BYTE 2
#define FLOAT ... |
RonxBulld/anvm | src/ErrorLog.h | #pragma once
void Log(const char *fmt, ...);
void Error(const char *fmt, ...);
void vError(const char *fmt, va_list ap);
|
GEEKiDoS/KsDumper | KsDumperDriver/NTUndocumented.h | #pragma once
#include <ntddk.h>
typedef struct _KAPC_STATE {
LIST_ENTRY ApcListHead[MaximumMode];
struct _KPROCESS *Process;
BOOLEAN KernelApcInProgress;
BOOLEAN KernelApcPending;
BOOLEAN UserApcPending;
} KAPC_STATE, *PKAPC_STATE, *PRKAPC_STATE;
typedef enum _SYSTEM_INFORMATION_CLASS
{
SystemProcessInformation... |
GEEKiDoS/KsDumper | KsDumperDriver/ProcessLister.h | #pragma once
#include <ntddk.h>
#pragma pack(push, 1)
typedef struct _PROCESS_SUMMARY
{
INT32 ProcessId;
PVOID MainModuleBase;
WCHAR MainModuleFileName[256];
UINT32 MainModuleImageSize;
PVOID MainModuleEntryPoint;
BOOLEAN WOW64;
} PROCESS_SUMMARY, *PPROCESS_SUMMARY;
typedef struct _MODULE_SUMMARY
{
PVOID Modul... |
GEEKiDoS/KsDumper | KsDumperDriver/ProcessLister.c | <reponame>GEEKiDoS/KsDumper
#include "NTUndocumented.h"
#include "ProcessLister.h"
#include "Utility.h"
static PSYSTEM_PROCESS_INFORMATION GetRawProcessList()
{
ULONG bufferSize = 0;
PVOID bufferPtr = NULL;
if (ZwQuerySystemInformation(SystemProcessInformation, 0, bufferSize, &bufferSize) == STATUS_INFO_LENGTH_MIS... |
sansuba/SSRecPlayer | SSRP/SSRP.h | //
// SSRP.h
// SSRP
//
// Created by <NAME> on 11/12/15.
// Copyright © 2015 Persystance Networks. All rights reserved.
//
#import <UIKit/UIKit.h>
//! Project version number for SSRP.
FOUNDATION_EXPORT double SSRPVersionNumber;
//! Project version string for SSRP.
FOUNDATION_EXPORT const unsigned char SSRPVersi... |
sansuba/SSRecPlayer | SSRP/VMRecorder.h | <gh_stars>0
//
// VMRecorder.h
// AVRecorder
//
// Created by <NAME> on 9/8/15.
// Copyright (c) 2015 Persystance Networks. All rights reserved.
//
#import <UIKit/UIKit.h>
#import <AVFoundation/AVFoundation.h>
typedef NS_ENUM(NSUInteger, RecordFormat) {
CAF,
M4A
};
typedef void(^BlockPlayingProgress)(flo... |
frugalos/openstack_liberasurecode | src/erasurecode_helpers.c | <filename>src/erasurecode_helpers.c
/*
* Copyright 2014 <NAME>, <NAME>, <NAME>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* lis... |
Eiyeron/squint | src/AsepriteConnection.h | <filename>src/AsepriteConnection.h
#ifndef _SQUINT_ASEPRITECONNECTION_H_
#define _SQUINT_ASEPRITECONNECTION_H_
#include "ixwebsocket/IXConnectionState.h"
#include "ixwebsocket/IXWebSocket.h"
#include "ixwebsocket/IXWebSocketMessageType.h"
#include "raylib.h"
#include <cstdint>
#include <memory>
#include <vector>
#inc... |
Eiyeron/squint | src/Upscaler.h | <filename>src/Upscaler.h
#ifndef _SQUINT_UPSCALER_H_
#define _SQUINT_UPSCALER_H_
#include "raylib.h"
#include <string>
#include <vector>
class Upscaler
{
public:
struct Uniform
{
enum class Type
{
Float,
Int,
};
Type type;
std::string name;
... |
Eiyeron/squint | src/platformSetup.h | <gh_stars>1-10
#ifndef _SQUINT_PLATFORMSETUP_H_
#define _SQUINT_PLATFORMSETUP_H_
void setupLoggingOutput();
void unsetupLoggingOutput();
#endif // _SQUINT_PLATFORMSETUP_H_ |
Dts0/code | MOOC/6.c | <filename>MOOC/6.c
#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Term;
ElementType Expon;
PtrToNode Next;
};
typedef PtrToNode List;
List Read();
void Print(List L);
List Add(List L1, List L2);
List Multi(List L1, List L2);
List MultiByN... |
Dts0/code | linux/hello_mod/hello_mod.c | #include<linux/init.h>
#include<linux/module.h>
MODULE_LICENSE("DualBSD/GPL");
static int hello_init(void)
{
printk(KERN_ALERT "Hello,world\n");
return 0;
}
static void hello_exit(void)
{
printk(KERN_ALERT "Goodbye,world\n");
}
module_init(hello_init);
module_exit(hello_exit);
|
Dts0/code | MOOC/18.c |
#include<stdio.h>
#include<stdlib.h>
#define MAXN 15
int visited[MAXN] = {0};
//建立邻接矩阵 //Create Graph
int G[MAXN][MAXN]={0},NV,NE;
void BuildGraph()
{
//freopen("test1.txt","r",stdin);
int i,j,v1,v2;
scanf("%d%d",&NV,&NE);
for( i=0; i<NE; i++)
{
scanf("%d%d",&v1,&v2);
//InsertEdge
G[v1][v2] = 1;
G... |
Dts0/code | else/fileops.c | #include<stdio.h>
int main(){
FILE* tty;
tty = fopen("./test","w");
fputs("hi",tty);
fclose(tty);
}
|
Dts0/code | student/read.c | #include<stdio.h>
#include<stdlib.h>
struct stu{
int id;
char name[10];
int Mathematics;
int Chinese;
int English;
};
int main(){
FILE *fp;
fp=fopen("student.dat","ab+");
const int size=5;
struct stu student[size];
for(int i=0;i<size;++i){
fgets(&student[i],sizeof(struct stu)+1,fp);
}
fclose(fp);
for... |
Dts0/code | else/1001.c | <filename>else/1001.c<gh_stars>0
#include <stdio.h>
int getCallatzResult(int num);
int main()
{
int input=0;
scanf("%d",&input);
int result=getCallatzResult(input);
printf("%d",result);
return 0;
}
int getCallatzResult(int num)
{
int count=0;
if(num>1000||num<0)
{
return -1;//不符合要求的输入
}
while(num!=1)
{
if... |
Dts0/code | test/test_asm.c | #include<stdio.h>
#include<stdlib.h>
#define clear_block(addr) \
__asm__ __volatile__("cld\n\t" \
"rep\n\t" \
"stosl" \
::"a" (0),"c" (BLOCK_SIZE/4),"D" ((long) (addr)))
#define clear_block(addr) \
__asm__ __volatile__("cld\n\t" \ //清方向位
"rep\n\t" \ // 重复执行存储数据(0).
"stosl"
::"a" (0),"c" ... |
Dts0/code | test/test_stack_overflow.c | #include <stdio.h>
#include <stdlib.h>
void pass(){
/*
printf("456");
exit(0);
*/
int y=0;
printf("%lx ",(unsigned long)&y);
*(&y+8)=456;
}
void pass_ex(int range_min,int range_max){
int tmp=0;
for(int* i=&tmp-range_min;i<&tmp+range_max;++i){
if(*i==123){
*i=456;
... |
Dts0/code | MOOC/2.c | #include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Data;
PtrToNode Next;
};
typedef PtrToNode List;
List Read(); /* 细节在此不表 */
void Print( List L ); /* 细节在此不表；空链表将输出NULL */
List Merge( List L1, List L2 );
int main()
{
List L1, L2, L... |
Dts0/code | else/time.c | #include<stdio.h>
#include<stdlib.h>
#include<time.h>
int main(){
//setenv("TZ","Asia/Shanghai",1);
while(1){
time_t now_1970=time(NULL);//从1970到现在的秒数
struct tm tm_now=*localtime(&now_1970);//现在的年月日等
/*//测试用
tm_now.tm_year=78;
tm_now.tm_mon=1;
tm_now.tm_mday=1;
tm_now.tm_hour=0;
tm_now.tm_min=0;
tm... |
Dts0/code | else/test.c | <gh_stars>0
#include<stdio.h>
#include<stdlib.h>
typedef void (*fun)(void);
void print(){
printf("passed\n");
}
int main(){
fun f=print;
f();
return 0;
}
|
Dts0/code | else/pointer.c | <reponame>Dts0/code
#include<stdio.h>
#include<stdlib.h>
void swap(int* x,int* y){
int tmp;
tmp=*y;
*y=*x;
*x=tmp;
}
int main(){
int x=100,y=999;
printf("%d %d\n",x,y);
swap(&x,&y);
printf("%d %d",x,y);
return 0;
}
/*
int tmp;
tmp=y;
y=x;
x=tmp;
*/
/*
int* tmp_ptr=(int *)malloc(sizeof(int));
*tmp_ptr=y... |
Dts0/code | else/sam.c | #include<stdio.h>
#include<stdlib.h>
int main(){
int a;
int* p;
p=&a;
scanf("%d",p);
printf("%d\n",*p);
return 0;
}
|
Dts0/code | MOOC/3.c | <gh_stars>0
#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
void InorderTraversal( BinTree BT ); /* 中序遍历，由... |
Dts0/code | else/test2.c | <reponame>Dts0/code<gh_stars>0
#include<stdio.h>
#include<stdlib.h>
int main(){
int s0=999;
int s;
s= 3>2?({
s=10;
s0+1;
}):100000;
printf("%d %d\n",s0,s);
return 0;
}
|
Dts0/code | student/write.c | <reponame>Dts0/code
#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
struct stu{
int id;
char name[10];
int Mathematics;
int Chinese;
int English;
};
int main(){
struct stu student;
FILE *fp;
printf("学号\n");
scanf("%d",&student.id);
getchar();
printf("姓名\n");
gets(student.name);
fflush(stdin);
... |
Dts0/code | test/test_inline_addr.c | #include<stdio.h>
#include<stdlib.h>
int add(int x,int y);//inline 函数必须要有前置声明
int inline add(int x,int y){
return x+y;
}
int add2(int x,int y){
return x+y;
}
int main(){
int r=add(2,55);
printf("%d\n%x\n%x\n",r,(unsigned int)&add,(unsigned int)&add2);
return 0;
}
|
Dts0/code | student/test.c | <reponame>Dts0/code
#include <stdlib.h>
#include<stdio.h>
//#include<malloc.h>
//#include<errno.h>
//static int line = 0;
int size = 0;
void head();
void increase();
void _select();
void condition();
int main()
{
//head();
//_select();
head();
return 0;
}
/*
学生类
*/
struct stu
{
int id; //学生学号
char name[10]; //学生名字
in... |
Dts0/code | else/1002_1.c | <gh_stars>0
#include<stdio.h>
void getNums(long long num,int nums[]);
void printNum(int num);
void exchange(int input[],int length);
//1234567890987654321123456789
//1844674407370955161
//超界了,换方法，这个只能处理在longlong即1844674407370955161以内的
int main()
{
long long input=0;
scanf("%lld",&input);
int nums[100];//小于2^100的数字... |
Dts0/code | tools/socketTools/socketServer.c | #include <stdio.h> //perror,printf
#include <stdlib.h> //exit
#include <sys/socket.h> //socket,bind,listen,accept,send,recv
#include <netinet/in.h> //struct sockaddr_in,htons
#include <arpa/inet.h> //inet_addr
#include <unistd.h> //close
#include <string.h> //memset,strcmp
#define SOCKET_ADDR "127.0.0.1"
#define SOCKE... |
Dts0/code | MOOC/1.c | #include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 10
#define NotFound 0
typedef int ElementType;
typedef int Position;
typedef struct LNode *List;
struct LNode {
ElementType Data[MAXSIZE];
Position Last; /* 保存线性表中最后一个元素的位置 */
};
List ReadInput(); /* 裁判实现，细节不表。元素从下标1开始存储 */
Position BinarySearch( List L,... |
Dts0/code | else/1005.c | <filename>else/1005.c
#include<stdio.h>
#include<stdlib.h>
int main(){
int reply=0;
reply=0;
printf("%s",reply);
return 0;
}
|
Dts0/code | MOOC/22.c | <gh_stars>0
#include<stdio.h>
#include<math.h>
#define inf 9999999
int n,d,flag=0,exist=0,newp;
int mark[101];
int path[101];
int distance[101];
struct node{
int x;
int y;
}stu[101];
double dis(int x,int y){
return sqrt(x*x+y*y);
}
int canjump(int x1,int y1,int x2,int y2){
if(sqrt(pow((x1-x2),2)+pow(y1-y2,2))<=d){
... |
Dts0/code | else/1002_2.c | <reponame>Dts0/code<gh_stars>0
#include<stdio.h>
void getNums(char num[],int nums[]);
void getNums_2(int num,int nums[]);
void printNum(int num);
void exchange(int input[],int length);
int atoi(char c);
int main()
{
char input[100];
scanf("%s",input);
int nums[100];
getNums(input,nums);
int sum=0;
for(int i=0... |
Dts0/code | bin/theCat/src/include/reply.h | #ifndef REPLY_H
#define REPLY_H
#include<string>
string reply(string inputStr);
#endif
|
Dts0/code | MOOC/23.c | <filename>MOOC/23.c
#include <stdio.h>
#include <string.h>
#define N 500
#define INF 501
int g[N][N][2], dis[N + 1], known[N], pay[N];
int main() {
int n, m, s, d, i, j, t1, t2, v;
scanf("%d%d%d%d", &n, &m, &s, &d);
for (i = 0;i < n;i++) {
for (j = 0;j < n;j++) {
g[i][j][0] = INF;
g[i][j][1] = INF;
}
}
w... |
Dts0/code | MOOC/21.c | #include <stdio.h>
#define Max 10000
int g[100][100];
int main() {
int n, m, w, i, j, k, maxl, minl = Max;
scanf("%d %d\n", &n, &m);
for (i = 0;i < n;i++) {
for (j = 0;j < n;j++)
g[i][j] = Max;
}
while (m--) {
scanf("%d %d %d\n", &i, &j, &w);
g[i-1][j-1] = w;
g[j-1][i-1] = w;
}
for (k = 0;k < n;k++) {... |
Dts0/code | tools/socketTools/socketClient.c | <filename>tools/socketTools/socketClient.c
#include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#define SOCKET_ADDR "127.0.0.1"
#define SOCKET_PORT 18888
#define MAXSIZE 1024
int main(){
int so... |
csauer42/rover | rpi/include/conversion.h | #ifndef CONVERSION_H
#define CONVERSION_H
#include <cmath>
#include "constants.h"
#include "crc.h"
/** Convert 4 integer motor values to 11-byte serial message */
void convertValues(int*, uint8_t c[]);
/** Remove any 0xFF byte from command before applying CRC */
void filterCommand(uint8_t c[]);
#endif
|
csauer42/rover | rpi/include/serial_comms.h | #ifndef SERIAL_COMMS_H
#define SERIAL_COMMS_H
#include <iostream>
#include <cstdio>
#include <cstring>
#include <termios.h>
#include <unistd.h>
#include <ctime>
#include <cstdint>
#include "constants.h"
/** writes command to serial device and reads reply */
float writeCommand(uint8_t[], int);
#endif
|
csauer42/rover | rpi/include/Rover.h | #ifndef ROVER_H
#define ROVER_H
#include <iostream>
#include <cstdint>
#include <cstdlib>
#include <zmq.hpp>
#include "serial_setup.h"
#include "conversion.h"
#include "serial_comms.h"
/** Rover Class, handles tranfer and conversion
of control values and voltage reads */
class Rover {
public:
/** Constructo... |
csauer42/rover | rpi/include/crc.h | <gh_stars>0
#ifndef CRC_H
#define CRC_H
#define CRC16INIT 0xFFFF
#define CRC8INIT 0x00
#include <cstdint>
// crc implementations borrowed from <util/crc16.h>
uint16_t crc16_update(uint16_t, uint8_t);
uint16_t calculate_crc16(unsigned char[], int size);
uint8_t crc_ibutton_update(uint8_t crc, uint8_t data);
uint8_t c... |
csauer42/rover | rpi/include/serial_setup.h | #ifndef SERIAL_SETUP_H
#define SERIAL_SETUP_H
#include <cstring>
#include <cstdlib>
#include <termios.h>
#include <sys/ioctl.h>
#include <sys/file.h>
#include <fcntl.h>
#include <cstdio>
#include <time.h>
#include <unistd.h>
#include <errno.h>
/** error codes */
#define ERRLOPEN -1
#define ERRLLOCK -2
#define... |
csauer42/rover | avr/MotorControlV1/MotorControlV1/main.c | <gh_stars>0
/** MotorControl for Rover project, handles 6x pwm
* channels for dc/servo motor control and battery
* voltage read through adc, controlled via UART
*/
#define F_CPU 8000000UL
#define BAUDRATE 38400
#define BAUD_PRESCALLER (((F_CPU / (BAUDRATE * 16UL))) - 1)
#define CLENGTH 11
#define START 0xFF
#defi... |
csauer42/rover | rpi/include/constants.h | <filename>rpi/include/constants.h
#ifndef CONSTANTS_H
#define CONSTANTS_H
#define CLENGTH 11 // length of serial command
#define MAXMOTOR 255.0 // maximum value for dc motor (8-bit)
#define LOOK_OFFSET 511 // offset value for servo motor (10-bit)
#define FILTER_BYTE 0xFF // start byte for serial read, do ... |
dannys42/DTSAnalytics | Example/Pods/Target Support Files/Pods-DTSAnalytics_Example/Pods-DTSAnalytics_Example-umbrella.h | #ifdef __OBJC__
#import <UIKit/UIKit.h>
#endif
FOUNDATION_EXPORT double Pods_DTSAnalytics_ExampleVersionNumber;
FOUNDATION_EXPORT const unsigned char Pods_DTSAnalytics_ExampleVersionString[];
|
dannys42/DTSAnalytics | Example/Pods/Target Support Files/Pods-DTSAnalytics_Tests/Pods-DTSAnalytics_Tests-umbrella.h | <reponame>dannys42/DTSAnalytics<gh_stars>0
#ifdef __OBJC__
#import <UIKit/UIKit.h>
#endif
FOUNDATION_EXPORT double Pods_DTSAnalytics_TestsVersionNumber;
FOUNDATION_EXPORT const unsigned char Pods_DTSAnalytics_TestsVersionString[];
|
dannys42/DTSAnalytics | Example/Pods/Target Support Files/DTSAnalytics/DTSAnalytics-umbrella.h | #ifdef __OBJC__
#import <UIKit/UIKit.h>
#endif
FOUNDATION_EXPORT double DTSAnalyticsVersionNumber;
FOUNDATION_EXPORT const unsigned char DTSAnalyticsVersionString[];
|
zouboan/incubator-nuttx | libs/libc/stdlib/lib_atexit.c | /****************************************************************************
* libs/libc/stdlib/lib_atexit.c
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright own... |
zouboan/incubator-nuttx | sched/tls/task_initinfo.c | /****************************************************************************
* sched/tls/task_initinfo.c
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownersh... |
zouboan/incubator-nuttx | sched/pthread/pthread_cancel.c | /****************************************************************************
* sched/pthread/pthread_cancel.c
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ow... |
zouboan/incubator-nuttx | sched/tls/tls.h | /****************************************************************************
* sched/tls/tls.h
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership. The
... |
Patrik-Berglund/esp8266-mqtt-nexa-bridge | user/user_main.c | <filename>user/user_main.c
/*
* Copyright (c) 2014-2015, <NAME> <tuanpm at live dot com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above ... |
esotericist/frf | src/main/vm.h | <filename>src/main/vm.h
#ifndef VM_H_
#define VM_H_
struct node_state* newnode();
proc* newprocess( struct node_state *N );
proc* process_from_pid(struct node_state *N, size_t pid );
void process_setactive( proc *P );
void process_setinactive( proc *P );
void process_reset( proc *P, size_t reasonatom );
void process_... |
esotericist/frf | src/main/vm.c | <gh_stars>1-10
#include <stdio.h>
#include <string.h>
#include "datatypes.h"
#include "atoms.h"
#include "stack.h"
#include "vm.h"
atom(active)
atom(inactive)
atom(killed)
atom(callstack_overflow)
atom(exit)
void definelist_add( struct node_state *N, sfs key, sfs value ) {
sfs k = sfsnew(key);
if ( !(sfsc... |
esotericist/frf | src/main/events.h | #ifndef files_H_
#define files_H_
#include "datatypes.h"
#include "atoms.h"
#include <uv.h>
extern uv_loop_t *uvloop;
void events_initialization();
void events_teardown();
#endif |
esotericist/frf | src/main/structures.c | <gh_stars>1-10
#include "prims.h"
#include "stdlib.h"
#include "stack.h"
#include "vm.h"
atom(range_error)
#pragma GCC push_options
#pragma GCC optimize("align-functions=16")
void copy_span( struct array_span *source, struct array_span *dest ) {
for(size_t i = 0; i < source->size; i++ ) {
dest... |
esotericist/frf | src/main/compile.h | #ifndef COMPILE_H_
#define COMPILE_H_
void initcommonstring();
void parse_line( proc *P, sfs input );
#endif
|
esotericist/frf | src/main/events.c | <gh_stars>1-10
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <unistd.h>
#include <dirent.h>
#include "stack.h"
#include "vm.h"
#include "events.h"
#include "structures.h"
#include "prims.h"
uv_loop_t *uvloop;
// definitions for various event things
typ... |
esotericist/frf | src/main/prims.h | <reponame>esotericist/frf
#ifndef PRIMS_H_
#define PRIMS_H_
#include "datatypes.h"
#include "atoms.h"
struct preprim {
void *thefunc;
char *prim;
};
struct preprim *preprims; size_t numpreprims;
void preregisterprim( void *thefunc, char *str );
void finalizeprims( struct node_state *N );
#define prim(x) \... |
esotericist/frf | src/main/compile.c |
#include "datatypes.h"
#include "compile.h"
#include "prims.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "vm.h"
int errorstate = 0;
#define pmode P->compilestate->parsemode
#define vset P->current_codestream->vars
uintptr_t tag_prim (void *v) {
return ( (uintptr_t)(void *) v ) | 3;
}
... |
esotericist/frf | src/main/frf.c | <filename>src/main/frf.c
#include <gc.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <uv.h>
#include "frf.h"
#include "datatypes.h"
#include "atoms.h"
#include "compile.h"
#include "prims.h"
#include "stack.h"
#include "events.h"
#include "vm.h"
atom(exit)
sfs readfile( proc *P ) {
sfs to... |
esotericist/frf | src/main/datatypes.c | <gh_stars>1-10
#include "datatypes.h"
#include "vm.h"
#include "atoms.h"
SGLIB_DEFINE_LIST_FUNCTIONS(qListType, QLIST_COMPARATOR, next_ptr)
SGLIB_DEFINE_SORTED_LIST_FUNCTIONS(iListType, ILIST_COMPARATOR, next_ptr)
SGLIB_DEFINE_HASHED_CONTAINER_FUNCTIONS(iListType, ilist_hash_size, ilist_hash_function )
SGLIB_DEFINE_... |
esotericist/frf | src/main/prims.c | <gh_stars>1-10
#include <stdlib.h>
#include "prims.h"
#include "stack.h"
#include "vm.h"
// #region prim registration
void preregisterprim(void *thefunc, char *s)
{
preprims = realloc(preprims, sizeof(struct preprim) * (numpreprims + 1));
preprims[numpreprims].thefunc = thefunc;
preprims[numpreprims].prim ... |
plaes/envytools | nva/nvaevo.c | /*
* Copyright 2011 Red Hat Inc.
* All Rights Reserved.
*
* 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, m... |
plaes/envytools | include/rnn.h | /*
* Copyright (C) 2010 <NAME> <<EMAIL>>
* Copyright (C) 2010 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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 w... |
plaes/envytools | nva/nvapoke.c | /*
* Copyright (C) 2010-2011 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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... |
plaes/envytools | rnn/dedma_back.c | /*
* Copyright (C) 2010 <NAME>.
* All Rights Reserved.
*
* 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, mo... |
plaes/envytools | include/nva.h | /*
* Copyright (C) 2010-2011 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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... |
plaes/envytools | nva/nvapms.c | <filename>nva/nvapms.c
/*
* Copyright (C) 2011 <NAME> <<EMAIL>>
* Copyright (C) 2012 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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 r... |
plaes/envytools | nva/set_timings.c | /*
* Copyright 2011 <NAME> (inspired from <NAME>'s work)
*
* 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, m... |
plaes/envytools | nva/nva.c | /*
* Copyright (C) 2010-2011 <NAME> <<EMAIL>>
* Copyright (C) 2011 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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, includ... |
plaes/envytools | nva/nvalist.c | <filename>nva/nvalist.c
/*
* Copyright (C) 2010-2011 <NAME> <<EMAIL>>
* All Rights Reserved.
*
* 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 lim... |
greg-minshall/flstats | flstats.c | /*
* Copyright (c) 1996
* Ipsilon Networks, Inc.
*
* please see terms and conditions of copyright at the end of this file
*/
/*
* output flow statistics from a tcpdump file.
*
*/
static char *flstats_c_rcsid = "$Id: af0d9d167513dbbf27d9045dad2e66733f2523b6 $";
#include "config.h"
#define _GNU_SOURCE /* nee... |
greg-minshall/flstats | flstats.h | /*
* Copyright (c) 1996
* Ipsilon Networks, Inc.
*
* please see terms and conditions of copyright at the end of this file
*
*/
/*
* output flow statistics from a tcpdump file.
*
*/
static char *flstats_h_rcsid = "$Id: 004d9c199d7b5d469bd612f292de926b6df18ef6 $";
/* global preprocessor defines */
#define MA... |
MyDevNote/Estrutura-de-dados | alocacaode_memoria.c | # include <stdio.h>
int main(){
int x = 25; // A variável x é iniciada com valor 25
int* y = &x; // A variável y recebe o endereço onde a variável x esta alocada
*y = 30;
int a = sizeof(int);
printf("%i %i %i", *y, &x, a);
return 0;
} |
MyDevNote/Estrutura-de-dados | aula_07.c | void
void
main(){
insere(10, lista);
}
void insere(int nr, struct no *)
void exibir(struct no *plista){
struct no *aux;
aux = plista;
if(aux!=NULL){
while(aux != NULL){
printf("[%x] %d -> %x\n", aux, aux->info, aux->prox);
aux = aux->prox;
}
}
else{
printf("A lista esta vazia\n");
}
} |
MyDevNote/Estrutura-de-dados | Funcao_maloc.c | <reponame>MyDevNote/Estrutura-de-dados
// Função Malloc
# include <stdio.h>
# include <malloc.h>
int main() {
int* y = (int*) malloc(sizeof(int));
*y = 20;
int z = sizeof(int);
printf("*y= %i z= %i\n ymalloc= %i", *y, z,y);
return 0;
} |
MyDevNote/Estrutura-de-dados | teste.c | #define TAM 10000
main()
{
int inicio, final, tempo_decorrido;
int vetor[TAM],x,y,aux;
x = 0;
y = 0;
aux = 0;
printf("\nGerando um vetor com %d inteiros aleatorios:\n",TAM);
for(x = 0; x < TAM; x++ )
{
vetor[x] = rand() % 100;
printf("%d\t", vetor[x]);
}
getchar();
inicio = GetTickCount();
for( x = 0; x < TA... |
Millionaryearl/CW2DTable | Pod/Classes/CW2DTableVC.h | <gh_stars>1-10
//
// TwoDStatisticVController.h
// SmartOrder-V2
//
// Created by millionaryearl on 14-5-9.
// Copyright (c) 2014年 Shanghai AgileMobi Co., Ltd. All rights reserved.
//
#import <UIKit/UIKit.h>
#import "CW2DTableLayout.h"
@interface CW2DTableVC : UICollectionViewController <UIPopoverControllerDelega... |
Millionaryearl/CW2DTable | CW2DTableLayoutStyle4.h | //
// CW2DTableLayoutStyle4.h
// Pods
//
// Created by millionaryearl on 14/12/4.
//
//
#import <UIKit/UIKit.h>
@interface CW2DTableLayoutStyle4 : UICollectionViewLayout
@property (nonatomic)UIOffset itemOffSet;
@end
|
Millionaryearl/CW2DTable | CW2DTableVC4.h | <gh_stars>1-10
//
// CW2DTableVC4.h
// Pods
//
// Created by millionaryearl on 14/12/4.
//
//
#import <UIKit/UIKit.h>
@interface CW2DTableVC4 : UICollectionViewController
@end
|
Millionaryearl/CW2DTable | Pod/Classes/CW2DTableCell.h | //
// TwoDContentCell.h
// SmartOrder-V2
//
// Created by millionaryearl on 14-5-9.
// Copyright (c) 2014年 Shanghai AgileMobi Co., Ltd. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface CW2DTableCell : UICollectionViewCell
@property(nonatomic,strong)IBOutlet UILabel *nameLabel;
@end
|
Millionaryearl/CW2DTable | CW2DTableVC3.h | <filename>CW2DTableVC3.h
//
// CW2DTableVC3.h
// Pods
//
// Created by millionaryearl on 14/12/2.
//
//
#import <UIKit/UIKit.h>
@interface CW2DTableVC3 : UICollectionViewController
@end
|
Millionaryearl/CW2DTable | Example/CW2DTable/CWAppDelegate.h | <reponame>Millionaryearl/CW2DTable<filename>Example/CW2DTable/CWAppDelegate.h
//
// CWAppDelegate.h
// CW2DTable
//
// Created by CocoaPods on 07/29/2014.
// Copyright (c) 2014 Millionaryearl. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface CWAppDelegate : UIResponder <UIApplicationDelegate>
@property... |
Millionaryearl/CW2DTable | CW2DTabeLayoutStyle3.h | <filename>CW2DTabeLayoutStyle3.h
//
// CW2DTabeLayoutStyle3.h
// Pods
//
// Created by millionaryearl on 14/12/2.
//
//
#import <UIKit/UIKit.h>
@interface CW2DTabeLayoutStyle3 : UICollectionViewLayout
@property (nonatomic)UIOffset itemOffSet;
@end
|
Millionaryearl/CW2DTable | CW2DTableVC2.h | <gh_stars>1-10
//
// CW2DTableVC2.h
// Pods
//
// Created by millionaryearl on 14/11/26.
//
//
#import <Foundation/Foundation.h>
#import "CW2DTableLayoutStyle2.h"
@interface CW2DTableVC2 : UICollectionViewController
@end
|
Millionaryearl/CW2DTable | Pod/Classes/CW2DTableLayout.h | //
// TwoDStatisticLayout.h
// SmartOrder-V2
//
// Created by millionaryearl on 14-5-9.
// Copyright (c) 2014年 Shanghai AgileMobi Co., Ltd. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface CW2DTableLayout : UICollectionViewLayout
@property (nonatomic)UIOffset itemOffSet;
@end
|
tvl83/fio | libraries/wasm-jit/Include/Emscripten/Emscripten.h | <filename>libraries/wasm-jit/Include/Emscripten/Emscripten.h
#pragma once
#ifndef EMSCRIPTEN_API
#define EMSCRIPTEN_API DLL_IMPORT
#endif
#include <vector>
namespace IR { struct Module; }
namespace Runtime { struct ModuleInstance; }
namespace Emscripten {
EMSCRIPTEN_API void initInstance(const IR::Module &modul... |
tvl83/fio | libraries/wasm-jit/Include/Logging/Logging.h | #pragma once
#ifndef LOGGING_API
#define LOGGING_API DLL_IMPORT
#endif
#include "Inline/BasicTypes.h"
#include "Platform/Platform.h"
// Debug logging.
namespace Log {
// Allow filtering the logging by category.
enum class Category {
error,
debug,
metrics,
num
};
LOGGIN... |
tvl83/fio | libraries/wasm-jit/Source/Runtime/LLVMJIT.h | <reponame>tvl83/fio
#pragma once
#include "Inline/BasicTypes.h"
#include "Platform/Platform.h"
#include "RuntimePrivate.h"
#include "Intrinsics.h"
#ifdef _WIN32
#pragma warning(push)
#pragma warning (disable:4267)
#pragma warning (disable:4800)
#pragma warning (disable:4291)
#pragma warning (disable:4244)
#pragma war... |
tvl83/fio | libraries/builtins/fixunstfti.c | <reponame>tvl83/fio
/* ===-- fixunstfsi.c - Implement __fixunstfsi -----------------------------===
*
* The LLVM Compiler Infrastructure
*
* This file is dual licensed under the MIT and the University of Illinois Open
* Source Licenses. See LICENSE.TXT for details.
*
* ===--------------------... |
tvl83/fio | libraries/chain/include/eosio/chain/fioio/fioserialize.h | <filename>libraries/chain/include/eosio/chain/fioio/fioserialize.h<gh_stars>10-100
/** fio serialize definitions file
* Description: This account will help the chain plugin and contracts to serialize fioaddresses into hashed values.
* @author <NAME> / <NAME>
* @file fioserialize.hpp
* @license FIO Foundation ( ... |
tvl83/fio | libraries/wasm-jit/Include/IR/IR.h | #pragma once
#include "Platform/Platform.h"
#ifndef IR_API
#define IR_API DLL_IMPORT
#endif
namespace IR {
enum {
maxMemoryPages = (Uptr) 65536
};
enum {
numBytesPerPage = (Uptr) 65536
};
enum {
numBytesPerPageLog2 = (Uptr) 16
};
enum {
requireSharedFlagFo... |
tvl83/fio | libraries/wasm-jit/Include/Runtime/TaggedValue.h | #pragma once
#include "IR/Types.h"
#include "Inline/Floats.h"
#include <string.h>
#undef ENABLE_SIMD_PROTOTYPE
namespace Runtime {
// A runtime value of any type.
struct UntaggedValue {
union {
I32 i32;
U32 u32;
I64 i64;
U64 u64;
F32 f32;
... |
tvl83/fio | libraries/wasm-jit/Source/WAST/Parse.h | #pragma once
#include "Inline/BasicTypes.h"
#include "WAST.h"
#include "Lexer.h"
#include "IR/Types.h"
#include "IR/Module.h"
#include <functional>
#include <map>
#include <unordered_map>
namespace WAST {
struct FatalParseException {
};
struct RecoverParseException {
};
// Like WAST::Error, but ... |
tvl83/fio | libraries/wasm-jit/Source/Programs/CLI.h | #pragma once
#include "Inline/BasicTypes.h"
#include "Inline/Floats.h"
#include "Inline/Timing.h"
#include "WAST/WAST.h"
#include "WASM/WASM.h"
#include "IR/Module.h"
#include "IR/Validate.h"
#include "Runtime/Runtime.h"
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <cstring>
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.