HelenOS sources

right              50 kernel/genarch/src/acpi/acpi.c #define CMP_SIGNATURE(left, right) \
right              51 kernel/genarch/src/acpi/acpi.c 	(((left)[0] == (right)[0]) && \
right              52 kernel/genarch/src/acpi/acpi.c 	((left)[1] == (right)[1]) && \
right              53 kernel/genarch/src/acpi/acpi.c 	((left)[2] == (right)[2]) && \
right              54 kernel/genarch/src/acpi/acpi.c 	((left)[3] == (right)[3]))
right             342 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                         current = current->right();
right             381 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (node->left() && node->right())
right             394 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto child = node->right() ? node->right() : node->left();
right             409 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                         child->parent()->right(child);
right             412 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->right(nullptr);
right             443 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                         current = current->right();
right              58 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node->parent()->right();
right              72 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return gp->right();
right              97 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return node->parent()->right() == node;
right             138 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             while (node->right())
right             139 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node = node->right();
right             154 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->right())
right             155 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return find_smallest(node->right());
right             206 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->right(child);
right             217 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             auto right1 = node1->right();
right             222 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             auto right2 = node2->right();
right             240 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     node->parent()->right(node);
right             249 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->right(r);
right             250 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->right())
right             251 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node->right()->parent(node);
right             887 uspace/lib/cpp/include/__bits/algorithm.hpp             auto right = heap_right_child(idx);
right             890 uspace/lib/cpp/include/__bits/algorithm.hpp             bool right_incorrect{comp(first[idx], first[right])};
right             892 uspace/lib/cpp/include/__bits/algorithm.hpp                    (right < count && right_incorrect))
right             894 uspace/lib/cpp/include/__bits/algorithm.hpp                 if (right >= count || (left_incorrect && comp(first[right], first[left])))
right             900 uspace/lib/cpp/include/__bits/algorithm.hpp                 else if (right < count && right_incorrect)
right             902 uspace/lib/cpp/include/__bits/algorithm.hpp                     swap(first[idx], first[right]);
right             904 uspace/lib/cpp/include/__bits/algorithm.hpp                     idx = right;
right             908 uspace/lib/cpp/include/__bits/algorithm.hpp                 right = heap_right_child(idx);
right             911 uspace/lib/cpp/include/__bits/algorithm.hpp                 right_incorrect = comp(first[idx], first[right]);
right            1056 uspace/lib/cpp/include/__bits/algorithm.hpp             auto right = heap_right_child(idx);
right            1060 uspace/lib/cpp/include/__bits/algorithm.hpp             if (right < count && comp(first[idx], first[right]))
right              78 uspace/lib/cpp/include/__bits/io/ios.hpp             static constexpr fmtflags right       = 0b0000'0000'1000'0000;
right              86 uspace/lib/cpp/include/__bits/io/ios.hpp             static constexpr fmtflags adjustfield = left | right | internal;
right             586 uspace/lib/cpp/include/__bits/io/ios.hpp     ios_base& right(ios_base& str);
right             268 uspace/lib/cpp/include/__bits/locale/num_put.hpp                     else if (adjustfield == ios_base::right)
right             294 uspace/lib/cpp/src/ios.cpp         str.setf(ios_base::right, ios_base::adjustfield);
right              49 uspace/lib/ui/include/types/ui/menu.h 	void (*right)(ui_menu_t *, void *, sysarg_t);
right             620 uspace/lib/ui/src/menu.c 	if (menu->cb != NULL && menu->cb->right != NULL)
right             621 uspace/lib/ui/src/menu.c 		menu->cb->right(menu, menu->arg, idev_id);
right              58 uspace/lib/ui/src/menudd.c 	.right = ui_menu_dd_right,
right             113 uspace/lib/ui/src/window.c 	.right = wnd_sysmenu_right,
right              65 uspace/lib/ui/test/menu.c 	.right = testmenu_right,
right             721 uspace/lib/ui/test/menu.c PCUT_TEST(right)
right            1370 uspace/srv/net/tcp/conn.c 	uint32_t left, right;
right            1372 uspace/srv/net/tcp/conn.c 	seq_no_seg_trim_calc(conn, seg, &left, &right);
right            1373 uspace/srv/net/tcp/conn.c 	tcp_segment_trim(seg, left, right);
right             171 uspace/srv/net/tcp/segment.c void tcp_segment_trim(tcp_segment_t *seg, uint32_t left, uint32_t right)
right             175 uspace/srv/net/tcp/segment.c 	assert(left + right <= seg->len);
right             185 uspace/srv/net/tcp/segment.c 	if (right == seg->len) {
right             202 uspace/srv/net/tcp/segment.c 	if (right > 0 && (seg->ctrl & CTL_FIN) != 0) {
right             206 uspace/srv/net/tcp/segment.c 		right--;
right             209 uspace/srv/net/tcp/segment.c 	if (left > 0 || right > 0) {
right             211 uspace/srv/net/tcp/segment.c 		assert(left + right <= t_size);
right             214 uspace/srv/net/tcp/segment.c 		seg->len -= left + right;
right             224 uspace/srv/net/tcp/seq_no.c     uint32_t *left, uint32_t *right)
right             245 uspace/srv/net/tcp/seq_no.c 		*right = 0;
right             247 uspace/srv/net/tcp/seq_no.c 		*right = (seg->seq + seg->len) -
HelenOS homepage, sources at GitHub