Tweet
Tweet

Slide 1

Slide 1 text

node-ffi othree jsdc

Slide 2

Slide 2 text

@othree othree.net MozTW F2E at HTC PhD Candidate

Slide 3

Slide 3 text

Topics r3 ffi node-ffi node-ffi packages node-r3

Slide 4

Slide 4 text

r3 ˖ 4VQFSGBTUSPVUFSMJCXSJUUFOJO$ ˖ CZDT https://github.com/c9s/r3

Slide 5

Slide 5 text

r3 ˖ #BTFEPO%'" 焷㹁剤ꣳ朜䢀荈⹛堥  ˖ 1SFDPNQJMFSPVUFTJOUPQSFYUSFF ˖ UJNFTGBTUFSUIBO+PVSOFZ http://c9s.blogspot.tw/2014/05/r3-url-router-library.html

Slide 6

Slide 6 text

How to Use libr3 ˖ $SFBUFUSFF ˖ *OTFSUSPVUFXJUIEBUB ˖ $PNQJMFUSFF ˖ .BUDISPVUFBOEHFUUIFEBUB

Slide 7

Slide 7 text

Sample 1/2 n = r3_tree_create(10);! ! int route_data = 3;! ! r3_tree_insert_routel(n, METHOD_GET, "/blog/post", ! sizeof("/blog/post") - 1, &route_data );! ! int err = r3_tree_compile(n, &errstr);

Slide 8

Slide 8 text

Sample 1/2 n = r3_tree_create(10);! ! int route_data = 3;! ! r3_tree_insert_routel(n, METHOD_GET, "/blog/post", ! sizeof("/blog/post") - 1, &route_data );! ! int err = r3_tree_compile(n, &errstr); Create Tree

Slide 9

Slide 9 text

Sample 1/2 n = r3_tree_create(10);! ! int route_data = 3;! ! r3_tree_insert_routel(n, METHOD_GET, "/blog/post", ! sizeof("/blog/post") - 1, &route_data );! ! int err = r3_tree_compile(n, &errstr); Insert Route

Slide 10

Slide 10 text

Sample 1/2 n = r3_tree_create(10);! ! int route_data = 3;! ! r3_tree_insert_routel(n, METHOD_GET, "/blog/post", ! sizeof("/blog/post") - 1, &route_data );! ! int err = r3_tree_compile(n, &errstr); Data

Slide 11

Slide 11 text

Sample 1/2 n = r3_tree_create(10);! ! int route_data = 3;! ! r3_tree_insert_routel(n, METHOD_GET, "/blog/post", ! sizeof("/blog/post") - 1, &route_data );! ! int err = r3_tree_compile(n, &errstr); Compile

Slide 12

Slide 12 text

No content

Slide 13

Slide 13 text

Sample 2/2 match_entry * entry = match_entry_create("/blog/post");! entry->request_method = METHOD_GET;! ! route *matched_route = r3_tree_match_route(n, entry);! matched_route->data; // The Data! ! match_entry_free(entry);! r3_tree_free(n);

Slide 14

Slide 14 text

Sample 2/2 match_entry * entry = match_entry_create("/blog/post");! entry->request_method = METHOD_GET;! ! route *matched_route = r3_tree_match_route(n, entry);! matched_route->data; // The Data! ! match_entry_free(entry);! r3_tree_free(n); Create Entry

Slide 15

Slide 15 text

Sample 2/2 match_entry * entry = match_entry_create("/blog/post");! entry->request_method = METHOD_GET;! ! route *matched_route = r3_tree_match_route(n, entry);! matched_route->data; // The Data! ! match_entry_free(entry);! r3_tree_free(n); Match Route

Slide 16

Slide 16 text

Sample 2/2 match_entry * entry = match_entry_create("/blog/post");! entry->request_method = METHOD_GET;! ! route *matched_route = r3_tree_match_route(n, entry);! matched_route->data; // The Data! ! match_entry_free(entry);! r3_tree_free(n); Route Data

Slide 17

Slide 17 text

match_entry ˖ 6TFEGPSDBQUVSFWBSJBCMFT ˖ "EENFUIPEDPOEJUJPO ˖ 'VUVSF ˖ *1NBTL ˖ 1PSUSBOHF

