HomeSort by relevance Sort by last modified time
    Searched defs:bf (Results 1 - 25 of 117) sorted by null

1 2 3 4 5

  /external/libcxx/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), "");
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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 ||
  /art/test/030-bad-finalizer/src/
Main.java 22 BadFinalizer bf = new BadFinalizer(); local
25 bf = null;
  /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...]
utils_module_tests.c 127 struct bitfield *bf; local
133 bf = bitfield_alloc(123);
134 if (bf == NULL)
138 if (bitfield_is_set(bf, i) || bitfield_is_set(bf, i + 1))
140 if (i > 0 && bitfield_is_set(bf, i - 1))
142 bitfield_set(bf, i);
143 if (!bitfield_is_set(bf, i))
145 bitfield_clear(bf, i);
146 if (bitfield_is_set(bf, i)
    [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);
  /frameworks/base/services/core/java/com/android/server/am/
ReceiverList.java 84 BroadcastFilter bf = get(i); local
87 pw.print(Integer.toHexString(System.identityHashCode(bf)));
89 bf.dumpInReceiverList(pw, pr, p2);
  /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
126 BrainF bf; local
127 std::unique_ptr<Module> Mod(bf.parse(in, 65536, cf, Context)); // 64 KiB
  /cts/tests/tests/renderscript/src/android/renderscript/cts/
SendToClient.java 95 StringBuffer bf = new StringBuffer(); local
96 bf.append("[Wrong value]");
97 bf.append("; i = " + i);
98 bf.append("; InValue = " + in);
99 bf.append("; exceptValue = " + temp);
100 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);
  /ndk/sources/host-tools/make-3.81/
strcache.c 192 int bf = sp->bytesfree; local
193 int sz = (sp->end - sp->buffer) + bf;
202 totfree += bf;
203 maxfree = (bf > maxfree ? bf : maxfree);
204 minfree = (bf < minfree ? bf : minfree);
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
TestBagFormatter.java 41 BagFormatter bf = new BagFormatter(); local
52 System.out.println(propAlias + "\t" + bf.join(up.getNameAliases()));
66 System.out.println("\t" + bf.join(valueAlias + "\t" + up.getValueAliases(valueAlias)));
92 BagFormatter bf = new BagFormatter(); local
96 bf.showSetNames(BagFormatter.CONSOLE,us);
100 bf.showSetNames(BagFormatter.CONSOLE,us);
104 bf.showSetNames(BagFormatter.CONSOLE,us);
109 bf.showSetNames(BagFormatter.CONSOLE, us);
231 BagFormatter bf = new BagFormatter();
236 System.out.println(bf.showSetNames(propAlias + " with " + matches, stuff))
    [all...]
  /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
TestBagFormatter.java 40 BagFormatter bf = new BagFormatter(); local
51 System.out.println(propAlias + "\t" + bf.join(up.getNameAliases()));
65 System.out.println("\t" + bf.join(valueAlias + "\t" + up.getValueAliases(valueAlias)));
91 BagFormatter bf = new BagFormatter(); local
95 bf.showSetNames(BagFormatter.CONSOLE,us);
99 bf.showSetNames(BagFormatter.CONSOLE,us);
103 bf.showSetNames(BagFormatter.CONSOLE,us);
108 bf.showSetNames(BagFormatter.CONSOLE, us);
230 BagFormatter bf = new BagFormatter();
235 System.out.println(bf.showSetNames(propAlias + " with " + matches, stuff))
    [all...]
  /cts/tests/tests/content/src/android/content/res/cts/
AssetManagerTest.java 183 final BufferedReader bf = new BufferedReader(new InputStreamReader(inputStream)); local
184 final String result = bf.readLine();
  /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/mesa3d/src/mesa/swrast/
s_aatritemp.h 61 GLfloat bf = SWRAST_CONTEXT(ctx)->_BackfaceCullSign; variable
81 vMin = v0; vMid = v2; vMax = v1; bf = -bf; /* y0<=y2<=y1 */
86 vMin = v1; vMid = v0; vMax = v2; bf = -bf; /* y1<=y0<=y2 */
89 vMin = v2; vMid = v1; vMax = v0; bf = -bf; /* y2<=y1<=y0 */
106 if (area * bf < 0 || area == 0 || IS_INF_OR_NAN(area))

Completed in 1162 milliseconds

1 2 3 4 5