HomeSort by relevance Sort by last modified time
    Searched defs:sibling (Results 1 - 25 of 525) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
ast.c 69 /* add a child node to the current sibling list */
98 * node the root for the current sibling list. If a root node already
125 /* Apply function to root then each sibling
126 * example: print tree in child-sibling LISP-format (AST has token field)
241 * to 1st sibling (child1). If root is not single node, return NULL.
258 register AST *child, *sibling=NULL, *tail=NULL /* MR20 */, *w; local
275 if ( sibling == NULL ) {sibling = child; tail = w;}
279 if ( root==NULL ) root = sibling;
280 else root->down = sibling;
    [all...]
ASTBase.cpp 54 /* add a child node to the current sibling list */
68 * node the root for the current sibling list. If a root node already
80 /* Apply preorder_action(), etc.. to root then each sibling */
121 * to 1st sibling (child1). If root is not single node, return NULL.
134 register ASTBase *child, *sibling=NULL, *tail=NULL /*MR23*/, *w; local
147 if ( sibling == NULL ) {sibling = child; tail = w;}
151 if ( root==NULL ) root = sibling;
152 else root->_down = sibling;
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
ASTBase.cpp 54 /* add a child node to the current sibling list */
68 * node the root for the current sibling list. If a root node already
80 /* Apply preorder_action(), etc.. to root then each sibling */
121 * to 1st sibling (child1). If root is not single node, return NULL.
134 register ASTBase *child, *sibling=NULL, *tail, *w; local
147 if ( sibling == NULL ) {sibling = child; tail = w;}
151 if ( root==NULL ) root = sibling;
152 else root->_down = sibling;
ast.c 69 /* add a child node to the current sibling list */
98 * node the root for the current sibling list. If a root node already
125 /* Apply function to root then each sibling
126 * example: print tree in child-sibling LISP-format (AST has token field)
241 * to 1st sibling (child1). If root is not single node, return NULL.
258 register AST *child, *sibling=NULL, *tail=NULL /* MR20 */, *w; local
275 if ( sibling == NULL ) {sibling = child; tail = w;}
279 if ( root==NULL ) root = sibling;
280 else root->down = sibling;
    [all...]
PCCTSAST.cpp 83 * to 1st sibling (child1). If root is not single node, return NULL.
85 * Siblings that are actually sibling lists themselves are handled
98 register PCCTS_AST *child, *sibling=NULL, *tail, *w; local
111 if ( sibling == NULL ) {sibling = child; tail = w;}
115 if ( root==NULL ) root = sibling;
116 else root->setDown(sibling);
163 if ( sib==NULL ) /* hit end of sibling list */
178 /* nothing below to try, try next sibling */
186 /* record sibling cursor so we can pick up next from there */
    [all...]
  /device/linaro/bootloader/arm-trusted-firmware/plat/fvp/
fvp_topology.c 49 unsigned char sibling; member in struct:affinity_info
58 * and sibling references allow traversal inside and in between the two arrays.
107 fvp_aff1_topology_map[ctr].sibling != AFFINST_INVAL;
108 ctr = fvp_aff1_topology_map[ctr].sibling) {
120 fvp_aff0_topology_map[ctr].sibling != AFFINST_INVAL;
121 ctr = fvp_aff0_topology_map[ctr].sibling) {
203 fvp_aff1_topology_map[aff1].sibling = aff1 + 1;
224 fvp_aff0_topology_map[aff0_offset].sibling =
231 /* Tie-off the last aff0 sibling to -1 to avoid overflow */
232 fvp_aff0_topology_map[aff0_offset - 1].sibling = AFFINST_INVAL
    [all...]
  /external/pdfium/fpdfsdk/
fpdfdoc_embeddertest.cpp 134 FPDF_BOOKMARK sibling = FPDFBookmark_GetNextSibling(document(), child); local
135 EXPECT_TRUE(sibling);
136 EXPECT_EQ(28u, FPDFBookmark_GetTitle(sibling, buf, sizeof(buf)));
140 EXPECT_EQ(nullptr, FPDFBookmark_GetNextSibling(document(), sibling));
  /external/jemalloc/test/unit/
ph.c 45 node_t *leftmost_child, *sibling; local
56 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
57 NULL; sibling = phn_next_get(node_t, link, sibling)) {
58 node_print(sibling, depth + 1);
89 node_t *leftmost_child, *sibling; local
103 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
104 NULL; sibling = phn_next_get(node_t, link, sibling))
106 link, sibling)), sibling, local
    [all...]
  /system/libufdt/include/
ufdt_types.h 31 it = &((*it)->sibling))
52 struct ufdt_node *sibling; member in struct:ufdt_node
  /art/compiler/optimizing/
register_allocation_resolver.cc 158 LiveInterval* sibling = interval->GetSiblingAt(block->GetLifetimeStart()); local
159 // `GetSiblingAt` returns the sibling that contains a position, but there could be
162 if ((sibling != nullptr) && sibling->CoversSlow(block->GetLifetimeStart())) {
163 DCHECK(!sibling->HasRegister());
ssa_liveness_analysis.cc 517 LiveInterval* sibling = GetSiblingAt(position); local
518 DCHECK(sibling != nullptr);
519 return sibling->ToLocation();
  /development/ndk/platforms/android-9/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /external/libedit/src/
keymacro.c 81 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member in struct:keymacro_node_t
302 if (ptr->sibling) {
303 /* try next sibling */
304 return node_trav(el, ptr->sibling, ch, val);
306 /* no next sibling -- mismatch */
325 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)
326 if (xm->sibling->ch == *str)
328 if (xm->sibling == NULL)
329 xm->sibling = node__get(*str); /* setup new node *
    [all...]
  /external/ltp/utils/ffsb-6.0-rc2/
rbt.c 824 rb_node *sibling; local
827 /* Get a pointer to the current node's sibling (notice
833 * sibling is the right child of the parent.
835 sibling = curr_node->parent->right;
837 /* Check the sibling's color. Notice that NULL
841 if (sibling && sibling->color == red) {
842 /* In case the sibling is red, color
847 sibling->color = black;
850 sibling = curr_node->parent->right
    [all...]
  /prebuilts/ndk/r10/platforms/android-12/arch-arm/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-12/arch-mips/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-12/arch-x86/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-13/arch-arm/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-13/arch-mips/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-13/arch-x86/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-14/arch-arm/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-14/arch-mips/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-14/arch-x86/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-15/arch-arm/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource
  /prebuilts/ndk/r10/platforms/android-15/arch-mips/usr/include/linux/
ioport.h 23 struct resource *parent, *sibling, *child; member in struct:resource

Completed in 656 milliseconds

1 2 3 4 5 6 7 8 91011>>