/external/dropbear/libtomcrypt/src/hashes/ |
H A D | 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, c [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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 107 ext2fs_u32_list_add(ext2_u32_list bb, __u32 blk) argument 153 ext2fs_badblocks_list_add(ext2_badblocks_list bb, blk_t blk) argument 162 ext2fs_u32_list_find(ext2_u32_list bb, __u32 blk) argument 197 ext2fs_u32_list_test(ext2_u32_list bb, __u32 blk) argument 205 ext2fs_badblocks_list_test(ext2_badblocks_list bb, blk_t blk) argument 214 ext2fs_u32_list_del(ext2_u32_list bb, __u32 blk) argument 231 ext2fs_badblocks_list_del(ext2_u32_list bb, __u32 blk) argument 236 ext2fs_u32_list_iterate_begin(ext2_u32_list bb, ext2_u32_iterate *ret) argument 255 ext2fs_badblocks_list_iterate_begin(ext2_badblocks_list bb, ext2_badblocks_iterate *ret) argument 265 ext2_u32_list bb; local 324 ext2fs_u32_list_count(ext2_u32_list bb) argument [all...] |
H A D | ext2fsP.h | 27 ext2_u32_list bb; member in struct:ext2_struct_u32_iterate
|
H A D | 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) argument 99 retval = ext2fs_badblocks_list_iterate_begin(bb, &iter); 121 static void validate_test_seq(badblocks_list bb, blk_t *vec) argument 126 match = ext2fs_badblocks_list_test(bb, vec[i]); 139 static void do_test_seq(badblocks_list bb, blk_ argument 171 file_test(badblocks_list bb) argument 217 file_test_invalid(badblocks_list bb) argument [all...] |
H A D | inode.c | 276 badblocks_list bb = scan->fs->badblocks; local 291 while (blk > bb->list[scan->bad_block_ptr]) { 292 if (++scan->bad_block_ptr >= bb->num) { 306 if (blk == bb->list[scan->bad_block_ptr]) { 309 if (++scan->bad_block_ptr >= bb->num) 320 if ((blk + *num_blocks) > bb->list[scan->bad_block_ptr]) 321 *num_blocks = (int) (bb->list[scan->bad_block_ptr] - blk);
|
/external/skia/bench/ |
H A D | RepeatTileBench.cpp | 64 int bb = conv6ToByte(b); local 65 *colors++ = SkPreMultiplyARGB(0xFF, rr, gg, bb);
|
H A D | BitmapBench.cpp | 68 int bb = conv6ToByte(b); local 69 *colors++ = SkPreMultiplyARGB(0xFF, rr, gg, bb);
|
/external/skia/include/core/ |
H A D | SkDescriptor.h | 107 const uint32_t* bb = (const uint32_t*)&other; local 110 if (*aa++ != *bb++)
|
/external/skia/tests/ |
H A D | Sk64Test.cpp | 84 int bb = rand.nextS() >> 1; local 86 b.set(bb); 87 REPORTER_ASSERT(reporter, a.get32() == aa && b.get32() == bb); 88 c = a; c.add(bb); 89 REPORTER_ASSERT(reporter, c.get32() == aa + bb); 90 c = a; c.add(-bb); 91 REPORTER_ASSERT(reporter, c.get32() == aa - bb); 93 REPORTER_ASSERT(reporter, c.get32() == aa + bb); 95 REPORTER_ASSERT(reporter, c.get32() == aa - bb); 116 SkLONGLONG bb local [all...] |
/external/valgrind/main/callgrind/ |
H A D | bb.c | 3 /*--- bb.c ---*/ 44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1", 65 /* double size of bb table */ 74 new_table = (BB**) CLG_MALLOC("cl.bb.rbt.1", 124 BB* bb; local 127 /* check fill degree of bb hash table and resize if needed (>80%) */ 134 bb = (BB*) CLG_MALLOC("cl.bb.nb.1", size); 135 VG_(memset)(bb, 0, size); 137 bb 181 BB* bb; local 244 BB* bb; local 291 BB *bb, *bp; local [all...] |
H A D | callstack.c | 238 ret_addr = (from->bb->jmpkind == Ijk_Call) ? 239 bb_addr(from->bb) + from->bb->instr_len : 0; 269 if (jcc && jcc->to && jcc->to->bb) { 278 BB* bb = jcc->to->bb; local 280 VG_(printf)("%s> %s(0x%x, 0x%x, ...) [%s / %#lx]\n", spaces[s%4]+40-s, bb->fn->name, 283 bb->obj->name + bb->obj->last_slash_pos, 284 bb [all...] |
H A D | debug.c | 47 void CLG_(print_bb)(int s, BB* bb) argument 54 VG_(printf)("BB %#lx (Obj '%s')", bb_addr(bb), bb->obj->name); 117 BB* bb; local 129 bb = bbcc->bb; 130 CLG_ASSERT(bb!=0); 133 bb->obj->name + bb->obj->last_slash_pos, 134 bb 326 BB* bb; local 452 print_bb(int s, BB* bb) argument [all...] |
/external/bluetooth/glib/gio/ |
H A D | gioscheduler.c | 84 const GIOSchedulerJob *bb = b; local 90 if (aa->io_priority < bb->io_priority) 92 if (aa->io_priority == bb->io_priority)
|
/external/clang/test/Analysis/ |
H A D | dynamic-cast.cpp | 49 BB bb; local 50 B *pb = &bb; 64 BB bb; local 65 A *pbb = &bb; 79 BB bb; local 80 A *pbb = &bb;
|
/external/guava/guava/src/com/google/common/hash/ |
H A D | AbstractStreamingHashFunction.java | 114 protected abstract void process(ByteBuffer bb); argument 124 protected void processRemaining(ByteBuffer bb) { argument 125 bb.position(bb.limit()); // move at the end 126 bb.limit(chunkSize + 7); // get ready to pad with longs 127 while (bb.position() < chunkSize) { 128 bb.putLong(0); 130 bb.limit(chunkSize); 131 bb.flip(); 132 process(bb); [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | AbstractStreamingHasherTest.java | 174 @Override protected void process(ByteBuffer bb) { argument 176 assertEquals(ByteOrder.LITTLE_ENDIAN, bb.order()); 177 assertTrue(bb.remaining() >= chunkSize); 179 out.write(bb.get()); 183 @Override protected void processRemaining(ByteBuffer bb) { argument 186 assertEquals(ByteOrder.LITTLE_ENDIAN, bb.order()); 187 assertTrue(bb.remaining() > 0); 188 assertTrue(bb.remaining() < bufferSize); 190 super.processRemaining(bb);
|
/external/icu4c/test/intltest/ |
H A D | nmfmtrt.cpp | 301 double aa,bb; local 309 bb = b.getDouble(); 311 bb = b.getLong(); 313 double error = aa - bb; 314 if(aa != 0 && bb != 0)
|
/external/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | BasicBlock.java | 121 void setJump(BasicBlock[] bb, int s, boolean always) { argument 122 jump = bb; 167 BasicBlock[] bb = makeBlocks(marks); 168 addCatchers(bb, et); 169 return bb; 323 BasicBlock bb = getBBlock(m); 324 if (bb == null) { 340 bb.incoming++; 341 prev.exit = makeArray(bb); 350 // bb [all...] |
H A D | MapMaker.java | 317 TypedBlock bb = blocks[i]; 318 if (isTarget(bb, blocks[i - 1])) { 319 bb.resetNumLocals(); 321 bb.numLocals, bb.localsTypes); 322 toStackMapBody(writer, bb, diffL, offsetDelta, prev); 323 offsetDelta = bb.length - 1; 324 prev = bb; 327 offsetDelta += bb.length; 346 private void toStackMapBody(StackMapTable.Writer writer, TypedBlock bb, argument [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
H A D | BoundingSphere.java | 690 public boolean intersectsBoundingBox(BoundingBox bb) {
argument 691 assert Vector3f.isValidVector(center) && Vector3f.isValidVector(bb.center);
693 if (FastMath.abs(bb.center.x - center.x) < getRadius()
694 + bb.xExtent
695 && FastMath.abs(bb.center.y - center.y) < getRadius()
696 + bb.yExtent
697 && FastMath.abs(bb.center.z - center.z) < getRadius()
698 + bb.zExtent) {
|
H A D | BoundingVolume.java | 273 * @param bb
277 public abstract boolean intersectsBoundingBox(BoundingBox bb);
argument 283 * @param bb
287 // public abstract boolean intersectsOrientedBoundingBox(OrientedBoundingBox bb);
|
/external/llvm/include/llvm/Support/ |
H A D | CFG.h | 45 explicit inline PredIterator(Ptr *bb) : It(bb->use_begin()) { argument 48 inline PredIterator(Ptr *bb, bool) : It(bb->use_end()) {} argument
|
/external/skia/src/core/ |
H A D | SkFloat.cpp | 304 int bb = rand.nextS() >> 14; local 306 b.setInt(bb); 308 SkASSERT(b.getInt() == bb); 312 SkASSERT(cc == aa + bb); 316 SkASSERT(cc == aa - bb); 319 bb >>= 5; 321 b.setInt(bb); 324 SkASSERT(cc == aa * bb); 332 bb = rand.nextS() >> 11; 333 b.setFixed(bb); [all...] |
/external/valgrind/main/drd/ |
H A D | drd_load_store.c | 275 static Bool is_stack_access(IRSB* const bb, IRExpr* const addr_expr) argument 282 for (i = 0; i < bb->stmts_size; i++) 284 if (bb->stmts[i] 285 && bb->stmts[i]->tag == Ist_WrTmp 286 && bb->stmts[i]->Ist.WrTmp.tmp == addr_expr->Iex.RdTmp.tmp) 288 IRExpr* e = bb->stmts[i]->Ist.WrTmp.data; 303 static void instrument_load(IRSB* const bb, argument 313 addStmtToIRSB(bb, 323 if (! s_check_stack_accesses && is_stack_access(bb, addr_expr)) 365 addStmtToIRSB(bb, IRStmt_Dirt 368 instrument_store(IRSB* const bb, IRExpr* const addr_expr, const HWord size) argument 442 IRSB* bb; local [all...] |
/external/bluetooth/glib/gio/xdgmime/ |
H A D | xdgmimeglob.c | 363 const MimeWeight *bb = (const MimeWeight *)b; local 365 return aa->weight - bb->weight;
|