| /haiku/headers/libs/agg/ |
| H A D | agg_rasterizer_outline_aa.h | 76 line_parameters curr, next; member
240 dv.xb1 = dv.curr.x1 + (dv.curr.y2 - dv.curr.y1); in draw()
241 dv.yb1 = dv.curr.y1 - (dv.curr.x2 - dv.curr.x1); in draw()
242 dv.xb2 = dv.curr.x2 + (dv.curr.y2 - dv.curr.y1); in draw()
243 dv.yb2 = dv.curr.y2 - (dv.curr.x2 - dv.curr.x1); in draw()
248 case 0: m_ren->line3(dv.curr, dv.xb1, dv.yb1, dv.xb2, dv.yb2); break; in draw()
249 case 1: m_ren->line2(dv.curr, dv.xb2, dv.yb2); break; in draw()
250 case 2: m_ren->line1(dv.curr, dv.xb1, dv.yb1); break; in draw()
251 case 3: m_ren->line0(dv.curr); break; in draw()
256 m_ren->pie(dv.curr.x2, dv.curr.y2, in draw()
[all …]
|
| H A D | agg_array.h | 406 const T& curr(unsigned idx) const in curr() function
411 T& curr(unsigned idx) in curr() function
|
| /haiku/src/add-ons/kernel/file_systems/websearchfs/ |
| H A D | lists.c | 47 struct _slist_entry *curr = NULL; in slist_dequeue_tail() local
51 curr = *head; in slist_dequeue_tail()
52 while (curr->next) { in slist_dequeue_tail()
53 prev = &(curr->next); in slist_dequeue_tail()
54 curr = curr->next; in slist_dequeue_tail()
57 return curr; in slist_dequeue_tail()
63 struct _slist_entry *curr = NULL; in slist_remove() local
67 curr = *head; in slist_remove()
68 while (prev && curr) { in slist_remove()
69 if (curr == item) { in slist_remove()
[all …]
|
| H A D | lists2.c | 67 void *curr = NULL; in sll_dequeue_tail() local
71 curr = *head; in sll_dequeue_tail()
72 while (sll_next(nextoff, curr)) { in sll_dequeue_tail()
73 prev = (void **)(((char *)curr)+nextoff); in sll_dequeue_tail()
74 curr = sll_next(nextoff, curr); in sll_dequeue_tail()
77 return curr; in sll_dequeue_tail()
83 void *curr = NULL; in sll_remove() local
87 curr = *head; in sll_remove()
88 while (prev && curr) { in sll_remove()
89 if (curr == item) { in sll_remove()
[all …]
|
| /haiku/src/libs/agg/src/ |
| H A D | agg_vcgen_stroke.cpp | 148 m_src_vertices.curr(m_src_vertex), in vertex()
151 m_src_vertices.curr(m_src_vertex).dist); in vertex()
173 m_src_vertices.curr(m_src_vertex), in vertex()
175 m_src_vertices.curr(m_src_vertex).dist, in vertex()
|
| H A D | agg_vcgen_contour.cpp | 131 m_src_vertices.curr(m_src_vertex), in vertex()
134 m_src_vertices.curr(m_src_vertex).dist); in vertex()
|
| H A D | agg_vcgen_smooth_poly1.cpp | 157 m_src_vertices.curr(m_src_vertex), in vertex()
|
| /haiku/src/system/kernel/debug/ |
| H A D | gdb.cpp | 450 gdb_state_dispatch(int curr, int input) in gdb_state_dispatch() argument
452 if (curr < INIT || curr >= GDBSTATES) in gdb_state_dispatch()
455 return dispatch_table[curr](input); in gdb_state_dispatch()
|
| /haiku/src/add-ons/kernel/network/protocols/udp/ |
| H A D | udp.cpp | 620 uint16 stop, curr; in _GetNextEphemeral() local
623 curr = fLastUsedEphemeral + 1; in _GetNextEphemeral()
626 curr = kFirst; in _GetNextEphemeral()
630 fLastUsedEphemeral, curr, stop); in _GetNextEphemeral()
634 for (; curr != stop; curr = (curr < kLast) ? (curr + 1) : kFirst) { in _GetNextEphemeral()
635 TRACE_DOMAIN(" _GetNextEphemeral(): trying port %hu...", curr); in _GetNextEphemeral()
637 if (_EndpointWithPort(htons(curr)) == NULL) { in _GetNextEphemeral()
638 TRACE_DOMAIN(" _GetNextEphemeral(): ...using port %hu", curr); in _GetNextEphemeral()
639 fLastUsedEphemeral = curr; in _GetNextEphemeral()
640 return curr; in _GetNextEphemeral()
|
| /haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
| H A D | fs_cache.c | 298 hash_ent *he, *curr; in hash_insert() local
302 curr = ht->table[hash]; in hash_insert()
303 for(; curr != NULL; curr=curr->next) in hash_insert()
304 if (curr->dev == dev && curr->bnum == bnum) in hash_insert()
307 if (curr && curr->dev == dev && curr->bnum == bnum) { in hash_insert()
|
| /haiku/src/add-ons/kernel/bus_managers/firewire/ |
| H A D | fwohci.cpp | 2332 struct fwohcidb *curr = NULL, *prev, *next = NULL; local
2365 curr = NULL;
2371 curr = cp->db;
2382 curr = NULL;
2388 if( curr != NULL){
2394 print_db(cp, curr, ch, dbch->ndesc);
|