| /external/clang/test/Sema/ |
| arg-scope-c99.c | 2 void bb(int sz, int ar[sz][sz]) { } function
|
| /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);
|
| freefs.c | 79 void ext2fs_u32_list_free(ext2_u32_list bb)
81 if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST)
84 if (bb->list)
85 ext2fs_free_mem(&bb->list);
86 bb->list = 0;
87 ext2fs_free_mem(&bb);
90 void ext2fs_badblocks_list_free(ext2_badblocks_list bb)
92 ext2fs_u32_list_free((ext2_u32_list) bb);
|
| tst_badblocks.c | 71 badblocks_list bb; local
74 retval = ext2fs_badblocks_list_create(&bb, 5);
80 retval = ext2fs_badblocks_list_add(bb, vec[i]);
84 ext2fs_badblocks_list_free(bb);
88 *ret = bb;
92 static void print_list(badblocks_list bb, int verify)
99 retval = ext2fs_badblocks_list_iterate_begin(bb, &iter);
121 static void validate_test_seq(badblocks_list bb, blk_t *vec)
126 match = ext2fs_badblocks_list_test(bb, vec[i]);
139 static void do_test_seq(badblocks_list bb, blk_t *vec
[all...] |
| /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
|
| virtual-base-cast.cpp | 4 struct B { int b; virtual int bb(); };
5 struct C : virtual A, virtual B { int c; virtual int aa(); virtual int bb(); };
7 struct BB { int b; virtual int bb(); };
8 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); };
27 BB* c() { return x; }
|
| /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...] |
| Ralloc.cpp | 27 static void inferTypes(CompilationUnit *cUnit, BasicBlock *bb)
30 if (bb->blockType != kDalvikByteCode && bb->blockType != kEntryBlock)
33 for (mir = bb->firstMIRInsn; mir; mir = mir->next) {
75 BasicBlock *bb = (BasicBlock *) dvmGrowableListIteratorNext(&iterator); local
76 if (bb == NULL) break;
77 inferTypes(cUnit, bb);
|
| SSATransformation.cpp | 70 * register idx is defined in BasicBlock bb.
72 static bool fillDefBlockMatrix(CompilationUnit *cUnit, BasicBlock *bb)
74 if (bb->dataFlowInfo == NULL) return false;
78 dvmBitVectorIteratorInit(bb->dataFlowInfo->defV, &iterator);
82 /* Block bb defines register idx */
83 dvmCompilerSetBit(cUnit->defBlockMatrix[idx], bb->id);
122 static void computeDomPostOrderTraversal(CompilationUnit *cUnit, BasicBlock *bb)
125 dvmBitVectorIteratorInit(bb->iDominated, &bvIterator);
138 dvmInsertGrowableList(&cUnit->domPostOrderTraversal, bb->id);
141 if (bb->taken && dvmIsBitSet(bb->dominators, bb->taken->id))
[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
65 void ado_treebuild_BB ( IRSB* bb );
|
| /hardware/ril/mock-ril/src/java/com/android/internal/telephony/ |
| RilChannel.java | 87 * write the bb contents to sc
89 * @param bb is the ByteBuffer to write
93 public final int sendAll(ByteBuffer bb) throws IOException {
95 while (bb.remaining() != 0) {
96 count += mChannel.write(bb);
102 * read from sc until bb is filled then rewind bb
104 * @param bb is the ByteBuffer to fill
108 public final int recvAll(ByteBuffer bb) throws IOException {
110 while (bb.remaining() != 0)
[all...] |
| /libcore/luni/src/test/java/libcore/java/nio/charset/ |
| CharsetEncoderTest.java | 69 ByteBuffer bb = ByteBuffer.allocate(128); local
70 CoderResult cr = e.encode(CharBuffer.wrap(new char[] { '\ud842', '\udf9f' }), bb, false);
72 assertEquals(4, bb.position());
73 assertEquals((byte) 0x00, bb.get(0));
74 assertEquals((byte) 0x02, bb.get(1));
75 assertEquals((byte) 0x0b, bb.get(2));
76 assertEquals((byte) 0x9f, bb.get(3));
83 ByteBuffer bb = ByteBuffer.allocate(128); local
84 CoderResult cr = e.encode(CharBuffer.wrap(new char[] { '\udf9f' }), bb, false);
115 ByteBuffer bb = ByteBuffer.allocate(128) local
164 ByteBuffer bb = ByteBuffer.allocate(128); local
188 ByteBuffer bb = ByteBuffer.allocate(128); local
[all...] |
| /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...] |
| bbprof.cpp | 9 StaticRec bb; member in struct:MyStaticRec
27 if (bb1->bb.bb_addr < bb2->bb.bb_addr)
29 if (bb1->bb.bb_addr > bb2->bb.bb_addr)
31 return bb1->bb.bb_num - bb2->bb.bb_num;
45 return bb1->bb.bb_num - bb2->bb.bb_num;
59 return bb1->bb.bb_num - bb2->bb.bb_num
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/ |
| rmd128.c | 89 ulong32 aa,bb,cc,dd,aaa,bbb,ccc,ddd,X[16]; local
99 bb = bbb = md->rmd128.state[1];
104 FF(aa, bb, cc, dd, X[ 0], 11);
105 FF(dd, aa, bb, cc, X[ 1], 14);
106 FF(cc, dd, aa, bb, X[ 2], 15);
107 FF(bb, cc, dd, aa, X[ 3], 12);
108 FF(aa, bb, cc, dd, X[ 4], 5);
109 FF(dd, aa, bb, cc, X[ 5], 8);
110 FF(cc, dd, aa, bb, X[ 6], 7);
111 FF(bb, cc, dd, aa, X[ 7], 9)
[all...] |
| rmd320.c | 103 ulong32 aa,bb,cc,dd,ee,aaa,bbb,ccc,ddd,eee,tmp,X[16]; local
113 bb = md->rmd320.state[1];
124 FF(aa, bb, cc, dd, ee, X[ 0], 11);
125 FF(ee, aa, bb, cc, dd, X[ 1], 14);
126 FF(dd, ee, aa, bb, cc, X[ 2], 15);
127 FF(cc, dd, ee, aa, bb, X[ 3], 12);
128 FF(bb, cc, dd, ee, aa, X[ 4], 5);
129 FF(aa, bb, cc, dd, ee, X[ 5], 8);
130 FF(ee, aa, bb, cc, dd, X[ 6], 7);
131 FF(dd, ee, aa, bb, cc, X[ 7], 9)
[all...] |
| rmd160.c | 109 ulong32 aa,bb,cc,dd,ee,aaa,bbb,ccc,ddd,eee,X[16]; local
119 bb = bbb = md->rmd160.state[1];
125 FF(aa, bb, cc, dd, ee, X[ 0], 11);
126 FF(ee, aa, bb, cc, dd, X[ 1], 14);
127 FF(dd, ee, aa, bb, cc, X[ 2], 15);
128 FF(cc, dd, ee, aa, bb, X[ 3], 12);
129 FF(bb, cc, dd, ee, aa, X[ 4], 5);
130 FF(aa, bb, cc, dd, ee, X[ 5], 8);
131 FF(ee, aa, bb, cc, dd, X[ 6], 7);
132 FF(dd, ee, aa, bb, cc, X[ 7], 9)
[all...] |
| /dalvik/tests/008-instanceof/src/ |
| Main.java | 24 ImplBSub bb = new ImplBSub(); local
28 face1 = bb;
32 System.out.println("bb.mWhoami = " + bb.mWhoami);
41 bb = (ImplBSub) face1;
|
| /external/valgrind/main/none/ |
| nl_main.c | 40 IRSB* bb,
45 return bb;
|
| /external/elfutils/tests/ |
| run-get-lines.sh | 27 804842c: /home/drepper/gnu/new-bu/build/ttt/m.c:5:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
28 8048432: /home/drepper/gnu/new-bu/build/ttt/m.c:6:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
29 804844d: /home/drepper/gnu/new-bu/build/ttt/m.c:7:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
30 8048458: /home/drepper/gnu/new-bu/build/ttt/m.c:8:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
31 804845a: /home/drepper/gnu/new-bu/build/ttt/m.c:8:0: is_stmt:yes, end_seq:yes, bb:no, prologue:no, epilogue:no
34 804845c: /home/drepper/gnu/new-bu/build/ttt/b.c:4:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
35 804845f: /home/drepper/gnu/new-bu/build/ttt/b.c:5:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
36 8048464: /home/drepper/gnu/new-bu/build/ttt/b.c:6:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:no
37 8048466: /home/drepper/gnu/new-bu/build/ttt/b.c:6:0: is_stmt:yes, end_seq:yes, bb:no, prologue:no, epilogue:no
40 8048468: /home/drepper/gnu/new-bu/build/ttt/f.c:3:0: is_stmt:yes, end_seq:no, bb:no, prologue:no, epilogue:n
[all...] |