Slide 18

Slide 18 text

Captures ˖ 6TF{variable_name}! ˖ $BOVTFSFHVMBSFYQSFTTJPO

Slide 19

Slide 19 text

No content

Slide 20

Slide 20 text

Sample 2/2 match_entry * entry = match_entry_create(“/blog/post/1/2/3“);! entry->request_method = METHOD_GET; // Method Condition! ! route *matched_route = r3_tree_match_route(n, entry);! ! matched_route->data; // The Data! entry->vars; //Captured Vars, a string array! ! r3_tree_free(n);

Slide 21

Slide 21 text

May I Use r3 in node

Slide 22

Slide 22 text

Yes.

Slide 23

Slide 23 text

How?

Slide 24

Slide 24 text

How ˖ /PEFKTFYUFOTJPO ˖ 8SJUF$$ DBBTJOPEFS ˖ 'PSFJHO'VODUJPO*OUFSGBDF ''*  ˖ 6TFEZOBNJDMJC

Slide 25

Slide 25 text

Why ˖ *UNJHIUGBTUFSUIBODVSSFOUTPMVUJPO ˖ 㔔捀䧮〳⟃#FDBVTF*DBO ˖ *BNXSJUJOHNZ1I%UIFTJT *BNXJMMJOHUPEP BOZUIJOHFYDFQUXSJUJOHUIFTJT

Slide 26

Slide 26 text

Foreign Function Interface

Slide 27

Slide 27 text

l "GPSFJHOGVODUJPOJOUFSGBDF ''* JT BNFDIBOJTNCZXIJDIBQSPHSBN XSJUUFOJOPOFQSPHSBNNJOH MBOHVBHFDBODBMMSPVUJOFTPSNBLF VTFPGTFSWJDFTXSJUUFOJOBOPUIFS https://en.wikipedia.org/wiki/Foreign_function_interface

Slide 28

Slide 28 text

˖ #ZVOEFSTUBOEDBMMJOHDPOWFOUJPO ˖ ,OPXIPXUPDBMMGPSFJHOGVODUJPOT TFOE BSHVNFOU BOESFBESFUVSOWBMVF ˖ *OBTTFNCMZMBOHVBHFMFWFM ˖ $BMM$EZOBNJDMJCJONPTUDBTFT

Slide 29

Slide 29 text

__cdecl val = sumExample(2,3) ; // push arguments to the stack, from right to left! push 3 ! push 2 ! ! ; // call the function! call _sumExample ! ! ; // cleanup the stack by adding the size of the arguments to! ; // ESP register! add esp,8 ! ! ; // copy the return value from EAX to a local variable (int c)! mov dword ptr [c],eax

Slide 30

Slide 30 text

node-ffi

Slide 31

Slide 31 text

l OPEFJTB/PEFKTBEEPOGPSMPBEJOH BOEDBMMJOHEZOBNJDMJCSBSJFTVTJOH QVSF+BWB4DSJQU*UDBOCFVTFEUP DSFBUFCJOEJOHTUPOBUJWFMJCSBSJFT XJUIPVUXSJUJOHBOZ$ DPEF https://github.com/node-ffi/node-ffi

Slide 32

Slide 32 text

So node-ffi Knows ˖ )PXUPDBMMGVODUJPOJO$$ EZOBNJDMJC ˖ )PXUPDPOWFSU+BWB4DSJQUEBUBUP$$ EBUB ˖ )PXUPTFOEQBSBNFUFS ˖ )PXUPHSBCSFUVSOWBMVF

Slide 33

Slide 33 text

˖ #Z!5PP5BMM/BUF

Slide 34

Slide 34 text

@TooTallNate ˖ /BUIBO3BKMJDI ˖ /PEFKTDPSFDPNNJUUFS ˖ 0OFBVUIPSPG/PEFKTJO"DUJPO ˖ -PUTPGSFMBUFEQBDLBHF ˖ /PE0CK$ /PEFKT̠0CKFDUJWF$CSJEHF

Slide 35

Slide 35 text

ffi Packages ffi ref ref-struct ref-array

Slide 36

Slide 36 text

