Home
last modified time | relevance | path

Searched refs:n_right (Results 1 – 25 of 207) sorted by relevance

123456789

/dports/lang/pcc/pcc-1.1.0/cc/ccom/
H A Doptim.c53 nfree(p->n_right); in zapleft()
66 p->n_right = fortarg( p->n_right ); in fortarg()
96 if( ty == BITYPE ) p->n_right = optim(p->n_right); in optim()
117 p->n_right = fortarg( p->n_right ); in optim()
246 q = p->n_right->n_right; in optim()
249 p->n_right->n_left = p->n_right->n_right; in optim()
318 conval(p->n_right, MINUS, p->n_left->n_right)){ in optim()
327 conval( p->n_right, o, p->n_left->n_right ) ){ in optim()
366 if( nncon( p->n_right ) && p->n_right->n_lval == 1 ) in optim()
373 q = p->n_right; in optim()
[all …]
H A Dtrees.c433 p->n_right = pconvert( p->n_right ); in buildtree()
602 p->n_right = r = strargs(p->n_right); in buildtree()
878 p->n_right = strargs( p->n_right ); in strargs()
933 p->n_right = q->n_right; in conval()
2275 q = p->n_right->n_right; in rmcops()
2643 p->n_right = rmfldops(p->n_right); in rmfldops()
2932 p->n_right = pprop(p->n_right, t, ap); in pprop()
2959 p->n_right = pprop(p->n_right, t, ap); in pprop()
2972 p->n_right = pprop(p->n_right, t, ap); in pprop()
2993 p->n_right = rmpconv(p->n_right); in rmpconv()
[all …]
/dports/lang/pcc/pcc-1.1.0/cc/cxxcom/
H A Doptim.c53 nfree(p->n_right); in zapleft()
66 p->n_right = fortarg( p->n_right ); in fortarg()
96 if( ty == BITYPE ) p->n_right = optim(p->n_right); in optim()
117 p->n_right = fortarg( p->n_right ); in optim()
291 sp = p->n_right; in optim()
302 conval(p->n_right, MINUS, p->n_left->n_right)){ in optim()
311 conval( p->n_right, o, p->n_left->n_right ) ){ in optim()
350 if( nncon( p->n_right ) && p->n_right->n_lval == 1 ) in optim()
357 q = p->n_right; in optim()
389 p->n_right = sp; in optim()
[all …]
H A Dtrees.c376 p->n_right = pconvert( p->n_right ); in buildtree()
549 p->n_right = r = strargs(p->n_right); in buildtree()
808 p->n_right = strargs( p->n_right ); in strargs()
863 p->n_right = q->n_right; in conval()
2216 q = p->n_right->n_right; in rmcops()
2353 p->n_right = delasgop(p->n_right); in delasgop()
2354 p->n_right = clocal(p->n_right); in delasgop()
2362 p->n_right = delasgop(p->n_right); in delasgop()
2640 p->n_right = rmfldops(p->n_right); in rmfldops()
2985 p->n_right = rmpconv(p->n_right); in rmpconv()
[all …]
/dports/math/chaco/Chaco-2.2/code/klvspiff/
H A Dflow.c80 n_left, n_right, pointers[n_left+n_right]-pointers[0]);
183 for (i = 0; i < n_left + n_right; i++) {
334 for (i = 0; i < n_left + n_right; i++)
381 int n_right;
399 for (i = 0; i < n_left + n_right; i++) {
440 int n_right;
455 int n_right;
462 for (i = 0; i < n_left + n_right; i++) {
491 int n_right;
503 for (i = 0; i < n_left + n_right; i++) {
[all …]
H A Dmatching.c25 void bpcover(n_left, n_right, pointers, indices, in bpcover() argument
28 int n_right; /* number of vertices on right side */
44 n_left, n_right, pointers[n_left+n_right]-pointers[0]);
65 for (i = n_left; i < n_left + n_right; i++) {
85 int n_right; /* number of vertices on right side */
97 for (i = 0; i < n_left + n_right; i++) {
103 for (i = n_left; i < n_left + n_right; i++) {
202 int n_right; /* number of vertices on right side */
211 for (i = 0; i < n_left + n_right; i++)
271 for (i = 0; i < n_left + n_right; i++) {
[all …]
H A Dflow.save98 for (i = n_left; i < n_left + n_right; i++) {
133 for (i = 0; i < n_left + n_right; i++) {
144 for (i = n_left; i < n_left + n_right; i++) {
156 count_flow(n_left, n_right, pointers, flow));
157 count_resid(n_left, n_right, resid, vweight);
171 count_resid(n_left, n_right, resid, vweight);
293 for (i = 0; i < n_left + n_right; i++)
357 for (i = 0; i < n_left + n_right; i++) {
386 int count_flow(n_left, n_right, pointers, flow)
401 int count_resid(n_left, n_right, resid, vweight)
[all …]
/dports/lang/pcc/pcc-1.1.0/arch/pdp10/
H A Dorder.c54 if( p->n_right->n_op == ICON ){ in offstar()
84 r = p->n_right; in setbin()
92 p->n_right = s; in setbin()
132 p->n_right->n_op == PLUS && in special()
133 p->n_right->n_left->n_op == REG && in special()
134 p->n_right->n_right->n_op == ICON && in special()
135 p->n_right->n_right->n_lval == 1 && in special()
183 for (p = p->n_right; p->n_op == CM; p = p->n_left) { in livecall()
184 if (p->n_right->n_op == ASSIGN && in livecall()
185 p->n_right->n_left->n_op == REG) in livecall()
[all …]
H A Dlocal2.c399 CONSZ val = p->n_right->n_lval; in constput()
568 NODE *r = p->n_right; in imuli()
587 NODE *r = p->n_right; in idivi()
750 p = p->n_right; in zzzcode()
795 if (p->n_right->n_op != OREG || p->n_right->n_lval != 0) in zzzcode()
1137 l->n_right->n_lval += p->n_right->n_lval; in optim2()
1139 l->n_right->n_name = p->n_right->n_name; in optim2()
1140 nfree(p->n_right); in optim2()
1166 l->n_left = p->n_right; in optim2()
1167 p->n_right = l; in optim2()
[all …]
/dports/astro/py-astropy/astropy-5.0/astropy/table/
H A D_np_utils.pyx48 n_right = 0
54 n_right += 1
63 if n_right == 0:
65 n_right = 1
67 if n_right == 0:
69 n_right = 1
91 n_right = 0
99 n_right += 1
107 if n_right == 0:
109 n_right = 1
[all …]
/dports/lang/pcc/pcc-1.1.0/arch/pdp11/
H A Dlocal2.c548 IS1CON(q->n_right->n_right)) { in cvtree()
551 nfree(p->n_right); in cvtree()
581 p->n_right->n_lval = ((~p->n_right->n_lval) & 0177777); in fixops()
584 nfree(p->n_right); in fixops()
585 p->n_right = q; in fixops()
587 p->n_right = mkunode(COMPL, p->n_right, 0, p->n_type); in fixops()
590 p->n_right = mkunode(UMINUS, p->n_right, 0, p->n_right->n_type); in fixops()
765 p->n_right->n_qual = 0; in lastcall()
770 p = op->n_right; in lastcall()
773 p = p->n_right; in lastcall()
[all …]
H A Dorder.c49 p->n_left->n_right->n_op == PLUS && in inctree()
50 treecmp(p->n_left->n_left, p->n_left->n_right->n_left) && in inctree()
51 p->n_right->n_op == ICON && p->n_right->n_lval == 1 && in inctree()
52 p->n_left->n_right->n_right->n_op == ICON && in inctree()
53 p->n_left->n_right->n_right->n_lval == 1) { in inctree()
81 if (p->n_right->n_op == ICON) { in offstar()
/dports/lang/pcc/pcc-1.1.0/arch/arm/
H A Dorder.c65 r = p->n_right; in offstar()
74 if (r->n_op == LS && r->n_right->n_op == ICON && in offstar()
75 r->n_right->n_lval == 2 && p->n_op == PLUS) { in offstar()
107 if (isreg(p->n_right) == 0) in myormake()
108 (void)geninsn(p->n_right, INAREG); in myormake()
115 } else if (p->n_op == PLUS && (r = p->n_right)->n_op == LS && in myormake()
116 r->n_right->n_op == ICON && r->n_right->n_lval == 2 && in myormake()
121 r->n_right->n_lval); in myormake()
323 for (p = p->n_right; p->n_op == CM; p = p->n_left) in livecall()
324 num += szty(p->n_right->n_type); in livecall()
[all …]
/dports/lang/pcc/pcc-1.1.0/arch/vax/
H A Dlocal2.c308 r = p->n_right; in casg64()
363 r = p->n_right; in casg()
737 q->n_right->n_lval = -q->n_right->n_lval;
739 t = q->n_right;
1199 p->n_right = mkunode(FUNARG, p->n_right, 0, UNSIGNED); in optim2()
1200 p->n_right = mkbinode(CM, p->n_left, p->n_right, INT); in optim2()
1211 mkunode(FUNARG, p->n_right, 0, p->n_right->n_type), in optim2()
1220 p->n_right->n_lval = -p->n_right->n_lval; in optim2()
1226 p->n_right = mkunode(UMINUS, p->n_right, in optim2()
1239 p->n_right = r; in optim2()
[all …]
H A Dorder.c310 r = p->n_right; in offstar()
340 order( p->n_right, INAREG );
348 if( p->n_right->n_op==LS &&
349 (p->n_right->n_left->n_op!=REG || tlen(p->n_right->n_left)!=sizeof(int) ) ) {
358 else if( p->n_right->n_op!=REG || tlen(p->n_right)!=sizeof(int) ) {
359 order(p->n_right, INAREG);
387 rt = p->n_right->n_type;
388 ro = p->n_right->n_op;
405 offstar( p->n_right->n_left );
447 if( !canaddr(p->n_right) ) {
[all …]
/dports/lang/pcc/pcc-1.1.0/arch/amd64/
H A Dorder.c101 l = p->n_right; in offstar()
106 if (l->n_op == PLUS && isreg(l->n_right)) { in offstar()
119 if (isreg(p->n_right)) in offstar()
121 if (findls(p->n_right, 0)) in offstar()
123 (void)geninsn(p->n_right, INAREG); in offstar()
157 p = p->n_right; in myormake()
162 p = p->n_right; in myormake()
168 sh = shtbl[(int)p->n_right->n_lval]; in myormake()
346 if (q->n_right->n_op == ASSIGN && in livecall()
347 q->n_right->n_left->n_op == REG) in livecall()
[all …]
H A Dcode.c637 dp = a->n_right; in amd64_builtin_va_arg()
920 p->n_right = argput(p->n_right); in argput()
1059 p->n_right = p->n_left->n_right; in argsort()
1063 coptype(p->n_right->n_right->n_op) != LTYPE) { in argsort()
1066 p->n_right->n_df, p->n_right->n_ap); in argsort()
1068 p->n_right->n_right = buildtree(COMOP, in argsort()
1069 buildtree(ASSIGN, q, p->n_right->n_right), r); in argsort()
1075 p->n_left->n_right = p->n_right; in argsort()
1076 p->n_right = q; in argsort()
1115 p->n_right = argput(p->n_right); in funcode()
[all …]
/dports/devel/libfirm/libfirm-1.21.0/ir/adt/
H A Dbipartite.c35 int n_left, n_right; member
39 bipartite_t *bipartite_new(int n_left, int n_right) in bipartite_new() argument
45 gr->n_right = n_right; in bipartite_new()
48 gr->adj[i] = bitset_malloc(n_right); in bipartite_new()
63 assert(i < gr->n_left && j < gr->n_right); in bipartite_add()
69 assert(i < gr->n_left && j < gr->n_right); in bipartite_remv()
75 assert(i < gr->n_left && j < gr->n_right); in bipartite_adj()
84 bitset_t *tmp = bitset_alloca(gr->n_right); in apply_alternating_path()
149 bitset_t *matched_right = bitset_alloca(gr->n_right); in bipartite_matching()
/dports/lang/pcc/pcc-1.1.0/arch/nova/
H A Dlocal.c160 r->n_right->n_op != FUNARG) in clocal()
161 r->n_right = block(FUNARG, r->n_right, NIL, in clocal()
162 r->n_right->n_type, r->n_right->n_df, in clocal()
163 r->n_right->n_sue); in clocal()
190 l->n_right->n_type = t; in clocal()
327 p->n_right = block(SCONV, p->n_right, NIL, INT, 0, 0); in clocal()
341 p->n_right = p->n_left; in clocal()
350 if (p->n_right->n_op == ICON) in clocal()
354 p->n_right = block(SCONV, p->n_right, NIL, in clocal()
358 if (p->n_right->n_type == CHAR || p->n_right->n_type == UCHAR) in clocal()
[all …]
H A Dcode.c144 p->n_right->n_name = ""; in efcode()
213 for (r = p->n_right; r->n_op == CM; r = r->n_left) { in funcode()
214 if (r->n_right->n_op != STARG) in funcode()
215 r->n_right = block(FUNARG, r->n_right, NIL, in funcode()
216 r->n_right->n_type, r->n_right->n_df, in funcode()
217 r->n_right->n_ap); in funcode()
/dports/lang/pcc/pcc-1.1.0/arch/hppa/
H A Dlocal.c333 p->n_right = block(SCONV, p->n_right, NIL, INT, 0, 0); in clocal()
341 if (p->n_right->n_op == ICON || p->n_right->n_lval <= 32) in clocal()
343 if (p->n_right->n_type != INT || p->n_right->n_lval > 32) in clocal()
344 p->n_right = block(SCONV, p->n_right, NIL, INT, 0, 0); in clocal()
372 r = p->n_right; in clocal()
429 p->n_right = clocal(p->n_right); in clocal()
457 r->n_right->n_right->n_op == CALL) { in clocal()
458 s = r->n_right->n_right; in clocal()
461 r->n_right->n_right = tcopy(l); in clocal()
495 p->n_right = block(CM, p->n_left, p->n_right, 0, 0, 0); in clocal()
[all …]
H A Dorder.c62 r = p->n_right; in offstar()
86 if (p->n_op == PLUS && (r = p->n_right)->n_op == LS && in myormake()
87 r->n_right->n_op == ICON && r->n_right->n_lval == 2 && in myormake()
197 for (p = p->n_right; p->n_op == CM; p = p->n_left) in livecall()
198 if (p->n_right->n_op == ASSIGN && in livecall()
199 p->n_right->n_left->n_op == REG) in livecall()
200 *--s = p->n_right->n_left->n_rval; in livecall()
/dports/lang/pcc/pcc-1.1.0/arch/m16c/
H A Dorder.c84 if( p->n_right->n_op == ICON ){ in offstar()
116 p->n_right->n_op == ICON) in shumul()
184 p->n_right = movenode(p->n_right, A0);
188 p->n_right->n_su &= ~LMASK;
189 p->n_right->n_su |= LOREG;
204 p->n_right = movenode(p->n_right, A0);
208 p->n_right->n_su &= ~LMASK;
209 p->n_right->n_su |= LOREG;
386 gencall(p->n_right, p); in gencall()
419 narry[--i] = q->n_right; in storearg()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/src/common/
H A Dpartition_builder.h120 const size_t n_right = child_nodes_sizes.second; in Partition() local
123 SetNRightElems(node_in_set, range.begin(), range.end(), n_right); in Partition()
151 void SetNRightElems(int nid, size_t begin, size_t end, size_t n_right) { in SetNRightElems() argument
153 mem_blocks_.at(task_idx)->n_right = n_right; in SetNRightElems()
174 size_t n_right = 0; in CalculateRowOffsets() local
176 mem_blocks_[j]->n_offset_right = n_left + n_right; in CalculateRowOffsets()
177 n_right += mem_blocks_[j]->n_right; in CalculateRowOffsets()
179 left_right_nodes_sizes_[i] = {n_left, n_right}; in CalculateRowOffsets()
193 std::copy_n(right, mem_blocks_[task_idx]->n_right, right_result); in MergeToArray()
203 size_t n_right; member
/dports/misc/xgboost/xgboost-1.5.1/src/common/
H A Dpartition_builder.h120 const size_t n_right = child_nodes_sizes.second; in Partition() local
123 SetNRightElems(node_in_set, range.begin(), range.end(), n_right); in Partition()
151 void SetNRightElems(int nid, size_t begin, size_t end, size_t n_right) { in SetNRightElems() argument
153 mem_blocks_.at(task_idx)->n_right = n_right; in SetNRightElems()
174 size_t n_right = 0; in CalculateRowOffsets() local
176 mem_blocks_[j]->n_offset_right = n_left + n_right; in CalculateRowOffsets()
177 n_right += mem_blocks_[j]->n_right; in CalculateRowOffsets()
179 left_right_nodes_sizes_[i] = {n_left, n_right}; in CalculateRowOffsets()
193 std::copy_n(right, mem_blocks_[task_idx]->n_right, right_result); in MergeToArray()
203 size_t n_right; member

123456789