Searched refs:k_type (Results 1 - 6 of 6) sorted by relevance
/ast/src/lib/libvdelta/ |
H A D | vdexpand.c | 42 reg int inst, k_type, n; local 51 k_type = K_GET(inst); 53 if(!VD_ISCOPY(k_type)) 54 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 70 if(K_ISMERGE(k_type)) 72 k_type -= K_MERGE; 87 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 89 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 93 if(k_type > [all...] |
H A D | vdsqueeze.c | 61 reg int n_add, i_add, i_copy, k_type; local 67 k_type = 0; 73 k_type = K_SELF; 76 k_type = K_HERE; 82 k_type = K_RECENT+n; 89 k_type = K_QUICK+d; 93 /**/ASSERT((k_type+K_MERGE) < (1<<I_BITS) ); 99 if(MERGABLE(n_add,n_copy,k_type) ) 101 i_add = K_TPUT(k_type)|A_TPUT(n_add)|C_TPUT(n_copy); 104 { i_copy = K_PUT(k_type); [all...] |
H A D | vdupdate.c | 61 reg int inst, k_type, n, r; local 76 k_type = K_GET(inst); 78 if(!VD_ISCOPY(k_type)) 79 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 117 if(K_ISMERGE(k_type)) 119 k_type -= K_MERGE; 140 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 141 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 146 if(k_type > [all...] |
H A D | vddelta.c | 63 reg int n_add, i_add, i_copy, k_type; local 68 k_type = 0; 74 k_type = K_SELF; 77 k_type = K_HERE; 83 k_type = K_RECENT+n; 90 k_type = K_QUICK+d; 94 /**/ASSERT((k_type+K_MERGE) < (1<<I_BITS) ); 100 if(MERGABLE(n_add,n_copy,k_type) ) 102 i_add = K_TPUT(k_type)|A_TPUT(n_add)|C_TPUT(n_copy); 105 { i_copy = K_PUT(k_type); [all...] |
/ast/src/lib/libvdelta/vd01/ |
H A D | vdupdate01.c | 59 reg int inst, k_type, n, r; local 74 k_type = K_GET(inst); 76 if(!VD_ISCOPY(k_type)) 77 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 115 if(K_ISMERGE(k_type)) 117 k_type -= K_MERGE; 138 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 139 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 144 if(k_type > [all...] |
H A D | vddelta01.c | 67 reg int n_add, i_add, i_copy, k_type; local 72 k_type = 0; 78 k_type = K_SELF; 81 k_type = K_HERE; 87 k_type = K_RECENT+n; 94 k_type = K_QUICK+d; 98 /**/ASSERT((k_type+K_MERGE) < (1<<I_BITS) ); 104 if(MERGABLE(n_add,n_copy,k_type) ) 106 i_add = K_TPUT(k_type)|A_TPUT(n_add)|C_TPUT(n_copy); 109 { i_copy = K_PUT(k_type); [all...] |
Completed in 10 milliseconds