Home
last modified time | relevance | path

Searched refs:val1 (Results 1 – 3 of 3) sorted by relevance

/include/linux/
A Dhid-sensor-hub.h257 int val1, int val2);
258 int hid_sensor_write_raw_hyst_rel_value(struct hid_sensor_common *st, int val1,
261 int *val1, int *val2);
263 int *val1, int *val2);
265 int val1, int val2);
267 int *val1, int *val2);
274 int *val0, int *val1);
/include/linux/mtd/
A Dmap.h260 #define map_word_equal(map, val1, val2) \ argument
264 if ((val1).x[i] != (val2).x[i]) { \
271 #define map_word_and(map, val1, val2) \ argument
276 r.x[i] = (val1).x[i] & (val2).x[i]; \
280 #define map_word_clr(map, val1, val2) \ argument
285 r.x[i] = (val1).x[i] & ~(val2).x[i]; \
289 #define map_word_or(map, val1, val2) \ argument
294 r.x[i] = (val1).x[i] | (val2).x[i]; \
298 #define map_word_andequal(map, val1, val2, val3) \ argument
310 #define map_word_bitsset(map, val1, val2) \ argument
[all …]
/include/trace/events/
A Dscmi.h13 TP_PROTO(u8 protocol_id, u8 msg_id, u32 res_id, u32 val1, u32 val2),
14 TP_ARGS(protocol_id, msg_id, res_id, val1, val2),
20 __field(u32, val1)
28 __entry->val1 = val1;
34 __entry->res_id, __entry->val1, __entry->val2)

Completed in 8 milliseconds