/external/libcxx/test/std/utilities/function.objects/func.require/ |
binary_function.pass.cpp | 21 typedef std::binary_function<int, short, bool> bf; typedef 22 static_assert((std::is_same<bf::first_argument_type, int>::value), ""); 23 static_assert((std::is_same<bf::second_argument_type, short>::value), ""); 24 static_assert((std::is_same<bf::result_type, bool>::value), "");
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/function.objects/func.require/ |
binary_function.pass.cpp | 19 typedef std::binary_function<int, short, bool> bf; typedef 20 static_assert((std::is_same<bf::first_argument_type, int>::value), ""); 21 static_assert((std::is_same<bf::second_argument_type, short>::value), ""); 22 static_assert((std::is_same<bf::result_type, bool>::value), "");
|
/external/clang/test/Analysis/ |
stack-block-returned.cpp | 5 bptr bf(int j) { function
|
fields.c | 6 typedef struct bf { unsigned x:2; } bf; typedef in typeref:struct:bf 8 bf y;
|
/external/clang/test/CodeGenCXX/ |
debug-info-alias.cpp | 20 // CHECK: !DIGlobalVariable(name: "bf",{{.*}} type: [[BFLOAT:![0-9]+]] 22 x::bar<float> bf; variable
|
ptr-to-member-function.cpp | 20 void bf() { printf("B::bf called\n"); } function in struct:B 33 return &B::bf;
|
/external/clang/test/CoverageMapping/ |
logical.cpp | 5 bool bf = false; local 6 bool a = bt && bf; // CHECK-NEXT: File 0, [[@LINE]]:18 -> [[@LINE]]:20 = #1 8 bf; // CHECK-NEXT: File 0, [[@LINE]]:7 -> [[@LINE]]:9 = #2 9 a = bf || bt; // CHECK-NEXT: File 0, [[@LINE]]:13 -> [[@LINE]]:15 = #3 10 a = bf ||
|
/external/ltp/utils/ffsb-6.0-rc2/ |
metaops.c | 87 struct benchfiles *bf = (struct benchfiles *)fs_get_opdata(fs, opnum); local 90 createdir(bf, rd); 91 createdir(bf, rd); 92 removedir(bf, rd); 93 renamedir(bf, rd); 100 struct benchfiles *bf = (struct benchfiles *)fs_get_opdata(fs, opnum); local 104 newdir = add_dir(bf, 0, rd);
|
/external/wpa_supplicant_8/src/utils/ |
bitfield.c | 23 struct bitfield *bf; local 25 bf = os_zalloc(sizeof(*bf) + (max_bits + 7) / 8); 26 if (bf == NULL) 28 bf->bits = (u8 *) (bf + 1); 29 bf->max_bits = max_bits; 30 return bf; 34 void bitfield_free(struct bitfield *bf) 36 os_free(bf); [all...] |
/packages/apps/Gallery2/jni/filters/ |
hue.c | 36 float bf = r*mat[2] + g*mat[6] + b*mat[10] + mat[14]; local 40 rgb[BLUE] = clamp((int)bf);
|
/art/test/030-bad-finalizer/src/ |
Main.java | 65 BadFinalizer bf = new BadFinalizer(finalizerWait); local 68 bf = null; // Not that this would make a difference, could be eliminated earlier.
|
/external/clang/test/SemaCXX/ |
microsoft-new-delete.cpp | 18 struct bitfield { int n : 3; } bf; // expected-note {{here}} variable in typeref:struct:bitfield 21 void *r = new (bf.n) int[4]; // expected-error {{non-const reference cannot bind to bit-field}}
|
/external/llvm/examples/BrainF/ |
BrainFDriver.cpp | 19 // ./BrainF -jit prog.bf #Run program now 20 // ./BrainF -jit -abc prog.bf #Run program now safely 21 // ./BrainF prog.bf #Write as BitCode 23 // lli prog.bf.bc #Run generated BitCode 141 BrainF bf; local 142 std::unique_ptr<Module> Mod(bf.parse(in, 65536, cf, Context)); // 64 KiB
|
/external/mesa3d/src/compiler/nir/ |
nir_lower_idiv.c | 42 nir_ssa_def *numer, *denom, *af, *bf, *a, *b, *q, *r; local 60 bf = nir_i2f(bld, denom); 62 bf = nir_fabs(bld, bf); 67 bf = nir_u2f(bld, denom); 73 bf = nir_frcp(bld, bf); 74 bf = nir_isub(bld, bf, nir_imm_int(bld, 2)); /* yes, really */ 75 q = nir_fmul(bld, af, bf); [all...] |
/external/swiftshader/third_party/LLVM/examples/BrainF/ |
BrainFDriver.cpp | 19 // ./BrainF -jit prog.bf #Run program now 20 // ./BrainF -jit -abc prog.bf #Run program now safely 21 // ./BrainF prog.bf #Write as BitCode 23 // lli prog.bf.bc #Run generated BitCode 24 // llvm-ld -native -o=prog prog.bf.bc #Compile BitCode into native executable 127 BrainF bf; local 128 Module *mod = bf.parse(in, 65536, cf, Context); //64 KiB
|
/frameworks/base/services/core/java/com/android/server/am/ |
ReceiverList.java | 95 BroadcastFilter bf = get(i); local 96 bf.writeToProto(proto, ReceiverListProto.FILTERS); 118 BroadcastFilter bf = get(i); local 121 pw.print(Integer.toHexString(System.identityHashCode(bf))); 123 bf.dumpInReceiverList(pw, pr, p2);
|
/cts/tests/tests/renderscript/src/android/renderscript/cts/ |
SendToClient.java | 106 StringBuffer bf = new StringBuffer(); local 107 bf.append("[Wrong value]"); 108 bf.append("; i = " + i); 109 bf.append("; InValue = " + in); 110 bf.append("; exceptValue = " + temp); 111 return bf.toString();
|
/external/guava/guava-tests/test/com/google/common/hash/ |
BloomFilterTest.java | 53 // Ideally we would also test the bitSize() overflow of this BF, but it runs out of heap space 59 BloomFilter<String> bf = BloomFilter.create( local 63 // Insert "numInsertions" even numbers into the BF. 65 bf.put(Integer.toString(i)); 68 // Assert that the BF "might" have all of the even numbers. 70 assertTrue(bf.mightContain(Integer.toString(i))); 79 assertFalse("BF should not contain " + i, bf.mightContain(Integer.toString(i))); 83 // Check that there are exactly 29824 false positives for this BF. 87 if (bf.mightContain(Integer.toString(i))) 100 BloomFilter<String> bf = BloomFilter.create( local 141 BloomFilter<String> bf = BloomFilter.create( local 287 BloomFilter<Object> bf = BloomFilter.create(HashTestUtils.BAD_FUNNEL, 10, 0.03); local 372 BloomFilter<String> bf = BloomFilter.create(Funnels.unencodedCharsFunnel(), 100); local 434 BloomFilter<byte[]> bf = BloomFilter.create(Funnels.byteArrayFunnel(), 100); local 450 BloomFilter<byte[]> bf = BloomFilter.create(funnel, 100); local [all...] |
/external/iputils/ |
tftpsubs.c | 61 struct bf { struct 66 /* Values for bf.counter */ 102 struct bf *b; 126 struct bf *b; 191 struct bf *b;
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
TreeTraverserTest.java | 108 static final BinaryTree bf = new BinaryTree('f', bg, null); field in class:TreeTraverserTest 109 static final BinaryTree be = new BinaryTree('e', null, bf);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
TreeTraverserTest.java | 110 static final BinaryTree bf = new BinaryTree('f', bg, null); field in class:TreeTraverserTest 111 static final BinaryTree be = new BinaryTree('e', null, bf);
|
/external/mesa3d/src/mesa/main/ |
imports.h | 190 double af, bf; local 192 bf = (3 << 22) + 0.5 - (double)f; 195 __asm__ ("fstps %0" : "=m" (bi) : "t" (bf) : "st"); 199 double af, bf; 202 bf = (3 << 22) + 0.5 - (double)f; 204 u.f = (float) bf; bi = u.i;
|
/device/linaro/bootloader/edk2/StdLib/LibC/Stdio/ |
vsnprintf_ss.c | 138 char bf[128]; /* space for %c, %[diouxX] */
local 262 *(cp = bf) = va_arg(ap, int);
371 cp = bf + sizeof(bf);
412 size = bf + sizeof(bf) - cp;
419 cp = bf;
|
/external/fio/engines/ |
binject.c | 71 struct binject_file *bf = FILE_ENG_DATA(f); local 73 ret = read(bf->fd, p, left * sizeof(struct b_user_cmd)); 107 struct binject_file *bf = FILE_ENG_DATA(f); local 113 bd->fd_flags[i] = fio_set_fd_nonblocking(bf->fd, "binject"); 117 bd->pfds[i].fd = bf->fd; 157 struct binject_file *bf = FILE_ENG_DATA(f); local 162 if (fcntl(bf->fd, F_SETFL, bd->fd_flags[i]) < 0) 176 struct binject_file *bf = FILE_ENG_DATA(io_u->file); local 179 ret = write(bf->fd, buc, sizeof(*buc)); 190 struct binject_file *bf = FILE_ENG_DATA(io_u->file) local 332 struct binject_file *bf = FILE_ENG_DATA(f); local 346 struct binject_file *bf; local [all...] |
/external/llvm/test/MC/Lanai/ |
v11.s | 49 bf 0x123454 label 89 bf.r 0x5678
|