Searched refs:right (Results 26 - 50 of 335) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/
H A Derase_fn_imps.hpp229 size_type right = m_size - 1; local
231 while (right + 1 != left)
237 else if (pred(m_a_entries[right]))
238 --right;
241 _GLIBCXX_DEBUG_ASSERT(left < right);
243 std::swap(m_a_entries[left], m_a_entries[right]);
246 --right;
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dfibheap.c71 node->right = node;
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
223 is needed so that delete's call to extractmin gets the right node. */
295 y = x->right;
311 heap->min = ret->right;
328 node->right = node;
333 and it's right node. */
442 if (a == a->right)
444 a->right
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dfibheap.c71 node->right = node;
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
223 is needed so that delete's call to extractmin gets the right node. */
295 y = x->right;
311 heap->min = ret->right;
328 node->right = node;
333 and it's right node. */
442 if (a == a->right)
444 a->right
[all...]
/freebsd-11-stable/share/examples/ppp/
H A Dlogin-auth54 pack .l.value -side right;
64 pack .p.value -side right;
73 pack .b.cancel -side right;
/freebsd-11-stable/contrib/gcc/
H A Det-forest.h68 struct et_node *right; /* The brothers of the node. */ member in struct:et_node
H A Dtree-chrec.h105 tree right)
108 || right == chrec_dont_know)
111 gcc_assert (TREE_TYPE (left) == TREE_TYPE (right));
114 build_int_cst (NULL_TREE, loop_num), left, right);
100 build_polynomial_chrec(unsigned loop_num, tree left, tree right) argument
/freebsd-11-stable/sys/netgraph/
H A Dng_tee.h53 #define NG_TEE_HOOK_RIGHT "right"
77 struct ng_tee_hookstat right; member in struct:ng_tee_stats
85 { "right", (hstype) }, \
/freebsd-11-stable/contrib/ipfilter/
H A Dradix_ipf.c143 /* Parameters: tree(I) - pointer to first right node in tree to search */
158 cur = cur->right;
394 cur = cur->right;
403 prev->right = &nodes[1];
408 nodes[1].right = cur;
410 nodes[1].right = &nodes[0];
463 cur = nodes[1].right;
562 prev->right = &nodes[0];
629 node->right = found->right;
[all...]
/freebsd-11-stable/sys/contrib/ipfilter/netinet/
H A Dradix_ipf.c143 /* Parameters: tree(I) - pointer to first right node in tree to search */
158 cur = cur->right;
394 cur = cur->right;
403 prev->right = &nodes[1];
408 nodes[1].right = cur;
410 nodes[1].right = &nodes[0];
463 cur = nodes[1].right;
562 prev->right = &nodes[0];
629 node->right = found->right;
[all...]
/freebsd-11-stable/contrib/ncurses/form/
H A Dfld_newftyp.c42 (FIELDTYPE *)0, /* pointer to right operand */
136 if (typ->right)
137 typ->right->ref--;
H A Dfld_ftlink.c71 nftyp->right = type2;
/freebsd-11-stable/contrib/groff/src/preproc/eqn/
H A Ddelim.cpp166 char *right; member in class:delim_box
191 : left(l), right(r), p(pp)
198 a_delete right; local
371 if (right) {
372 define_extensible_string(right, uid, RIGHT_DELIM);
384 if (right)
398 if (right)
399 fprintf(stderr, " right \"%s\"", right);
H A Dlist.cpp64 static int compute_spacing(int is_script, int left, int right) argument
66 if (left == SUPPRESS_TYPE || right == SUPPRESS_TYPE)
70 if (left == OPENING_TYPE || right == CLOSING_TYPE)
72 if (right == BINARY_TYPE || left == BINARY_TYPE)
74 if (right == RELATION_TYPE) {
82 if (right == OPERATOR_TYPE)
84 if (left == INNER_TYPE || right == INNER_TYPE)
86 if (left == OPERATOR_TYPE && right == ORDINARY_TYPE)
/freebsd-11-stable/usr.bin/ctags/
H A Dprint.c111 if (node->right)
112 put_entries(node->right);
/freebsd-11-stable/usr.bin/m4/
H A Dparser.y40 %right EXPONENT
41 %right UMINUS UPLUS '!' '~'
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Core/
H A DIOStreamMacros.h15 #define RAW_HEXBASE std::setfill('0') << std::hex << std::right
30 std::left << std::setfill(' ') << std::setw(w) << (s) << std::right
/freebsd-11-stable/usr.bin/sdiff/
H A Dedit.c87 eparse(const char *cmd, const char *left, const char *right) argument
109 if (right == NULL)
113 if (asprintf(&text, "%s\n%s\n", left, right) == -1)
130 /* Skip if there is no right column. */
131 if (right == NULL)
134 if (asprintf(&text, "%s\n", right) == -1)
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/
H A DAnsiTerminal.h111 llvm::StringRef left, right; local
112 std::tie(left, right) = format.split(tok_hdr);
116 if (left == format && right.empty()) {
123 if (!right.consume_front(code.name))
131 format = right;
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c38 * any given node, the left and right subtrees are allowed to differ in height
66 * - The left/right children pointers of a node are in an array.
68 * left and right indices. The implementation is written as if it only
70 * to "left", the code also works for right handed trees. The
74 * // 1 for dealing with right children
77 * // +1 when right subtree is taller
79 * int right; // will be the opposite of left (0 or 1)
82 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
111 * left and right children when examining a tree. C "if()" statements
128 * - otherwise we return through parent nodes until we've come from a right
140 int right = 1 - left; local
306 int right = 1 - left; local
687 int right; local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1477 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
1655 bool operator()(SUnit* left, SUnit* right) const {
1656 // reverse left/right rather than simply !SortFunc(left, right)
1658 return SortFunc(right, left);
1675 bool operator()(SUnit* left, SUnit* right) const;
1689 bool operator()(SUnit* left, SUnit* right) const;
1705 bool operator()(SUnit* left, SUnit* right) const;
1722 bool operator()(SUnit* left, SUnit* right) const;
1929 // Return -1 to schedule right abov
[all...]
/freebsd-11-stable/contrib/xz/src/liblzma/common/
H A Dindex.c41 index_tree_node *right; member in struct:index_tree_node_s
202 if (node->right != NULL)
203 index_tree_node_end(node->right, allocator, free_func);
234 node->right = NULL;
252 tree->rightmost->right = node;
269 index_tree_node *pivot = node->right;
274 assert(node->parent->right == node);
275 node->parent->right = pivot;
280 node->right = pivot->left;
281 if (node->right !
748 index_stream *right = (index_stream *)(this->node.right); local
1233 size_t right = group->last; local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Drecovery.c68 know exists, right a revision that we know does not exist. */
70 svn_revnum_t left, right = 1; local
73 /* Keep doubling right, until we find a revision that doesn't exist. */
79 SVN_ERR(revision_file_exists(&exists, fs, right, iterpool));
83 right <<= 1;
86 left = right >> 1;
88 /* We know that left exists and right doesn't. Do a normal bsearch to find
90 while (left + 1 < right)
92 svn_revnum_t probe = left + ((right - left) / 2);
100 right
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/
H A Dtoken.c46 svn_diff__node_t *right; member in struct:svn_diff__node_t
126 node_ref = &parent->right;
134 new_node->right = NULL;
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/atomic/sparc64/
H A Dopensolaris_atomic.S80 and %o0, 0x3, %o4 ! %o4 = byte offset, left-to-right
81 xor %o4, 0x3, %g1 ! %g1 = byte offset, right-to-left
82 sll %g1, 3, %g1 ! %g1 = bit offset, right-to-left
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_stats_timing.cpp104 os << std::setw(width - 3) << std::right << "0.00" << std::setw(3)
119 << std::right << (negative ? -interval : interval) << std::setw(2)
126 os << std::setprecision(2) << std::fixed << std::right << std::setw(width - 3)

Completed in 146 milliseconds

1234567891011>>