Home
last modified time | relevance | path

Searched refs:new (Results 1 – 25 of 86) sorted by relevance

1234

/tools/testing/selftests/rtc/
Dsetdate.c24 struct rtc_time new, current; in main() local
47 sscanf(date, "%d-%d-%d", &new.tm_mday, &new.tm_mon, &new.tm_year); in main()
48 new.tm_mon -= 1; in main()
49 new.tm_year -= 1900; in main()
50 sscanf(time, "%d:%d:%d", &new.tm_hour, &new.tm_min, &new.tm_sec); in main()
53 new.tm_mday, new.tm_mon + 1, new.tm_year + 1900, in main()
54 new.tm_hour, new.tm_min, new.tm_sec); in main()
57 retval = ioctl(fd, RTC_SET_TIME, &new); in main()
Drtctest.c117 time_t secs, new; in TEST_F() local
161 new = timegm((struct tm *)&tm); in TEST_F()
162 ASSERT_EQ(new, secs); in TEST_F()
171 time_t secs, new; in TEST_F() local
210 new = timegm((struct tm *)&tm); in TEST_F()
211 ASSERT_EQ(new, secs); in TEST_F()
219 time_t secs, new; variable
263 new = timegm((struct tm *)&tm);
264 ASSERT_EQ(new, secs);
273 time_t secs, new; variable
[all …]
/tools/include/linux/
Drefcount.h78 unsigned int old, new, val = atomic_read(&r->refs); in refcount_inc_not_zero() local
81 new = val + 1; in refcount_inc_not_zero()
86 if (unlikely(!new)) in refcount_inc_not_zero()
89 old = atomic_cmpxchg_relaxed(&r->refs, val, new); in refcount_inc_not_zero()
96 REFCOUNT_WARN(new == UINT_MAX, "refcount_t: saturated; leaking memory.\n"); in refcount_inc_not_zero()
123 unsigned int old, new, val = atomic_read(&r->refs); in refcount_sub_and_test() local
129 new = val - i; in refcount_sub_and_test()
130 if (new > val) { in refcount_sub_and_test()
131 REFCOUNT_WARN(new > val, "refcount_t: underflow; use-after-free.\n"); in refcount_sub_and_test()
135 old = atomic_cmpxchg_release(&r->refs, val, new); in refcount_sub_and_test()
[all …]
Dlist.h38 static inline void __list_add(struct list_head *new, in __list_add() argument
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
44 new->prev = prev; in __list_add()
45 prev->next = new; in __list_add()
48 extern void __list_add(struct list_head *new,
61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
75 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
77 __list_add(new, head->prev, head); in list_add_tail()
[all …]
Drbtree_augmented.h31 void (*copy)(struct rb_node *old, struct rb_node *new);
32 void (*rotate)(struct rb_node *old, struct rb_node *new);
36 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
92 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
93 new->RBAUGMENTED = old->RBAUGMENTED; \
99 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
100 new->RBAUGMENTED = old->RBAUGMENTED; \
171 __rb_change_child(struct rb_node *old, struct rb_node *new, in __rb_change_child() argument
176 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
178 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
[all …]
Drbtree.h63 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
147 struct rb_node *new, in rb_replace_node_cached() argument
151 root->rb_leftmost = new; in rb_replace_node_cached()
152 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
/tools/perf/util/
Dcomm.c65 struct comm_str *iter, *new; in __comm_str__findnew() local
87 new = comm_str__alloc(str); in __comm_str__findnew()
88 if (!new) in __comm_str__findnew()
91 rb_link_node(&new->rb_node, parent, p); in __comm_str__findnew()
92 rb_insert_color(&new->rb_node, root); in __comm_str__findnew()
94 return new; in __comm_str__findnew()
129 struct comm_str *new, *old = comm->comm_str; in comm__override() local
131 new = comm_str__findnew(str, &comm_str_root); in comm__override()
132 if (!new) in comm__override()
136 comm->comm_str = new; in comm__override()
Dordered-events.c18 static void queue_event(struct ordered_events *oe, struct ordered_event *new) in queue_event() argument
21 u64 timestamp = new->timestamp; in queue_event()
25 oe->last = new; in queue_event()
30 list_add(&new->list, &oe->events); in queue_event()
44 list_add_tail(&new->list, &oe->events); in queue_event()
50 list_add_tail(&new->list, &last->list); in queue_event()
55 list_add(&new->list, &oe->events); in queue_event()
60 list_add(&new->list, &last->list); in queue_event()
103 struct ordered_event *new = NULL; in alloc_event() local
138 size = sizeof(*oe->buffer) + MAX_SAMPLE_BUFFER * sizeof(*new); in alloc_event()
[all …]
Dcallchain.c528 struct callchain_node *new; in create_child() local
530 new = zalloc(sizeof(*new)); in create_child()
531 if (!new) { in create_child()
535 new->parent = parent; in create_child()
536 INIT_LIST_HEAD(&new->val); in create_child()
537 INIT_LIST_HEAD(&new->parent_val); in create_child()
543 new->rb_root_in = parent->rb_root_in; in create_child()
546 n = rb_first(&new->rb_root_in); in create_child()
549 child->parent = new; in create_child()
554 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
[all …]
Dthread.c174 struct namespaces *new, *curr = __thread__namespaces(thread); in __thread__set_namespaces() local
176 new = namespaces__new(event); in __thread__set_namespaces()
177 if (!new) in __thread__set_namespaces()
180 list_add(&new->list, &thread->namespaces_list); in __thread__set_namespaces()
188 curr = list_next_entry(new, list); in __thread__set_namespaces()
240 struct comm *new, *curr = thread__comm(thread); in ____thread__set_comm() local
248 new = comm__new(str, timestamp, exec); in ____thread__set_comm()
249 if (!new) in ____thread__set_comm()
251 list_add(&new->list, &thread->comm_list); in ____thread__set_comm()
/tools/arch/x86/include/asm/
Dcmpxchg.h35 #define __raw_cmpxchg(ptr, old, new, size, lock) \ argument
39 __typeof__(*(ptr)) __new = (new); \
83 #define __cmpxchg(ptr, old, new, size) \ argument
84 __raw_cmpxchg((ptr), (old), (new), (size), LOCK_PREFIX)
86 #define cmpxchg(ptr, old, new) \ argument
87 __cmpxchg(ptr, old, new, sizeof(*(ptr)))
Datomic.h68 static __always_inline int atomic_cmpxchg(atomic_t *v, int old, int new) in atomic_cmpxchg() argument
70 return cmpxchg(&v->counter, old, new); in atomic_cmpxchg()
/tools/usb/usbip/libsrc/
Dlist.h40 static inline void __list_add(struct list_head *new, in __list_add() argument
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
46 new->prev = prev; in __list_add()
47 prev->next = new; in __list_add()
58 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
60 __list_add(new, head, head->next); in list_add()
/tools/build/feature/
Dtest-sync-compare-and-swap.c8 uint64_t old, new = argc; in main() local
13 } while (!__sync_bool_compare_and_swap(&x, old, new)); in main()
14 return old == new; in main()
/tools/testing/ktest/examples/include/
Dmin-config.conf49 OUTPUT_MIN_CONFIG = ${CONFIG_DIR}/config-new-min-net
57 OUTPUT_MIN_CONFIG = ${CONFIG_DIR}/config-new-min
59 MIN_CONFIG = ${CONFIG_DIR}/config-new-min-net
/tools/lib/
Drbtree.c75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents() argument
79 new->__rb_parent_color = old->__rb_parent_color; in __rb_rotate_set_parents()
80 rb_set_parent_color(old, new, color); in __rb_rotate_set_parents()
81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert() argument
228 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in ____rb_erase_color() argument
411 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_erase_color() argument
424 static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {} in dummy_copy() argument
425 static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {} in dummy_rotate() argument
454 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert_augmented() argument
[all …]
Dstring.c157 char *strreplace(char *s, char old, char new) in strreplace() argument
161 *s = new; in strreplace()
/tools/perf/scripts/python/
Dsched-migration.py82 def __init__(self, new): argument
83 self.new = new
86 return "task migrated in %s" % thread_name(self.new)
133 def __migrate_in(self, new, event): argument
134 if new in self.tasks:
137 next_tasks = self.tasks[:] + tuple([new])
141 def migrate_in(self, new): argument
142 return self.__migrate_in(new, RunqueueMigrateIn(new))
144 def wake_up(self, new): argument
145 return self.__migrate_in(new, RunqueueEventWakeup(new))
[all …]
/tools/objtool/
Dspecial.c39 unsigned char size, orig, new; member
51 .new = ALT_NEW_OFFSET,
60 .new = JUMP_NEW_OFFSET,
66 .new = EX_NEW_OFFSET,
136 new_rela = find_rela_by_dest(sec, offset + entry->new); in get_alt_entry()
139 sec, offset + entry->new); in get_alt_entry()
/tools/perf/
Dbuiltin-help.c151 char *new = strdup(path); in exec_man_konqueror() local
152 char *dest = strrchr(new, '/'); in exec_man_konqueror()
156 path = new; in exec_man_konqueror()
211 struct man_viewer_info_list *new = zalloc(sizeof(*new) + len + 1); in do_add_man_viewer_info() local
213 strncpy(new->name, name, len); in do_add_man_viewer_info()
214 new->info = strdup(value); in do_add_man_viewer_info()
215 new->next = man_viewer_info_list; in do_add_man_viewer_info()
216 man_viewer_info_list = new; in do_add_man_viewer_info()
Dbuiltin-lock.c142 static void thread_stat_insert(struct thread_stat *new) in thread_stat_insert() argument
152 if (new->tid < p->tid) in thread_stat_insert()
154 else if (new->tid > p->tid) in thread_stat_insert()
160 rb_link_node(&new->rb, parent, rb); in thread_stat_insert()
161 rb_insert_color(&new->rb, &thread_stats); in thread_stat_insert()
321 struct lock_stat *ret, *new; in lock_stat_findnew() local
328 new = zalloc(sizeof(struct lock_stat)); in lock_stat_findnew()
329 if (!new) in lock_stat_findnew()
332 new->addr = addr; in lock_stat_findnew()
333 new->name = zalloc(sizeof(char) * strlen(name) + 1); in lock_stat_findnew()
[all …]
/tools/testing/radix-tree/linux/
Dpercpu.h9 #define this_cpu_cmpxchg(var, old, new) uatomic_cmpxchg(&var, old, new) argument
/tools/perf/Documentation/
Ddb-export.txt27 so long as the new names are unique.
30 backward compatibility by testing for the presence of new tables and columns
34 script will continue to work with new versions of perf) by accepting a variable
39 before calling them. The scripting engine can also test for the support of new
/tools/memory-model/scripts/
Dnewlitmushist.sh50 sort $T/list-C-already $T/list-C-short | uniq -u > $T/list-C-new
57 sort -u $T/list-C-new $T/list-C-newer > $T/list-C-needed
/tools/testing/selftests/vm/
Dmlock-random-test.c27 struct rlimit new; in set_cap_limits() local
30 new.rlim_cur = max; in set_cap_limits()
31 new.rlim_max = max; in set_cap_limits()
32 if (setrlimit(RLIMIT_MEMLOCK, &new)) { in set_cap_limits()

1234