HomeSort by: relevance | last modified time | path
    Searched refs:So (Results 1 - 25 of 114) sorted by relevancy

1 2 3 4 5

  /src/external/bsd/unbound/dist/doc/
README.ipset.md 5 So, I set up a transparent proxy to proxy the traffic which has been blocked only.
7 I did some research for this. Unfortunately, Unbound, My favorite dns service doesn't support ipset yet. So, I decided to implement it by my self and contribute the patch. It's good for me and the community.
  /src/external/gpl2/gettext/dist/gettext-tools/tests/
msgattrib-properties-1 16 !The\ world\ is\ full\ of\ married\ men=So viele verheiratete M\u00e4nner
48 !The\ world\ is\ full\ of\ married\ men=So viele verheiratete M\u00e4nner
msgexec-3 16 !The\ world\ is\ full\ of\ married\ men=So viele verheiratete M\u00e4nner
64 So viele verheiratete Männer
msgexec-1 21 msgstr "So viele verheiratete M�nner"
91 So viele verheiratete M�nner
msgfilter-3 44 !The\ world\ is\ full\ of\ married\ men=So viele verheiratete M\u00e4nner
78 !The\ world\ is\ full\ of\ married\ men=So viele \nverheiratete M\u00e4nner
  /src/external/gpl3/gcc/dist/libgcc/config/or1k/
crti.S 27 l.nop # So _init doesn't start at 0
  /src/external/gpl3/gcc.old/dist/libgcc/config/or1k/
crti.S 27 l.nop # So _init doesn't start at 0
  /src/usr.sbin/sysinst/arch/shark/
msg.md.de 87 straight from a FFS partition on the local hard disk. So, to configure it
msg.md.en 83 straight from a FFS partition on the local hard disk. So, to configure it
msg.md.pl 85 straight from a FFS partition on the local hard disk. So, to configure it
  /src/external/gpl3/gdb/dist/sim/testsuite/msp430/
testutils.inc 21 # start up code, so the data still resides at the LMA
29 # but the assembler cannot cope with this expression. So we
31 # first string in the .data section and so (_passmsg -
  /src/external/gpl3/gdb.old/dist/sim/testsuite/msp430/
testutils.inc 21 # start up code, so the data still resides at the LMA
29 # but the assembler cannot cope with this expression. So we
31 # first string in the .data section and so (_passmsg -
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/
align.exp 91 So we avoid using alignof, and use __alignof__ instead. */
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/
align.exp 91 So we avoid using alignof, and use __alignof__ instead. */
  /src/external/apache2/llvm/dist/llvm/lib/Support/Windows/
Signals.inc 42 // specifier. So these warnings are spurious in this case. Since we compile
43 // with -Wall, this will generate these warnings which should be ignored. So
45 // not support push and pop for diagnostics, so we have to manually turn it
52 // DebugHlp APIs. So we will have to load them manually. The structures and
227 // StackWalk64 modifies the incoming stack frame and context, so copy them.
230 // Copy the register context so that we don't modify it while we unwind. We
304 // and DWARF, so it should do a good job regardless of what debug info or
844 // is fired. Killing a process in this way is normal, so don't trigger the
855 // to catch it in this thread so it will kill the process.
867 // We turned these warnings off for this file so that MinGW-g++ doesn'
    [all...]
  /src/lib/libc/arch/sparc/gen/
divrem.m4 64 * R the remainder so far, initially the dividend
168 ! `Here the dividend is >= 2^(31-N) or so. We must be careful here,
172 ! the top decade: so do not even bother to compare to R.'
208 ! We have to be careful here. We know that R >= V, so we can do the
213 ! So we unroll slightly...
  /src/sys/lib/libkern/arch/sparc/
divrem.m4 64 * R the remainder so far, initially the dividend
168 ! `Here the dividend is >= 2^(31-N) or so. We must be careful here,
172 ! the top decade: so do not even bother to compare to R.'
208 ! We have to be careful here. We know that R >= V, so we can do the
213 ! So we unroll slightly...
  /src/sys/lib/libkern/arch/sparc64/
divrem.m4 68 * R the remainder so far, initially the dividend
169 ! `Here the dividend is >= 2^(31-N) or so. We must be careful here,
173 ! the top decade: so do not even bother to compare to R.'
209 ! We have to be careful here. We know that R >= V, so we can do the
214 ! So we unroll slightly...
  /src/external/lgpl3/gmp/dist/mpn/powerpc32/
mode1o.asm 58 C the divisor. So the fastest is for instance divisor==1 (inverse==-1), and
76 C Load from our table with PIC is so slow on Linux and Darwin that we avoid it
95 mullw r7, r5, r7 C i*i*d [i*i is 16 bits, so second operand]
  /src/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/
com.asm 40 C aligned to a 16 byte boundary and only 16 bytes long. Maybe that's so it
44 C If both src and dst are 4mod8, the loop runs at 1.5 c/l. So long as one
  /src/sys/arch/mvme68k/stand/sboot/
oc_cksum.s 51 | of the buffer so will only work on a 68010 if the buffer is
74 | me why.) So, since 16 was good for both large and small counts,
106 | case is header checksums) so we give that the faster
  /src/tests/usr.bin/indent/
t_misc.sh 264 /* $ The indentation is 3 + (int)(3.5 * 3), so 3 + 10.5, so 13. */
267 /* $ The indentation is 3 + (int)3.5 * 3 + 3, so 3 + 9 + 3, so 15. */
310 ; So is this comment.
  /src/sys/arch/m68k/m68k/
oc_cksum.s 47 | of the buffer so will only work on a 68010 if the buffer is
70 | me why.) So, since 16 was good for both large and small counts,
101 | case is header checksums) so we give that the faster
116 addl %a0,%a1 | add start so a1 now points to end
120 subl %d1,%d1 | this can never carry so X is cleared
  /src/sys/arch/sparc/stand/ofwboot/
srt0.s 92 sub %sp, %g1, %g1 ! This is so we properly sign-extend things
101 wrpr %g0, 0, %pil ! So I lied
271 * registers so that it works even with 32-bit compilers.
293 * registers so that it works even with 32-bit compilers.
329 * registers so that it works even with 32-bit compilers.
  /src/crypto/external/bsd/openssl.old/dist/crypto/bn/asm/
armv8-mont.pl 89 and $tp,$tp,#-16 // ABI says so
112 // $lo0 being non-zero. So that carry can be calculated
227 // subtraction. So we subtract modulus, see if it borrowed,
909 // subtraction. So we subtract modulus, see if it borrowed,
1397 // subtraction. So we subtract modulus, see if it borrowed,

Completed in 65 milliseconds

1 2 3 4 5