This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# TOOLS | |
CPP = g++ | |
CC = gcc | |
# MORE TOOLS | |
SIZE = size | |
OBJCOPY = objcopy | |
OBJDUMP = objdump | |
#PROJECT RELATED STUFF |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void print_list(void) | |
{ | |
int x; | |
for(x=0; x < (word_count);printf("Word %d is: %s\n",x,words[x++])) | |
; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
extern printf | |
section .rodata ; data section | |
pstr: db "rax = %d",10,0 ; rax = %d\n\0 | |
num: dq 5 | |
section .text ; code section | |
global main ; make label available to linker | |
main: ; standard gcc entry point |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* * * * * * * * * | |
* | |
* Help routine for remove_word_from_tree | |
* this recursive function finds the 'alphabetically largest' | |
* word in (sub-)tree. This means: it returns a pointer | |
* to the word that has the largest value out of strcmp(). | |
* | |
* * * * * * * * */ | |
const char * // help routine for the above function | |
branch::get_largest_word(void) const |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'prime' | |
require 'mathn' | |
Prime.each(600851475143/3) do |prime| | |
if ((600851475143%prime)) == 0 | |
puts prime | |
end | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int main(void) | |
{ | |
char buf[] = "string"; | |
char * str = buf; | |
printf("hallo %x\n", (int)str); | |
return 0; | |
} | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
update_interval 2 | |
total_run_times 0 | |
net_avg_samples 1 | |
cpu_avg_samples 1 | |
imlib_cache_size 0 | |
double_buffer yes | |
no_buffers yes | |
format_human_readable | |
background true | |
use_xft yes |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
NAME := tetris | |
CXX := g++ | |
SIZE := size | |
DEBUGGER := ddd | |
DEBUGGERFLAGS := | |
# Default target is debug | |
ifeq ($(TARGET),) | |
TARGET=debug | |
endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from .yaml_reader import * |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PWM on the DE0 board | |
The pll is left out. Its 50MHz in, 1MHz out, generated by quartus |
OlderNewer