| /third_party/ffmpeg/libavcodec/ |
| H A D | mpeg4video_parser.c | 46 * @return the position of the first byte of the next frame, or -1 in ff_mpeg4_find_frame_end()
146 int next; in mpeg4video_parse() local
149 next = buf_size; in mpeg4video_parse()
152 next = ff_mpeg4_find_frame_end(pc, buf, buf_size); in mpeg4video_parse()
154 next = mpeg4_find_frame_end(pc, buf, buf_size); in mpeg4video_parse()
157 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in mpeg4video_parse()
167 return next; in mpeg4video_parse()
|
| H A D | opus_parser.c | 81 * @return the position of the first byte of the next frame, or -1
171 int next, header_len; in opus_parse() local
173 next = opus_find_frame_end(ctx, avctx, buf, buf_size, &header_len); in opus_parse()
175 if (s->ts_framing && next != AVERROR_INVALIDDATA && in opus_parse()
176 ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in opus_parse()
182 if (next == AVERROR_INVALIDDATA){ in opus_parse()
190 return next; in opus_parse()
|
| /third_party/elfutils/libdw/ |
| H A D | dwarf_getaranges.c | 42 struct arangelist *next; member
138 struct arangelist *next = arangelist->next; in dwarf_getaranges() local
140 arangelist = next; in dwarf_getaranges()
164 /* Round the address to the next multiple of 2*address_size. */ in dwarf_getaranges()
212 new_arange->next = arangelist; in dwarf_getaranges()
252 arangelist = arangelist->next; in dwarf_getaranges()
|
| /third_party/alsa-utils/alsamixer/ |
| H A D | card_select.c | 37 struct card *next; member
90 for (card = first_card.next; card; card = next_card) { in close_card_select_list()
91 next_card = card->next; in close_card_select_list()
144 prev_card->next = card; in get_cards()
152 prev_card->next = card; in get_cards()
167 for (card = &first_card; card; card = card->next) { in create_list_items()
|
| /third_party/curl/lib/ |
| H A D | cf-haproxy.c | 118 result = cf->next->cft->do_connect(cf->next, data, blocking, done); in cf_haproxy_connect()
170 if(cf->next) in cf_haproxy_close()
171 cf->next->cft->do_close(cf->next, data); in cf_haproxy_close()
178 if(cf->next->connected && !cf->connected) { in cf_haproxy_adjust_pollset()
|
| /third_party/icu/icu4c/source/test/intltest/ |
| H A D | tstnrapi.cpp | 29 if(norm.next()!=0xe4) { in TestNormalizerAPI()
30 dataerrln("error in Normalizer(CharacterIterator).next()"); in TestNormalizerAPI()
35 if(copy.next()!=0xac00) { in TestNormalizerAPI()
36 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).next()"); in TestNormalizerAPI()
48 if(clone->next()!=0x4e3d) { in TestNormalizerAPI()
49 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next()"); in TestNormalizerAPI()
53 errln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next().hashCode()==copy.hashCode()"); in TestNormalizerAPI()
105 if(copy.next()!=0x308 || copy.next()!=0x1100) { in TestNormalizerAPI()
137 if(norm.first()!=0x61 || norm.next()! in TestNormalizerAPI()
[all...] |
| /third_party/libwebsockets/include/libwebsockets/ |
| H A D | lws-dll2.h | 53 * \param nxt: member name in the iterator pointing to next list element
70 * \param nxt: member name in the iterator pointing to next list element
76 * Performs storage of next increment for situations where iterator can become invalidated
114 * previous pointer to the element's next pointer.
124 type next; \
126 next = &((*(it))->nxt); \
132 * \param nxt: member name in the iterator pointing to next list element
144 it = next; \
150 ___m_list, /* member for next list object ptr */ \
159 ___m_list, /* member for next lis
199 struct lws_dll2 *next; global() member
[all...] |
| /third_party/libdrm/nouveau/ |
| H A D | bufctx.c | 39 struct nouveau_bufref_priv *next; member
90 pctx->free = pref->next; in nouveau_bufctx_del()
107 pbin->list = pref->next; in nouveau_bufctx_reset()
108 pref->next = pctx->free; in nouveau_bufctx_reset()
127 pctx->free = pref->next; in nouveau_bufctx_refn()
136 pref->next = pbin->list; in nouveau_bufctx_refn()
|
| /third_party/mesa3d/src/compiler/glsl/glcpp/ |
| H A D | glcpp.h | 11 * The above copyright notice and this permission notice (including the next
52 struct string_node *next; member
114 struct token_node *next; member
125 struct argument_node *next; member
157 struct expansion_node *next; member
170 struct skip_node *next; member
176 struct active_list *next; member
|
| /third_party/node/deps/v8/third_party/zlib/ |
| H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
201 next = *table; /* current table to fill in */
233 min = fill; /* save offset to next table */
236 next[(huff >> drop) + fill] = here;
250 /* go to next symbol, update count, len */
264 next += min; /* here min is 1 << curr */
266 /* determine length of next tabl
[all...] |
| /third_party/node/deps/zlib/ |
| H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the
49 code FAR *next; /* next available space in table */ in inflate_table() local
146 filled is at next and has curr index bits. The code being used is huff in inflate_table()
196 next = *table; /* current table to fill in */ in inflate_table()
228 min = fill; /* save offset to next table */ in inflate_table()
231 next[(huff >> drop) + fill] = here; in inflate_table()
245 /* go to next symbol, update count, len */ in inflate_table()
259 next += min; /* here min is 1 << curr */ in inflate_table()
261 /* determine length of next tabl in inflate_table()
[all...] |
| /third_party/ltp/testcases/realtime/func/periodic_cpu_load/ |
| H A D | periodic_cpu_load.c | 129 nsec_t next, now; in periodic_thread() local
132 next = rt_gettime(); in periodic_thread()
134 next += period; in periodic_thread()
135 if (rt_gettime() > next) { in periodic_thread()
151 if (now > next) { in periodic_thread()
157 rt_nanosleep(next - now); in periodic_thread()
|
| /third_party/mesa3d/src/gallium/frontends/wgl/ |
| H A D | stw_tls.c | 15 * next paragraph) shall be included in all copies or substantial portions
40 * stw_tls_data::next member.
93 data->next = g_pendingTlsData; in stw_tls_init()
223 g_pendingTlsData = data->next; in stw_tls_cleanup()
245 for (p_data = &g_pendingTlsData; *p_data; p_data = &(*p_data)->next) { in stw_tls_lookup_pending_data()
252 *p_data = data->next; in stw_tls_lookup_pending_data()
253 data->next = NULL; in stw_tls_lookup_pending_data()
302 assert(data->next == NULL); in stw_tls_get_data()
|
| /third_party/openssl/test/ |
| H A D | bio_prefix_text.c | 96 BIO *next = NULL; in setup_bio_chain() local
104 next = bio_out; in setup_bio_chain()
105 BIO_up_ref(next); /* Protection against freeing */ in setup_bio_chain()
112 chain[i] = BIO_push(curr, next); in setup_bio_chain()
115 next = chain[i]; in setup_bio_chain()
121 BIO_free_all(next); in setup_bio_chain()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| H A D | equivalence_relation.h | 205 const T* next = parent_[current]; in Find() local
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
211 "'next' is the parent of 'current', so 'current' should be a " in Find()
212 "child of 'next'"); in Find()
213 children_[next].erase(child_iterator); in Find()
214 current = next; in Find()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| H A D | equivalence_relation.h | 205 const T* next = parent_[current]; in Find() local
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
211 "'next' is the parent of 'current', so 'current' should be a " in Find()
212 "child of 'next'"); in Find()
213 children_[next].erase(child_iterator); in Find()
214 current = next; in Find()
|
| /third_party/skia/src/sksl/lex/ |
| H A D | RegexNode.cpp | 57 std::vector<int> next = accept; in createStates() local
60 next.push_back(id); in createStates()
61 result = fChildren[0].createStates(nfa, next); in createStates()
72 std::vector<int> next = accept; in createStates() local
75 next.push_back(id); in createStates()
76 result = fChildren[0].createStates(nfa, next); in createStates()
|
| /third_party/skia/third_party/externals/zlib/ |
| H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
201 next = *table; /* current table to fill in */
233 min = fill; /* save offset to next table */
236 next[(huff >> drop) + fill] = here;
250 /* go to next symbol, update count, len */
264 next += min; /* here min is 1 << curr */
266 /* determine length of next tabl
[all...] |
| /third_party/spirv-tools/source/fuzz/ |
| H A D | equivalence_relation.h | 205 const T* next = parent_[current]; in Find() local
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
211 "'next' is the parent of 'current', so 'current' should be a " in Find()
212 "child of 'next'"); in Find()
213 children_[next].erase(child_iterator); in Find()
214 current = next; in Find()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/ |
| H A D | bind_test.cc | 29 bool Extract(const char *s, UnboundConversion *props, int *next) const { in Extract()
30 return ConsumeUnboundConversion(s, s + strlen(s), props, next) == in Extract()
88 int next = 0; in TEST_F() local
89 if (Extract(e.fmt, &props, &next)) { in TEST_F()
108 int next = 0; in TEST_F() local
112 ASSERT_TRUE(Extract("*d", &props, &next)); in TEST_F()
|
| /third_party/skia/gn/ |
| H A D | gn_meta_sln.py | 33 pLine = lines.next()
144 line = projLines.next()
156 projLines.next(),
157 projLines.next(),
158 projLines.next(),
159 projLines.next() ]
|
| /third_party/zlib/ |
| H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the
49 code FAR *next; /* next available space in table */ in inflate_table() local
146 filled is at next and has curr index bits. The code being used is huff in inflate_table()
196 next = *table; /* current table to fill in */ in inflate_table()
228 min = fill; /* save offset to next table */ in inflate_table()
231 next[(huff >> drop) + fill] = here; in inflate_table()
245 /* go to next symbol, update count, len */ in inflate_table()
259 next += min; /* here min is 1 << curr */ in inflate_table()
261 /* determine length of next tabl in inflate_table()
[all...] |
| /drivers/hdf_core/framework/model/input/driver/ |
| H A D | hdf_input_device_manager.c | 138 (g_inputManager->inputDevList)->next = NULL; in AddInputDevice()
142 if (tmpDev->next == NULL) { in AddInputDevice()
143 tmpDev->next = inputDev; in AddInputDevice()
144 inputDev->next = NULL; in AddInputDevice()
147 tmpDev = tmpDev->next; in AddInputDevice()
166 tmpDev = tmpDev->next; in CheckInputDevice()
178 g_inputManager->inputDevList = g_inputManager->inputDevList->next; in DeleteInputDevice()
183 InputDevice *tmpDev = preNode->next; in DeleteInputDevice()
186 preNode->next = tmpDev->next; in DeleteInputDevice()
[all...] |
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/ |
| H A D | PatternStringParser.java | 226 /** Returns the next code point, or -1 if string is too short. */
235 /** Returns the code point after the next code point, or -1 if string is too short. */
248 /** Returns the next code point and then steps forward. */
249 int next() { in next() method in PatternStringParser.ParserState
272 state.next(); // consume the ';' in consumePattern()
307 state.next(); // consume the '*' in consumePadding()
368 state.next(); // consume the starting quote in consumeLiteral()
373 state.next(); // consume a quoted character in consumeLiteral()
376 state.next(); // consume the ending quote in consumeLiteral()
379 state.next(); in consumeLiteral()
[all...] |
| /third_party/skia/src/pathops/ |
| H A D | SkOpSpan.h | 93 const SkOpPtT* next() const { in next() function in SkOpPtT
97 SkOpPtT* next() { in next() function in SkOpPtT
172 bool fDuplicatePt; // set if identical pt is somewhere in the next loop
208 const SkOpSpanBase* next = this; in containsCoinEnd() local
209 while ((next = next->fCoinEnd) != this) { in containsCoinEnd()
210 if (next == coin) { in containsCoinEnd()
340 return fPtT.next()->next() == &fPtT; in simple()
408 SkOpAngle* fFromAngle; // points to next angl
441 const SkOpSpan* next = this; containsCoincidence() local
495 SkOpSpanBase* next() const { next() function in SkOpSpan
[all...] |