Home
last modified time | relevance | path

Searched refs:GETRIGHT (Results 1 – 11 of 11) sorted by relevance

/dports/japanese/skkinput3/skkinput-3.0.6/lib/lisp/
H A Dlbind.c423 pNodeY = GETRIGHT (pNodeX) ; in lispBindTree_leftRotate()
495 pNodeY = GETRIGHT (pPPX) ; in lispBindTree_rbInsert()
548 pNodeY = GETRIGHT (pNodeZ) ; in lispBindTree_rbDelete()
564 pNodeX = GETRIGHT (pNodeY) ; in lispBindTree_rbDelete()
599 pNodeW = GETRIGHT (pPX) ; in lispBindTree_rbDeleteFixup()
605 pNodeW = GETRIGHT (pPX) ; in lispBindTree_rbDeleteFixup()
608 pNodeWR = GETRIGHT (pNodeW) ; in lispBindTree_rbDeleteFixup()
619 pNodeW = GETRIGHT (pPX) ; in lispBindTree_rbDeleteFixup()
635 pNodeW = GETRIGHT (pPX) ; in lispBindTree_rbDeleteFixup()
638 pNodeWR = GETRIGHT (pNodeW) ; in lispBindTree_rbDeleteFixup()
[all …]
/dports/graphics/nip2/nip2-8.7.1/src/
H A Dreduce.c1185 GETRT( arg[0] ), GETRIGHT( arg[0] ) ); in reduce_spine()
1292 GETRT( arg[0] ), GETRIGHT( arg[0] ) ); in reduce_spine()
1334 GETRT( arg[0] ), GETRIGHT( arg[0] ) ); in reduce_spine()
1434 d3 = GETRIGHT( GETRIGHT( hn ) )->body.num; in reduce_spine()
1612 GETRT( arg[2] ), GETRIGHT( arg[2] ) ); in reduce_spine()
1615 GETRT( arg[1] ), GETRIGHT( arg[1] ) ); in reduce_spine()
1633 GETRT( arg[1] ), GETRIGHT( arg[1] ) ); in reduce_spine()
1635 GETRT( arg[2] ), GETRIGHT( arg[2] ), in reduce_spine()
1730 GETRT( arg[1] ), GETRIGHT( arg[1] ), in reduce_spine()
1737 GETRT( arg[2] ), GETRIGHT( arg[2] ), in reduce_spine()
[all …]
H A Ddump.c642 GETRIGHT( hn )->ltype, in graph_heap()
643 GETRIGHT( hn )->body.ptrs.left ); in graph_heap()
646 GETRIGHT( hn )->rtype, in graph_heap()
647 GETRIGHT( hn )->body.ptrs.right ); in graph_heap()
653 GETLEFT( hn )->body.num, GETRIGHT( hn )->body.num ); in graph_heap()
659 GETLEFT( GETRIGHT( hn ) )->body.num, in graph_heap()
660 GETRIGHT( GETRIGHT( hn ) )->body.num ); in graph_heap()
H A Dheap.c96 (c = heap_map( GETRIGHT( hn ), fn, a, b )) ) in heap_map()
545 GETRIGHT( hn ) ); in heap_mark_tree()
554 GETRIGHT( hn ) ); in heap_mark_tree()
558 hn = GETRIGHT( hn ); in heap_mark_tree()
1689 i = GPOINTER_TO_INT( GETRIGHT( hn ) ); in copy_node()
1710 i = GPOINTER_TO_INT( GETRIGHT( hn1 ) ); in copy_node()
2286 hn = GETRIGHT( hn ); in lisp_node()
2314 GETLEFT( GETRIGHT( hn ) )->body.num ); in lisp_node()
2315 if( GETRT( GETRIGHT( hn ) ) == ELEMENT_ELIST ) in lisp_node()
2319 GETRIGHT( GETRIGHT( hn ) )->body.num ); in lisp_node()
[all …]
H A Dheap.h144 #define GETRIGHT(N) ((HeapNode*)((N)->body.ptrs.right)) macro
268 #define PEGETIMAGPART(P) (GETRIGHT(PEGETVAL(P))->body.num)
271 #define PEGETCLASSSECRET(P1,P2) PEPOINTLEFT(GETRIGHT(PEGETVAL(P2)),P1)
272 #define PEGETCLASSMEMBER(P1,P2) PEPOINTRIGHT(GETRIGHT(PEGETVAL(P2)),P1)
H A Dcompile.c1273 GETRIGHT( hn1 )->body.num == GETRIGHT( hn2 )->body.num ) in compile_equal_node()
1296 if( GETRIGHT( hn1 ) != GETRIGHT( hn2 ) ) in compile_equal_node()
1305 if( !compile_equal_node( GETRIGHT( hn1 ), GETRIGHT( hn2 ) ) ) in compile_equal_node()
H A Dclass.c95 for( p = PEGETVAL( &member ); p; p = GETRIGHT( p ) ) { in class_map()
141 for( p = PEGETVAL( &member ); p; p = GETRIGHT( p ) ) { in class_get_member()
219 for( p = PEGETVAL( &secret ); p; p = GETRIGHT( p ) ) { in class_get_symbol()
H A Dsubcolumn.c327 for( p = PEGETVAL( &member ); p; p = GETRIGHT( p ) ) { in subcolumn_class_new_heap()
H A Dtool.c663 for( p = PEGETVAL( &member ); p; p = GETRIGHT( p ) ) { in toolitem_build_all()
H A Dbuiltin.c203 ELEMENT_NODE, GETRIGHT( PEGETVAL( &rhs ) ) ); in apply_complex_call()
H A Daction.c538 GETRIGHT( a )->body.num == GETRIGHT( b )->body.num ); in action_node_equal()