Searched refs:previous (Results 1 - 25 of 73) sorted by relevance

123

/freebsd-10.0-release/contrib/ntp/sntp/
H A Dtiming.c61 struct timeval old, new, adjust, previous; local
97 previous.tv_sec = 0;
98 previous.tv_usec = 0;
100 if (adjtime(&adjust,&previous))
102 if (previous.tv_sec != 0 || previous.tv_usec != 0) {
104 (long)previous.tv_sec,(long)previous.tv_usec);
105 if (previous.tv_sec+1.0e-6*previous
[all...]
H A Dmain.c84 'savefile' may be used in daemon mode to store a record of previous
661 /* Make the correction. Provide some protection against the previous
698 /* Correct the previous data and store a new entry in the circular buffer. */
904 data_record *record, double *previous, double *when, double *correction) {
913 double previous, when, correction; member in struct:__anon3853
935 buffer.previous,buffer.when,buffer.correction);
970 buffer.waiting > delay || buffer.previous > buffer.when ||
971 buffer.previous < buffer.when-count*delay ||
1017 *previous = buffer.previous;
903 handle_saving(int operation, int *total, int *index, int *cycle, data_record *record, double *previous, double *when, double *correction) argument
1090 double previous, when, correction = 0.0, offset = 0.0, error = -1.0, local
1127 double history[COUNT_MAX], started, previous, when, correction = 0.0, local
[all...]
/freebsd-10.0-release/lib/csu/powerpc64/
H A Dcrti.S36 .previous
52 .previous
/freebsd-10.0-release/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c72 struct links_entry *previous; member in struct:links_entry
297 if (le->previous != NULL)
298 le->previous->next = le->next;
300 le->next->previous = le->previous;
337 le->next->previous = le->previous;
338 if (le->previous != NULL)
339 le->previous->next = le->next;
373 res->buckets[bucket]->previous
[all...]
H A Darchive_read_support_format_cpio.c167 struct links_entry *previous; member in struct:links_entry
1030 if (le->previous != NULL)
1031 le->previous->next = le->next;
1033 le->next->previous = le->previous;
1051 cpio->links_head->previous = le;
1053 le->previous = NULL;
/freebsd-10.0-release/contrib/ofed/management/opensm/opensm/
H A Dosm_perfmgr_db.c178 * Dump a reading vs the previous reading to stdout
251 perfmgr_db_err_reading_t *previous = NULL; local
261 previous = &(node->ports[port].err_previous);
265 epi_pe_data.time_diff_s = (reading->time - previous->time);
269 /* calculate changes from previous reading */
271 (reading->symbol_err_cnt - previous->symbol_err_cnt);
274 (reading->link_err_recover - previous->link_err_recover);
277 (reading->link_downed - previous->link_downed);
279 epi_pe_data.rcv_err = (reading->rcv_err - previous->rcv_err);
282 (reading->rcv_rem_phys_err - previous
342 perfmgr_db_err_reading_t *previous = NULL; local
393 perfmgr_db_data_cnt_reading_t *previous = NULL; local
467 perfmgr_db_data_cnt_reading_t *previous = NULL; local
[all...]
/freebsd-10.0-release/contrib/gcc/config/rs6000/
H A Dppc-asm.h107 .previous; \
133 .previous; \
163 .previous
/freebsd-10.0-release/sys/kern/
H A Dsubr_acl_nfs4.c370 struct acl_entry *entry, *copy, *previous, local
468 previous = &(aclp->acl_entry[i - 1]);
473 if (previous->ae_entry_type != ACL_ENTRY_TYPE_DENY)
484 if (previous->ae_id != entry->ae_id ||
485 previous->ae_tag != entry->ae_tag)
488 if (previous->ae_flags)
497 if (previous->ae_perm & ~(entry->ae_perm))
500 if (previous->ae_perm & ~(ACL_READ_DATA |
512 previous = entry;
518 previous
[all...]
/freebsd-10.0-release/usr.bin/du/
H A Ddu.c348 struct links_entry *previous; member in struct:links_entry
408 new_buckets[hash]->previous =
411 le->previous = NULL;
430 if (le->previous != NULL)
431 le->previous->next = le->next;
433 le->next->previous = le->previous;
470 le->previous = NULL;
472 buckets[hash]->previous = le;
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_subr/
H A Dcache-membuffer.c60 * entries. Every USED entry has a reference to the previous and the next
346 /* Reference to the previous used entry in the order defined by offset.
351 apr_uint32_t previous; member in struct:entry_t
656 if (entry->previous == NO_INDEX)
663 /* insertion may start right behind the previous entry */
664 entry_t *previous = get_entry(cache, entry->previous); local
665 cache->current_data = ALIGN_VALUE( previous->offset
666 + previous->size);
672 if (entry->previous
[all...]
/freebsd-10.0-release/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-10.0-release/usr.bin/csup/
H A Dstatus.c80 struct statusrec *previous; member in struct:status
243 if (st->previous != NULL &&
244 statusrec_cmp(st->previous, &sr) >= 0) {
250 if (st->previous == NULL) {
251 st->previous = &st->buf;
253 statusrec_fini(st->previous);
254 statusrec_init(st->previous);
256 st->previous->sr_type = sr.sr_type;
257 st->previous->sr_file = sr.sr_file;
259 return (st->previous);
[all...]
/freebsd-10.0-release/sys/dev/ofw/
H A Dofw_fdt.c340 ofw_fdt_nextprop(ofw_t ofw, phandle_t package, const char *previous, char *buf, argument
350 if (previous == NULL)
355 * Advance to the previous prop
357 prop = fdt_get_property(fdtp, offset, previous, NULL);
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:__anon9269
376 args.previous = (cell_t)previous;
/freebsd-10.0-release/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;
H A Dcgraph.h115 struct cgraph_node GTY((chain_next ("%h.next"), chain_prev ("%h.previous")))
121 struct cgraph_node *previous; local
/freebsd-10.0-release/lib/libdevstat/
H A Ddevstat.h169 struct devstat *previous,
H A Ddevstat.c52 compute_stats(struct devstat *current, struct devstat *previous,
687 * any previous selections are erased and
1166 compute_stats(struct devstat *current, struct devstat *previous, argument
1173 return(devstat_compute_statistics(current, previous, etime,
1212 (current->field[(index)] - (previous ? previous->field[(index)] : 0))
1216 (previous ? &previous->field : NULL))
1219 devstat_compute_statistics(struct devstat *current, struct devstat *previous, argument
/freebsd-10.0-release/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-10.0-release/sys/boot/ofw/libofw/
H A Dopenfirm.c297 OF_nextprop(phandle_t package, char *previous, char *buf) argument
304 cell_t previous; member in struct:__anon6141
314 args.previous = (cell_t)previous;
/freebsd-10.0-release/sys/sparc64/include/
H A Dktr.h49 .previous ; \
H A Dasmacros.h173 .previous ; \
191 .previous ; \
/freebsd-10.0-release/sys/powerpc/ofw/
H A Dofw_real.c91 static int ofw_real_nextprop(ofw_t, phandle_t package, const char *previous,
536 ofw_real_nextprop(ofw_t ofw, phandle_t package, const char *previous, argument
545 cell_t previous; member in struct:__anon10868
557 args.previous = ofw_real_map(previous, (previous != NULL) ? (strlen(previous) + 1) : 0);
/freebsd-10.0-release/sys/powerpc/include/
H A Dasm.h91 .previous; \

Completed in 232 milliseconds

123