Searched refs:left (Results 1 – 8 of 8) sorted by relevance
19 struct node_t *left, *right; member39 &(*rootp)->left : /* T3: follow left branch */ in tsearch()46 q->left = q->right = (struct node_t *)0; in tsearch()68 &(*rootp)->left : /* follow left branch */ in tdelete()74 if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */ in tdelete()77 if (r->left == (struct node_t *)0) { /* D2: Find successor */ in tdelete()78 r->left = q; in tdelete()81 for (q = r->left; q->left != (struct node_t *)0; q = r->left) in tdelete()83 r->left = q->right; in tdelete()84 q->left = (*rootp)->left; in tdelete()[all …]
138 u_int left, right, tmp; in permute15() local143 left = (in >> 8) & 0x7f; in permute15()156 tmp ^= left; in permute15()157 left = right; in permute15()161 return (right << 8) | left; in permute15()
240 uint_least32_t left_offset = atomic_load_explicit(¤t->left, memory_order_relaxed); in find_prop_bt()242 current = to_prop_bt(¤t->left); in find_prop_bt()251 atomic_store_explicit(¤t->left, new_offset, memory_order_release); in find_prop_bt()337 uint_least32_t left_offset = atomic_load_explicit(&trie->left, memory_order_relaxed); in foreach_property()339 const int err = foreach_property(to_prop_bt(&trie->left), propfn, cookie); in foreach_property()
43 unsigned char left; member
99 struct tcf_meta_val left; member
70 __u32 left; member
75 atomic_uint_least32_t left; member
208 left on the list are verified.