Searched refs:left (Results 1 - 17 of 17) sorted by relevance

/bionic/libc/upstream-openbsd/lib/libc/stdlib/
H A Dtsearch.c19 struct node_t *left, *right; member in struct:node_t
39 &(*rootp)->left : /* T3: follow left branch */
46 q->left = q->right = (struct node_t *)0;
68 &(*rootp)->left : /* follow left branch */
74 if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */
77 if (r->left == (struct node_t *)0) { /* D2: Find successor */
78 r->left = q;
81 for (q = r->left;
[all...]
/bionic/libc/upstream-freebsd/lib/libc/stdlib/
H A Drealpath.c48 * in which case the path which caused trouble is left in (resolved).
58 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local
82 left_len = strlcpy(left, path + 1, sizeof(left));
94 left_len = strlcpy(left, path, sizeof(left));
96 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) {
104 * Iterate over path components in `left'.
108 * Extract the next path component and adjust `left'
111 p = strchr(left, '/');
[all...]
/bionic/libc/upstream-openbsd/lib/libc/net/
H A Dres_random.c138 u_int left, right, tmp; local
143 left = (in >> 8) & 0x7f;
147 * Each round swaps the width of left and right. Even rounds have
148 * a 7-bit left, odd rounds have an 8-bit left. Since this uses an
149 * odd number of rounds, left is always 8 bits wide at the end.
156 tmp ^= left;
157 left = right;
161 return (right << 8) | left;
/bionic/libc/kernel/uapi/linux/tc_ematch/
H A Dtc_em_meta.h99 struct tcf_meta_val left; member in struct:tcf_meta_hdr
/bionic/libc/kernel/uapi/sound/
H A Dasound_fm.h43 unsigned char left; member in struct:snd_dm_fm_voice
/bionic/libc/versioner-dependencies/common/kernel_uapi/linux/tc_ematch/
H A Dtc_em_meta.h99 struct tcf_meta_val left; member in struct:tcf_meta_hdr
/bionic/libc/versioner-dependencies/common/kernel_uapi/sound/
H A Dasound_fm.h43 unsigned char left; member in struct:snd_dm_fm_voice
/bionic/tools/versioner/dependencies/common/kernel_uapi/linux/tc_ematch/
H A Dtc_em_meta.h99 struct tcf_meta_val left; member in struct:tcf_meta_hdr
/bionic/tools/versioner/dependencies/common/kernel_uapi/sound/
H A Dasound_fm.h43 unsigned char left; member in struct:snd_dm_fm_voice
/bionic/libc/system_properties/
H A Dprop_area.cpp240 uint_least32_t left_offset = atomic_load_explicit(&current->left, memory_order_relaxed);
242 current = to_prop_bt(&current->left);
251 atomic_store_explicit(&current->left, new_offset, memory_order_release);
337 uint_least32_t left_offset = atomic_load_explicit(&trie->left, memory_order_relaxed);
339 const int err = foreach_property(to_prop_bt(&trie->left), propfn, cookie);
/bionic/libc/kernel/uapi/drm/
H A Dqxl_drm.h69 __u32 left; member in struct:drm_qxl_update_area
/bionic/libc/versioner-dependencies/common/kernel_uapi/drm/
H A Dqxl_drm.h69 __u32 left; member in struct:drm_qxl_update_area
/bionic/tools/versioner/dependencies/common/kernel_uapi/drm/
H A Dqxl_drm.h69 __u32 left; member in struct:drm_qxl_update_area
/bionic/libc/system_properties/include/system_properties/
H A Dprop_area.h49 // left / \ right left / | prop +===========+
62 // left, right, children "pointers" in the trie node. To make sure readers who see the
67 // Its situation is similar to the left, right, children "pointers". So we use
75 atomic_uint_least32_t left; member in struct:prop_bt
/bionic/libc/kernel/uapi/linux/
H A Dvideodev2.h136 __s32 left; member in struct:v4l2_rect
/bionic/libc/versioner-dependencies/common/kernel_uapi/linux/
H A Dvideodev2.h136 __s32 left; member in struct:v4l2_rect
/bionic/tools/versioner/dependencies/common/kernel_uapi/linux/
H A Dvideodev2.h136 __s32 left; member in struct:v4l2_rect

Completed in 862 milliseconds