| /haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.abi/ |
| H A D | bitfields.C | 39 bool is_set = (buf[bit / 8] & (1 << (bit % 8))) != 0; local
41 if (! is_set)
45 if (is_set)
|
| /haiku-buildtools/gcc/gcc/ada/ |
| H A D | expect.c | 155 int *is_set)
166 is_set[i] = 0;
189 is_set[i] = 1;
260 int *is_set)
276 is_set[i] = 0;
325 is_set[i] = 1;
417 int *is_set)
457 is_set[i] = 1;
461 is_set[i] = 0;
538 int *is_set ATTRIBUTE_UNUSE
151 __gnat_expect_poll(int *fd, int num_fd, int timeout, int *dead_process, int *is_set) argument
256 __gnat_expect_poll(int *fd, int num_fd, int timeout, int *dead_process, int *is_set) argument
413 __gnat_expect_poll(int *fd, int num_fd, int timeout, int *dead_process, int *is_set) argument
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
| H A D | template26.C | 55 int is_set() const { return is_set_; } function in class:Parameter
65 if ((stack[i].*access)().is_set()) {
|
| /haiku-buildtools/gcc/libstdc++-v3/src/filesystem/ |
| H A D | dir.cc | 77 is_set(Bitmask obj, Bitmask bits) function in namespace:__anon2434
96 && is_set(options, fs::directory_options::skip_permission_denied))
164 && is_set(options, directory_options::skip_permission_denied))
260 && is_set(options, fs::directory_options::skip_permission_denied))
319 = is_set(options, fs::directory_options::follow_directory_symlink);
|
| H A D | ops.cc | 241 inline bool is_set(Bitmask obj, Bitmask bits) function in namespace:__anon277
370 if (is_set(option, opts::skip_existing))
375 else if (is_set(option, opts::update_existing))
383 else if (!is_set(option, opts::overwrite_existing))
403 if (is_set(option, opts::overwrite_existing|opts::update_existing))
410 if (errno == EEXIST && is_set(option, opts::skip_existing))
470 const bool skip_symlinks = is_set(options, copy_options::skip_symlinks);
471 const bool create_symlinks = is_set(options, copy_options::create_symlinks);
472 const bool copy_symlinks = is_set(options, copy_options::copy_symlinks);
530 if (is_set(option
[all...] |
| /haiku-buildtools/gcc/libcilkrts/include/cilk/ |
| H A D | reducer_min_max.h | 208 * @subsection redminmax_initial Initial Values and is_set()
230 * the view���s `is_set()` function, which will return true if the reducer
235 * // r1->is_set() == true
239 * // r2->is_set() == false
242 * // r2->is_set() == true
447 /** @defgroup ReducersMinMaxIsSet The ���is_set optimization���
456 * `(value, is_set)`. When `is_set` is true, the pair represents the known
457 * value `value`; when `is_set` is false, the pair represents the identity
463 * smallest and largest values. Testing `is_set` fo
816 bool is_set() const { return m_is_set; } function in class:cilk::cilk_lib_1_0::min_max_internal::view_content
859 bool is_set() const { return true; } function in class:cilk::cilk_lib_1_0::min_max_internal::view_content
950 bool is_set() const { return m_is_set; } function in class:cilk::cilk_lib_1_0::min_max_internal::index_view_content
2298 bool is_set() const { return view().is_set(); } function in class:cilk::cilk_lib_1_0::reducer_max
2498 bool is_set() const { return view().is_set(); } function in class:cilk::cilk_lib_1_0::reducer_min
2719 bool is_set() const { return view().is_set(); } function in class:cilk::cilk_lib_1_0::reducer_max_index
2905 bool is_set() const { return view().is_set(); } function in class:cilk::cilk_lib_1_0::reducer_min_index
[all...] |
| /haiku-buildtools/gcc/gcc/config/spu/ |
| H A D | spu-protos.h | 27 extern void spu_emit_branch_or_set (int is_set, rtx cmp, rtx * operands);
|
| H A D | spu.c | 699 spu_emit_branch_or_set (int is_set, rtx cmp, rtx operands[])
746 if (GET_CODE (op1) == CONST_INT && is_set == 1)
894 if (is_set == 0 && op1 == const0_rtx
945 if (is_set == 0)
970 else if (is_set == 2)
696 spu_emit_branch_or_set(int is_set, rtx cmp, rtx operands[]) argument
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | dse.c | 259 bool is_set; member in struct:store_info
1317 while (!store_info->is_set)
1592 while (!s_info->is_set)
1724 store_info->is_set = GET_CODE (body) == SET;
1732 return store_info->is_set ? 1 : 0;
2211 while (!store_info->is_set)
2253 while (!store_info->is_set)
2341 while (!store_info->is_set)
2567 while (!store_info->is_set)
2796 while (!store_info->is_set)
[all...] |
| H A D | df-problems.c | 2430 df_word_lr_mark_ref (df_ref ref, bool is_set, regset live)
2457 if (is_set)
2425 df_word_lr_mark_ref(df_ref ref, bool is_set, regset live) argument
|
| /haiku-buildtools/isl/ |
| H A D | isl_aff.c | 3835 int is_set; local
3837 is_set = isl_map_is_set(map);
3855 if (is_set) {
3999 * If "is_set" is set, then the affine expression is of the form
4008 unsigned n_in, unsigned n_out, int is_set)
4018 if (!is_set)
4106 int is_set; local
4108 is_set = isl_map_is_set(map);
4114 if (is_set)
4135 ma = range_map(aff, d, n_in, n_out, is_set);
4007 range_map(__isl_take isl_aff *aff, int d, unsigned n_in, unsigned n_out, int is_set) argument
[all...] |