| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
| node_iterators.hpp | 168 const bool is_end = m_p_begin_value == m_p_end_value; local
171 if (is_end)
175 return (is_end);
|
| node_iterators.hpp | 168 const bool is_end = m_p_begin_value == m_p_end_value; local
171 if (is_end)
175 return (is_end);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
| node_iterators.hpp | 168 const bool is_end = m_p_begin_value == m_p_end_value; local
171 if (is_end)
175 return (is_end);
|
| node_iterators.hpp | 168 const bool is_end = m_p_begin_value == m_p_end_value; local
171 if (is_end)
175 return (is_end);
|
| /src/external/lgpl2/userspace-rcu/dist/src/ |
| rculfhash.c | 905 int is_end(struct cds_lfht_node *node) function
987 if (caa_unlikely(is_end(iter)))
1111 if (caa_unlikely(is_end(iter)))
1744 if (caa_unlikely(is_end(node))) {
1781 if (caa_unlikely(is_end(node))) {
1810 if (caa_unlikely(is_end(node))) {
1951 } while (!is_end(node));
1973 } while (!is_end(node));
2090 } while (!is_end(node));
|
| rculfhash.c | 905 int is_end(struct cds_lfht_node *node) function
987 if (caa_unlikely(is_end(iter)))
1111 if (caa_unlikely(is_end(iter)))
1744 if (caa_unlikely(is_end(node))) {
1781 if (caa_unlikely(is_end(node))) {
1810 if (caa_unlikely(is_end(node))) {
1951 } while (!is_end(node));
1973 } while (!is_end(node));
2090 } while (!is_end(node));
|
| /src/usr.bin/xlint/lint1/ |
| lex.c | 1020 bool *is_begin, bool *is_end, bool *is_system)
1024 *is_end = false;
1039 *is_end = true;
1095 bool is_begin, is_end, is_system; local
1096 parse_line_directive_flags(p, &is_begin, &is_end, &is_system);
1097 update_location(curr_pos.p_file, (int)ln, is_begin, is_end);
|
| lex.c | 1020 bool *is_begin, bool *is_end, bool *is_system)
1024 *is_end = false;
1039 *is_end = true;
1095 bool is_begin, is_end, is_system; local
1096 parse_line_directive_flags(p, &is_begin, &is_end, &is_system);
1097 update_location(curr_pos.p_file, (int)ln, is_begin, is_end);
|
