| /external/clang/test/Sema/ |
| arg-scope-c99.c | 3 void bb(int sz, int ar[sz][sz]) { } function
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/ |
| IsoTypeReaderVariable.java | 22 public static long read(ByteBuffer bb, int bytes) {
25 return IsoTypeReader.readUInt8(bb);
27 return IsoTypeReader.readUInt16(bb);
29 return IsoTypeReader.readUInt24(bb);
31 return IsoTypeReader.readUInt32(bb);
33 return IsoTypeReader.readUInt64(bb);
|
| IsoTypeWriter.java | 22 public static void writeUInt64(ByteBuffer bb, long u) {
23 bb.putLong(u);
26 public static void writeUInt32(ByteBuffer bb, long u) {
27 bb.putInt((int) u);
31 public static void writeUInt32BE(ByteBuffer bb, long u) {
33 writeUInt16BE(bb, (int) u & 0xFFFF);
34 writeUInt16BE(bb, (int) ((u >> 16) & 0xFFFF));
39 public static void writeUInt24(ByteBuffer bb, int i) {
41 writeUInt16(bb, i >> 8);
42 writeUInt8(bb, i)
[all...] |
| IsoTypeWriterVariable.java | 23 public static void write(long v, ByteBuffer bb, int bytes) {
26 IsoTypeWriter.writeUInt8(bb, (int) (v & 0xff));
29 IsoTypeWriter.writeUInt16(bb, (int) (v & 0xffff));
32 IsoTypeWriter.writeUInt24(bb, (int) (v & 0xffffff));
35 IsoTypeWriter.writeUInt32(bb, v);
38 IsoTypeWriter.writeUInt64(bb, v);
|
| IsoTypeReader.java | 24 public static long readUInt32BE(ByteBuffer bb) {
25 long ch1 = readUInt8(bb);
26 long ch2 = readUInt8(bb);
27 long ch3 = readUInt8(bb);
28 long ch4 = readUInt8(bb);
34 public static long readUInt32(ByteBuffer bb) {
35 long i = bb.getInt();
42 public static int readUInt24(ByteBuffer bb) {
44 result += readUInt16(bb) << 8;
45 result += byte2int(bb.get())
[all...] |
| /system/core/libsparse/ |
| backed_block.c | 60 struct backed_block *backed_block_iter_next(struct backed_block *bb)
62 return bb->next;
65 unsigned int backed_block_len(struct backed_block *bb)
67 return bb->len;
70 unsigned int backed_block_block(struct backed_block *bb)
72 return bb->block;
75 void *backed_block_data(struct backed_block *bb)
77 assert(bb->type == BACKED_BLOCK_DATA);
78 return bb->data.data;
81 const char *backed_block_filename(struct backed_block *bb)
133 struct backed_block *bb = bbl->data_blocks; local
148 struct backed_block *bb; local
249 struct backed_block *bb; local
291 struct backed_block *bb = calloc(1, sizeof(struct backed_block)); local
309 struct backed_block *bb = calloc(1, sizeof(struct backed_block)); local
327 struct backed_block *bb = calloc(1, sizeof(struct backed_block)); local
346 struct backed_block *bb = calloc(1, sizeof(struct backed_block)); local
[all...] |
| backed_block.h | 42 struct backed_block *backed_block_iter_next(struct backed_block *bb);
43 unsigned int backed_block_len(struct backed_block *bb);
44 unsigned int backed_block_block(struct backed_block *bb);
45 void *backed_block_data(struct backed_block *bb);
46 const char *backed_block_filename(struct backed_block *bb);
47 int backed_block_fd(struct backed_block *bb);
48 int64_t backed_block_file_offset(struct backed_block *bb);
49 uint32_t backed_block_fill_val(struct backed_block *bb);
50 enum backed_block_type backed_block_type(struct backed_block *bb);
51 int backed_block_split(struct backed_block_list *bbl, struct backed_block *bb,
[all...] |
| sparse.c | 82 struct backed_block *bb; local
86 for (bb = backed_block_iter_new(s->backed_block_list); bb;
87 bb = backed_block_iter_next(bb)) {
88 if (backed_block_block(bb) > last_block) {
93 last_block = backed_block_block(bb) +
94 DIV_ROUND_UP(backed_block_len(bb), s->block_size);
104 struct backed_block *bb)
106 switch (backed_block_type(bb)) {
127 struct backed_block *bb; local
229 struct backed_block *bb; local
280 struct backed_block *bb; local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| badblocks.c | 35 ext2_u32_list bb; local
38 retval = ext2fs_get_mem(sizeof(struct ext2_struct_u32_list), &bb);
41 memset(bb, 0, sizeof(struct ext2_struct_u32_list));
42 bb->magic = EXT2_ET_MAGIC_BADBLOCKS_LIST;
43 bb->size = size ? size : 10;
44 bb->num = num;
45 retval = ext2fs_get_array(bb->size, sizeof(blk_t), &bb->list);
47 ext2fs_free_mem(&bb);
51 memcpy(bb->list, list, bb->size * sizeof(blk_t))
265 ext2_u32_list bb; local
[all...] |
| bb_compat.c | 34 void badblocks_list_free(badblocks_list bb)
36 ext2fs_badblocks_list_free(bb);
39 errcode_t badblocks_list_add(badblocks_list bb, blk_t blk)
41 return ext2fs_badblocks_list_add(bb, blk);
44 int badblocks_list_test(badblocks_list bb, blk_t blk)
46 return ext2fs_badblocks_list_test(bb, blk);
49 errcode_t badblocks_list_iterate_begin(badblocks_list bb,
52 return ext2fs_badblocks_list_iterate_begin(bb, ret);
|
| /external/clang/test/CodeGenCXX/ |
| virt-thunk-reference.cpp | 4 struct B { int b; virtual void bb(int&); };
5 struct C : A,B { virtual void aa(int&), bb(int&); };
7 void C::bb(int&) {} function in class:C
|
| debug-info-union.cpp | 6 int bb() { return a;} function in union:E
14 // CHECK: {{.*}} ; [ DW_TAG_subprogram ] [line 6] [bb]
|
| virtual-base-cast.cpp | 5 struct B { int b; virtual int bb(); };
6 struct C : virtual A, virtual B { int c; virtual int aa(); virtual int bb(); };
8 struct BB { int b; virtual int bb(); };
9 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); };
50 BB* c() { return x; }
75 BB* d() { return y; }
|
| /external/stlport/test/unit/ |
| bvector_test.cpp | 54 bit_vector bb = b; local
55 if (bb != b)
65 bb[0] &= 0;
66 bb[1] &= 0;
67 bb[2] &= 1;
68 bb[3] &= 1;
69 CPPUNIT_ASSERT(!((bb[0] != 0) || (bb[1] != 0) || (bb[2] != 1) || (bb[3] != 0)))
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| bvector_test.cpp | 54 bit_vector bb = b; local
55 if (bb != b)
65 bb[0] &= 0;
66 bb[1] &= 0;
67 bb[2] &= 1;
68 bb[3] &= 1;
69 CPPUNIT_ASSERT(!((bb[0] != 0) || (bb[1] != 0) || (bb[2] != 1) || (bb[3] != 0)))
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| bvector_test.cpp | 54 bit_vector bb = b; local
55 if (bb != b)
65 bb[0] &= 0;
66 bb[1] &= 0;
67 bb[2] &= 1;
68 bb[3] &= 1;
69 CPPUNIT_ASSERT(!((bb[0] != 0) || (bb[1] != 0) || (bb[2] != 1) || (bb[3] != 0)))
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.cpp | 23 BasicBlock *bb = (BasicBlock *)dvmCompilerNew(sizeof(BasicBlock), true); local
24 bb->blockType = blockType;
25 bb->id = blockId;
26 bb->predecessors = dvmCompilerAllocBitVector(blockId > 32 ? blockId : 32,
28 return bb;
32 void dvmCompilerAppendMIR(BasicBlock *bb, MIR *mir)
34 if (bb->firstMIRInsn == NULL) {
35 assert(bb->lastMIRInsn == NULL);
36 bb->lastMIRInsn = bb->firstMIRInsn = mir
[all...] |
| /external/valgrind/main/callgrind/ |
| bb.c | 3 /*--- bb.c ---*/
32 /*--- Basic block (BB) operations ---*/
35 /* BB hash, resizable */
44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1",
45 bbs.size * sizeof(BB*));
57 * - BB base as object file offset
65 /* double size of bb table */
70 BB **new_table, *curr, *next;
74 new_table = (BB**) CLG_MALLOC("cl.bb.rbt.1"
124 BB* bb; local
181 BB* bb; local
244 BB* bb; local
291 BB *bb, *bp; local
[all...] |
| /external/valgrind/main/VEX/priv/ |
| ir_opt.h | 43 /* Top level optimiser entry point. Returns a new BB. Operates
47 IRSB* bb,
58 /* Do a dead-code removal pass. bb is destructively modified. */
60 void do_deadcode_BB ( IRSB* bb );
62 /* The tree-builder. Make (approximately) maximal safe trees. bb is
67 Addr64 ado_treebuild_BB ( IRSB* bb );
|
| /art/compiler/dex/ |
| ssa_transformation.cc | 26 for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) {
27 bb->visited = false;
31 BasicBlock* MIRGraph::NeedsVisit(BasicBlock* bb) {
32 if (bb != NULL) {
33 if (bb->visited || bb->hidden) {
34 bb = NULL;
37 return bb;
[all...] |
| mir_optimization.cc | 23 static unsigned int Predecessors(BasicBlock* bb) {
24 return bb->predecessors->Size();
39 void MIRGraph::DoConstantPropogation(BasicBlock* bb) {
42 for (mir = bb->first_mir_insn; mir != NULL; mir = mir->next) {
100 for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) {
101 DoConstantPropogation(bb);
107 BasicBlock* bb = *p_bb; local
111 bb = bb->fall_through
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/ |
| GLUtils.java | 47 FloatBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asFloatBuffer(); local
49 StringBuilder sb = new StringBuilder(bb.capacity() * 3);
51 while (bb.remaining() > 0) {
52 sb.append(String.format("%.4f", bb.get()));
61 IntBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asIntBuffer(); local
63 StringBuilder sb = new StringBuilder(bb.capacity() * 3);
65 while (bb.remaining() > 0) {
66 sb.append(bb.get());
75 ShortBuffer bb = ByteBuffer.wrap(data).order(ByteOrder.LITTLE_ENDIAN).asShortBuffer(); local
77 StringBuilder sb = new StringBuilder(bb.capacity() * 3)
93 ByteBuffer bb = ByteBuffer.wrap(data); local
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Murmur3_128HashFunction.java | 59 @Override protected void process(ByteBuffer bb) {
60 long k1 = bb.getLong();
61 long k2 = bb.getLong();
86 @Override protected void processRemaining(ByteBuffer bb) {
89 len += bb.remaining();
90 switch (bb.remaining()) {
92 k2 ^= (long) toInt(bb.get(14)) << 48; // fall through
94 k2 ^= (long) toInt(bb.get(13)) << 40; // fall through
96 k2 ^= (long) toInt(bb.get(12)) << 32; // fall through
98 k2 ^= (long) toInt(bb.get(11)) << 24; // fall throug
148 ByteBuffer bb = ByteBuffer.wrap(new byte[16]).order(ByteOrder.LITTLE_ENDIAN); local
[all...] |
| Murmur3_32HashFunction.java | 55 @Override protected void process(ByteBuffer bb) {
56 int k1 = bb.getInt();
68 @Override protected void processRemaining(ByteBuffer bb) {
69 len += bb.remaining();
71 switch (bb.remaining()) {
73 k1 ^= toInt(bb.get(2)) << 16;
76 k1 ^= toInt(bb.get(1)) << 8;
79 k1 ^= toInt(bb.get(0));
|
| /sdk/emulator/qtools/ |
| bb2sym.cpp | 14 StaticRec bb; member in struct:MyStaticRec
35 if (bb1->bb.bb_addr < bb2->bb.bb_addr)
37 if (bb1->bb.bb_addr > bb2->bb.bb_addr)
39 return bb1->bb.bb_num - bb2->bb.bb_num;
67 trace->ReadStatic(&blocks[ii].bb);
68 blocks[ii].is_thumb = blocks[ii].bb.bb_addr & 1;
69 blocks[ii].bb.bb_addr &= ~1
[all...] |