ffi Foreign Function Call ref Reference Tools ref-struct Struct Helper ref-array Array Helper

Slide 37

Slide 37 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2

Slide 38

Slide 38 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2 Library name! Use dlopen

Slide 39

Slide 39 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2 A function named ‘ceil’ return double
 Take one double parameter

Slide 40

Slide 40 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2 return type

Slide 41

Slide 41 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2 arguments type

Slide 42

Slide 42 text

Types void bool byte pointer (u)short (u)int (u)int16 (u)int32 (u)int64 (u)longlong size_t float (u)char string object

Slide 43

Slide 43 text

Example var ffi = require('ffi');! ! var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });! ! libm.ceil(1.5); // 2 Call ceil

Slide 44

Slide 44 text

To Use node-ffi ˖ 3FBEIFBEFSMF I  ˖ 8SJUFffi.LibraryEFOJUJPO ˖ 6TFJU

Slide 45

Slide 45 text

math.h http://www.cplusplus.com/reference/cmath/ceil/ double ceil (double x); var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });

Slide 46

Slide 46 text

math.h http://www.cplusplus.com/reference/cmath/ceil/ double ceil (double x); var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });

Slide 47

Slide 47 text

math.h http://www.cplusplus.com/reference/cmath/ceil/ double ceil (double x); var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });

Slide 48

Slide 48 text

math.h http://www.cplusplus.com/reference/cmath/ceil/ double ceil (double x); var libm = ffi.Library('libm', {! 'ceil': [ 'double', [ 'double' ] ]! });

Slide 49

Slide 49 text

r3.h

Slide 50

Slide 50 text

No content

Slide 51

Slide 51 text

No content

Slide 52

Slide 52 text

Struct?

Slide 53

Slide 53 text

Struct ˖ "TUSVDUJTBDUVBMMZBQPJOUFS ˖ 0LUPVTFQPJOUFS ˖ /PUPLUPVTFQPJOUFSJGXBOUUPMPBEJUTQSPQFSUZ ˖ 6TFSFGTUSVDU

Slide 54

Slide 54 text

