Home
last modified time | relevance | path

Searched refs:strings (Results 1 – 4 of 4) sorted by relevance

/crypto/ui/
A Dui_lib.c78 sk_UI_STRING_pop_free(ui->strings, free_string); in UI_free()
86 if (ui->strings == NULL) { in allocate_string_stack()
87 ui->strings = sk_UI_STRING_new_null(); in allocate_string_stack()
88 if (ui->strings == NULL) { in allocate_string_stack()
132 ret = sk_UI_STRING_push(ui->strings, s); in general_allocate_string()
176 ret = sk_UI_STRING_push(ui->strings, s); in general_allocate_boolean()
441 if (i >= sk_UI_STRING_num(ui->strings)) { in UI_get0_result()
445 return UI_get0_result_string(sk_UI_STRING_value(ui->strings, i)); in UI_get0_result()
454 if (i >= sk_UI_STRING_num(ui->strings)) { in UI_get_result_length()
491 for (i = 0; i < sk_UI_STRING_num(ui->strings); i++) { in UI_process()
[all …]
A Dui_local.h96 STACK_OF(UI_STRING) *strings; /* We might want to prompt for more than
/crypto/property/
A DREADME.md39 strings. Moreover, such a data structure need not be garbage collected.
40 By converting strings to integers using a structure such as this, string
56 global and requested property strings.
68 separate hash tables. The two Boolean values, the strings "yes" and "no",
72 done by maintaining parallel stacks of strings if required).
76 These convert ASCII strings into lists of properties. The resulting
92 contains a cache that maps property definition strings to
/crypto/
A Dthreads_pthread.c636 char **strings; member
718 if (traces->stacks[traces->idx].strings != NULL) { in print_stack_traces()
724 iov[2 * j].iov_base = traces->stacks[traces->idx].strings[j]; in print_stack_traces()
725 iov[2 * j].iov_len = strlen(traces->stacks[traces->idx].strings[j]); in print_stack_traces()
740 free(traces->stacks[traces->idx].strings); in print_stack_traces()
762 traces->stacks[traces->idx].strings = backtrace_symbols(buffer, in record_lock_contention()

Completed in 16 milliseconds