HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 951 - 975 of 3921) sorted by null

<<31323334353637383940>>

  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
valparam.c 148 yasm_valparam *cur, *next; local
152 next = STAILQ_NEXT(cur, link);
167 cur = next;
  /external/chromium_org/third_party/zlib/
gzguts.h 96 unsigned char *next; /* next output data to deliver or write */ member in struct:__anon14591
98 unsigned have; /* amount of output data unused at next */
infback.c 84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next = Z_NULL;
249 unsigned char FAR *next; \/* next input *\/ local
    [all...]
  /external/chromium_org/tools/gn/
file_template.cc 266 size_t next = str.find("{{", cur); local
269 if (next == std::string::npos) {
273 } else if (next > cur) {
275 Subrange(Subrange::LITERAL, str.substr(cur, next - cur)));
279 if (str.compare(next, arraysize(kSource) - 1, kSource) == 0) {
283 cur = next + arraysize(kSource) - 1;
284 } else if (str.compare(next, arraysize(kSourceNamePart) - 1,
289 cur = next + arraysize(kSourceNamePart) - 1;
290 } else if (str.compare(next, arraysize(kSourceFilePart) - 1,
295 cur = next + arraysize(kSourceFilePart) - 1
    [all...]
  /external/chromium_org/v8/src/
d8-debug.h 68 // Read next debugger event from the list.
142 RemoteDebuggerEvent* next() { return next_; } function in class:v8::RemoteDebuggerEvent
zone.cc 45 void Initialize(Segment* next, int size) {
46 next_ = next;
50 Segment* next() const { return next_; } function in class:v8::internal::Segment
99 Segment* next = current->next(); local
112 current = next;
142 ASSERT(segment_head_ == NULL || segment_head_->next() == NULL);
  /external/chromium_org/webkit/browser/fileapi/
local_file_util.cc 39 virtual base::FilePath Next() OVERRIDE;
51 base::FilePath LocalFileEnumerator::Next() {
52 base::FilePath next = file_enum_.Next(); local
54 while (!next.empty() && base::IsLink(next))
55 next = file_enum_.Next();
56 if (next.empty())
57 return next;
    [all...]
  /external/clang/test/CodeGenCXX/
debug-info.cpp 11 A<T> *next; member in struct:A
  /external/compiler-rt/lib/asan/
asan_fake_stack.h 29 FakeFrame *next; member in struct:__asan::FakeFrame
asan_globals.cc 32 ListOfGlobals *next; member in struct:__asan::ListOfGlobals
75 for (ListOfGlobals *l = list_of_all_globals; l; l = l->next) {
100 l->next = list_of_all_globals;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_quarantine.h 30 QuarantineBatch *next; member in struct:__sanitizer::QuarantineBatch
  /external/compiler-rt/lib/tsan/rtl/
tsan_symbolize_addr2line_linux.cc 39 SectionDesc *next; member in struct:__tsan::SectionDesc
123 sec->next = ctx->sections;
140 for (SectionDesc *s = sections; s; s = s->next) {
tsan_sync.h 70 SyncVar *next; // In SyncTab hashtable. member in struct:__tsan::SyncVar
  /external/dhcpcd/
eloop.c 46 struct event *next; member in struct:event
55 struct timeout *next; member in struct:timeout
68 for (e = events; e; e = e->next) {
80 free_events = e->next;
86 e->next = NULL;
88 last->next = e;
98 for (e = events; e; e = e->next) {
101 last->next = e->next;
103 events = e->next;
    [all...]
net.h 89 struct rt *next; member in struct:rt
  /external/dnsmasq/src/
dbus.c 61 struct watch *next; member in struct:watch
69 for (w = daemon->watches; w; w = w->next)
77 w->next = daemon->watches;
88 for (up = &(daemon->watches), w = daemon->watches; w; w = w->next)
91 *up = w->next;
95 up = &(w->next);
110 for (serv = daemon->servers; serv; serv = serv->next)
184 for (serv = daemon->servers; serv; serv = serv->next)
217 serv->next = daemon->servers;
248 tmp = serv->next;
    [all...]
  /external/dropbear/
dropbearkey.c 93 char ** next = 0; local
109 if (next) {
110 *next = argv[i];
111 next = NULL;
118 next = &filename;
121 next = &typetext;
124 next = &sizetext;
  /external/dropbear/libtommath/etc/
pprime.c 36 mp_digit r, x, y, next; local
55 next = (y + 1) * (y + 1);
59 r += 2; /* next candidate */
64 if (next <= r) {
66 next = (y + 1) * (y + 1);
  /external/e2fsprogs/e2fsck/
mtrace.h 142 size_t next; /* Index of next free cluster. */ member in struct:__anon17425::__anon17429
166 struct list *next; member in struct:list
176 struct alignlist *next; member in struct:alignlist
  /external/e2fsprogs/ext2ed/
dir_com.c 102 int return_code, next; local
115 /* Pass to the next entry */
120 next = dir_entry_ptr->rec_len;
121 if (!next)
122 next = file_system_info.block_size - info.dir_entry_offset;
123 info.dir_entry_offset += next;
124 info.file_offset += next;
129 /* Find the next block, */
473 return (CONTINUE); /* And pass to the next */
480 This function moves to the next directory entry. It just uses the current information and the entry command
    [all...]
  /external/e2fsprogs/intl/
gettextP.h 141 struct binding *next; member in struct:binding
  /external/e2fsprogs/lib/e2p/
feature.c 262 char *cp, *buf, *next; local
280 for (cp = buf; cp && *cp; cp = next ? next+1 : 0) {
283 next = skip_over_word(cp);
285 if (*next == 0)
286 next = 0;
288 *next = 0;
ls.c 269 time_t next; local
271 next = sb->s_lastcheck + sb->s_checkinterval;
272 fprintf(f, "Next check after: %s", ctime(&next));
  /external/e2fsprogs/lib/ext2fs/
inode_io.c 41 struct inode_private_data *next; member in struct:inode_private_data
102 data->next = top_intern;
126 prev = data, data = data->next)
132 prev->next = data->next;
134 top_intern = data->next;
irel.h 58 errcode_t (*next)(ext2_irel irel, ext2_ino_t *old, member in struct:ext2_inode_relocation_table
108 #define ext2fs_irel_next(irel, old, ent) ((irel)->next((irel), old, ent))

Completed in 2341 milliseconds

<<31323334353637383940>>