/external/perfetto/src/protozero/test/ |
fake_scattered_buffer.cc | 48 uint8_t* begin = chunk.get(); local 49 memset(begin, 0, chunk_size_); 51 return {begin, begin + chunk_size_};
|
/external/piex/src/binary_parse/ |
cached_paged_byte_array.h | 44 virtual void getPage(size_t page_index, const unsigned char** begin, 52 const unsigned char* begin; member in struct:piex::binary_parse::CachedPagedByteArray::CachedPage
|
/external/protobuf/src/google/protobuf/util/ |
time_util_test.cc | 50 Timestamp begin, end; local 51 EXPECT_TRUE(TimeUtil::FromString("0001-01-01T00:00:00Z", &begin)); 52 EXPECT_EQ(TimeUtil::kTimestampMinSeconds, begin.seconds()); 53 EXPECT_EQ(0, begin.nanos()); 57 EXPECT_EQ("0001-01-01T00:00:00Z", TimeUtil::ToString(begin)); 92 Timestamp begin, end; local 93 EXPECT_TRUE(TimeUtil::FromString("0001-01-01T00:00:00Z", &begin)); 96 EXPECT_EQ("315537897599.999999999s", TimeUtil::ToString(end - begin)); 97 EXPECT_EQ(999999999, (end - begin).nanos()); 98 EXPECT_EQ("-315537897599.999999999s", TimeUtil::ToString(begin - end)) [all...] |
/external/skia/src/core/ |
SkGaussFilter.h | 33 const double* begin() const { return &fBasis[0]; } function in class:SkGaussFilter
|
/external/skqp/src/core/ |
SkGaussFilter.h | 33 const double* begin() const { return &fBasis[0]; } function in class:SkGaussFilter
|
/external/swiftshader/src/OpenGL/libGL/ |
Query.cpp | 38 void Query::begin() function in class:gl::Query 63 mQuery->begin();
|
/external/swiftshader/src/OpenGL/libGLESv2/ |
Query.cpp | 38 void Query::begin() function in class:es2::Query 67 mQuery->begin();
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
TinyPtrVector.h | 58 iterator begin() const { function in class:llvm::TinyPtrVector 65 return Val.template get<VecTy *>()->begin(); 73 return begin() + 1;
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
CallGraphSCCPass.h | 98 iterator begin() const { return Nodes.begin(); } function in class:llvm::CallGraphSCC
|
ValueSymbolTable.h | 90 inline iterator begin() { return vmap.begin(); } function in class:llvm::ValueSymbolTable 93 inline const_iterator begin() const { return vmap.begin(); } function in class:llvm::ValueSymbolTable
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
GCMetadataPrinter.h | 59 /// begin/end - Iterate over the collected function metadata. 60 iterator begin() { return S->begin(); } function in class:llvm::GCMetadataPrinter
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
TargetRegistry.cpp | 22 TargetRegistry::iterator TargetRegistry::begin() { function in class:TargetRegistry 29 if (begin() == end()) { 35 for (iterator it = begin(), ie = end(); it != ie; ++it) { 105 for (TargetRegistry::iterator I = TargetRegistry::begin(), 111 array_pod_sort(Targets.begin(), Targets.end(), TargetArraySortFn);
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
MaximumSpanningTree.h | 69 std::stable_sort(EdgeVector.begin(), EdgeVector.end(), EdgeWeightCompare<T>()); 75 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), 84 for (typename EdgeWeights::iterator EWi = EdgeVector.begin(), 97 typename MaxSpanTree::iterator begin() { function in class:llvm::MaximumSpanningTree 98 return MST.begin();
|
/external/syslinux/com32/hdt/ |
hdt-dump-memory.c | 91 char begin[24]={0}; local 94 snprintf(begin,sizeof(begin),"0x%016llx",map[i].addr); 98 add_s("memory.segment.start",begin); 108 char begin[24]={0}; local 111 snprintf(begin,sizeof(begin),"0x%016llx",nm[i].addr); 115 add_s("sanitized_memory.segment.start",begin);
|
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
slice_op.cc | 49 "Expected begin and size arguments to be 1-D tensors of size ", 56 std::vector<int64> begin; variable 59 if (ctx->ConstantInputAsIntVector(1, &begin).ok()) { 60 // `begin` is a compile-time constant. 63 // A size[i] of -1 means "all elements from begin[i] to dim_size(i)". 64 size[i] = input_shape.dim_size(i) - begin[i]; 69 int64 b = begin[i]; 74 "Expected begin[", i, "] == 0 (got ", b, 79 errors::InvalidArgument("Expected begin[", i, "] in [0, ", 90 limits.reserve(begin.size()) [all...] |
/external/tensorflow/tensorflow/compiler/xla/tests/ |
exhaustive_f32_elementwise_op_test.cc | 33 int64 begin, end; local 34 std::tie(begin, end) = GetParam(); 35 int64 input_size = end - begin; 36 LOG(INFO) << "Checking range [" << begin << ", " << end << ")"; 42 for (int64 i = begin; i < end; i++) { 47 input_literal->Set({i - begin}, 0.0f); 49 input_literal->Set({i - begin}, tensorflow::bit_cast<float, int>(i));
|
/external/tensorflow/tensorflow/contrib/linear_optimizer/python/ |
sdca_estimator.py | 187 def begin(self): member in class:_SdcaUpdateWeightsHook
|
/external/tensorflow/tensorflow/contrib/lite/schema/builtin_ops_header/ |
generator.cc | 63 const char* begin = name.c_str(); local 64 const char* ch = begin; 67 if (ch != begin) {
|
/external/tensorflow/tensorflow/contrib/opt/python/training/ |
elastic_average_optimizer.py | 348 def begin(self): member in class:_ElasticAverageOptimizerHook
|
model_average_optimizer.py | 302 def begin(self): member in class:_ModelAverageOptimizerHook
|
/external/tensorflow/tensorflow/contrib/training/python/training/ |
evaluation.py | 300 def begin(self): member in class:SummaryAtEndHook
|
/external/tensorflow/tensorflow/core/framework/ |
node_def_util.h | 154 AttrValueMap::const_iterator begin() const { return attrs_->begin(); } function in class:tensorflow::AttrSlice
|
/external/tensorflow/tensorflow/python/training/ |
session_run_hook.py | 29 `hook.begin()`. The graph is finalized after the `begin()` method is called. 40 def begin(self): 70 call hooks.begin() 106 def begin(self): member in class:SessionRunHook 111 After the `begin()` call the graph will be finalized and the other callbacks 112 can not modify the graph anymore. Second call of `begin()` on the same 121 has two essential differences with the situation in which `begin` is called:
|
sync_replicas_optimizer.py | 465 def begin(self): member in class:_SyncReplicasOptimizerHook
|
/external/v8/src/asmjs/ |
switch-logic.cc | 12 CaseNode* CreateBst(ZoneVector<CaseNode*>* nodes, size_t begin, size_t end) { 13 if (end < begin) { 15 } else if (end == begin) { 16 return nodes->at(begin); 18 size_t root_index = (begin + end) / 2; 21 root->left = CreateBst(nodes, begin, root_index - 1); 35 std::sort(cases->begin(), cases->end()); 48 int begin = cases->at(curr_pos); local 50 nodes.push_back(new (zone) CaseNode(begin, end));
|