/external/libvpx/libvpx/vp9/encoder/ |
vp9_subexp.c | 126 const int new_b = cost_branch256(ct, newp); local 128 const int savings = old_b - new_b - update_b; 143 int i, old_b, new_b, update_b, savings, bestsavings; local 164 new_b = cost_branch256(ct + 2 * PIVOT_NODE, newp); 166 new_b += cost_branch256(ct + 2 * i, newplist[i - UNCONSTRAINED_NODES]); 168 savings = old_b - new_b - update_b;
|
/art/runtime/ |
jvalue.h | 39 void SetB(int8_t new_b) { 40 j = ((static_cast<int64_t>(new_b) << 56) >> 56); // Sign-extend to 64 bits.
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
model_pruner_test.cc | 76 const NodeDef& new_b = output.node(1); local 77 EXPECT_EQ(NodeName(b.name()), new_b.name()); 112 const NodeDef& new_b = output.node(1); local 113 EXPECT_EQ(NodeName(b.name()), new_b.name()); 150 const NodeDef& new_b = output.node(1); local 151 EXPECT_EQ(NodeName(b.name()), new_b.name()); 218 const NodeDef& new_b = output.node(1); local 223 EXPECT_EQ("b", new_b.name()); 231 EXPECT_EQ("a", new_b.input(0)); 306 const NodeDef& new_b = output.node(1) local [all...] |
/art/compiler/optimizing/ |
induction_var_analysis.cc | 576 InductionInfo* new_b = TransferAddSub(a->op_b, b->op_b, op); local 577 if (new_a != nullptr && new_b != nullptr) { 578 return CreateInduction(a->induction_class, a->operation, new_a, new_b, a->fetch, type_); 583 InductionInfo* new_b = TransferAddSub(a, b->op_b, op); local 589 if (new_a != nullptr && new_b != nullptr) { 590 return CreateInduction(b->induction_class, b->operation, new_a, new_b, b->fetch, type_); 595 InductionInfo* new_b = TransferAddSub(a->op_b, b, op); local 599 if (new_a != nullptr && new_b != nullptr) { 600 return CreateInduction(a->induction_class, a->operation, new_a, new_b, a->fetch, type_); 618 InductionInfo* new_b = TransferNeg(a->op_b) local 641 InductionInfo* new_b = TransferMul(a, b->op_b); local 649 InductionInfo* new_b = TransferMul(a->op_b, b); local [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
encodemv.c | 176 const int new_b = vp8_cost_branch(ct, new_p); local 181 if (cur_b - new_b > cost) {
|
bitstream.c | 60 unsigned int new_b = 0, old_b = 0; local 67 new_b += vp8_cost_branch(bct[i], Pnew[i]); 71 if (new_b + (n << 8) < old_b) { 711 const int new_b = vp8_cost_branch(ct, newp); local 714 return old_b - new_b - update_b; [all...] |
/external/webp/src/dsp/ |
lossless_enc.c | 509 const uint32_t new_b = (((argb >> 0) & 0xff) - green) & 0xff; local 510 argb_data[i] = (argb & 0xff00ff00u) | (new_r << 16) | new_b; [all...] |