Skip to content

Instantly share code, notes, and snippets.

@choupi
choupi / JN5121.c
Created May 30, 2012 07:52 — forked from aqzhh/JN5121.c
開放-JN5121 coordinator
@@@@@@@@@@@@
edit test @@@@@@@@@@@@@@@@@@@@@
@@@@@@@@@@@@
/****************************************************************************
*
* MODULE: WSN - Coordinator
*
* COMPONENT: $RCSfile: WSN_Coordinator.c,v $
*
@choupi
choupi / gist:3851535
Created October 8, 2012 09:04 — forked from chihchun/gist:753181
NextVOD
壹多媒體娛樂服務股份有限公司 壹網樂/網樂通, https://www.nextvod.com.tw/ #nextvod #nextv
H/W
STMicroelectronics STx7105 (Renesas SuperH Core)
VIA VT6113 (Ethernet)
NANYA NT5TU64M16GG-AC (DRAM DDR2 64Mx16 PC800 BGA) * 2
Samsung NCDOM08GMS-MLC (USB DOM 8GB)
Winbond 25Q80 1MB Spi Flash (Onboard Flash)
Console Pin headers
@choupi
choupi / COSCUP 2013 Day 1
Last active December 20, 2015 14:59 — forked from denny0223/COSCUP 2013 Day 1
COSCUP 2013 IRC log
--- Day changed Sat Aug 03 2013
00:11 < tsai> :)
00:13 < pichuang_> 好多人
00:14 < darkgerm> 差點忘記進來了XD
00:17 < darkgerm> pichuang: 學弟好 (?
00:17 < Jedi_> 隨手亂拿了一些奇怪的小禮品,實用性可疑,笑果若干,今、明兩天如果你剛好帶著拙著《簡報原力》或我的其他著作/譯作出席,請來跟我打個招呼,領取隨機小禮~ :p
00:22 < darkgerm> pichuang: 啊!原來是學長... 只看學號以為是學弟 <冏>
00:23 < chihhsin> darkgerm: 黑駿~
00:23 < pichuang> 沒關係 我現在還沒有搞清楚狀況中XD
00:25 < darkgerm> chihhsin: hihi~
@choupi
choupi / extand fork()
Last active December 23, 2015 12:18
init/main.c: process 0 -> process 1
int fork(void)
{
long __res;
__asm__ volatile ("int $0x80"
: "=a" (__res)
: "0" (__NR_ fork)) ;
if (__res >= 0)
return (int) __res;
errno = -__res;
return -1;
@choupi
choupi / ctos.c
Last active December 24, 2015 03:29
glibc
#include <stdio.h>
//void my_init(void) __attribute__ ((constructor));
void my_init(void)
{
printf("ctos\n");
}
typedef void (*ctor_t)(void);
ctor_t __attribute__((section(".ctors"))) my_init_p=&my_init;
@choupi
choupi / n.c
Created July 6, 2014 04:24
find max n such that s <= LONG_MAX, for s=1+2+3+...+n (O(1) algorithm)
#include <stdio.h>
#include <limits.h>
#include <math.h>
int main()
{
double nn=(1+sqrt(1+4.0*LONG_MAX*2.0))/2.0;
long int n= nn, s=n/2*(n-1),t;
printf("%lf %lf\n", nn, log(nn)/log(2.0));
printf("%ld %ld %ld\n", n, s, s+n+1);
--- Day changed Sat Jul 19 2014
00:17 < Guest10976> 請問沒有帶識別証 還有救嗎
00:18 < Guest10976> 各位大大救命呀
01:47 < S3p_lin> 嗯? 網站上面沒有 R0 R1 R2 H1 H2 H3 H4 的分布圖?
01:48 < wens> S3p_lin: R0 R1 R2 照舊吧
01:49 < wens> S3p_lin: 活動中心就是外面有摩斯那邊
01:53 < S3p_lin> wens: hmm
01:57 < wens> 竟然兩點了 明天爬不起來QQ
01:57 < Heero> 五點得搭統聯北上...
02:02 < shtzeng_tw> 最近特別累啊 orz
--- Day changed Thu Aug 21 2014
05:52 < iddqd> morning
07:21 < MrQ_> m0rning 0.0
07:34 < susu> good morning~
08:00 < newbuy_> 早安! 揪竟能不能到現場呢?
08:04 < Lunpin> good morning
08:06 < newbuy_> @Lunpin 早 跟您一樣鍵盤參加了:'(
08:14 < Lunpin> Q___Q
08:15 < AlpacaZoo> [HTTP] 140.109.127.10:8944 -> 54.254.253.233:80 666 / # market.voga360.com/j****
08:15 < iddqd> wow
@choupi
choupi / submit time
Last active August 29, 2015 14:06
阿美語submit分析
186 31/Aug/2014:14:
196 31/Aug/2014:15:
129 31/Aug/2014:16:
34 31/Aug/2014:17:
31 31/Aug/2014:18:
32 31/Aug/2014:19:
28 31/Aug/2014:20:
92 31/Aug/2014:21:
306 31/Aug/2014:22:
242 31/Aug/2014:23:
@choupi
choupi / mg.hs
Created January 7, 2015 02:59
mergesort in haskell
mergesort :: Ord a => [a] -> [a]
mergesortM :: Ord a => [a] -> [a] -> [a]
mergesortM a [] = a
mergesortM [] a = a
mergesortM (a:ax) (b:bx)
| a>b = [a] ++ (mergesortM ax ([b] ++ bx))
| otherwise =[b] ++ (mergesortM ([a] ++ ax) bx)
mergesort [] = []
mergesort [a] = [a]