HomeSort by: relevance | last modified time | path
    Searched refs:a_node (Results 1 - 6 of 6) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
rb.h 52 #define rbtn_left_get(a_type, a_field, a_node) \
53 ((a_node)->a_field.rbn_left)
54 #define rbtn_left_set(a_type, a_field, a_node, a_left) do { \
55 (a_node)->a_field.rbn_left = a_left; \
60 #define rbtn_right_get(a_type, a_field, a_node) \
61 ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red) \
63 #define rbtn_right_set(a_type, a_field, a_node, a_right) do { \
64 (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right) \
65 | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1))); \
69 #define rbtn_red_get(a_type, a_field, a_node) \
    [all...]
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
rb.h 52 #define rbtn_left_get(a_type, a_field, a_node) \
53 ((a_node)->a_field.rbn_left)
54 #define rbtn_left_set(a_type, a_field, a_node, a_left) do { \
55 (a_node)->a_field.rbn_left = a_left; \
60 #define rbtn_right_get(a_type, a_field, a_node) \
61 ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red) \
63 #define rbtn_right_set(a_type, a_field, a_node, a_right) do { \
64 (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right) \
65 | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1))); \
69 #define rbtn_red_get(a_type, a_field, a_node) \
    [all...]
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
rb.h 61 #define rbtn_left_get(a_type, a_field, a_node) \
62 ((a_node)->a_field.rbn_left)
63 #define rbtn_left_set(a_type, a_field, a_node, a_left) do { \
64 (a_node)->a_field.rbn_left = a_left; \
69 #define rbtn_right_get(a_type, a_field, a_node) \
70 ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red) \
72 #define rbtn_right_set(a_type, a_field, a_node, a_right) do { \
73 (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right) \
74 | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1))); \
78 #define rbtn_red_get(a_type, a_field, a_node) \
    [all...]
  /src/external/bsd/jemalloc/include/jemalloc/internal/
rb.h 61 #define rbtn_left_get(a_type, a_field, a_node) \
62 ((a_node)->a_field.rbn_left)
63 #define rbtn_left_set(a_type, a_field, a_node, a_left) do { \
64 (a_node)->a_field.rbn_left = a_left; \
69 #define rbtn_right_get(a_type, a_field, a_node) \
70 ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red) \
72 #define rbtn_right_set(a_type, a_field, a_node, a_right) do { \
73 (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right) \
74 | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1))); \
78 #define rbtn_red_get(a_type, a_field, a_node) \
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ira-build.cc 2502 ira_loop_tree_node_t a_node, parent;
2514 a_node = ALLOCNO_LOOP_TREE_NODE (a);
2515 if (! a_node->to_remove_p)
2519 for (parent = a_node->parent;
2549 a_node->regno_allocno_map[regno] = NULL;
2578 ira_loop_tree_node_t a_node, parent;
2584 a_node = ALLOCNO_LOOP_TREE_NODE (a);
2585 if (a_node == ira_loop_tree_root || ALLOCNO_CAP_MEMBER (a) != NULL)
2594 propagate_p = a_node->parent->regno_allocno_map[regno] == NULL;
2604 a_node = ALLOCNO_LOOP_TREE_NODE (a)
2492 ira_loop_tree_node_t a_node, parent; local
2568 ira_loop_tree_node_t a_node, parent; local
    [all...]
  /src/sys/fs/udf/
udf_subr.c 3497 const struct udf_node *a_node = a; local
3500 return udf_compare_icb(&a_node->loc, &b_node->loc);
3507 const struct udf_node *a_node = a; local
3510 return udf_compare_icb(&a_node->loc, icb);

Completed in 67 milliseconds