| /src/external/ibm-public/postfix/dist/src/util/ |
| trimblanks.c | 41 char *curr; local
44 curr = string + len;
46 for (curr = string; *curr != 0; curr++)
49 while (curr > string && ISSPACE(curr[-1]))
50 curr -= 1;
51 return (curr);
|
| /src/crypto/external/apache2/openssl/dist/crypto/async/ |
| async_wait.c | 22 struct fd_lookup_st *curr; local
28 curr = ctx->fds;
29 while (curr != NULL) {
30 if (!curr->del) {
32 if (curr->cleanup != NULL)
33 curr->cleanup(ctx, curr->key, curr->fd, curr->custom_data);
36 next = curr->next
68 struct fd_lookup_st *curr; local
90 struct fd_lookup_st *curr; local
114 struct fd_lookup_st *curr; local
141 struct fd_lookup_st *curr, *prev; local
221 struct fd_lookup_st *curr, *prev = NULL; local
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/async/ |
| async_wait.c | 22 struct fd_lookup_st *curr; local
28 curr = ctx->fds;
29 while (curr != NULL) {
30 if (!curr->del) {
32 if (curr->cleanup != NULL)
33 curr->cleanup(ctx, curr->key, curr->fd, curr->custom_data);
36 next = curr->next
69 struct fd_lookup_st *curr; local
91 struct fd_lookup_st *curr; local
115 struct fd_lookup_st *curr; local
142 struct fd_lookup_st *curr, *prev; local
222 struct fd_lookup_st *curr, *prev = NULL; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/async/ |
| async_wait.c | 22 struct fd_lookup_st *curr; local
28 curr = ctx->fds;
29 while (curr != NULL) {
30 if (!curr->del) {
32 if (curr->cleanup != NULL)
33 curr->cleanup(ctx, curr->key, curr->fd, curr->custom_data);
36 next = curr->next
69 struct fd_lookup_st *curr; local
91 struct fd_lookup_st *curr; local
115 struct fd_lookup_st *curr; local
142 struct fd_lookup_st *curr, *prev; local
187 struct fd_lookup_st *curr, *prev = NULL; local
[all...] |
| /src/external/cddl/osnet/dist/lib/libnvpair/ |
| nvpair_json.c | 119 nvpair_t *curr; local
124 for (curr = nvlist_next_nvpair(nvl, NULL); curr;
125 curr = nvlist_next_nvpair(nvl, curr)) {
126 data_type_t type = nvpair_type(curr);
133 if (nvlist_print_json_string(fp, nvpair_name(curr)) == -1)
139 char *string = fnvpair_value_string(curr);
151 FPRINTF(fp, "%s", fnvpair_value_boolean_value(curr) ==
157 FPRINTF(fp, "%hhu", fnvpair_value_byte(curr));
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 69 node *curr = todo.back(); local
71 if (curr->visited)
72 std::cout << curr->id << " ";
75 curr->visited = true;
76 if (curr->right)
77 todo.push_back (curr->right);
78 todo.push_back (curr);
79 if (curr->left)
80 todo.push_back (curr->left);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 69 node *curr = todo.back(); local
71 if (curr->visited)
72 std::cout << curr->id << " ";
75 curr->visited = true;
76 if (curr->right)
77 todo.push_back (curr->right);
78 todo.push_back (curr);
79 if (curr->left)
80 todo.push_back (curr->left);
|
| /src/distrib/utils/more/ |
| line.c | 56 static char *curr; /* Pointer into linebuf */ variable
103 line = curr = linebuf;
130 curr[0] = curr[-1];
131 curr[-1] = UE_CHAR;
132 curr++;
135 curr[0] = curr[-1];
136 curr[-1] = BE_CHAR;
137 curr++
[all...] |
| /src/sbin/fsck_lfs/ |
| pass5.c | 60 int i, nsb, curr, labelcorrect, mfs; local
80 nsb = curr = labelcorrect = mfs = 0;
136 curr = lfs_sntod(fs, i + 1) - lfs_sb_getoffset(fs);
144 avail += curr;
152 "+ curr %jd - mfs %jd - locked %jd = %jd\n",
158 (intmax_t)curr,
|
| /src/sys/arch/ia64/stand/common/ |
| environment.c | 74 struct env_var *ev, *curr, *last; local
99 for (last = NULL, curr = environ;
100 curr != NULL;
101 last = curr, curr = curr->ev_next) {
103 if (strcmp(ev->ev_name, curr->ev_name) < 0) {
104 if (curr->ev_prev) {
105 curr->ev_prev->ev_next = ev;
109 ev->ev_next = curr;
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_scatterlist.h | 59 unsigned int curr; member in struct:sgt_iter
65 s.max = s.curr = s.sgp->offset;
112 ((__dp) = (__iter).dma + (__iter).curr), (__iter).sgp; \
113 (((__iter).curr += (__step)) >= (__iter).max) ? \
125 pfn_to_page((__iter).pfn + ((__iter).curr >> PAGE_SHIFT))); \
126 (((__iter).curr += PAGE_SIZE) >= (__iter).max) ? \
|
| /src/tests/usr.bin/indent/ |
| opt_bc.c | 142 *curr = ps.paren.item; variable in typeref:struct:
149 const struct paren_level *prev = state.prev_ps.paren.item, *curr = ps.paren.item; variable in typeref:struct:
|
| /src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| rbtree.cc | 110 struct rbt_string_node *curr = t->rbt_root; local
113 while (curr != t->rbt_nil)
115 trail = curr;
116 int cmp = strcmp (str, curr->str);
118 curr = curr->left;
120 curr = curr->right;
146 curr = fresh;
147 while (curr->par->color == RBT_RED
203 struct rbt_string_node *curr = t->rbt_root; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| rbtree.cc | 110 struct rbt_string_node *curr = t->rbt_root; local
113 while (curr != t->rbt_nil)
115 trail = curr;
116 int cmp = strcmp (str, curr->str);
118 curr = curr->left;
120 curr = curr->right;
146 curr = fresh;
147 while (curr->par->color == RBT_RED
203 struct rbt_string_node *curr = t->rbt_root; local
[all...] |
| /src/common/dist/zlib/contrib/infback9/ |
| inftree9.c | 39 unsigned curr; /* number of index bits for current table */ local
140 filled is at next and has curr index bits. The code being used is huff
142 bits off of the bottom. For codes where len is less than drop + curr,
143 those top drop + curr - len bits are incremented through all values to
193 curr = root; /* current table index bits */
223 fill = 1U << curr;
254 next += 1U << curr;
257 curr = len - drop;
258 left = (int)(1 << curr);
259 while (curr + drop < max)
[all...] |
| /src/common/dist/zlib/ |
| inftrees.c | 41 unsigned curr; /* number of index bits for current table */ local
148 filled is at next and has curr index bits. The code being used is huff
150 bits off of the bottom. For codes where len is less than drop + curr,
151 those top drop + curr - len bits are incremented through all values to
199 curr = root; /* current table index bits */
229 fill = 1U << curr;
261 next += mmin; /* here mmin is 1 << curr */
264 curr = len - drop;
265 left = (int)(1 << curr);
266 while (curr + drop < mmax)
[all...] |
| /src/crypto/external/apache2/openssl/dist/ssl/ |
| pqueue.c | 50 pitem *curr, *next; local
57 for (curr = NULL, next = pq->items;
58 next != NULL; curr = next, next = next->next) {
66 if (curr == NULL)
69 curr->next = item;
79 curr->next = item;
|
| /src/crypto/external/bsd/openssl/dist/ssl/ |
| pqueue.c | 55 pitem *curr, *next; local
62 for (curr = NULL, next = pq->items;
63 next != NULL; curr = next, next = next->next) {
71 if (curr == NULL)
74 curr->next = item;
84 curr->next = item;
|
| /src/crypto/external/bsd/openssl.old/dist/ssl/ |
| pqueue.c | 55 pitem *curr, *next; local
62 for (curr = NULL, next = pq->items;
63 next != NULL; curr = next, next = next->next) {
71 if (curr == NULL)
74 curr->next = item;
84 curr->next = item;
|
| /src/external/bsd/top/dist/ |
| hash.h | 70 int curr; member in struct:hash_pos
|
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| inftrees.c | 46 unsigned curr; /* number of index bits for current table */ local
153 filled is at next and has curr index bits. The code being used is huff
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
207 curr = root; /* current table index bits */
236 fill = 1U << curr;
268 next += min; /* here min is 1 << curr */
271 curr = len - drop;
272 left = (int)(1 << curr);
273 while (curr + drop < max)
[all...] |
| /src/external/gpl3/binutils/dist/zlib/contrib/infback9/ |
| inftree9.c | 39 unsigned curr; /* number of index bits for current table */ local
140 filled is at next and has curr index bits. The code being used is huff
142 bits off of the bottom. For codes where len is less than drop + curr,
143 those top drop + curr - len bits are incremented through all values to
193 curr = root; /* current table index bits */
223 fill = 1U << curr;
254 next += 1U << curr;
257 curr = len - drop;
258 left = (int)(1 << curr);
259 while (curr + drop < max)
[all...] |
| /src/external/gpl3/binutils/dist/zlib/ |
| inftrees.c | 39 unsigned curr; /* number of index bits for current table */ local
146 filled is at next and has curr index bits. The code being used is huff
148 bits off of the bottom. For codes where len is less than drop + curr,
149 those top drop + curr - len bits are incremented through all values to
197 curr = root; /* current table index bits */
227 fill = 1U << curr;
259 next += min; /* here min is 1 << curr */
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr + drop < max)
[all...] |
| /src/external/gpl3/binutils.old/dist/zlib/contrib/infback9/ |
| inftree9.c | 44 unsigned curr; /* number of index bits for current table */ local
145 filled is at next and has curr index bits. The code being used is huff
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
198 curr = root; /* current table index bits */
228 fill = 1U << curr;
259 next += 1U << curr;
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr + drop < max)
[all...] |
| /src/external/gpl3/binutils.old/dist/zlib/ |
| 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
202 curr = root; /* current table index bits */
232 fill = 1U << curr;
264 next += min; /* here min is 1 << curr */
267 curr = len - drop;
268 left = (int)(1 << curr);
269 while (curr + drop < max)
[all...] |
