Home
last modified time | relevance | path

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

12345678910

/freebsd-src/usr.sbin/bsnmpd/modules/snmp_bridge/
H A Dbridge_addrs.c1 /*-
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 Dbridge_sys.c1 /*-
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-src/sys/tests/framework/
H A Dkern_testfrwk.c1 /*-
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()
178 struct kern_test_list *li, *te = NULL; kerntest_execute() local
239 struct kern_test_list *li, *te = NULL; kern_testframework_register() local
272 struct kern_test_list *li, *te = NULL; kern_testframework_deregister() local
[all...]
/freebsd-src/contrib/netbsd-tests/bin/sh/
H A Dt_here.sh6 # 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-src/sys/netgraph/
H A Dng_car.c1 /*-
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-src/share/man/man9/
H A Dieee80211_amrr.95 .\" 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-src/contrib/netbsd-tests/lib/libpthread/
H A Dt_condwait.c7 * 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-src/contrib/ntp/sntp/libevent/test/
H A Dbench_cascade.c2 * 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 Dbench.c2 * 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-src/contrib/libevent/test/
H A Dbench_cascade.c2 * 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 Dbench.c2 * 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-src/sys/dev/cxgbe/tom/
H A Dt4_tom.c1 /*-
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->param in alloc_toepcb()
492 struct tcb_histent *te; alloc_tcb_histent() local
508 free_tcb_histent(struct tcb_histent * te) free_tcb_histent() argument
521 struct tcb_histent *te = NULL; add_tid_to_history() local
556 remove_tcb_histent(struct tcb_histent * te) remove_tcb_histent() argument
573 struct tcb_histent *te; lookup_tcb_histent() local
600 release_tcb_histent(struct tcb_histent * te) release_tcb_histent() argument
614 struct tcb_histent *te = arg; request_tcb() local
627 update_tcb_histent(struct tcb_histent * te,const uint64_t * tcb) update_tcb_histent() argument
686 struct tcb_histent *te; do_get_tcb_rpl() local
755 fill_tcp_info_from_history(struct adapter * sc,struct tcb_histent * te,struct tcp_info * ti) fill_tcp_info_from_history() argument
795 struct tcb_histent *te; fill_tcp_info() local
[all...]
/freebsd-src/sys/dev/iwm/
H A Dif_iwm_time_event.c20 /*-
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-src/lib/libutil/
H A Dlogin_ok.c1 /*-
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-src/sys/netinet/
H A Dtcp_ratelimit.h1 /*-
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->ptb in tcp_hw_highest_rate()
175 tcp_get_pacing_burst_size_w_divisor(struct tcpcb * tp,uint64_t bw,uint32_t segsiz,int can_use_1mss,const struct tcp_hwrate_limit_table * te,int * err,int divisor) tcp_get_pacing_burst_size_w_divisor() argument
233 tcp_get_pacing_burst_size(struct tcpcb * tp,uint64_t bw,uint32_t segsiz,int can_use_1mss,const struct tcp_hwrate_limit_table * te,int * err) tcp_get_pacing_burst_size() argument
[all...]
H A Dtcp_reass.c1 /*-
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_le in tcp_log_reassm()
522 struct tseg_qent *te = NULL; tcp_reass() local
[all...]
/freebsd-src/usr.sbin/uhsoctl/
H A Duhsoctl.c1 /*-
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 in tmr_run()
222 struct timer_entry *te, *te2, *te3; tmr_add() local
[all...]
/freebsd-src/contrib/libarchive/libarchive/
H A Darchive_read_disk_posix.c1 /*-
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-lengt
2125 struct tree_entry *te; tree_push() local
2283 struct tree_entry *te; tree_ascend() local
2366 struct tree_entry *te; tree_pop() local
2660 struct tree_entry *te; global() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1 //===- SLPVectorizer.cpp - A bottom up SLP Vectorizer --------
2301 TreeEntry *TE = nullptr; getVectorizedOperand() local
2859 const TreeEntry *TE = getTreeEntry(V); newTreeEntry() local
3160 TreeEntry *TE = nullptr; global() member
3326 if (TreeEntry *TE = BundleMember->TE) { schedule() local
3757 findReusedOrderedScalars(const BoUpSLP::TreeEntry & TE) findReusedOrderedScalars() argument
4002 findPartiallyOrderedLoads(const BoUpSLP::TreeEntry & TE) findPartiallyOrderedLoads() argument
4074 getReorderingData(const TreeEntry & TE,bool TopToBottom) getReorderingData() argument
4279 reorderNodeWithReuses(TreeEntry & TE,ArrayRef<int> Mask) const reorderNodeWithReuses() argument
4331 __anon1d05f9c62e02( const std::unique_ptr<TreeEntry> &TE) reorderTopToBottom() argument
4577 if (TreeEntry *TE = getVectorizedOperand(UserTE, I)) { canReorderOperands() local
4601 __anon1d05f9c63602(TreeEntry *TE) canReorderOperands() argument
4630 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { reorderBottomToTop() local
4748 __anon1d05f9c63d02( const TreeEntry *TE) reorderBottomToTop() argument
4837 TreeEntry *TE = Op.second; reorderBottomToTop() local
5898 TreeEntry *TE = buildTree_rec() local
5978 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6000 TreeEntry *TE = nullptr; buildTree_rec() local
6055 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6074 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6123 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6151 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6217 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6224 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6238 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
6257 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7441 __anon1d05f9c66d02(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument
7706 if (const TreeEntry *TE = getTreeEntry(Op)) { getOperandEntry() local
7713 for (const TreeEntry *TE : MIt->second) { getOperandEntry() local
7722 __anon1d05f9c67702(const std::unique_ptr<TreeEntry> &TE) getOperandEntry() argument
8394 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { getEntryCost() local
8493 __anon1d05f9c69102(const TreeEntry *TE, unsigned Limit) isFullyVectorizableTinyTree() argument
8622 __anon1d05f9c69402(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument
8931 TreeEntry &TE = *VectorizableTree[I]; getTreeCost() local
9102 __anon1d05f9c69b02(const TreeEntry *TE, ArrayRef<int> Mask, bool) getTreeCost() argument
9348 isGatherShuffledSingleRegisterEntry(const TreeEntry * TE,ArrayRef<Value * > VL,MutableArrayRef<int> Mask,SmallVectorImpl<const TreeEntry * > & Entries,unsigned Part) isGatherShuffledSingleRegisterEntry() argument
9540 for (const TreeEntry *TE : UsedTEs.front()) { isGatherShuffledSingleRegisterEntry() local
9556 for (const TreeEntry *TE : SecondEntries) { isGatherShuffledSingleRegisterEntry() local
9704 isGatherShuffledEntry(const TreeEntry * TE,ArrayRef<Value * > VL,SmallVectorImpl<int> & Mask,SmallVectorImpl<SmallVector<const TreeEntry * >> & Entries,unsigned NumParts) isGatherShuffledEntry() argument
10212 if (const TreeEntry *TE = R.getTreeEntry(VecBase)) adjustExtracts() local
10223 __anon1d05f9c6b502(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument
10262 if (const TreeEntry *TE = R.getTreeEntry(VecOp)) adjustExtracts() local
10322 __anon1d05f9c6bb02(const TreeEntry *TE) needToDelay() argument
10521 __anon1d05f9c6bf02(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
10531 __anon1d05f9c6c002(const TreeEntry *TE) vectorizeOperand() argument
10596 __anon1d05f9c6c302(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
10612 __anon1d05f9c6c402(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
10648 __anon1d05f9c6c702(const std::unique_ptr<TreeEntry> &TE) processBuildVector() argument
10695 if (const auto *TE = getTreeEntry( processBuildVector() local
10770 __anon1d05f9c6cc02(const TreeEntry *TE) processBuildVector() argument
10896 if (const auto *TE = getTreeEntry(VecOp)) processBuildVector() local
11184 if (const TreeEntry *TE = getTreeEntry(V)) vectorizeTree() local
11837 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) vectorizeTree() local
11847 auto *TE = const_cast<TreeEntry *>(E); vectorizeTree() local
13302 auto *TE = getTreeEntry(Scalar); computeMinimumValueSizes() local
[all...]
/freebsd-src/contrib/bc/locales/
H A Dnl_BE.ISO8859-1.msg2 $ 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 Dnl_NL.ISO8859-1.msg2 $ 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 Dnl_NL.ISO8859-15.msg2 $ 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 Dnl_NL.UTF-8.msg2 $ 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 Dnl_BE.ISO8859-15.msg2 $ 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 Dnl_NL.utf8.msg2 $ 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...]

12345678910