| /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;
|
| 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=NULL /*MR23*/, *w;
local
111 if ( sibling == NULL ) {sibling = child; tail = w;}
115 if ( root==NULL ) root = sibling;
116 else root->setDown(sibling);
164 if ( sib==NULL ) /* hit end of sibling list */
179 /* nothing below to try, try next sibling */
187 /* record sibling cursor so we can pick up next from there */
[all...] |
| /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...] |
| /external/wpa_supplicant_8/src/utils/ |
| json.h | 31 struct json_token *parent, *child, *sibling; member in struct:json_token
|
| /system/libufdt/include/ |
| ufdt_types.h | 31 (it) = &((*(it))->sibling))
55 struct ufdt_node *sibling; member in struct:ufdt_node
|
| /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...] |
| /external/pdfium/fpdfsdk/ |
| fpdfdoc_embeddertest.cpp | 191 FPDF_BOOKMARK sibling = FPDFBookmark_GetNextSibling(document(), child); local
192 EXPECT_TRUE(sibling);
193 EXPECT_EQ(28u, FPDFBookmark_GetTitle(sibling, buf, sizeof(buf)));
196 EXPECT_EQ(nullptr, FPDFBookmark_GetNextSibling(document(), sibling));
|
| /art/compiler/optimizing/ |
| register_allocation_resolver.cc | 161 LiveInterval* sibling = interval->GetSiblingAt(block->GetLifetimeStart()); local
162 // `GetSiblingAt` returns the sibling that contains a position, but there could be
165 if ((sibling != nullptr) && sibling->CoversSlow(block->GetLifetimeStart())) {
166 DCHECK(!sibling->HasRegister());
|
| ssa_liveness_analysis.cc | 521 LiveInterval* sibling = GetSiblingAt(position); local
522 DCHECK(sibling != nullptr);
523 return sibling->ToLocation();
|
| /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...] |
| /toolchain/binutils/binutils-2.27/bfd/ |
| dwarf1.c | 112 unsigned long sibling; member in struct:die_info
227 aDieInfo->sibling = bfd_get_32 (abfd, (bfd_byte *) xptr);
374 /* Move to next sibling, if none, end loop */
375 if (eachDieInfo.sibling)
376 eachDie = stash->debug_section + eachDieInfo.sibling;
539 not it's sibling. */
540 if (aDieInfo.sibling
544 != stash->debug_section + aDieInfo.sibling)
556 if (aDieInfo.sibling != 0)
557 stash->currentDie = stash->debug_section + aDieInfo.sibling;
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 93 const Node* sibling = node->fNextSibling; local
95 for (; sibling != nullptr; sibling = sibling->fNextSibling) {
96 if (!strcmp(name, sibling->fName)) {
101 return sibling;
|
| /external/skqp/src/xml/ |
| SkDOM.cpp | 93 const Node* sibling = node->fNextSibling; local
95 for (; sibling != nullptr; sibling = sibling->fNextSibling) {
96 if (!strcmp(name, sibling->fName)) {
101 return sibling;
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| move_to_front.h | 738 const uint32_t sibling = LeftOf(parent); local
739 if (BalanceOf(sibling) > 0)
740 RotateLeft(sibling);
747 const uint32_t sibling = RightOf(parent); local
748 if (BalanceOf(sibling) < 0)
749 RotateRight(sibling);
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/ |
| astlib.c | 128 * to 1st sibling (child1). If root is not single node, return NULL.
130 * Siblings that are actually sibling lists themselves are handled
148 register SORAST *child, *sibling=NULL, *tail = NULL, *w;
local
166 if ( sibling == NULL ) {sibling = child; tail = w;}
170 if ( root==NULL ) root = sibling;
171 else root->ast_down = sibling;
258 if ( sib==NULL ) /* hit end of sibling list */
273 /* nothing below to try, try next sibling */
281 /* record sibling cursor so we can pick up next from there */
[all...] |
| /external/ImageMagick/MagickCore/ |
| segment.c | 168 *sibling,
165 *sibling, member in struct:_IntervalTree
[all...] |
| xml-tree.c | 92 *sibling,
922 child=child->sibling;
89 *sibling, member in struct:_XMLTreeInfo
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| fset2.c | 72 * Then each sibling
128 /* check the depth of each primary sibling to see that it is exactly
195 Tree *child, *sibling=NULL, *tail=NULL;
local
216 if ( sibling == NULL ) {sibling = child; tail = w;}
221 /* was "root->down = sibling;" */
222 if ( root==NULL ) root = sibling;
223 else root->down = sibling;
485 /* (? (ALT (? ...)) s) ==> (? (? ...) s) where s = sibling, ? = match any */
1145 if ( p->token != t->token ) /* not found, try a sibling */
[all...] |
| /external/icu/icu4c/source/tools/ctestfw/ |
| ctest.c | 47 struct TestNode* sibling; member in struct:TestNode
179 newNode->sibling = NULL;
194 if(tn->sibling != NULL) {
195 cleanUpTestTree(tn->sibling);
268 nextNode = nextNode -> sibling;
274 curNode->sibling = nextNode;
486 iterateTestsWithLevel ( root->sibling, depth, nodeList, mode );
613 nextNode = nextNode -> sibling;
[all...] |
| /external/seccomp-tests/linux/ |
| seccomp_bpf.c | 1641 struct tsync_sibling sibling[TSYNC_SIBLINGS]; local
[all...] |
| /external/v8/src/ast/ |
| scopes.h | 351 // inner_scope() and sibling() together implement the inner scope list of a
353 // "sibling" points to a next inner scope of the outer scope of this scope.
355 Scope* sibling() const { return sibling_; } function in class:v8::internal::Scope
493 Scope* sibling_; // a sibling inner scope of the outer scope of this scope.
[all...] |
