| /src/tests/usr.bin/xlint/lint1/ |
| msg_027.c | 17 next enumerator in enum:__anonfa86d3e40103
|
| /src/lib/libbluetooth/ |
| sdp_data.c | 52 if (data->next + 1 > data->end)
55 return data->next[0];
68 uint8_t *p = data->next;
143 return (p - data->next);
314 if (data->next == NULL || data->end == NULL)
317 if (data->next >= data->end)
320 return _sdp_data_valid(data->next, data->end);
373 _sdp_data_print(const uint8_t *next, const uint8_t *end, int indent)
377 while (next < end) {
378 if (next + 1 > end
[all...] |
| sdp_put.c | 52 len = value->end - value->next;
54 if (len > data->end - data->next)
57 memcpy(data->next, value->next, (size_t)len);
58 data->next += len;
68 || sdp_data_size(value) != (value->end - value->next)
96 if (data->next + 3 > data->end)
99 data->next[0] = SDP_DATA_UUID16;
100 be16enc(data->next + 1, uuid);
101 data->next += 3
[all...] |
| /src/usr.bin/make/unit-tests/ |
| suff-main.exp | 1 : Making next-main
|
| /src/usr.bin/find/ |
| operator.c | 66 (*planp) = (*planp)->next;
67 node->next = NULL;
80 PLAN *next; /* temp node holding subexpression results */ local in function:yankexpr
97 if ((next = yankexpr(planp)) == NULL)
106 if (next->type == N_CLOSEPAREN) {
115 tail = subplan = next;
117 tail->next = next;
118 tail = next;
120 tail->next = NULL
170 PLAN *next; \/* next node being processed *\/ local in function:not_squish
229 PLAN *next; \/* next node being processed *\/ local in function:or_squish
[all...] |
| /src/lib/libc/stdio/ |
| glue.h | 42 struct glue *next; member in struct:glue
|
| /src/lib/libc/stdlib/ |
| rand.c | 44 static u_long next = 1; variable in typeref:typename:u_long
50 return (int)((next = next * 1103515245 + 12345) % ((u_long)RAND_MAX + 1));
56 next = seed;
|
| /src/usr.sbin/mrouted/ |
| rsrr_var.h | 45 struct rsrr_cache *next; /* next cache item */ member in struct:rsrr_cache
|
| callout.c | 21 struct timeout_q *next; /* next event */ member in struct:timeout_q
25 int time; /* time offset to next event*/
60 Q = Q->next;
110 node->next = 0;
127 node->next = ptr;
131 prev->next = node;
141 ptr = ptr->next;
144 prev->next = node;
179 Q = Q->next;
[all...] |
| /src/games/warp/ |
| object.c | 26 if (free_root.next == &free_root)
33 obj = free_root.next;
34 free_root.next = obj->next;
35 obj->next->prev = &free_root;
39 obj->next = where;
42 obj->prev->next = obj;
61 curobj->prev->next = curobj->next;
62 curobj->next->prev = curobj->prev
[all...] |
| /src/usr.sbin/sdpd/ |
| service.c | 42 * buffer for sdpd_put_byte(), below. bytes are written at next when
47 uint8_t *next; /* current write position */ member in struct:__anon58f9542c0108
68 d.next = srv->ibuf;
81 if (d.next + sizeof(uint16_t) > d.end)
84 max = be16dec(d.next);
85 d.next += sizeof(uint16_t);
93 if (d.next + 1 > d.end
94 || d.next[0] > 16
95 || d.next + 1 + d.next[0] != d.end
566 uint8_t *next; local in function:sdpd_close_seq
[all...] |
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_linux_list.h | 15 * The above copyright notice and this permission notice (including the next
36 struct list_head *next, *prev; member in struct:list_head
44 (head)->next = head;
50 return (head)->next == head;
55 (head)->next->prev = new;
56 (new)->next = (head)->next;
58 (head)->next = new;
64 (entry)->next = head;
65 (head)->prev->next = entry
[all...] |
| /src/usr.sbin/ypserv/revnetgroup/ |
| hash.h | 39 struct grouplist *next; member in struct:grouplist
47 struct member_entry *next; member in struct:member_entry
54 struct group_entry *next; member in struct:group_entry
|
| /src/usr.bin/m4/ |
| tokenizer.l | 87 char *next;
91 base = strtol(yytext+2, &next, 0);
92 if (base > 36 || next == NULL) {
95 next++;
96 while (*next != 0) {
97 if (*next >= '0' && *next <= '9')
98 l = base * l + *next - '0';
99 else if (*next >= 'a' && *next <= 'z'
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| spsc_queue.h | 37 struct spsc_node *next; member in struct:spsc_node
71 node->next = NULL;
75 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next);
93 struct spsc_node *next, *node; local in function:spsc_queue_pop
103 next = READ_ONCE(node->next);
104 WRITE_ONCE(queue->head, next);
106 if (unlikely(!next)) {
110 (long)&node->next, (long) &queue->head) != (long)&node->next) {
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/ |
| list.h | 14 * The above copyright notice and this permission notice (including the next
94 * struct foo *iterator, *next;
95 * list_for_each_entry_safe(iterator, next, &bar.list_of_foos, entry) {
113 struct list_head *next, *prev; member in struct:list_head
132 list->next = list->prev = list;
137 struct list_head *prev, struct list_head *next)
139 next->prev = entry;
140 entry->next = next;
142 prev->next = entry
[all...] |
| /src/games/atc/ |
| list.c | 72 p->next = p->prev = NULL;
79 q = q -> next;
85 r->next = p;
86 p->next = q;
89 p->next = q;
95 l->tail->next = p;
96 p->next = NULL;
112 l->head = p->next;
116 l->tail->next = NULL;
118 p->prev->next = p->next
[all...] |
| /src/bin/sh/ |
| alias.h | 40 struct alias *next; member in struct:alias
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/fb/ |
| nouveau_nvkm_subdev_fb_sddr2.c | 71 switch (ram->next->bios.timing_ver) {
73 CL = ram->next->bios.timing_10_CL;
74 WR = ram->next->bios.timing_10_WR;
75 DLL = !ram->next->bios.ramcfg_DLLoff;
76 ODT = ram->next->bios.timing_10_ODT & 3;
79 CL = (ram->next->bios.timing[1] & 0x0000001f);
80 WR = (ram->next->bios.timing[2] & 0x007f0000) >> 16;
86 if (ram->next->bios.timing_ver == 0x20 ||
87 ram->next->bios.ramcfg_timing == 0xff) {
|
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| arm-realview-eb-a9mp.dts | 42 next-level-cache = <&L2>;
49 next-level-cache = <&L2>;
56 next-level-cache = <&L2>;
63 next-level-cache = <&L2>;
|
| /src/usr.bin/msgc/ |
| msgdb.h | 51 struct id_rec *next; member in struct:id_rec
|
| /src/sys/arch/next68k/next68k/ |
| conf.c | 51 cons_decl(next);
58 cons_init(next),
|
| /src/sys/external/bsd/drm/dist/shared-core/ |
| i915_mem.c | 16 * next paragraph) shall be included in all copies or substantial portions
75 list[(unsigned)list[i].next].prev = list[i].prev;
76 list[(unsigned)list[i].prev].next = list[i].next;
81 list[i].next = list[nr].next;
82 list[(unsigned)list[nr].next].prev = i;
83 list[nr].next = i;
103 newblock->next = p->next;
[all...] |
| /src/distrib/utils/more/ |
| linenum.c | 79 struct linenum *next; /* Link to next in the list */ member in struct:linenum
82 off_t gap; /* Gap between prev and next */
87 * is the distance between the previous one and the next one in the list.
120 p->next = p+1;
121 pool[NPOOL-2].next = NULL;
129 anchor.next = anchor.prev = &anchor;
148 if (p == &anchor || p->next == &anchor)
150 p->gap = p->next->pos - p->prev->pos;
173 for (p = anchor.next; p != &anchor && p->pos < pos; p = p->next
[all...] |
| /src/games/battlestar/ |
| battlestar.c | 59 char *next; local in function:main
89 next = getcom(mainbuf, sizeof mainbuf, ">-: ",
91 for (wordcount = 0; next && wordcount < NWORD - 1; wordcount++)
92 next = getword(next, words[wordcount], -1);
|
