Searched refs:history (Results 1 - 25 of 33) sorted by relevance

12

/linux-master/drivers/misc/echo/
H A Dfir.h21 history sample offsets that are 16 bit aligned - the dual MAC needs
45 int16_t *history; member in struct:fir16_state_t
57 int16_t *history; member in struct:fir32_state_t
68 float *history; member in struct:fir_float_state_t
77 fir->history = kcalloc(taps, sizeof(int16_t), GFP_KERNEL);
78 return fir->history;
83 memset(fir->history, 0, fir->taps * sizeof(int16_t));
88 kfree(fir->history);
98 fir->history[fir->curr_pos] = sample;
104 y += fir->coeffs[i] * fir->history[
[all...]
H A Decho.c126 exp = (ec->fir_state_bg.history[i - offset1] * factor);
130 exp = (ec->fir_state_bg.history[i + offset2] * factor);
147 const int16_t *history; local
167 history = fir16_create(&ec->fir_state, ec->fir_taps16[0], ec->taps);
168 if (!history)
170 history = fir16_create(&ec->fir_state_bg, ec->fir_taps16[1], ec->taps);
171 if (!history)
334 old = (int)ec->fir_state.history[ec->fir_state.curr_pos] *
335 (int)ec->fir_state.history[ec->fir_state.curr_pos];
/linux-master/arch/x86/kernel/cpu/mce/
H A Dthreshold.c41 * but the precise history of that storm is unknown. Assume
46 storm->banks[bank].history = ~0ull;
89 storm->banks[bank].history = 0;
102 u64 history = 0; local
110 * the history mask will record about the last minute of poll results.
114 * to apply to history.
121 /* If it has been a long time since the last poll, clear history. */
123 history = storm->banks[mce->bank].history << shift;
129 history |
[all...]
H A Dinternal.h80 * history: Bitmask tracking errors occurrence. Each set bit
88 u64 history; member in struct:storm_bank
96 /* How many errors within the history buffer mark the start of a storm. */
101 * the storm is over. Since it is tracked by the bitmasks in the history
/linux-master/drivers/crypto/cavium/zip/
H A Dzip_device.h93 * @history: Decompression history pointer
100 union zip_zptr_s *history; member in struct:zip_state
H A Dcommon.h98 * @history: Pointer to the history buffer
110 * @history_len: Size of the history data
125 u64 history; member in struct:zip_operation
/linux-master/include/linux/
H A Ddynamic_queue_limits.h45 #define DQL_HIST_ENT(dql, idx) ((dql)->history[(idx) % DQL_HIST_LEN])
55 unsigned long history[DQL_HIST_LEN]; member in struct:dql
111 * bit trackes time the packet was queued. The dql->history buffer
131 /* Populate the history with an entry (bit) per queued */
H A Dtimekeeping.h327 struct system_time_snapshot *history,
/linux-master/lib/
H A Ddynamic_queue_limits.c62 dql->history))
78 now, dql->history);
200 memset(dql->history, 0, sizeof(dql->history));
/linux-master/drivers/s390/net/
H A Dfsm.c98 int e = fi->history[idx].event;
99 int s = fi->history[idx++].state;
115 fi->history[fi->history_index].state = state;
116 fi->history[fi->history_index++].event = event;
H A Dfsm.h26 * Define these to record a history of
53 * Element of State/Event history used for debugging.
74 fsm_history history[FSM_HISTORY_SIZE]; member in struct:fsm_instance_t
/linux-master/drivers/gpu/drm/msm/adreno/
H A Da6xx_hfi.h45 s32 history[HFI_HISTORY_SZ]; member in struct:a6xx_hfi_queue
H A Da6xx_hfi.c41 queue->history[(queue->history_idx++) % HFI_HISTORY_SZ] = index;
82 queue->history[(queue->history_idx++) % HFI_HISTORY_SZ] = index;
790 memset(&queue->history, 0xff, sizeof(queue->history));
804 memset(&queue->history, 0xff, sizeof(queue->history));
/linux-master/net/packet/
H A Dinternal.h106 u32 history[ROLLOVER_HLEN] ____cacheline_aligned;
/linux-master/drivers/gpu/drm/i915/gt/
H A Dselftest_timeline.c68 struct intel_timeline **history; member in struct:mock_hwsp_freelist
81 tl = xchg(&state->history[idx], tl);
127 i915_prandom_shuffle(state->history,
128 sizeof(*state->history),
171 state.max = PAGE_SIZE / sizeof(*state.history);
173 state.history = kcalloc(state.max, sizeof(*state.history), GFP_KERNEL);
174 if (!state.history) {
191 kfree(state.history);
H A Dselftest_rps.c153 u8 history[64], i; local
158 memset(history, freq, sizeof(history));
175 if (!memchr_inv(history, act, sizeof(history)))
178 history[i] = act;
179 i = (i + 1) % ARRAY_SIZE(history);
/linux-master/security/apparmor/include/
H A Dmatch.h143 unsigned int size; /* power of 2, same as history size */
144 unsigned int history[WB_HISTORY_SIZE]; member in struct:match_workbuf
/linux-master/security/apparmor/
H A Dmatch.c640 if (wb->history[pos] < state)
644 if (wb->history[pos] == state) {
684 wb->history[wb->pos] = state;
703 wb->history[wb->pos] = state;
/linux-master/net/core/
H A Ddev.h21 u16 history[FLOW_LIMIT_HISTORY]; member in struct:sd_flow_limit
/linux-master/include/trace/events/
H A Dwriteback.h182 unsigned int history),
184 TP_ARGS(inode, wbc, history),
190 __field(unsigned int, history)
197 __entry->history = history;
200 TP_printk("bdi %s: ino=%lu cgroup_ino=%lu history=0x%x",
204 __entry->history
/linux-master/drivers/infiniband/hw/cxgb4/
H A Dcm.c154 set_bit(CM_ID_DEREFED, &epc->history);
159 set_bit(CM_ID_REFED, &epc->history);
167 set_bit(QP_DEREFED, &ep->com.history);
173 set_bit(QP_REFED, &ep->com.history);
931 set_bit(ACT_OPEN_REQ, &ep->com.history);
1246 set_bit(ACT_ESTAB, &ep->com.history);
1280 set_bit(CLOSE_UPCALL, &ep->com.history);
1295 set_bit(DISCONN_UPCALL, &ep->com.history);
1312 set_bit(ABORT_UPCALL, &ep->com.history);
1352 set_bit(CONN_RPL_UPCALL, &ep->com.history);
[all...]
H A Drestrack.c238 if (rdma_nl_put_driver_u64_hex(msg, "history", epcp->history))
/linux-master/fs/
H A Dfs-writeback.c236 * We record, very roughly, 2s worth of IO time history and if more than
787 * oscillation, the detection mechanism keeps track of history and gives
810 u16 history; local
816 history = inode->i_wb_frn_history;
854 * history mask where each bit represents one sixteenth of
856 * history from @max_time.
860 history <<= slots;
862 history |= (1U << slots) - 1;
864 if (history)
865 trace_inode_foreign_history(inode, wbc, history);
[all...]
/linux-master/drivers/gpu/drm/display/
H A Ddrm_dp_mst_topology.c1530 struct drm_dp_mst_topology_ref_history *history,
1545 for (i = 0; i < history->len; i++) {
1546 if (history->entries[i].backtrace == backtrace) {
1547 entry = &history->entries[i];
1555 int new_len = history->len + 1;
1557 new = krealloc(history->entries, sizeof(*new) * new_len,
1562 entry = &new[history->len];
1563 history->len = new_len;
1564 history->entries = new;
1598 struct drm_dp_mst_topology_ref_history *history,
1529 __topology_ref_save(struct drm_dp_mst_topology_mgr *mgr, struct drm_dp_mst_topology_ref_history *history, enum drm_dp_mst_topology_ref_type type) argument
1597 __dump_topology_ref_history(struct drm_device *drm, struct drm_dp_mst_topology_ref_history *history, void *ptr, const char *type_str) argument
[all...]
/linux-master/kernel/time/
H A Dtimekeeping.c1105 * @history: Snapshot representing start of history
1106 * @partial_history_cycles: Cycle offset into history (fractional part)
1107 * @total_history_cycles: Total history length in cycles
1108 * @discontinuity: True indicates clock was set on history period
1115 * total_history_* quantities are the total history starting at the provided
1120 static int adjust_historical_crosststamp(struct system_time_snapshot *history, argument
1134 /* Interpolate shortest distance from beginning or end of history */
1145 ktime_sub(ts->sys_monoraw, history->raw));
1152 * If there is a discontinuity in the history, scal
[all...]

Completed in 546 milliseconds

12