Searched refs:right (Results 1 - 25 of 27) sorted by relevance

12

/seL4-camkes-master/projects/musllibc/src/search/
H A Dtdestroy.c8 struct node *right; member in struct:node
18 tdestroy(r->right, freekey);
H A Dtsearch_avl.c13 struct node *right; member in struct:node
18 return (n->left ? n->left->height:0) - (n->right ? n->right->height:0);
25 if (n->right && n->right->height > n->height)
26 n->height = n->right->height;
31 struct node *r = n->right;
32 n->right = r->left;
41 n->left = l->right;
42 l->right
[all...]
/seL4-camkes-master/projects/musllibc/src/signal/
H A Dsigandset.c6 int sigandset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
8 unsigned long i = 0, *d = (void*) dest, *l = (void*) left, *r = (void*) right;
H A Dsigorset.c6 int sigorset(sigset_t *dest, const sigset_t *left, const sigset_t *right) argument
8 unsigned long i = 0, *d = (void*) dest, *l = (void*) left, *r = (void*) right;
/seL4-camkes-master/projects/seL4_libs/libsel4allocman/src/utspace/
H A Dsplit.c133 struct utspace_split_node *left, *right; local
178 right = _new_node(alloc);
179 if (!right) {
180 ZF_LOGV("Failed to allocate right node");
189 _delete_node(alloc, right);
195 sel4_error = seL4_Untyped_Retype(node->ut.capPtr, seL4_UntypedObject, size_bits, right->ut.root, right->ut.dest,
196 right->ut.destDepth, right->ut.offset, 1);
200 _delete_node(alloc, right);
[all...]
/seL4-camkes-master/tools/cogent/impl/fs/bilby/cogent/plat/linux/
H A Drbt.c45 struct rbt_node *right = node->rbt_right; local
48 node->rbt_right = right->rbt_left;
50 rbt_set_parent(right->rbt_left, node);
51 right->rbt_left = node;
53 rbt_set_parent(right, parent);
58 parent->rbt_left = right;
60 parent->rbt_right = right;
63 rbt->root = right;
64 rbt_set_parent(node, right);
/seL4-camkes-master/tools/cogent/impl/fs/bilby/c/
H A Drbt.c53 struct rbt_node *right = node->rbt_right; local
56 node->rbt_right = right->rbt_left;
58 rbt_set_parent(right->rbt_left, node);
59 right->rbt_left = node;
61 rbt_set_parent(right, parent);
66 parent->rbt_left = right;
68 parent->rbt_right = right;
71 root->rbt_node = right;
72 rbt_set_parent(node, right);
346 /* If we have a right
[all...]
/seL4-camkes-master/projects/musllibc/src/regex/
H A Dregcomp.c111 holds all but the last, and `right' part holds the last subexpression
115 tre_ast_node_t *right; member in struct:__anon465
136 tre_ast_node_t *right; member in struct:__anon467
188 tre_ast_new_union(tre_mem_t mem, tre_ast_node_t *left, tre_ast_node_t *right) argument
194 return right;
197 if (!node || !right)
200 un->right = right;
201 node->num_submatches = left->num_submatches + right->num_submatches;
206 tre_ast_new_catenation(tre_mem_t mem, tre_ast_node_t *left, tre_ast_node_t *right) argument
1360 tre_ast_node_t *right = cat->right; local
1443 tre_ast_node_t *right = uni->right; local
1588 tre_ast_node_t *right = tre_stack_pop_voidptr(stack); local
[all...]
/seL4-camkes-master/projects/capdl/capDL-tool/
H A DMakefile18 %.test-OK: %.parse %.dot %.xml %.right
19 @diff -b $*.parse $*.right
26 camkes-adder-arm.test-thy-OK: $(TARGET) camkes-adder-arm.cdl camkes-adder-arm.thy.right
28 @diff -b camkes-adder-arm.thy camkes-adder-arm.thy.right || (echo "Isabelle output differs"; exit 1)
/seL4-camkes-master/projects/util_libs/libutils/include/utils/
H A Dsglib.h728 #define SGLIB___BIN_TREE_MAP_ON_ELEMENTS(type, tree, iteratedVariable, order, left, right, command) {\
748 _right_[_pathi_] = _cn_->right;\
773 #define SGLIB_BIN_TREE_MAP_ON_ELEMENTS(type, tree, _current_element_, left, right, command) {\
774 SGLIB___BIN_TREE_MAP_ON_ELEMENTS(type, tree, _current_element_, 1, left, right, command);\
777 #define SGLIB_BIN_TREE_MAP_ON_ELEMENTS_PREORDER(type, tree, _current_element_, left, right, command) {\
778 SGLIB___BIN_TREE_MAP_ON_ELEMENTS(type, tree, _current_element_, 0, left, right, command);\
781 #define SGLIB_BIN_TREE_MAP_ON_ELEMENTS_POSTORDER(type, tree, _current_element_, left, right, command) {\
782 SGLIB___BIN_TREE_MAP_ON_ELEMENTS(type, tree, _current_element_, 2, left, right, command);\
785 #define SGLIB___BIN_TREE_FIND_MEMBER(type, tree, elem, left, right, comparator, res) {\
792 else if (_c_ > 0) _s_ = _s_->right;\
[all...]
/seL4-camkes-master/projects/picotcp/docs/user_manual/
H A Duser_doc.tex52 \author{Copyright \copyright 2013-2015 Altran NV. All right reserved.}
/seL4-camkes-master/projects/lwip/src/core/
H A Dtcp_in.c101 static void tcp_add_sack(struct tcp_pcb *pcb, u32_t left, u32_t right);
1417 inseg.data pointer to point to the right place. This way, the
1468 "seqno %"U32_F" len %"U16_F" right edge %"U32_F"\n",
1520 /* Now trim right side of inseg if it overlaps with the first
1655 pcb->rcv_sacks[0].right = seqno + inseg.len;
1750 at the segment right in front of the newly added one. */
1773 "seqno %"U32_F" len %"U16_F" right edge %"U32_F"\n",
1797 We need to find the right edge. */
1801 we need to move sackbeg. After that we should find the right edge. */
1939 /* An MSS option with the right optio
2047 tcp_add_sack(struct tcp_pcb *pcb, u32_t left, u32_t right) argument
[all...]
/seL4-camkes-master/projects/seL4_projects_libs/libsel4vm/src/
H A Dguest_memory.c60 struct res_tree *right; member in struct:res_tree
80 SGLIB_DEFINE_RBTREE_PROTOTYPES(res_tree, left, right, color_field, reservation_node_cmp);
81 SGLIB_DEFINE_RBTREE_FUNCTIONS(res_tree, left, right, color_field, reservation_node_cmp);
/seL4-camkes-master/kernel/manual/parts/
H A Dipc.tex113 Trying to Send or Call without the Write right will fail and return an error. In
115 there is no way of knowing that a send has failed because of missing right.
117 does not have the Read right will raise a fault, see \autoref{sec:faults}. This
146 capabilities using an endpoint capability without the Grant right will
243 receiver TCB. The Grant right of that reply capability is set by copying the Grant
244 right of the endpoint capability invoked by the receiver in
261 \obj{Endpoint}. A reply capability has implicitly the Write right, so the
263 if the reply capability has the Grant right and is done in exactly the same way
H A Dobjects.tex183 % \hyphenation) makes it overrun the right margin. GBR knows an easy way to
220 right to send a reply message and wake up the caller, meaning that the
297 capabilities can have the grant right, which allows sending
H A Dvspace.tex266 An \obj{ASID Pool} confers the right to create a subset of the available
H A Dcspace.tex148 Grant, having GrantReply or not is irrelevant. The meaning of each right is interpreted
176 \caption{\label{tab:rights}seL4 access rights: What a specific right entitles a
/seL4-camkes-master/projects/lwip/src/include/lwip/
H A Dtcp.h158 * SACK entry is invalid if left==right. */
163 u32_t right; member in struct:tcp_sack_range
286 u32_t rcv_ann_right_edge; /* announced right edge of window */
289 /* SACK ranges to include in ACK packets (entry is invalid if left==right) */
291 #define LWIP_TCP_SACK_VALID(pcb, idx) ((pcb)->rcv_sacks[idx].left != (pcb)->rcv_sacks[idx].right)
/seL4-camkes-master/projects/projects_libs/libjansson/jansson-2.7/
H A Dcompile248 right script to run: please start by reading the file 'INSTALL'.
/seL4-camkes-master/tools/rumprun/tests/configure/build-aux/
H A Dcompile248 right script to run: please start by reading the file 'INSTALL'.
/seL4-camkes-master/projects/projects_libs/libusbdrivers/src/drivers/
H A Dusbkbd.c261 right 4f left 50 down 51 up 52 macro 64 dropdown 65
/seL4-camkes-master/projects/picotcp/test/unit/
H A Dmodunit_pico_tcp.c361 a->right = ar;
364 b->right = br;
367 c->right = cr;
/seL4-camkes-master/projects/picotcp/modules/
H A Dpico_tcp.c265 uint32_t right; member in struct:tcp_sack_block
1600 uint32_t left = 0, right = 0; local
1615 sb->right = long_be(right);
1620 right = 0;
1633 right = pkt->seq + pkt->payload_len;
1638 if(pkt->seq == right) {
1639 right += pkt->payload_len;
1648 sb->right = long_be(right);
[all...]
/seL4-camkes-master/tools/cogent/cogent/manual/
H A Dcogent-manual.tex391 %Tuple types in \cogent are right associative: If the rightmost field in a tuple type T again has a tuple type, the type T is equivalent
536 not occur in the type expression on the right-hand side. Thus the following type definition is illegal
582 it is strictly equivalent to the expression on the right-hand side in the definition. A type synonym with
585 In the definition of a generic type, the type parameters may occur in the \textit{MonoType} on the right-hand side.
611 Note that in the definition of a generic type, all type variables occurring in the type expression on the right-hand
1083 %Since tuple types are right associative, the pattern also conforms to all
1387 %Since tuple types are right associative, the same holds for the tuple terms. Hence, the example term is equivalent
1645 \code{o}, \code{\&\&}, \code{||} and \code{\$} which are right associative and \code{<, >, <=, >=, ==, /=} which
2036 in the corresponding position in the more specific forms, which is the right-hand side of a \textit{Binding} in a
2639 Productions are structured by indenting the right
[all...]
/seL4-camkes-master/tools/cogent/cogent/doc/
H A Ddoc.tex476 having them separately. We now have at most 4 different combinations. Getting simpler, right?
545 In the core calculus of \cogent, tuples are nested pairs, grouping from the right. For example, \inlinecogent{(a,b,c,d)} is equal to
720 Line 1 is one way to pattern match the argument, since tuples are right associative.
1527 % \item Update semantics properties. Not sure these would be necessary to relate the two semantics, as they're stronger statements (\emph{all} data, not just data I'm accessing right now). Still, it'd be nice to generate proofs of this, because it shows that the C is not only correct with respect to its results but also in terms of memory management (in particular, freeing stuff).

Completed in 320 milliseconds

12