Searched refs:prev (Results 101 - 125 of 285) sorted by relevance

1234567891011>>

/haiku-fatelf/src/add-ons/print/drivers/pdf/source/
H A DPDFWriter.h195 State *prev; member in class:PDFWriter::State
217 prev = NULL;
235 State(State *prev) argument
237 *this = *prev;
238 this->prev = prev;
/haiku-fatelf/src/bin/coreutils/src/
H A Dwc.c292 size_t prev = 0; /* number of bytes carried over from previous round */
294 const size_t prev = 0;
297 while ((bytes_read = safe_read (fd, buf + prev, BUFFER_SIZE - prev)) > 0)
312 bytes_read += prev;
408 prev = bytes_read;
291 size_t prev = 0; /* number of bytes carried over from previous round */ local
293 const size_t prev = 0; local
/haiku-fatelf/src/bin/gdb/bfd/
H A Ddwarf1.c60 struct dwarf1_unit* prev; member in struct:dwarf1_unit
92 struct dwarf1_func* prev; member in struct:dwarf1_func
153 x->prev = stash->lastUnit;
170 x->prev = aUnit->func_list;
444 eachFunc = eachFunc->prev)
531 for (eachUnit = stash->lastUnit; eachUnit; eachUnit = eachUnit->prev)
/haiku-fatelf/src/bin/less/
H A Dtags.c69 struct tag *next, *prev; /* List links */ member in struct:tag
79 (tp)->prev = taglist.tl_last; \
84 (tp)->next->prev = (tp)->prev; \
85 (tp)->prev->next = (tp)->next;
646 tp = curtag->prev;
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dthreads.c489 struct _xmlGlobalStateCleanupHelperParams * prev; member in struct:_xmlGlobalStateCleanupHelperParams
571 cleanup_helpers_head->prev = p;
574 p->prev = NULL;
852 p->prev->next = p->next;
854 p->next->prev = p->prev;
/haiku-fatelf/src/libs/print/libgutenprint/scripts/
H A Dltmain.sh1875 prev=
1892 *) prev=$arg ;;
1896 prev=$arg
1906 if test -n "$prev"; then
1907 prev=
1923 test -n "$prev" && \
1924 func_fatal_help "the \`$prev' option requires an argument"
4091 prev=
4158 if test -n "$prev"; then
4159 case $prev i
[all...]
/haiku-fatelf/data/etc/bash_completion.d/
H A Dgit447 prev)
448 prev=${words_[$cword_-1]}
468 prev)
469 prev=${COMP_WORDS[COMP_CWORD-1]}
815 local cur prev
816 _get_comp_words_by_ref -n =: cur prev
818 case "$prev" in
1784 local cur prev
1785 _get_comp_words_by_ref -n =: cur prev
1786 case "$prev" i
[all...]
/haiku-fatelf/src/libs/agg/src/
H A Dagg_vcgen_bspline.cpp78 m_spline_x.add_point(0.0, m_src_vertices.prev(m_src_vertices.size() - 3).x);
79 m_spline_y.add_point(0.0, m_src_vertices.prev(m_src_vertices.size() - 3).y);
/haiku-fatelf/src/add-ons/kernel/file_systems/googlefs/
H A Dparse_google_html.c49 struct google_result *res = NULL, *nres = NULL, *prev = NULL; local
249 if (!prev)
252 prev->next = nres;
253 prev = nres;
/haiku-fatelf/src/bin/diffutils/src/
H A Dcontext.c392 struct change *prev;
408 prev = start;
410 thresh = (prev->ignore || (start && start->ignore)
422 return prev;
386 struct change *prev; local
/haiku-fatelf/src/libs/ncurses/c++/
H A Dcursesapp.h44 struct _slk_link* prev; // a stack of SLKs member in struct:NCursesApplication::_slk_link
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/
H A Dcache.h39 *prev; /* points toward lru end of list */ member in struct:cache_ent
/haiku-fatelf/src/bin/gdb/
H A Dltcf-cxx.sh955 prev=$p
958 prev=
968 compiler_lib_search_path="${prev}${p}"
970 compiler_lib_search_path="${compiler_lib_search_path} ${prev}${p}"
978 postdeps="${prev}${p}"
980 postdeps="${postdeps} ${prev}${p}"
H A Dltconfig143 prev=:
149 prev="$cmd"
152 if test "$prev" != 'sed 50q "$0"'; then
153 echo_test_string=`eval $prev`
296 prev=
305 if test -n "$prev"; then
306 eval "$prev=\$option"
307 prev=
347 --build) prev=build ;;
367 --srcdir) prev
[all...]
/haiku-fatelf/src/bin/network/wget/src/
H A Dcookies.c178 struct cookie *chain, *prev;
184 prev = NULL;
185 for (; chain; prev = chain, chain = chain->next)
190 *prevptr = prev;
220 struct cookie *prev;
221 struct cookie *victim = find_matching_cookie (jar, cookie, &prev);
227 if (prev)
229 prev->next = victim->next;
234 /* prev is NULL; apparently VICTIM was at the head of
283 struct cookie *prev, *victi
176 struct cookie *chain, *prev; local
218 struct cookie *prev; local
281 struct cookie *prev, *victim; local
[all...]
H A Dftp-ls.c378 l->prev = l->next = NULL;
382 cur.prev = l;
543 l->prev = l->next = NULL;
547 cur.prev = l;
996 l->prev = l->next = NULL;
1000 cur.prev = l;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-1.2.6/
H A Drpc_workers.c76 curNode->prev = NULL;
78 rootNode->prev = curNode;
112 if (deadNode->prev)
113 deadNode->prev->next = deadNode->next;
117 deadNode->next->prev = deadNode->prev;
607 block->prev = NULL;
609 session->rootBlock->prev = block;
658 if (block->prev)
659 block->prev
[all...]
/haiku-fatelf/src/bin/gzip/
H A Ddeflate.c97 /* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
101 error: cannot overlay window with tab_suffix and prev with tab_prefix0
145 /* DECLARE(Pos, prev, WSIZE); */
280 prev[(s) & WMASK] = match_head = head[ins_h], \
301 /* prev will be initialized on the fly */
476 } while ((cur_match = prev[cur_match & WMASK]) > limit
547 m = prev[n];
548 prev[n] = (Pos)(m >= WSIZE ? m-WSIZE : NIL);
549 /* If n is not on any hash chain, prev[n] is garbage but
H A Dgzip.h65 * deflate: prev+head window d_buf l_buf outbuf
121 # define tab_prefix prev /* hash link (see deflate.c) */
122 # define head (prev+WSIZE) /* hash head (see deflate.c) */
125 # define tab_prefix0 prev
/haiku-fatelf/src/kits/network/libbind/isc/
H A Dmemcluster.c374 memcluster_element *prev; local
404 prev = NULL;
410 prev = el;
414 if (prev == NULL) {
420 prev->next = el->next;
/haiku-fatelf/src/libs/agg/gpc/
H A Dgpc.c97 do {(d)= (d)->prev;} while (!(d)->outp[(p)]); \
181 struct edge_shape *prev; /* Previous edge in the AET */ member in struct:edge_shape
215 struct st_shape *prev; /* Previous edge in sorted list */ member in struct:st_shape
502 e[i].prev= NULL;
552 e[i].prev= NULL;
569 static void add_edge_to_aet(edge_node **aet, edge_node *edge, edge_node *prev) argument
575 edge->prev= prev;
584 edge->prev= prev;
[all...]
/haiku-fatelf/src/libs/edit/
H A Dmap.c1202 int prev, i; local
1205 prev = 0;
1207 if (el->el_map.key[prev] == el->el_map.key[i])
1209 map_print_some_keys(el, el->el_map.key, prev, i - 1);
1210 prev = i;
1212 map_print_some_keys(el, el->el_map.key, prev, i - 1);
1215 prev = 0;
1217 if (el->el_map.alt[prev] == el->el_map.alt[i])
1219 map_print_some_keys(el, el->el_map.alt, prev, i - 1);
1220 prev
[all...]
/haiku-fatelf/src/bin/bash/support/
H A Dman2html.c1209 TABLEROW *prev, *next; member in struct:TABLEROW
1225 while (tr1->prev)
1226 tr1 = tr1->prev;
1255 currow->next = currow->prev = NULL;
1356 currow->next->prev = currow;
1399 tr->next->prev = tr;
1501 if (currow->prev) {
1502 currow->prev->next = (TABLEROW *) malloc(sizeof(TABLEROW));
1503 currow->prev->next->next = currow;
1504 currow->prev
[all...]
/haiku-fatelf/src/system/runtime_loader/
H A Dimages.cpp71 image->prev = queue->tail;
85 image->next->prev = image->prev;
87 queue->tail = image->prev;
89 if (image->prev)
90 image->prev->next = image->next;
94 image->prev = NULL;
/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Ddeflate.c179 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
185 * prev[] will be initialized on the fly.
271 s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
280 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
592 TRY_FREE(strm, strm->state->prev);
633 ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
638 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
645 zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
747 Posf *prev local
[all...]

Completed in 321 milliseconds

1234567891011>>