| /src/sys/arch/hppa/spmath/ |
| sfcmp.c | 57 register unsigned int left, right; local
62 right = *rightptr;
67 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )
76 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
77 && Sgl_isnotzero_mantissa(right)
78 && (Exception(cond) || Sgl_isone_signaling(right)) ) )
93 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
94 && Sgl_isnotzero_mantissa(right)) )
104 Sgl_xortointp1(left,right,xorresult);
110 && Sgl_iszero_exponentmantissa(right) )
[all...] |
| sfadd.c | 57 register unsigned int left, right, result, extent; local
68 right = *rightptr;
72 Sgl_xortointp1(left,right,/*to*/save);
81 if (Sgl_isnotnan(right))
83 if (Sgl_isinfinity(right) && save!=0)
117 else if (Sgl_is_signalingnan(right))
123 Sgl_set_quiet(right);
124 *dstptr = right;
137 if (Sgl_isinfinity_exponent(right))
139 if (Sgl_iszero_mantissa(right))
[all...] |
| sfsub.c | 57 register unsigned int left, right, result, extent; local
66 right = *rightptr;
70 Sgl_xortointp1(left,right,/*to*/save);
79 if (Sgl_isnotnan(right))
81 if (Sgl_isinfinity(right) && save==0)
115 else if (Sgl_is_signalingnan(right))
121 Sgl_set_quiet(right);
122 *dstptr = right;
135 if (Sgl_isinfinity_exponent(right))
137 if (Sgl_iszero_mantissa(right))
[all...] |
| /src/tests/usr.bin/xlint/lint1/ |
| expr_precedence.c | 44 int left, right; local
47 * Assignments are right-associative. If they were left-associative,
48 * the result of (left = right) would be an rvalue, resulting in this
51 left = right = arg;
68 * In almost all programming languages, '?:' is right-associative,
|
| gcc_init_compound_literal.c | 35 struct node *right; member in struct:node
|
| /src/external/gpl3/gcc/dist/libsanitizer/hwasan/ |
| hwasan_malloc_bisect.h | 33 uptr right = flags()->malloc_bisect_right; local
34 if (LIKELY(left == 0 && right == 0))
41 if (h < left || h > right)
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/hwasan/ |
| hwasan_malloc_bisect.h | 33 uptr right = flags()->malloc_bisect_right; local
34 if (LIKELY(left == 0 && right == 0))
41 if (h < left || h > right)
|
| /src/usr.bin/msgc/ |
| msgdb.h | 48 struct id_rec *left, *right; member in struct:id_rec
|
| /src/external/gpl3/gcc/dist/contrib/unicode/ |
| gen-box-drawing-chars.py | 26 right: bool) -> str:
36 if left and right:
39 right = False
47 for dir_name in ('up', 'down', 'vertical', 'left', 'right', 'horizontal'):
67 'HEAVY DOWN AND RIGHT'
87 right = (i & 1) variable
88 name = get_box_drawing_char_name(up, down, left, right)
|
| /src/sys/dev/raidframe/ |
| rf_sstf.h | 42 RF_SstfQ_t right; member in struct:RF_Sstf_s
|
| rf_cvscan.h | 68 RF_DiskQueueData_t *right; member in struct:RF_CvscanHeader_s
|
| /src/sys/external/mit/xen-include-public/dist/xen/include/public/io/ |
| libxenvchan.h | 67 * right is client read, server write
69 struct ring_shared left, right; member in struct:vchan_interface
94 * Grant list: ordering is left, right. Must not extend into actual ring
|
| /src/external/bsd/libbind/dist/include/isc/ |
| tree.h | 46 struct tree_s *left, *right; member in struct:tree_s
|
| /src/external/bsd/unbound/dist/util/ |
| rbtree.h | 60 /** right node (larger items) */
61 rbnode_type *right; member in struct:rbnode_type
|
| /src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| rbtree.h | 32 struct rbt_string_node *right; member in struct:rbt_string_node
39 and the child of every node without a "real" left or right child.
|
| /src/external/gpl3/gcc/dist/gcc/ |
| et-forest.h | 65 struct et_node *right; /* The brothers of the node. */ member in struct:et_node
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 190 size_type right = m_size - 1; local
192 while (right + 1 != left)
198 else if (pred(m_a_entries[right]))
199 --right;
202 _GLIBCXX_DEBUG_ASSERT(left < right);
203 std::swap(m_a_entries[left], m_a_entries[right]);
205 --right;
|
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| rbtree.h | 32 struct rbt_string_node *right; member in struct:rbt_string_node
39 and the child of every node without a "real" left or right child.
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| et-forest.h | 65 struct et_node *right; /* The brothers of the node. */ member in struct:et_node
|
| /src/external/gpl3/gcc.old/dist/libgomp/ |
| splay-tree.c | 48 tmp = n->right;
49 n->right = p;
54 /* Rotate the edge joining the right child N with its parent P. PP is the
63 p->right = tmp;
86 /* Left or right? If no child, then we're done. */
90 c = n->right;
94 /* Next one left or right? If found or no child, we're done
99 || (cmp2 > 0 && !c->right))
116 rotate_right (&n->right, c, c->right);
177 splay_tree_node left, right; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 190 size_type right = m_size - 1; local
192 while (right + 1 != left)
198 else if (pred(m_a_entries[right]))
199 --right;
202 _GLIBCXX_DEBUG_ASSERT(left < right);
203 std::swap(m_a_entries[left], m_a_entries[right]);
205 --right;
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 24 node *right; member in struct:node
36 new_node->right = NULL;
55 if (root->right)
56 tree_insert (root->right, val);
58 root->right = make_node(val);
76 if (curr->right)
77 todo.push_back (curr->right);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 24 node *right; member in struct:node
36 new_node->right = NULL;
55 if (root->right)
56 tree_insert (root->right, val);
58 root->right = make_node(val);
76 if (curr->right)
77 todo.push_back (curr->right);
|
| /src/games/dab/ |
| box.h | 57 right = 3, enumerator in enum:BOX::EDGE
|
| /src/external/bsd/nsd/dist/ |
| rbtree.h | 24 rbnode_type *right; member in struct:rbnode
|
