Searched refs:split (Results 76 - 100 of 194) sorted by relevance

12345678

/haiku-buildtools/gcc/gcc/
H A Dgensupport.c73 struct queue_elem *split; member in struct:queue_elem
403 e->split = NULL;
525 rtx split;
531 /* Create a split with values from the insn_and_split. */
532 split = rtx_alloc (DEFINE_SPLIT);
535 XVEC (split, 0) = rtvec_alloc (i);
538 XVECEXP (split, 0, i) = copy_rtx (XVECEXP (desc, 1, i));
539 remove_constraints (XVECEXP (split, 0, i));
542 /* If the split condition starts with "&&", append it to the
543 insn condition to create the new split conditio
522 rtx split; local
1675 rtx pred, insn, pattern, split; local
[all...]
/haiku-buildtools/autoconf/bin/
H A Dautom4te.in570 foreach (split (/\W+/))
997 for (split (/\n*$separator\n*/o, contents ("$tmp/warnings")))
1005 my ($cat, $loc, $msg, $stacktrace) = split ('::', $_, 4);
1007 for (split /\n/, $stacktrace)
1009 my ($loc, $trace) = split (': ', $_, 2);
H A Dautoscan.in275 foreach my $word (split (/\W+/))
326 foreach my $word (split (/\s+/))
597 my ($file, $line, $macro, @args) = split (/:/, $_);
602 foreach my $word (split (/\s|,/, $args[0]))
H A Dautoreconf.in159 @warning = map { split /,/ } @warning;
476 push @subdir, split (' ', $1) if /AC_CONFIG_SUBDIRS:(.*)/ && $recursive;
H A Dautoheader.in195 ($config_h, $config_h_in) = split (':', $config_h, 2);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dbinomial_heap_base_.hpp132 split(Pred, PB_DS_CLASS_C_DEC&);
H A Dsplit_join_fn_imps.hpp45 split(Pred pred, PB_DS_CLASS_C_DEC& other) function in class:PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dpairing_heap_.hpp134 split(Pred, pairing_heap&);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Drc_binomial_heap_.hpp123 split(Pred, PB_DS_CLASS_C_DEC&);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/performance/assoc/timing/
H A Dtree_split_join_test.hpp66 m_r_container.split(*mid_it, other);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/
H A Ddebug_map_base.hpp111 split(key_const_reference, Cmp_Fn, PB_DS_CLASS_C_DEC&);
309 split(key_const_reference r_key, Cmp_Fn cmp_fn, PB_DS_CLASS_C_DEC& other) function in class:__gnu_pbds::detail::PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dsplit_fn_imps.hpp44 split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other) function in class:PB_DS_CLASS_C_DEC
124 _GLIBCXX_DEBUG_ONLY(debug_base::split(r_key,(synth_access_traits&)(*this), other);)
/haiku-buildtools/gcc/libgcc/config/i386/
H A Dmorestack.S86 # The amount of space we ask for when calling non-split-stack code.
89 # This entry point is for split-stack code which calls non-split-stack
115 subl $NON_SPLIT_STACK,%eax # less space for non-split code.
127 # Since we aren't doing a full split stack, we don't need to
149 # full stack split routine. FIXME: This is fragile.
193 subq $NON_SPLIT_STACK,%rax # less space for non-split code.
207 # full stack split routine. FIXME: This is fragile.
861 .section .note.GNU-split-stack,"",@progbits
862 .section .note.GNU-no-split
[all...]
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/
H A Dpowser1.go66 // split reads a single demand channel and replicates its
71 // When multiple generations of split exist, the newest
110 func split(in *dch, out *dch2) { func
316 go split(U,UU)
536 split(Mul(Cmul(neg(z),U),Shift(z,ZZ[0])),ZZ)
551 split(Integ(one,Mul(ZZ[0],Diff(U))),ZZ)
H A Dpowser2.go76 // split reads a single demand channel and replicates its
81 // When multiple generations of split exist, the newest
120 func split(in *dch, out *dch2){ func
330 go split(U,UU)
550 split(Mul(Cmul(neg(z),U),Shift(z,ZZ[0])),ZZ)
565 split(Integ(one,Mul(ZZ[0],Diff(U))),ZZ)
/haiku-buildtools/gcc/contrib/testsuite-management/
H A Dvalidate_failures.py186 (_, value) = line.split('=', 1)
209 (attrs, line) = line.split('|', 1)
407 sum_files = results.split()
/haiku-buildtools/binutils/gas/testsuite/gas/rx/
H A Dexplode159 @l = split(//, $l);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
H A Dsplit_join_fn_imps.hpp45 split(Pred pred, PB_DS_CLASS_C_DEC& other) function in class:PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
H A Drb_tree_.hpp176 split(key_const_reference, PB_DS_CLASS_C_DEC&);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Dthin_heap_.hpp131 split(Pred, PB_DS_CLASS_C_DEC&);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/native_type/
H A Dnative_priority_queue.hpp172 split(Pred pred, PB_DS_CLASS_C_DEC& other) function in class:__gnu_pbds::test::native_priority_queue
/haiku-buildtools/gcc/gmp/tune/
H A Dalpha.asm26 C The rpcc instruction returns a 64-bit value split into two 32-bit fields.
/haiku-buildtools/legacy/gcc/gcc/
H A Dcombine.c1931 with no ASM_OPERANDS that wasn't recognized, try to split it into two
1932 insns. There are two ways to do this. It can be split using a
1939 rtx m_split, *split;
1942 /* See if the MD file can split NEWPAT. If it can't, see if letting it
1991 code doesn't get executed and we do a split the other way. */
2035 /* If we can split it and use I2DEST, go ahead and see if that
2038 if (insn_code_number < 0 && (split = find_split_point (&newpat, i3)) != 0
2044 && (GET_MODE (*split) == GET_MODE (i2dest)
2045 || GET_MODE (*split) == VOIDmode
2050 || ! use_crosses_set_p (*split, INSN_CUI
1930 rtx m_split, *split; local
2643 rtx *split; local
[all...]
/haiku-buildtools/legacy/binutils/libiberty/
H A Dmaint-tool260 push(@pending, split(' ', $deps{$p}));
/haiku-buildtools/binutils/libiberty/
H A Dmaint-tool263 push(@pending, split(' ', $deps{$p}));

Completed in 1780 milliseconds

12345678