te\-source (full) in projects: freebsd - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:te +full:- +full:source (Results 1 – 25 of 230) sorted by relevance

12 3 4 5 6 7 8 9 10

/freebsd/usr.sbin/bsnmpd/modules/snmp_bridge/
H A D	bridge_addrs.c	1 /- 2 SPDX-License-Identifier: BSD-2-Clause 7 * Redistribution and use in source and binary forms, with or without 10 * 1. Redistributions of source code must retain the above copyright 80 while (bif->f_tpa != NULL && bif->sysindex == bif->f_tpa->sysindex) { in bridge_tpe_bif_free() 81 tp = TAILQ_NEXT(bif->f_tpa, tp_e); in bridge_tpe_bif_free() 82 TAILQ_REMOVE(headp, bif->f_tpa, tp_e); in bridge_tpe_bif_free() 83 free(bif->f_tpa); in bridge_tpe_bif_free() 84 bif->f_tpa = tp; in bridge_tpe_bif_free() 90 * m1 < m2 : -1 [all …]
H A D	bridge_sys.c	1 /- 2 SPDX-License-Identifier: BSD-2-Clause 7 * Redistribution and use in source and binary forms, with or without 10 * 1. Redistributions of source code must retain the above copyright 63 int sock = -1; 70 return (-1); in bridge_ioctl_init() 101 /* Not present - load it. / in bridge_kmod_load() 104 return (-1); in bridge_kmod_load() 126 b_id[SNMP_BRIDGE_ID_LEN - i - 1] = o; in snmp_uint64_to_bridgeid() 139 strlcpy(ifd.ifd_name, bif->bif_name, IFNAMSIZ); in bridge_get_conf_param() [all …]
/freebsd/sys/tests/framework/
H A D	kern_testfrwk.c	1 /- 4 Redistribution and use in source and binary forms, with or without 7 * 1. Redistributions of source code must retain the above copyright 97 wk = TAILQ_FIRST(&tf->kfrwk_testq); in kfrwk_task() 99 wk->kt_data.tot_threads_running--; in kfrwk_task() 100 tf->kfrwk_waiting--; in kfrwk_task() 101 memcpy(&kt_data, &wk->kt_data, sizeof(kt_data)); in kfrwk_task() 102 if (wk->kt_data.tot_threads_running == 0) { in kfrwk_task() 103 TAILQ_REMOVE(&tf->kfrwk_testq, wk, next); in kfrwk_task() 107 taskqueue_enqueue(tf->kfrwk_tq, &tf->kfrwk_que); in kfrwk_task() [all …]
/freebsd/contrib/netbsd-tests/bin/sh/
H A D	t_here.sh	`6 # Redistribution and use in source and binary forms, with or without 9 # 1. Redistributions of source code must retain the above copyright 51 result="$( ${TEST_SH} -c "${CMD}" 2>"${TEMP_FILE}" )" 54 if [ "${STATUS}" -ne "$3" ]; then 64 if [ "$3" -eq 0 ]; then 65 if [ -s "${TEMP_FILE}" ]; then 72 if ! [ -s "${TEMP_FILE}" ]; then 78 rm -f "${TEMP_FILE}" 96 $fail && test -n "$TEST_ID" && { 108 test -z "${TEST_ID}" && return 0 [all …]`
/freebsd/sys/netgraph/
H A D	ng_car.c	1 /- 2 SPDX-License-Identifier: BSD-2-Clause 9 * Redistribution and use in source and binary forms, with or without 12 * 1. Redistributions of source code must retain the above copyright 32 * ng_car - An implementation of committed access rate for netgraph 35 * - Sanitize input config values (impose some limits) 36 * - Implement DSCP marking for IPv4 37 * - Decouple functionality into a simple classifier (g/y/r) 65 hook_p hook; /* this (source) hook / 69 int64_t te; / exceeded/peak token bucket counter */ member [all …]
/freebsd/share/man/man9/
H A D	ieee80211_amrr.9	5 .\" Redistribution and use in source and binary forms, with or without 8 .\" 1. Redistributions of source code must retain the above copyright 94 limits it's effectiveness--do not expect it to function well in 98 requires per-vap state and per-node state for each station it is to 100 The API's are designed for drivers to pre-allocate state in the 101 driver-private extension areas of each vap and node. 105 .Bd -literal -offset indent 118 structure member holds the per-vap state for 123 .Bd -literal -offset indent 124 ieee80211_amrr_init(&rvp->amrr, vap, [all …]
/freebsd/contrib/netbsd-tests/lib/libpthread/
H A D	t_condwait.c	`7 * Redistribution and use in source and binary forms, with or without 10 * 1. Redistributions of source code must retain the above copyright 40 #include <atf-c.h> 53 struct timespec ts, to, te, twmin, twmax; in run() local 80 ATF_REQUIRE_EQ(clock_gettime(clck, &te), 0); in run() 81 timespecsub(&te, &to, &to); in run() 84 (long long)te.tv_sec, te.tv_nsec); in run()`
/freebsd/contrib/ntp/sntp/libevent/test/
H A D	bench_cascade.c	2 * Copyright 2007-2012 Niels Provos and Nick Mathewson 4 * Redistribution and use in source and binary forms, with or without 7 * 1. Redistributions of source code must retain the above copyright 28 #include "event2/event-config.h" 85 static struct timeval ts, te, tv_timeout; in run_once() local 96 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, cp) == -1) { in run_once() 110 evutil_socket_t fd = i < num_pipes - 1 ? cp[3] : -1; in run_once() 124 evutil_gettimeofday(&te, NULL); in run_once() 125 evutil_timersub(&te, &ts, &te); in run_once() 136 return (&te); in run_once() [all …]
H A D	bench.c	2 * Copyright 2003-2007 Niels Provos <provos@citi.umich.edu> 3 * Copyright 2007-2012 Niels Provos and Nick Mathewson 5 * Redistribution and use in source and binary forms, with or without 8 * 1. Redistributions of source code must retain the above copyright 28 * Mon 03/10/2003 - Modified by Davide Libenzi <davidel@xmailserver.org> 36 #include "event2/event-config.h" 37 #include "../util-internal.h" 90 widx -= num_pipes; in read_cb() 94 writes--; in read_cb() 104 static struct timeval ts, te; in run_once() local [all …]
/freebsd/contrib/libevent/test/
H A D	bench_cascade.c	2 * Copyright 2007-2012 Niels Provos and Nick Mathewson 4 * Redistribution and use in source and binary forms, with or without 7 * 1. Redistributions of source code must retain the above copyright 28 #include "event2/event-config.h" 85 static struct timeval ts, te, tv_timeout; in run_once() local 96 if (evutil_socketpair(AF_UNIX, SOCK_STREAM, 0, cp) == -1) { in run_once() 110 evutil_socket_t fd = i < num_pipes - 1 ? cp[3] : -1; in run_once() 124 evutil_gettimeofday(&te, NULL); in run_once() 125 evutil_timersub(&te, &ts, &te); in run_once() 136 return (&te); in run_once() [all …]
H A D	bench.c	2 * Copyright 2003-2007 Niels Provos <provos@citi.umich.edu> 3 * Copyright 2007-2012 Niels Provos and Nick Mathewson 5 * Redistribution and use in source and binary forms, with or without 8 * 1. Redistributions of source code must retain the above copyright 28 * Mon 03/10/2003 - Modified by Davide Libenzi <davidel@xmailserver.org> 36 #include "event2/event-config.h" 37 #include "../util-internal.h" 90 widx -= num_pipes; in read_cb() 94 writes--; in read_cb() 104 static struct timeval ts, te; in run_once() local [all …]
/freebsd/sys/dev/cxgbe/tom/
H A D	t4_tom.c	1 /- 2 SPDX-License-Identifier: BSD-2-Clause 8 * Redistribution and use in source and binary forms, with or without 11 * 1. Redistributions of source code must retain the above copyright 113 struct port_info pi = vi->pi; in alloc_toepcb() 114 struct adapter sc = pi->adapter; in alloc_toepcb() 123 tx_credits = sc->params.ofldq_wr_cred; in alloc_toepcb() 124 tx_credits -= howmany(sizeof(struct cpl_abort_req), 16); in alloc_toepcb() 141 refcount_init(&toep->refcount, 1); in alloc_toepcb() 142 toep->td = sc->tom_softc; in alloc_toepcb() [all …]
/freebsd/sys/dev/iwm/
H A D	if_iwm_time_event.c	20 /- 21 Based on BSD-licensed source modules in the Linux iwlwifi driver, 34 * Copyright(c) 2007 - 2013 Intel Corporation. All rights reserved. 55 * Intel Corporation, 5200 N.E. Elam Young Parkway, Hillsboro, OR 97124-6497 60 * Copyright(c) 2005 - 2013 Intel Corporation. All rights reserved. 63 * Redistribution and use in source and binary forms, with or without 67 * * Redistributions of source code must retain the above copyright 90 /- 91 Copyright (c) 2007-2010 Damien Bergamini <damien.bergamini@free.fr> 165 sc->sc_time_event_uid = 0; in iwm_te_clear_data() [all …]
/freebsd/usr.sbin/uhsoctl/
H A D	uhsoctl.c	`1 /- 2 SPDX-License-Identifier: BSD-2-Clause 4 * Copyright (c) 2008-2009 Fredrik Lindberg 7 * Redistribution and use in source and binary forms, with or without 10 * 1. Redistributions of source code must retain the above copyright 200 struct timer_entry te, te2; in tmr_run() local 202 te = TAILQ_FIRST(&tmrs->head); in tmr_run() 203 if (te == NULL) in tmr_run() 206 te->timeout -= tmrs->res; in tmr_run() 207 while (te->timeout <= 0) { in tmr_run() [all …]`
/freebsd/lib/libutil/
H A D	login_ok.c	1 /- 6 Redistribution and use in source and binary forms, with or without 9 * 1. Redistributions of source code must retain the above copyright 37 /* -- support functions -- / 41 This function is intentionally public - reused by TAS. 42 * Returns TRUE (non-zero) if a string matches a pattern 82 * This function is intentionally public - reused by TAS. 108 for (--j; i < j; i++) in login_timelist() 131 struct ttyent te; in login_ttyok() local 135 te = getttynam(tty); / Need group name */ in login_ttyok() [all …]
/freebsd/sys/netinet/
H A D	tcp_ratelimit.h	1 /- 3 SPDX-License-Identifier: BSD-3-Clause 5 * Copyright (c) 2018-2020 8 * Redistribution and use in source and binary forms, with or without 11 * 1. Redistributions of source code must retain the above copyright 51 uint32_t time_between; /* Time-Gap between packets at this rate / 111 return (rle->ptbl->rs_rlt[rle->ptbl->rs_highest_valid].rate); in tcp_hw_highest_rate() 131 const struct tcp_hwrate_limit_table te, int err, int divisor); 180 const struct tcp_hwrate_limit_table te, int *err, int divisor) in tcp_get_pacing_burst_size_w_divisor() argument 209 new_tso = (bytes + segsiz - 1) / segsiz; in tcp_get_pacing_burst_size_w_divisor() [all …]
H A D	tcp_reass.c	1 /- 2 SPDX-License-Identifier: BSD-3-Clause 7 * Redistribution and use in source and binary forms, with or without 10 * 1. Redistributions of source code must retain the above copyright 202 if (tp->t_logstate != TCP_LOG_STATE_OFF) { in tcp_log_reassm() 211 log.u_bbr.flex2 = q->tqe_start; in tcp_log_reassm() 212 log.u_bbr.flex3 = q->tqe_len; in tcp_log_reassm() 213 log.u_bbr.flex4 = q->tqe_mbuf_cnt; in tcp_log_reassm() 214 log.u_bbr.hptsi_gain = q->tqe_flags; in tcp_log_reassm() 217 log.u_bbr.flex5 = p->tqe_start; in tcp_log_reassm() [all …]
/freebsd/contrib/libarchive/libarchive/
H A D	archive_read_disk_posix.c	`1 /- 2 Copyright (c) 2003-2009 Tim Kientzle 3 * Copyright (c) 2010-2012 Michihiro NAKAJIMA 6 * Redistribution and use in source and binary forms, with or without 9 * 1. Redistributions of source code must retain the above copyright 28 /* This is the tree-walking code for POSIX systems. / 111 #define dirfd(x) ((x)->__dd_fd) 115 /- 116 * This is a new directory-walking system that addresses a number 118 * pathname-length limits (other than the size of 'int'), handles [all …]`
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A D	SLPVectorizer.cpp	1 //===- SLPVectorizer.cpp - A bottom up SLP Vectorizer -------- 2667 TreeEntry TE = nullptr; getVectorizedOperand() local 3247 const TreeEntry TE = getTreeEntry(V); newTreeEntry() local 3577 TreeEntry TE = nullptr; global() member 3743 if (TreeEntry TE = BundleMember->TE) { schedule() local 4222 findReusedOrderedScalars(const BoUpSLP::TreeEntry & TE) findReusedOrderedScalars() argument 4856 findPartiallyOrderedLoads(const BoUpSLP::TreeEntry & TE) findPartiallyOrderedLoads() argument 4928 getReorderingData(const TreeEntry & TE,bool TopToBottom) getReorderingData() argument 5187 reorderNodeWithReuses(TreeEntry & TE,ArrayRef<int> Mask) const reorderNodeWithReuses() argument 5257 __anon07b2d7743f02( const std::unique_ptr<TreeEntry> &TE) reorderTopToBottom() argument 5509 if (TreeEntry TE = getVectorizedOperand(UserTE, I)) { canReorderOperands() local 5530 __anon07b2d7744802(TreeEntry TE) canReorderOperands() argument 5560 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { reorderBottomToTop() local 5672 __anon07b2d7744f02(const TreeEntry TE) reorderBottomToTop() argument 5769 TreeEntry TE = Op.second; reorderBottomToTop() local 7049 TreeEntry TE = buildTree_rec() local 7110 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7125 TreeEntry TE = nullptr; buildTree_rec() local 7200 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7213 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7274 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7296 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7354 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7370 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 7416 TreeEntry TE = newTreeEntry(VL, Bundle /vectorized/, S, UserTreeIdx, buildTree_rec() local 8913 __anon07b2d7748902(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument 9182 if (const TreeEntry TE = getTreeEntry(Op)) { getOperandEntry() local 9189 for (const TreeEntry TE : MIt->second) { getOperandEntry() local 9198 __anon07b2d7749302(const std::unique_ptr<TreeEntry> &TE) getOperandEntry() argument 9888 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { getEntryCost() local 10002 __anon07b2d774ac02(const TreeEntry TE, unsigned Limit) isFullyVectorizableTinyTree() argument 10128 __anon07b2d774ae02(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument 10155 __anon07b2d774af02(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument 10454 TreeEntry &TE = VectorizableTree[I]; getTreeCost() local 10662 __anon07b2d774b802(const TreeEntry TE, ArrayRef<int> Mask, bool) getTreeCost() argument 10928 isGatherShuffledSingleRegisterEntry(const TreeEntry TE,ArrayRef<Value * > VL,MutableArrayRef<int> Mask,SmallVectorImpl<const TreeEntry * > & Entries,unsigned Part,bool ForOrder) isGatherShuffledSingleRegisterEntry() argument 11132 for (const TreeEntry TE : UsedTEs.front()) { isGatherShuffledSingleRegisterEntry() local 11148 for (const TreeEntry TE : SecondEntries) { isGatherShuffledSingleRegisterEntry() local 11299 isGatherShuffledEntry(const TreeEntry * TE,ArrayRef<Value * > VL,SmallVectorImpl<int> & Mask,SmallVectorImpl<SmallVector<const TreeEntry * >> & Entries,unsigned NumParts,bool ForOrder) isGatherShuffledEntry() argument 11881 if (const TreeEntry TE = R.getTreeEntry(VecBase)) adjustExtracts() local 11894 __anon07b2d774d402(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument 11936 if (const TreeEntry TE = R.getTreeEntry(VecOp)) adjustExtracts() local 11947 if (const TreeEntry TE = R.getTreeEntry(VecOp)) adjustExtracts() local 12004 __anon07b2d774db02(const TreeEntry TE) needToDelay() argument 12218 __anon07b2d774e102(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 12228 __anon07b2d774e202(const TreeEntry TE) vectorizeOperand() argument 12289 __anon07b2d774e502(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 12305 __anon07b2d774e602(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 12342 __anon07b2d774e902(const std::unique_ptr<TreeEntry> &TE) processBuildVector() argument 12395 if (const auto TE = getTreeEntry( processBuildVector() local 12470 __anon07b2d774ee02(const TreeEntry TE) processBuildVector() argument 12596 if (const auto TE = getTreeEntry(VecOp)) processBuildVector() local 12894 if (const TreeEntry TE = getTreeEntry(V)) vectorizeTree() local 13717 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) vectorizeTree() local 13727 auto TE = const_cast<TreeEntry >(E); vectorizeTree() local 15555 const TreeEntry TE = getTreeEntry(U); computeMinimumValueSizes() local 15796 TreeEntry *TE = VectorizableTree[Idx].get(); computeMinimumValueSizes() local [all...]
/freebsd/contrib/bc/locales/
H A D	nl_NL.ISO8859-1.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`
H A D	nl_NL.ISO8859-15.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`
H A D	nl_NL.UTF-8.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`
H A D	nl_NL.utf8.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`
H A D	nl_BE.ISO8859-1.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`
H A D	nl_BE.ISO8859-15.msg	`2 $ SPDX-License-Identifier: BSD-2-Clause 4 $ Copyright (c) 2018-2024 Gavin D. Howard and contributors. 6 $ Redistribution and use in source and binary forms, with or without 9 $ * Redistributions of source code must retain the above copyright notice, this 44 2 "niet-integraal getal" 45 3 "overloop: nummer past niet in een hardware-nummer" 58 8 "ongeldige print- o [all...]`

12 3 4 5 6 7 8 9 10