Searched refs:previous (Results 26 - 50 of 109) sorted by relevance

12345

/freebsd-11-stable/libexec/bootpd/
H A Dhash.c165 * Hopefully, this function is better than the previous one which returned
268 hash_member *previous = NULL;
295 previous = memberptr;
301 previous->next = memberptr = memberptr->next;
309 previous = memberptr;
262 hash_member *previous = NULL; local
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Dstring_table.c53 struct builder_string_t *previous;
196 to_insert->previous = current->previous;
199 if (to_insert->previous == NULL)
205 builder_string_t *previous = to_insert->previous;
207 = match_length(&previous->string, &to_insert->string);
209 previous->next = to_insert;
210 previous->next_match_len = to_insert->previous_match_len;
213 current->previous
51 struct builder_string_t *previous; member in struct:builder_string_t
202 builder_string_t *previous = to_insert->previous; local
[all...]
/freebsd-11-stable/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr.h195 T previous = 0; \
202 : "=&r" (previous), \
/freebsd-11-stable/sys/contrib/ck/include/gcc/sparcv9/
H A Dck_pr.h189 ck_pr_cas_ptr_value(void *target, void *compare, void *set, void *previous) argument
192 return ck_pr_cas_64_value(target, (uint64_t)compare, (uint64_t)set, previous);
/freebsd-11-stable/sys/arm/amlogic/aml8726/
H A Daml8726_rtc.c326 uint32_t now, previous; local
340 previous = CSR_READ_4(sc, AML_RTC_2_REG);
345 if (now != previous)
352 if (now == previous)
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_ht.c662 struct ck_ht_entry *bucket, *previous; local
678 previous = &map->entries[k];
680 if (previous->key == CK_HT_KEY_EMPTY || previous->key == CK_HT_KEY_TOMBSTONE)
688 key = ck_ht_entry_key(previous);
689 key_length = ck_ht_entry_key_length(previous);
693 h.value = previous->hash;
699 h.value = previous->hash;
701 table->h(&h, &previous->key, sizeof(previous
[all...]
H A Dck_epoch.c199 struct ck_epoch_ref *previous; local
205 * from the previous epoch generation.
211 previous = &record->local.bucket[(i + 1) &
213 if (previous->count > 0)
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dcache-membuffer.c76 * entries. Every USED entry has a reference to the previous and the next
581 /* Reference to the previous used entry in the order defined by offset.
586 apr_uint32_t previous; member in struct:entry_t
612 apr_uint32_t previous; member in struct:group_header_t
1001 header->previous = NO_INDEX;
1050 assert(group->header.previous != NO_INDEX);
1054 cache->directory[group->header.previous].header.next = NO_INDEX;
1056 group->header.previous = NO_INDEX;
1144 entry->previous = NO_INDEX;
1153 entry->previous
1242 entry_t *previous = get_entry(cache, entry->previous); local
[all...]
H A Dsorts.c275 void *previous;
278 previous = array->elts + (idx-1) * array->elt_size;
280 if (compare_func(previous, key) && !compare_func(result, key))
273 void *previous; local
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dldo.c88 struct lua_longjmp *previous; member in struct:lua_longjmp
139 lj.previous = L->errorJmp; /* chain new error handler */
144 L->errorJmp = lj.previous; /* restore old error handler */
158 for (ci = L->ci; ci != NULL; ci = ci->previous) {
207 for (ci = L->ci; ci != NULL; ci = ci->previous) {
257 if (isLua(ci->previous) &&
258 GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) {
293 func = restorestack(L, funcr); /* previous call may change stack */
348 func = restorestack(L, funcr); /* previous call can change stack */
382 L->oldpc = ci->previous
[all...]
H A Dlcode.c37 Instruction *previous; local
40 previous = &fs->f->code[fs->pc-1];
41 if (GET_OPCODE(*previous) == OP_LOADNIL) {
42 int pfrom = GETARG_A(*previous);
43 int pl = pfrom + GETARG_B(*previous);
48 SETARG_A(*previous, from);
49 SETARG_B(*previous, l - from);
609 fs->pc--; /* remove previous OP_NOT */
/freebsd-11-stable/contrib/lua/src/
H A Dldo.c85 struct lua_longjmp *previous; member in struct:lua_longjmp
140 lj.previous = L->errorJmp; /* chain new error handler */
145 L->errorJmp = lj.previous; /* restore old error handler */
164 for (ci = L->ci; ci != NULL; ci = ci->previous) {
213 for (ci = L->ci; ci != NULL; ci = ci->previous) {
283 if (isLua(ci->previous) &&
284 GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) {
385 L->oldpc = ci->previous->u.l.savedpc; /* 'oldpc' for caller function */
388 L->ci = ci->previous; /* back to caller */
568 for (ci = L->ci; ci != NULL; ci = ci->previous) { /* searc
[all...]
H A Dlstate.c112 ci->previous = L->ci;
145 next2->previous = ci;
162 ci->next = ci->previous = NULL;
/freebsd-11-stable/contrib/ncurses/ncurses/base/
H A Dlib_color.c438 colorpair_t previous; local
452 previous = SP_PARM->_color_pairs[pair];
482 if ((FORE_OF(previous) == COLOR_DEFAULT)
483 || (BACK_OF(previous) == COLOR_DEFAULT))
524 if (previous != 0
525 && previous != result) {
/freebsd-11-stable/sys/dev/ofw/
H A Dofw_fdt.c287 * -1: package or previous property does not exist
292 ofw_fdt_nextprop(ofw_t ofw, phandle_t package, const char *previous, char *buf, argument
303 if (previous == NULL)
311 /* Skip until we find 'previous', then bail out */
312 if (strcmp(name, previous) != 0)
H A Dofw_standard.c85 static int ofw_std_nextprop(ofw_t ofw, phandle_t package, const char *previous,
358 ofw_std_nextprop(ofw_t ofw, phandle_t package, const char *previous, char *buf, argument
366 cell_t previous; member in struct:__anon7738
376 args.previous = (cell_t)previous;
/freebsd-11-stable/contrib/gcc/
H A Dggc-page.c265 /* The previous page-entry with objects of the same size, or NULL if
1145 /* First try to use the hint left from the previous allocation
1401 PE is the node we want to move. Q is the previous node
1533 the special orders. All objects bigger than the previous power
1667 page_entry *p, *previous;
1674 previous = NULL;
1701 if (! previous)
1704 previous->next = next;
1708 next->prev = previous;
1712 G.page_tails[order] = previous;
1662 page_entry *p, *previous; local
[all...]
H A Dcgraph.c189 cgraph_nodes->previous = node;
190 node->previous = NULL;
549 if (node->previous)
550 node->previous->next = node->next;
554 node->next->previous = node->previous;
556 node->previous = NULL;
/freebsd-11-stable/lib/libdevstat/
H A Ddevstat.h169 struct devstat *previous,
H A Ddevstat.c52 compute_stats(struct devstat *current, struct devstat *previous,
692 * any previous selections are erased and
1171 compute_stats(struct devstat *current, struct devstat *previous, argument
1178 return(devstat_compute_statistics(current, previous, etime,
1217 (current->field[(index)] - (previous ? previous->field[(index)] : 0))
1221 (previous ? &previous->field : NULL))
1224 devstat_compute_statistics(struct devstat *current, struct devstat *previous, argument
/freebsd-11-stable/sys/sparc64/include/
H A Dktr.h45 .previous ; \
H A Dasmacros.h173 .previous ; \
191 .previous ; \
/freebsd-11-stable/share/examples/ipfw/
H A Dchange_rules.sh37 # If no answer is received in 30 seconds, the previous
42 # the previous ones will be copied to ${firewall_script}.{date}. Mail
147 The new rules are now installed. The previous rules have been preserved in
/freebsd-11-stable/sys/powerpc/ofw/
H A Dofw_real.c90 static int ofw_real_nextprop(ofw_t, phandle_t package, const char *previous,
535 ofw_real_nextprop(ofw_t ofw, phandle_t package, const char *previous, argument
544 cell_t previous; member in struct:__anon8406
556 args.previous = ofw_real_map(previous, (previous != NULL) ? (strlen(previous) + 1) : 0);
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_cpio.c167 struct links_entry *previous; member in struct:links_entry
1068 if (le->previous != NULL)
1069 le->previous->next = le->next;
1071 le->next->previous = le->previous;
1089 cpio->links_head->previous = le;
1091 le->previous = NULL;

Completed in 315 milliseconds

12345