/external/libunwind/doc/ |
unw_get_proc_name.tex | 33 between procedure names and ordinary labels. Furthermore, if symbol 49 \section{Thread and Signal Safety}
|
unw_get_reg.tex | 20 \Var{reg} in the stack frame identified by cursor \Var{cp} and stores 23 The register numbering is target-dependent and described in separate 28 (``callee-saved'') registers and frame-related registers (such as the 44 \section{Thread and Signal Safety} 57 the \Func{access\_mem}(), \Func{access\_reg}(), and
|
unw_getcontext.tex | 23 (``callee-saved'') and all frame-related registers, such as the 26 This routine is normally implemented as a macro and applications 32 that of \Type{ucontext\_t} and such structures can be initialized with 34 reverse is \emph{not} true and it is \emph{not} safe to use structures 38 performance and does not, for example, save the signal mask. 45 \section{Thread and Signal Safety}
|
unw_is_fpreg.tex | 22 This routine is normally implemented as a macro and applications 31 \section{Thread and Signal Safety}
|
unw_is_signal_frame.tex | 20 if the current frame identified by \Var{cp} is a signal frame, and a 23 asynchronous interruption. For UNIX and UNIX-like platforms, such 39 \section{Thread and Signal Safety}
|
unw_regname.tex | 22 marks is returned. The returned string is statically allocated and 27 The \Func{unw\_regname}() routine cannot fail and always returns a 30 \section{Thread and Signal Safety}
|
unw_set_caching_policy.tex | 54 \section{Thread and Signal Safety}
|
unw_set_fpreg.tex | 23 The register numbering is target-dependent and described in separate 28 (``callee-saved'') registers and frame-related registers (such as the 43 \section{Thread and Signal Safety} 58 the \Func{access\_mem}(), \Func{access\_reg}(), and
|
unw_set_reg.tex | 23 The register numbering is target-dependent and described in separate 28 (``callee-saved'') registers and frame-related registers (such as the 44 \section{Thread and Signal Safety} 59 the \Func{access\_mem}(), \Func{access\_reg}(), and
|
unw_step.tex | 29 \section{Thread and Signal Safety}
|
/external/libvorbis/doc/ |
06-floor0.tex | 4 \section{Floor type 0 setup and decode} \label{vorbis:spec:floor0} 13 coding; LSP representation may be converted to LPC representation and 20 Floor zero configuration consists of six integer fields and a list of 36 6) [floor0_number_of_books] = read an unsigned integer of four bits and add 1 51 decoding the curve amplitude and \varname{[floor0_order]} LSP 52 coefficient values from the bitstream, and then computing the floor 86 1 ) bits. Nevertheless, the above specification is correct and values 93 \varname{[codebook_dimensions]} value of three and 97 condition, and care must be taken not to allow a buffer overflow in 98 decode. The extra values are not used and may be ignored or discarded [all...] |
07-floor1.tex | 4 \section{Floor type 1 setup and decode} \label{vorbis:spec:floor1} 10 mechanically on a linear frequency axis and a logarithmic (dB) 27 from x_0,y_0 to x_1,y_1 where in the base case x_0=0 and x_1=[n], the 31 logical line segment and produces a y_new value at that point computed 32 from the existing line's y value at x_new (as plotted by the line) and 36 x_0,y_0 to x_new,y_new and from x_new,y_new to x_1,y_1. This step is 53 0,16,32,48,64,80,96,112 and 128. In list order, the values interleave 54 as 0, 128, 64, 32, 96, 16, 48, 80 and 112. The corresponding 56 -45, 0, -25, -10, 30 and -10. We compute the floor in the following 64 We now draw new logical lines to reflect the correction to new_Y, and [all...] |
/external/llvm/test/MC/ARM/ |
arm-arithmetic-aliases.s | 26 and r2, r2, #6 label 27 and r2, #6 label 28 and r2, r2, r3 label 29 and r2, r3 label 31 @ CHECK: and r2, r2, #6 @ encoding: [0x06,0x20,0x02,0xe2] 32 @ CHECK: and r2, r2, #6 @ encoding: [0x06,0x20,0x02,0xe2] 33 @ CHECK: and r2, r2, r3 @ encoding: [0x03,0x20,0x02,0xe0] 34 @ CHECK: and r2, r2, r3 @ encoding: [0x03,0x20,0x02,0xe0] 67 @ Also check that we handle the predicate and cc_out operands.
|
/external/mockito/src/org/mockito/ |
AdditionalMatchers.java | 25 * It is recommended to use matchers from {@link Matchers} and keep stubbing and verification simple. 27 * Example of using logical and(), not(), or() matchers: 33 * //not "ejb" and not "michael jackson" 34 * mock.someMethod(and(not(eq("ejb")), not(eq("michael jackson")))); 438 * have the same type, length, and each element has to be equal. 454 * have the same length, and each element has to be equal. 468 * the same length, and each element has to be equal. 482 * the same length, and each element has to be equal. 496 * have the same length, and each element has to be equal 575 public static boolean and(boolean first, boolean second) { method in class:AdditionalMatchers 590 public static byte and(byte first, byte second) { method in class:AdditionalMatchers 605 public static char and(char first, char second) { method in class:AdditionalMatchers 620 public static double and(double first, double second) { method in class:AdditionalMatchers 635 public static float and(float first, float second) { method in class:AdditionalMatchers 650 public static int and(int first, int second) { method in class:AdditionalMatchers 665 public static long and(long first, long second) { method in class:AdditionalMatchers 680 public static short and(short first, short second) { method in class:AdditionalMatchers 697 public static <T> T and(T first, T second) { method in class:AdditionalMatchers [all...] |
/frameworks/base/core/java/com/android/internal/util/ |
Predicates.java | 13 * See the License for the specific language governing permissions and 32 * evaluates to true. The components are evaluated in order, and evaluation 35 public static <T> Predicate<T> and(Predicate<? super T>... components) { method in class:Predicates 36 return and(Arrays.asList(components)); 41 * evaluates to true. The components are evaluated in order, and evaluation 47 public static <T> Predicate<T> and(Iterable<? extends Predicate<? super T>> components) { method in class:Predicates 53 * evaluates to true. The components are evaluated in order, and evaluation 62 * evaluates to true. The components are evaluated in order, and evaluation
|
/prebuilts/clang/darwin-x86/host/3.4/lib/clang/3.4/include/ |
iso646.h | 6 * of this software and associated documentation files (the "Software"), to deal 8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 * copies of the Software, and to permit persons to whom the Software is 12 * The above copyright notice and this permission notice shall be included in 17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 30 #define and && macro
|
/prebuilts/clang/darwin-x86/host/3.5/lib/clang/3.5/include/ |
iso646.h | 6 * of this software and associated documentation files (the "Software"), to deal 8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 * copies of the Software, and to permit persons to whom the Software is 12 * The above copyright notice and this permission notice shall be included in 17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 30 #define and && macro
|
/prebuilts/clang/linux-x86/host/3.4/lib/clang/3.4/include/ |
iso646.h | 6 * of this software and associated documentation files (the "Software"), to deal 8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 * copies of the Software, and to permit persons to whom the Software is 12 * The above copyright notice and this permission notice shall be included in 17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 30 #define and && macro
|
/prebuilts/clang/linux-x86/host/3.5/lib/clang/3.5/include/ |
iso646.h | 6 * of this software and associated documentation files (the "Software"), to deal 8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 * copies of the Software, and to permit persons to whom the Software is 12 * The above copyright notice and this permission notice shall be included in 17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 30 #define and && macro
|
/prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.8/lib/gcc/aarch64-linux-android/4.8/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 19 You should have received a copy of the GNU General Public License and 21 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 32 #define and && macro
|
/prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/lib/gcc/aarch64-linux-android/4.9/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 19 You should have received a copy of the GNU General Public License and 21 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 32 #define and && macro
|
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.8/lib/gcc/arm-eabi/4.8/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 19 You should have received a copy of the GNU General Public License and 21 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 32 #define and && macro
|
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.8/lib/gcc/arm-linux-androideabi/4.8/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 19 You should have received a copy of the GNU General Public License and 21 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 32 #define and && macro
|
/prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 35 #define and && macro
|
/prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/ |
iso646.h | 5 GCC is free software; you can redistribute it and/or modify 35 #define and && macro
|