struct _edge {! char * pattern; // 8 bytes! node * child; // 8 bytes! unsigned char pattern_len; // 1 byte! unsigned char opcode:4; // 4 bit! unsigned char has_slug:1; // 1 bit! }; var StructType = require('ref-struct');! ! var edge = StructType({! pattern: "string",! child: "pointer",! pattern_len: "ushort",! opcode: "uchar",! has_slug: "uchar"! });

Slide 55

Slide 55 text

ref-struct ˖ $SFBUF"#*DPNQMJBOUTUSVDUJOTUBODFTPOUPQPG #VFST ˖ "#* "QQMJDBUJPO#JOBSZ*OUFSGBDF  ˖ UIFTJ[FT MBZPVU BOEBMJHONFOUPGEBUBUZQFT ˖  https://en.wikipedia.org/wiki/Application_binary_interface

Slide 56

Slide 56 text

https://mentorembedded.github.io/cxx-abi/abi.html

Slide 57

Slide 57 text

https://mentorembedded.github.io/cxx-abi/

Slide 58

Slide 58 text

Struct in Struct?

Slide 59

Slide 59 text

typedef struct {! str_array * vars;! const char * path; // current path to dispatch! int path_len; // the length of the current path! int request_method; // current request method! void * data; // route ptr! char * host; // the request host! ! ...

Slide 60

Slide 60 text

typedef struct {! str_array * vars;! const char * path; // current path to dispatch! int path_len; // the length of the current path! int request_method; // current request method! void * data; // route ptr! char * host; // the request host! ! ... var ref = require('ref');! ! var str_array = StructType({ ... });! ! var match_entry = StructType({! vars: ref.refType(str_array),! path: "string",! path_len: "int",! request_method: "int",! data: "pointer",! host: "pointer",! ...

Slide 61

Slide 61 text

lSFGJTBOBUJWFBEEPOGPS/PEFKT UIBUBJETJOEPJOH$QSPHSBNNJOH JO+BWB4DSJQU CZFYUFOEJOHUIF CVJMUJO#VFSDMBTT https://tootallnate.github.io/ref/

Slide 62

Slide 62 text

No content

Slide 63

Slide 63 text

ref.refType ˖ (FUSFGFSFODFUPEBUBUZQF

Slide 64

Slide 64 text

l3FUVSOTBOFXDMPOFPGUIFHJWFO UZQFPCKFDU XJUIJUTJOEJSFDUJPO MFWFMJODSFNFOUFECZ https://tootallnate.github.io/ref/

Slide 65

Slide 65 text

ref.refType ˖ (FUSFGFSFODFUPEBUBUZQF ˖ indirectionNFBOTUIFDPVOUPG*

Slide 66

Slide 66 text

ref.refType StructType({! var1: str_array,! var2: ref.refType(str_array)! }); str_array var1;! str_array * var2;

Slide 67

Slide 67 text

ref.refType StructType({! var1: str_array,! var2: ref.refType(str_array)! }); str_array var1;! str_array * var2;

Slide 68

Slide 68 text

ref.refType StructType({! var1: str_array,! var2: ref.refType(str_array)! }); str_array var1;! str_array * var2;

Slide 69

Slide 69 text

ref.refType StructType({! var1: str_array,! var2: ref.refType(str_array),! var3: ref.refType(ref.refType(str_array)),! }); str_array var1;! str_array * var2;! str_array **var3;

Slide 70

Slide 70 text

Back to r3.h

Slide 71

Slide 71 text

No content

Slide 72

Slide 72 text

No content

Slide 73

Slide 73 text

#define ˖ $QSFQSPDFTTPS ˖ 3FQMBDFUIFTUSJOHJOTPVSDFDPEFT ˖ 1SPDFTTCFGPSFDPNQJMF ˖ /PUSFBMGVODUJPO

Slide 74

Slide 74 text

#define r3_tree_insert_path(n,p,d) r3_tree_insert_pathl_ex(n,p,s var libr3 = ffi.Library('libr3', {! "r3_tree_insert_pathl_ex": ["pointer", ["pointer", "string", " });! ! ! var r3_tree_insert_path = function (tree, path, data) {! return libr3.r3_tree_insert_pathl_ex(tree, path, path.length, };

Slide 75

Slide 75 text

r3.h

Slide 76

Slide 76 text

r3.h ˖  MJOFT ˖ TUSVDUT ˖  NFUIPET -PUTPGXPSL

Slide 77

Slide 77 text

node-ffi-generate ˖ "VUPNBUJDHFOFSBUFEFOJUJPOGSPNIMF ˖ $POT ˖ 3FTVMUJTUPPEFUBJM UPPCJH ˖ .JHIUOPUTVJUGPSVTF ˖ EFOF https://github.com/tjfontaine/node-ffi-generate

Slide 78

Slide 78 text

node-r3 ˖ 0OMZEFOFOFDFTTBSZNFUIPET ˖ NFUIPET ˖ 5SFFDSFBUF DPNQJMF EVNQ NBUDI GSFF ˖ *OTFSUSPVUF QBUI ˖ .BUDI@FOUSZDSFBUF GSFF

Slide 79

Slide 79 text

Now We Can Write ffi.Library Define for r3

Slide 80

Slide 80 text

羳

Slide 81

Slide 81 text

ㆭ剚鸏랃갫ⵄ

Slide 82

Slide 82 text

㉏겗 Route Data

Slide 83

Slide 83 text

route * r3_tree_insert_routel(node *tree, int method,
 const char *path, int path_len, void *data);

Slide 84

Slide 84 text

route * r3_tree_insert_routel(node *tree, int method,
 const char *path, int path_len, void *data);

Slide 85

Slide 85 text

Route Data ˖ 3PVUFEBUBJTWPJEQPJOUFS ˖ $BOQPJOUUPBOZUZQFPGEBUB ˖ MJCSPOMZTUPSFUIFQPJOUFS

Slide 86

Slide 86 text

Pointer?

Slide 87

Slide 87 text

Pointer in JS ˖ 5IFSFJTOPSFBMQPJOUFSJO+BWB4DSJQU ˖ #VUZPVDBOVTF#VFS

Slide 88

Slide 88 text

Buffer ˖ /PEFKTPOMZ ˖ #VFSJTBDIVOLPGNFNPSZJOTQFDJFEBEESFTT ˖ $BOCFUZQFMFTT TJ[FDBOCF ˖ OPEFEFBMQPJOUFSBTCVFS

Slide 89

Slide 89 text

Example 1/2 var tree = libr3.r3_tree_create(10);! ! var data = new Buffer(data_str + '\u0000');! ! r3_tree_insert_route(tree, 'GET','/path', data);

Slide 90

Slide 90 text

Example 2/2 var node = libr3.r3_tree_match_route(tree, entry);! ! var data = ref.deref(node).data; https://github.com/othree/node-r3/blob/46e29f72bbf68097ed66fd151f9ef42d5a3ede05/node-r3.js

Slide 91

Slide 91 text

ref.deref ˖ %FSFGFSFODF ˖ (FUWBMVFGSPNCVFS ˖ *OUIJTDBTF EFSFGXJMMHFUBTUSVDU
 "OEJUTEBUBBUUSJCVUFJTXIBUXFXBOU

Slide 92

Slide 92 text

The Data ˖ 5IFEBUBXFHPUJTBOPUIFSCVFSJOTUBODF ˖ 8FTFOEQPJOUFSPGUIJTCVFSUPSXIFOJOTFSU SPVUF ˖ 8FOFFEUPEFSFGFSFODFJUUPHFUSFBMEBUBWBMVF

Slide 93

Slide 93 text

BUT

Slide 94

Slide 94 text

The Problem ˖ %FSFGFSFODFdataXJMMHFUOPUIJOH ˖ #FDBVTFUIFTJ[FPGdataJTBOEUIFUZQFJT VOLOPXO

Slide 95

Slide 95 text

Solution 1 ˖ 4FUEBUBUZQFBOETJ[F • buffer.type! • ref.reinterpret

Slide 96

Slide 96 text

ref.reinterpret ˖ 3FTJ[FCVFS ˖ :PVOFFEUPLOPXUIFTJ[FPGZPVSEBUB

Slide 97

Slide 97 text

Cons ˖ )BSEUPJNQMFNFOUWBSJPVTEBUBUZQF ˖ *GZPVEPJU NJHIUIVSUQFSGPSNBODF ˖ )BSEUPEFTJHO"1*

Slide 98

Slide 98 text

Solution 2 ˖ "MXBZTVTFTUSJOH ˖ ref.readCString

Slide 99

Slide 99 text

ref.readCString ˖ 3FBETUSJOHGSPNCVFS VOUJM00 ˖ /PUTUPQXIFONFFUCVFSFOE

Slide 100

Slide 100 text

var data = new Buffer(data_str + '\u0000');

Slide 101

Slide 101 text

var data = ref.readCString(ref.deref(node).data, 0);

Slide 102

Slide 102 text

Cons ˖ 3PVUFEBUBJTMJNJUFEUPTUSJOHUZQF

Slide 103

Slide 103 text

˖ "GUFSTPMWFSTUJTTVF ˖ 8FIBWFSTUVTBCMFOPEFS ˖ #VUUIFQFSGPSNBODFJTWFSZCBE ˖ 4MPXFSUIBOEJSFDUPS

Slide 104

Slide 104 text

㉏겗 Performance

Slide 105

Slide 105 text

Spec ˖ 6TFUIFTBNFUSFFJOSUFTUTCFODI ˖ 3VOPOJ.BD ˖ ()[*OUFM$PSFJ ˖ (#.)[%%3 https://github.com/c9s/r3/blob/master/tests/bench.c

Slide 106

Slide 106 text

Route req/s director ~2200 node-r3 0.0.1 ~1900 'PSVOLOPXOSFBTPO
 *DBOOPUSFQSPEVDFUIJTOVNCFS

Slide 107

Slide 107 text

What Takes Time ˖ %BUBUSBOTGPSN ˖ $BMMGPSFJHOGVODUJPO

Slide 108

Slide 108 text

Transform String ˖ /FXCVFSGSPNHJWFOEBUBTUSJOH ˖ 3FBE$TUSJOHGSPNQPJOUFS

Slide 109

Slide 109 text

data = new Buffer(data + '\u0000');! r3_tree_insert_path(this.tree, route, data); var node = r3_tree_match(this.tree, path, entry);! ! var data = ref.readCString(node.deref().data, 0);

Slide 110

Slide 110 text

How to Skip Transform ˖ 4UPSFEBUBJO+BWB4DSJQUTJEF ˖ 6TFJOUFHFSJOEFYBTEBUB

Slide 111

Slide 111 text

var i = this.i++;! this.data[i] = data;! ! var iref = ref.alloc('int', i);! ! libr3.r3_tree_insert_route(this.tree, method, route, iref); var node = libr3.r3_tree_match_route(this.tree, entry);! ! var index = node.deref().data.reinterpret(4).readUInt32LE(0);! ! var data = this.data[index];

Slide 112

Slide 112 text

var i = this.i++;! this.data[i] = data;! ! var iref = ref.alloc('int', i);! ! libr3.r3_tree_insert_route(this.tree, method, route, iref); var node = libr3.r3_tree_match_route(this.tree, entry);! ! var index = node.deref().data.reinterpret(4).readUInt32LE(0);! ! var data = this.data[index]; Store Data

Slide 113

Slide 113 text

ref.alloc ˖ $SFBUFCVFSCZHJWFUZQFTJ[FBOEWBMVF

Slide 114

Slide 114 text

var i = this.i++;! this.data[i] = data;! ! var iref = ref.alloc('int', i);! ! libr3.r3_tree_insert_route(this.tree, method, route, iref); var node = libr3.r3_tree_match_route(this.tree, entry);! ! var index = node.deref().data.reinterpret(4).readUInt32LE(0);! ! var data = this.data[index]; Data for r3

Slide 115

Slide 115 text

var i = this.i++;! this.data[i] = data;! ! var iref = ref.alloc('int', i);! ! libr3.r3_tree_insert_route(this.tree, method, route, iref); var node = libr3.r3_tree_match_route(this.tree, entry);! ! var index = node.deref().data.reinterpret(4).readUInt32LE(0);! ! var data = this.data[index]; Resize Buffer

Slide 116

Slide 116 text

var i = this.i++;! this.data[i] = data;! ! var iref = ref.alloc('int', i);! ! libr3.r3_tree_insert_route(this.tree, method, route, iref); var node = libr3.r3_tree_match_route(this.tree, entry);! ! var index = node.deref().data.reinterpret(4).readUInt32LE(0);! ! var data = this.data[index]; Read Index

Slide 117

Slide 117 text

readUInt32LE ˖ /PEFOBUJWFNFUIPE ˖ 3FBEVOTJHOFEJOUWBMVFGSPNCVFS

Slide 118

Slide 118 text

Route req/s director ~2200 node-r3 0.0.1 ~1900 node-r3 0.0.3 ~5000

Slide 119

Slide 119 text

More Pros ˖ /PNPSFMJNJUBUJPOPOEBUBUZQF ˖ "MM+4OBUJWFEBUBUZQFDBOCFVTF

Slide 120

Slide 120 text

How About Foreign Calls ˖ 8IBUXFVTFE ˖ S@USFF@DSFBUF S@USFF@GSFF ˖ S@USFF@JOTFSU@QBUI ˖ S@USFF@DPNQJMF ˖ NBUDI@FOUSZ@DSFBUF NBUDI@FOUSZ@GSFF ˖ S@USFF@NBUDI@SPVUF

Slide 121

Slide 121 text

What is Omissible ˖ match_entry_create match_entry_free ˖ 0OMZSFRVJSFEXIFO ˖ 6TF)551NFUIPEDPOEJUJPO ˖ $BQUVSFBSHVNFOU

Slide 122

Slide 122 text

So ˖ *DBOPNJUUIFTFNFUIPETXIFOOPUOFDFTTBSZ

Slide 123

Slide 123 text

Route req/s director ~2200 node-r3 0.0.1 ~1900 node-r3 0.0.3 ~5000 node-r3 0.1.0 7800~10600 Not Yet

Slide 124

Slide 124 text

˖ "GUFSTPMWFTFDPOEJTTVF ˖ 8FIBWFGBTUFSOPEFS ˖ #VUJUDBOOPUQBTTQSFTTVSFUFTU ˖ %BUBJOEFYCFDPNFTSBOEPNOVNCFS BOEDSBTI BGUFSNPSFSFRVFTU

Slide 125

Slide 125 text

㉏겗 Crash…

Slide 126

Slide 126 text

No content

Slide 127

Slide 127 text

No content

Slide 128

Slide 128 text

Hard To Find The Bug

Slide 129

Slide 129 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCase()];! if (!method) { throw new Error(route_frag[0]); }! r3_tree_insert_route(this.tree, method, route, data);! } else {! r3_tree_insert_route(this.tree, 0, route, data);! }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! };

Slide 130

Slide 130 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; WBSJBCMFT

Slide 131

Slide 131 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; DSFBUFUSFF

Slide 132

Slide 132 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; EBUBTUPSBHF

Slide 133

Slide 133 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; QBSTFSPVUFT

Slide 134

Slide 134 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; DSFBUFJOEFY

Slide 135

Slide 135 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; QBSTFTUSJOH

Slide 136

Slide 136 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; NFUIPEDPOEJUJPO

Slide 137

Slide 137 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; JOTFSUSPVUF

Slide 138

Slide 138 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCa if (!method) { throw new Error(route_fra r3_tree_insert_route(this.tree, method, } else {! r3_tree_insert_route(this.tree, 0, route }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! }; DPNQJMFUSFF

Slide 139

Slide 139 text

Any Idea?

Slide 140

Slide 140 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCase()];! if (!method) { throw new Error(route_frag[0]); }! r3_tree_insert_route(this.tree, method, route, data);! } else {! r3_tree_insert_route(this.tree, 0, route, data);! }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! };

Slide 141

Slide 141 text

The Bug ˖ dataJTMPDBMWBSJBCMF ˖ 8JMMCFGSFFEVSJOH(BSCBHF$PMMFDUJPO

Slide 142

Slide 142 text

var Router = function (routes) {! var route, data, method, route_frag, i = 0;! this.tree = libr3.r3_tree_create(10);! this.data = [];! this.index = [];! for (route in routes) {! this.data[i] = routes[route];! data = ref.alloc('int', i);! this.index[i] = data; // prevent GC! route = route.trim();! route_frag = route.split(' ');! if (route_frag.length > 1) {! route = route_frag[1];! method = METHODS[route_frag[0].toUpperCase()];! if (!method) { throw new Error(route_frag[0]); }! r3_tree_insert_route(this.tree, method, route, data);! } else {! r3_tree_insert_route(this.tree, 0, route, data);! }! i++;! }! libr3.r3_tree_compile(this.tree);! return this;! };

Slide 143

Slide 143 text

荈䊹涸隶侸荈䊹鎹 鎹䖤+BWB4DSJQU剤($

Slide 144

Slide 144 text

˖ "GUFSTPMWFBMMJTTVFT ˖ 8FOBMMZIBWFBSFBMMZTUBCMF IJHIQFSGPSNBODF SPVUFSMJC ˖ "OEUIBUTSFMFBTF ˖ /PXJT

Slide 145

Slide 145 text

node-r3

Slide 146

Slide 146 text

var Router = require('node-r3').Router;! ! var router = new Router({! "/foo": "data string",! "/foo/bar": function () {},! "/foo/bar/qoo": {obj: 1},! });! ! var dispatched = router.match("/foo");! ! router.free();

Slide 147

Slide 147 text

var router = new Router({! "/": handler,! "/foo": fooHandler,! "/foo/{id}": fooHandler,! "POST /me": postMeHandler,! "GET /me": getMeHandler,! "POST|GET /post": postHandler,! });! ! var server = http.createServer(! router.httpHandler(notfound)! );

Slide 148

Slide 148 text

Handler Function function (req, res, captures) array

Slide 149

Slide 149 text

Error Handler Function function (req, res)

Slide 150

Slide 150 text

Known Issues ˖ .FNPSZMFBL  ˖ 1FSGPSNBODFJNQSPWFNFOU

Slide 151

Slide 151 text

Question?

Slide 152

Slide 152 text

Thanks For your Attention