Home
last modified time | relevance | path

Searched full:state (Results 1 – 25 of 12222) sorted by relevance

12345678910>>...489

/external/XNNPACK/bench/
Df32-dwconv2d-chw.cc26 static void DWConv2DBenchmark(benchmark::State& state, in DWConv2DBenchmark() argument
31 if (isa_check && !isa_check(state)) { in DWConv2DBenchmark()
35 const size_t input_height = state.range(0); in DWConv2DBenchmark()
36 const size_t input_width = state.range(1); in DWConv2DBenchmark()
37 const size_t kernel_height = state.range(2); in DWConv2DBenchmark()
38 const size_t kernel_width = state.range(3); in DWConv2DBenchmark()
39 const size_t padding_height = state.range(4); in DWConv2DBenchmark()
40 const size_t padding_width = state.range(5); in DWConv2DBenchmark()
41 const size_t subsampling = state.range(6); in DWConv2DBenchmark()
42 const size_t dilation = state.range(7); in DWConv2DBenchmark()
[all …]
Df32-igemm.cc26 static void IGEMMBenchmark(benchmark::State& state, in IGEMMBenchmark() argument
31 if (isa_check && !isa_check(state)) { in IGEMMBenchmark()
35 const size_t input_height = state.range(0); in IGEMMBenchmark()
36 const size_t input_width = state.range(1); in IGEMMBenchmark()
37 const size_t kernel_height = state.range(2); in IGEMMBenchmark()
38 const size_t kernel_width = state.range(3); in IGEMMBenchmark()
40 const size_t padding_height = state.range(4); in IGEMMBenchmark()
41 const size_t padding_width = state.range(5); in IGEMMBenchmark()
42 const size_t subsampling = state.range(6); in IGEMMBenchmark()
43 const size_t dilation = state.range(7); in IGEMMBenchmark()
[all …]
Df32-spmm.cc23 static void SpMMBenchmark(benchmark::State& state, in SpMMBenchmark() argument
27 if (isa_check && !isa_check(state)) { in SpMMBenchmark()
31 const size_t mc = state.range(0); in SpMMBenchmark()
32 const size_t nc = state.range(1); in SpMMBenchmark()
33 const size_t kc = state.range(2); in SpMMBenchmark()
132 for (auto _ : state) { in SpMMBenchmark()
133 // Use circular buffers (exceeding cache size) and prefetch to control cache state: in SpMMBenchmark()
137 state.PauseTiming(); in SpMMBenchmark()
140 state.ResumeTiming(); in SpMMBenchmark()
153 state.counters["cpufreq"] = cpu_frequency; in SpMMBenchmark()
[all …]
Df32-gemm.cc34 static void GEMMBenchmark(benchmark::State& state, in GEMMBenchmark() argument
39 if (isa_check && !isa_check(state)) { in GEMMBenchmark()
43 const size_t mc = state.range(0); in GEMMBenchmark()
44 const size_t nc = state.range(1); in GEMMBenchmark()
45 const size_t kc = state.range(2); in GEMMBenchmark()
77 for (auto _ : state) { in GEMMBenchmark()
78 // Use circular buffers (exceeding cache size) and prefetch to control cache state: in GEMMBenchmark()
82 state.PauseTiming(); in GEMMBenchmark()
85 state.ResumeTiming(); in GEMMBenchmark()
100 state.counters["cpufreq"] = cpu_frequency; in GEMMBenchmark()
[all …]
Dqs8-gemm.cc31 static void GEMMBenchmark(benchmark::State& state, in GEMMBenchmark() argument
37 state.SkipWithError("cpuinfo initialization failed"); in GEMMBenchmark()
40 if (isa_check && !isa_check(state)) { in GEMMBenchmark()
44 const size_t mc = state.range(0); in GEMMBenchmark()
45 const size_t nc = state.range(1); in GEMMBenchmark()
46 const size_t kc = state.range(2); in GEMMBenchmark()
79 for (auto _ : state) { in GEMMBenchmark()
80 // Use circular buffers (exceeding cache size) and prefetch to control cache state: in GEMMBenchmark()
84 state.PauseTiming(); in GEMMBenchmark()
87 state.ResumeTiming(); in GEMMBenchmark()
[all …]
/external/zstd/zlibWrapper/
Dgzwrite.c19 /* Initialize state for writing a gzip file. Mark initialization by setting
20 state.state->size to non-zero. Return -1 on a memory allocation failure, or 0 on
22 local int gz_init(state) in gz_init() argument
23 gz_statep state; in gz_init()
26 z_streamp strm = &(state.state->strm);
29 state.state->in = (unsigned char*)malloc(state.state->want << 1);
30 if (state.state->in == NULL) {
31 gz_error(state, Z_MEM_ERROR, "out of memory");
35 /* only need output buffer and deflate state if compressing */
36 if (!state.state->direct) {
[all …]
Dgzread.c29state.state->fd, and update state.state->eof, state.state->err, and state.state->msg as appropriat…
32 local int gz_load(state, buf, len, have) in gz_load() argument
33 gz_statep state; in gz_load()
46 ret = read(state.state->fd, buf + *have, get);
52 gz_error(state, Z_ERRNO, zstrerror());
56 state.state->eof = 1;
67 local int gz_avail(state) in gz_avail() argument
68 gz_statep state; in gz_avail()
71 z_streamp strm = &(state.state->strm);
73 if (state.state->err != Z_OK && state.state->err != Z_BUF_ERROR)
[all …]
Dgzlib.c77 /* Reset gzip file state */
78 local void gz_reset(state) in gz_reset() argument
79 gz_statep state; in gz_reset()
81 state.state->x.have = 0; /* no output data available */
82 if (state.state->mode == GZ_READ) { /* for reading ... */
83 state.state->eof = 0; /* not at end of file */
84 state.state->past = 0; /* have not read past end yet */
85 state.state->how = LOOK; /* look for gzip header */
87 state.state->seek = 0; /* no seek request pending */
88 gz_error(state, Z_OK, NULL); /* clear error */
[all …]
/external/angle/third_party/abseil-cpp/absl/debugging/internal/
Ddemangle.cc151 // State needed for demangling. This struct is copied in almost every stack
169 // One-off state for demangling that's not subject to backtracking -- either
181 ParseState parse_state; // Backtrackable state copied for most frames.
182 } State; typedef
189 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
190 ++state->recursion_depth; in ComplexityGuard()
191 ++state->steps; in ComplexityGuard()
222 State *state_;
256 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
258 state->mangled_begin = mangled; in InitState()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/debugging/internal/
Ddemangle.cc151 // State needed for demangling. This struct is copied in almost every stack
169 // One-off state for demangling that's not subject to backtracking -- either
181 ParseState parse_state; // Backtrackable state copied for most frames.
182 } State; typedef
189 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
190 ++state->recursion_depth; in ComplexityGuard()
191 ++state->steps; in ComplexityGuard()
222 State *state_;
256 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
258 state->mangled_begin = mangled; in InitState()
[all …]
/external/openscreen/third_party/abseil/src/absl/debugging/internal/
Ddemangle.cc151 // State needed for demangling. This struct is copied in almost every stack
169 // One-off state for demangling that's not subject to backtracking -- either
181 ParseState parse_state; // Backtrackable state copied for most frames.
182 } State; typedef
189 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
190 ++state->recursion_depth; in ComplexityGuard()
191 ++state->steps; in ComplexityGuard()
222 State *state_;
256 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
258 state->mangled_begin = mangled; in InitState()
[all …]
/external/libtextclassifier/abseil-cpp/absl/debugging/internal/
Ddemangle.cc151 // State needed for demangling. This struct is copied in almost every stack
169 // One-off state for demangling that's not subject to backtracking -- either
181 ParseState parse_state; // Backtrackable state copied for most frames.
182 } State; typedef
189 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
190 ++state->recursion_depth; in ComplexityGuard()
191 ++state->steps; in ComplexityGuard()
222 State *state_;
256 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
258 state->mangled_begin = mangled; in InitState()
[all …]
/external/webrtc/modules/audio_coding/audio_network_adaptor/
Devent_log_writer_unittest.cc51 EventLogWriterStates state; in CreateEventLogWriter() local
52 state.event_log.reset(new ::testing::StrictMock<MockRtcEventLog>()); in CreateEventLogWriter()
53 state.event_log_writer.reset(new EventLogWriter( in CreateEventLogWriter()
54 state.event_log.get(), kMinBitrateChangeBps, kMinBitrateChangeFraction, in CreateEventLogWriter()
56 state.runtime_config.bitrate_bps = kHighBitrateBps; in CreateEventLogWriter()
57 state.runtime_config.frame_length_ms = kFrameLengthMs; in CreateEventLogWriter()
58 state.runtime_config.uplink_packet_loss_fraction = kPacketLossFraction; in CreateEventLogWriter()
59 state.runtime_config.enable_fec = kEnableFec; in CreateEventLogWriter()
60 state.runtime_config.enable_dtx = kEnableDtx; in CreateEventLogWriter()
61 state.runtime_config.num_channels = kNumChannels; in CreateEventLogWriter()
[all …]
/external/lz4/ossfuzz/
Dround_trip_stream_fuzzer.c51 typedef void (*round_trip_t)(state_t* state);
60 state_t state; in state_create() local
62 state.seed = seed; in state_create()
64 state.data.buf = (char const*)data; in state_create()
65 state.data.size = size; in state_create()
66 state.data.pos = 0; in state_create()
69 state.compressed = cursor_create(1024 + 2 * LZ4_compressBound(size)); in state_create()
70 state.roundTrip = cursor_create(size); in state_create()
72 state.cstream = LZ4_createStream(); in state_create()
73 FUZZ_ASSERT(state.cstream); in state_create()
[all …]
/external/rust/crates/syn/src/gen/
Dhash.rs11 fn hash<H>(&self, state: &mut H) in hash()
15 self.name.hash(state); in hash()
21 fn hash<H>(&self, state: &mut H) in hash()
25 self.colon2_token.hash(state); in hash()
26 self.args.hash(state); in hash()
32 fn hash<H>(&self, state: &mut H) in hash()
36 self.attrs.hash(state); in hash()
37 self.pat.hash(state); in hash()
38 self.guard.hash(state); in hash()
39 self.body.hash(state); in hash()
[all …]
/external/rust/crates/libz-sys/src/zlib-ng/
Dinflate.c19 /* Memory management for the inflate state. Useful for allocating arch-specific extension blocks. */
46 struct inflate_state *state; in inflateStateCheck() local
49 state = (struct inflate_state *)strm->state; in inflateStateCheck()
50 if (state == NULL || state->strm != strm || state->mode < HEAD || state->mode > SYNC) in inflateStateCheck()
56 struct inflate_state *state; in PREFIX() local
60 state = (struct inflate_state *)strm->state; in PREFIX()
61 strm->total_in = strm->total_out = state->total = 0; in PREFIX()
63 if (state->wrap) /* to support ill-conceived Java test suite */ in PREFIX()
64 strm->adler = state->wrap & 1; in PREFIX()
65 state->mode = HEAD; in PREFIX()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/debugging/internal/
Ddemangle.cc150 // State needed for demangling. This struct is copied in almost every stack
168 // One-off state for demangling that's not subject to backtracking -- either
180 ParseState parse_state; // Backtrackable state copied for most frames.
181 } State; typedef
188 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
189 ++state->recursion_depth; in ComplexityGuard()
190 ++state->steps; in ComplexityGuard()
221 State *state_;
255 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
257 state->mangled_begin = mangled; in InitState()
[all …]
/external/abseil-cpp/absl/debugging/internal/
Ddemangle.cc150 // State needed for demangling. This struct is copied in almost every stack
168 // One-off state for demangling that's not subject to backtracking -- either
180 ParseState parse_state; // Backtrackable state copied for most frames.
181 } State; typedef
188 explicit ComplexityGuard(State *state) : state_(state) { in ComplexityGuard() argument
189 ++state->recursion_depth; in ComplexityGuard()
190 ++state->steps; in ComplexityGuard()
221 State *state_;
255 static void InitState(State *state, const char *mangled, char *out, in InitState() argument
257 state->mangled_begin = mangled; in InitState()
[all …]
/external/freetype/src/lzw/
Dftzopen.c29 ft_lzwstate_refill( FT_LzwState state ) in ft_lzwstate_refill() argument
34 if ( state->in_eof ) in ft_lzwstate_refill()
37 count = FT_Stream_TryRead( state->source, in ft_lzwstate_refill()
38 state->buf_tab, in ft_lzwstate_refill()
39 state->num_bits ); /* WHY? */ in ft_lzwstate_refill()
41 state->buf_size = (FT_UInt)count; in ft_lzwstate_refill()
42 state->buf_total += count; in ft_lzwstate_refill()
43 state->in_eof = FT_BOOL( count < state->num_bits ); in ft_lzwstate_refill()
44 state->buf_offset = 0; in ft_lzwstate_refill()
46 state->buf_size <<= 3; in ft_lzwstate_refill()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/
Dregexp_benchmark.cc128 typedef void SearchImpl(benchmark::State& state, const char* regexp,
136 typedef void ParseImpl(benchmark::State& state, const char* regexp,
170 void Search(benchmark::State& state, const char* regexp, SearchImpl* search) { in Search() argument
172 MakeText(&s, state.range(0)); in Search()
173 search(state, regexp, s, Prog::kUnanchored, false); in Search()
174 state.SetBytesProcessed(state.iterations() * state.range(0)); in Search()
200 void Search_Easy0_CachedDFA(benchmark::State& state) { Search(state, EASY0, SearchCachedDFA); } in Search_Easy0_CachedDFA() argument
201 void Search_Easy0_CachedNFA(benchmark::State& state) { Search(state, EASY0, SearchCachedNFA); } in Search_Easy0_CachedNFA() argument
202 void Search_Easy0_CachedPCRE(benchmark::State& state) { Search(state, EASY0, SearchCachedPCRE); } in Search_Easy0_CachedPCRE() argument
203 void Search_Easy0_CachedRE2(benchmark::State& state) { Search(state, EASY0, SearchCachedRE2); } in Search_Easy0_CachedRE2() argument
[all …]
/external/brotli/csharp/org/brotli/dec/
DDecode.cs62 private static void DecodeMetaBlockLength(Org.Brotli.Dec.BitReader br, Org.Brotli.Dec.State state) in DecodeMetaBlockLength() argument
64 state.inputEnd = Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1; in DecodeMetaBlockLength()
65 state.metaBlockLength = 0; in DecodeMetaBlockLength()
66 state.isUncompressed = false; in DecodeMetaBlockLength()
67 state.isMetadata = false; in DecodeMetaBlockLength()
68 if (state.inputEnd && Org.Brotli.Dec.BitReader.ReadBits(br, 1) != 0) in DecodeMetaBlockLength()
75 state.isMetadata = true; in DecodeMetaBlockLength()
92 state.metaBlockLength |= bits << (i * 8); in DecodeMetaBlockLength()
104 state.metaBlockLength |= bits << (i * 4); in DecodeMetaBlockLength()
107 state.metaBlockLength++; in DecodeMetaBlockLength()
[all …]
/external/rust/crates/ring/crypto/poly1305/
Dpoly1305.c58 poly1305_state *state) { in poly1305_aligned_state() argument
59 dev_assert_secret(((uintptr_t)state & 63) == 0); in poly1305_aligned_state()
60 return (struct poly1305_state_st *)(((uintptr_t)state + 63) & ~63); in poly1305_aligned_state()
63 // poly1305_blocks updates |state| given some amount of input data. This
66 static void poly1305_update(struct poly1305_state_st *state, const uint8_t *in, in poly1305_update() argument
88 state->h0 += t0 & 0x3ffffff; in poly1305_update()
89 state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; in poly1305_update()
90 state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; in poly1305_update()
91 state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; in poly1305_update()
92 state->h4 += (t3 >> 8) | (1 << 24); in poly1305_update()
[all …]
/external/mesa3d/src/gallium/auxiliary/driver_trace/
Dtr_dump_state.c104 void trace_dump_rasterizer_state(const struct pipe_rasterizer_state *state) in trace_dump_rasterizer_state() argument
109 if (!state) { in trace_dump_rasterizer_state()
116 trace_dump_member(bool, state, flatshade); in trace_dump_rasterizer_state()
117 trace_dump_member(bool, state, light_twoside); in trace_dump_rasterizer_state()
118 trace_dump_member(bool, state, clamp_vertex_color); in trace_dump_rasterizer_state()
119 trace_dump_member(bool, state, clamp_fragment_color); in trace_dump_rasterizer_state()
120 trace_dump_member(uint, state, front_ccw); in trace_dump_rasterizer_state()
121 trace_dump_member(uint, state, cull_face); in trace_dump_rasterizer_state()
122 trace_dump_member(uint, state, fill_front); in trace_dump_rasterizer_state()
123 trace_dump_member(uint, state, fill_back); in trace_dump_rasterizer_state()
[all …]
/external/libwebsockets/win32port/zlib/
Dinflate.c26 * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)
30 * - Add comments on state->bits assertion in inffast.c
95 local void fixedtables OF((struct inflate_state FAR *state));
106 struct inflate_state FAR *state; local
108 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
109 state = (struct inflate_state FAR *)strm->state;
110 strm->total_in = strm->total_out = state->total = 0;
113 state->mode = HEAD;
114 state->last = 0;
115 state->havedict = 0;
[all …]
/external/rust/crates/quiche/deps/boringssl/src/crypto/poly1305/
Dpoly1305.c54 poly1305_state *state) { in poly1305_aligned_state() argument
55 return (struct poly1305_state_st *)(((uintptr_t)state + 63) & ~63); in poly1305_aligned_state()
58 // poly1305_blocks updates |state| given some amount of input data. This
61 static void poly1305_update(struct poly1305_state_st *state, const uint8_t *in, in poly1305_update() argument
83 state->h0 += t0 & 0x3ffffff; in poly1305_update()
84 state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; in poly1305_update()
85 state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; in poly1305_update()
86 state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; in poly1305_update()
87 state->h4 += (t3 >> 8) | (1 << 24); in poly1305_update()
90 t[0] = mul32x32_64(state->h0, state->r0) + mul32x32_64(state->h1, state->s4) + in poly1305_update()
[all …]

12345678910>>...489