/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | ternary.c | 44 ternary_tree curr, *pcurr; local 49 while ((curr = *pcurr)) 52 diff = *s - curr->splitchar; 60 curr->eqkid = (ternary_tree) data; 61 return (PTR) curr->eqkid; 63 pcurr = &(curr->eqkid); 68 pcurr = &(curr->lokid); 73 pcurr = &(curr->hikid); 77 the string, into the tree rooted at curr */ 82 curr 120 const ternary_node *curr; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/googlefs/ |
H A D | lists.c | 47 struct _slist_entry *curr = NULL; local 51 curr = *head; 52 while (curr->next) { 53 prev = &(curr->next); 54 curr = curr->next; 57 return curr; 63 struct _slist_entry *curr = NULL; local 67 curr = *head; 68 while (prev && curr) { [all...] |
H A D | lists2.c | 64 void *curr = NULL; local 68 curr = *head; 69 while (sll_next(nextoff, curr)) { 70 prev = (void **)(((char *)curr)+nextoff); 71 curr = sll_next(nextoff, curr); 74 return curr; 80 void *curr = NULL; local 84 curr = *head; 85 while (prev && curr) { [all...] |
/haiku-fatelf/src/bin/findutils/find/ |
H A D | tree.c | 38 static struct predicate *set_new_parent PARAMS((struct predicate *curr, enum predicate_precedence high_prec, struct predicate **prevp)); 213 struct predicate *curr; 214 struct predicate **prevp; /* Address of `curr' node. */ 227 Set `curr' to the leftmost node, `prevp' to its address, and 231 curr = *prevp; 232 while (curr->pred_left != NULL) 234 prevp = &curr->pred_left; 235 prev_prec = curr->p_prec; /* must be a BI_OP */ 236 curr = curr 211 struct predicate *curr; local 365 set_new_parent(struct predicate *curr, enum predicate_precedence high_prec, struct predicate **prevp) argument [all...] |
/haiku-fatelf/headers/libs/agg/ |
H A D | agg_rasterizer_outline_aa.h | 76 line_parameters curr, next; member in struct:agg::rasterizer_outline_aa::draw_vars 240 dv.xb1 = dv.curr.x1 + (dv.curr.y2 - dv.curr.y1); 241 dv.yb1 = dv.curr.y1 - (dv.curr.x2 - dv.curr.x1); 242 dv.xb2 = dv.curr.x2 + (dv.curr.y2 - dv.curr [all...] |
/haiku-fatelf/src/bin/less/ |
H A D | line.c | 31 static int curr; /* Index into linebuf */ variable 154 curr = 0; 198 linebuf[curr] = ' '; 201 attr[curr] = AT_NORMAL|AT_HILITE; 203 attr[curr] = AT_NORMAL; 204 curr++; 220 sprintf(linebuf+curr, "%*s ", n, buf); 223 attr[curr+i] = AT_NORMAL; 224 curr += n; 234 linebuf[curr] [all...] |
/haiku-fatelf/src/libs/zlib/ |
H A D | inftrees.c | 44 unsigned curr; /* number of index bits for current table */ local 151 filled is at next and has curr index bits. The code being used is huff 153 bits off of the bottom. For codes where len is less than drop + curr, 154 those top drop + curr - len bits are incremented through all values to 204 curr = root; /* current table index bits */ 234 fill = 1U << curr; 266 next += min; /* here min is 1 << curr */ 269 curr = len - drop; 270 left = (int)(1 << curr); 271 while (curr [all...] |
/haiku-fatelf/src/system/kernel/scheduler/ |
H A D | scheduler_simple.cpp | 88 Thread *curr, *prev; local 89 for (curr = sRunQueue, prev = NULL; curr 90 && curr->priority >= thread->next_priority; 91 curr = curr->queue_next) { 98 T(EnqueueThread(thread, prev, curr)); 100 thread->queue_next = curr;
|
H A D | scheduler_simple_smp.cpp | 131 Thread *curr, *prev; local 132 for (curr = sRunQueue, prev = NULL; curr 133 && curr->priority >= thread->next_priority; 134 curr = curr->queue_next) { 141 T(EnqueueThread(thread, prev, curr)); 143 thread->queue_next = curr;
|
H A D | scheduler_affine.cpp | 167 Thread *curr, *prev; local 168 for (curr = sRunQueue[targetCPU], prev = NULL; curr 169 && curr->priority >= thread->next_priority; 170 curr = curr->queue_next) { 177 T(EnqueueThread(thread, prev, curr)); 179 thread->queue_next = curr;
|
/haiku-fatelf/src/kits/network/libbind/isc/ |
H A D | memcluster.c | 250 char *curr, *next; local 260 curr = new; 261 next = curr + mem_target; 263 ((memcluster_element *)curr)->next = next; 264 curr = next; 268 * curr is now pointing at the last block in the 271 ((memcluster_element *)curr)->next = NULL; 293 curr = new; 294 next = curr + new_size; 297 memset(curr, [all...] |
/haiku-fatelf/src/libs/agg/src/ |
H A D | agg_vcgen_stroke.cpp | 148 m_src_vertices.curr(m_src_vertex), 151 m_src_vertices.curr(m_src_vertex).dist); 173 m_src_vertices.curr(m_src_vertex), 175 m_src_vertices.curr(m_src_vertex).dist,
|
H A D | agg_vcgen_contour.cpp | 131 m_src_vertices.curr(m_src_vertex), 134 m_src_vertices.curr(m_src_vertex).dist);
|
H A D | agg_vcgen_smooth_poly1.cpp | 157 m_src_vertices.curr(m_src_vertex),
|
/haiku-fatelf/src/libs/udis86/ |
H A D | decode.c | 43 uint8_t curr; local 56 curr = inp_curr( u ); 59 if ( u->dis_mode == 64 && ( curr & 0xF0 ) == 0x40 ) { 60 u->pfx_rex = curr; 62 switch ( curr ) 166 uint8_t curr; local 177 curr = inp_curr(u); 180 if ( 0x90 == curr ) { 193 if ( 0x0F == curr ) { 195 curr [all...] |
/haiku-fatelf/src/bin/network/tcpdump/libpcap/ |
H A D | pcap-dag.c | 103 pcap_dag_node_t *curr = NULL, *prev = NULL; local 105 for (prev = NULL, curr = pcap_dags; curr != NULL && curr->p != p; prev = curr, curr = curr->next) { 109 if (curr != NULL && curr->p == p) { 111 prev->next = curr [all...] |
/haiku-fatelf/src/system/kernel/debug/ |
H A D | gdb.cpp | 450 gdb_state_dispatch(int curr, int input) argument 452 if (curr < INIT || curr >= GDBSTATES) 455 return dispatch_table[curr](input);
|
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | objfiles.c | 825 struct objfile_data_registration **curr; 828 for (curr = &objfile_data_registry.registrations; 829 *curr != NULL; curr = &(*curr)->next); 831 *curr = XMALLOC (struct objfile_data_registration); 832 (*curr)->next = NULL; 833 (*curr)->data = XMALLOC (struct objfile_data); 834 (*curr)->data->index = objfile_data_registry.num_registrations++; 836 return (*curr) 822 struct objfile_data_registration **curr; local [all...] |
H A D | gdbarch.sh | 1733 struct gdbarch_data_registration **curr; 1735 for (curr = &gdbarch_data_registry.registrations; 1736 (*curr) != NULL; 1737 curr = &(*curr)->next); 1738 (*curr) = XMALLOC (struct gdbarch_data_registration); 1739 (*curr)->next = NULL; 1740 (*curr)->data = XMALLOC (struct gdbarch_data); 1741 (*curr)->data->index = gdbarch_data_registry.nr++; 1742 (*curr) [all...] |
H A D | gdbarch.c | 3722 struct gdbarch_data_registration **curr; local 3724 for (curr = &gdbarch_data_registry.registrations; 3725 (*curr) != NULL; 3726 curr = &(*curr)->next); 3727 (*curr) = XMALLOC (struct gdbarch_data_registration); 3728 (*curr)->next = NULL; 3729 (*curr)->data = XMALLOC (struct gdbarch_data); 3730 (*curr)->data->index = gdbarch_data_registry.nr++; 3731 (*curr) 3862 struct gdbarch_swap **curr = ¤t_gdbarch->swap; local 3886 struct gdbarch_swap *curr; local 3903 struct gdbarch_swap *curr; local 3970 struct gdbarch_registration **curr; local [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/network/bcm440x/ |
H A D | b44lm.c | 903 LM_UINT32 rxin, curr, rxdmask; local 910 curr = (REG_RD(pDevice, dmaregs.rcvstatus) & RS_CD_MASK); 911 curr = curr / sizeof(dmadd_t); 913 for (rxin = pDevice->rxin; rxin != curr; rxin = (rxin + 1) & rxdmask) 962 curr = (REG_RD(pDevice, dmaregs.rcvstatus) & RS_CD_MASK) / 973 LM_UINT32 curr; local 982 curr = (REG_RD(pDevice, dmaregs.rcvstatus) & RS_CD_MASK); 983 curr = curr / sizeo 1052 LM_UINT32 txin, curr, txdmask; local [all...] |
/haiku-fatelf/src/add-ons/kernel/network/protocols/udp/ |
H A D | udp.cpp | 610 uint16 stop, curr; local 613 curr = fLastUsedEphemeral + 1; 616 curr = kFirst; 619 TRACE_DOMAIN("_GetNextEphemeral(), last %hu, curr %hu, stop %hu", 620 fLastUsedEphemeral, curr, stop); 624 for (; curr != stop; curr = (curr < kLast) ? (curr + 1) : kFirst) { 625 TRACE_DOMAIN(" _GetNextEphemeral(): trying port %hu...", curr); [all...] |
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/libbz2/ |
H A D | compress.c | 532 Int32 curr = s->len[t][0]; local 533 bsW ( s, 5, curr ); 535 while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ }; 536 while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
|
H A D | decompress.c | 128 Int32 curr; local 182 curr = s->save_curr; 318 GET_BITS(BZ_X_CODING_1, curr, 5); 321 if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR); 325 if (uc == 0) curr++; else curr--; 327 s->len[t][i] = curr; 609 s->save_curr = curr;
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/dp83815/ |
H A D | driver.c | 558 descriptor_t *curr = data->Rx.CurrInt; local 560 while (curr->cmd & DESC_OWN) { 561 curr = curr->virt_next; 565 data->Rx.CurrInt = curr;
|