Home
last modified time | relevance | path

Searched refs:node (Results 1 - 25 of 9637) sorted by relevance

12345678910>>...386

/kernel/linux/linux-5.10/arch/mips/include/asm/netlogic/xlp-hal/
H A Diomap.h50 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8)
53 #define XLP_HDR_OFFSET(node, bus, dev, fn) \
54 XLP_IO_PCI_OFFSET(bus, XLP_IO_DEV(node, dev), fn)
56 #define XLP_IO_BRIDGE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 0)
58 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1)
59 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node,
203 xlp9xx_get_socbus(int node) xlp9xx_get_socbus() argument
[all...]
/kernel/linux/linux-6.6/fs/hfs/
H A Dbnode.c9 * Handle basic btree node operations
18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
25 off += node->page_offset; in hfs_bnode_read()
30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
32 page = node->page[pagenum]; in hfs_bnode_read()
42 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
46 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
50 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
54 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
58 void hfs_bnode_read_key(struct hfs_bnode *node, voi argument
73 hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) hfs_bnode_write() argument
84 hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) hfs_bnode_write_u16() argument
91 hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data) hfs_bnode_write_u8() argument
97 hfs_bnode_clear(struct hfs_bnode *node, int off, int len) hfs_bnode_clear() argument
125 hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len) hfs_bnode_move() argument
142 hfs_bnode_dump(struct hfs_bnode *node) hfs_bnode_dump() argument
179 hfs_bnode_unlink(struct hfs_bnode *node) hfs_bnode_unlink() argument
228 struct hfs_bnode *node; hfs_bnode_findhash() local
246 struct hfs_bnode *node, *node2; __hfs_bnode_create() local
302 hfs_bnode_unhash(struct hfs_bnode *node) hfs_bnode_unhash() argument
319 struct hfs_bnode *node; hfs_bnode_find() local
401 hfs_bnode_free(struct hfs_bnode *node) hfs_bnode_free() argument
413 struct hfs_bnode *node; hfs_bnode_create() local
447 hfs_bnode_get(struct hfs_bnode *node) hfs_bnode_get() argument
458 hfs_bnode_put(struct hfs_bnode *node) hfs_bnode_put() argument
[all...]
/kernel/linux/linux-6.6/drivers/scsi/elx/libefc/
H A Defc_device.c16 efc_d_send_prli_rsp(struct efc_node *node, u16 ox_id) in efc_d_send_prli_rsp() argument
19 struct efc *efc = node->efc; in efc_d_send_prli_rsp()
21 node->ls_acc_oxid = ox_id; in efc_d_send_prli_rsp()
22 node->send_ls_acc = EFC_NODE_SEND_LS_ACC_PRLI; in efc_d_send_prli_rsp()
29 if (node->init) { in efc_d_send_prli_rsp()
31 node->display_name, node->wwpn, node->wwnn); in efc_d_send_prli_rsp()
32 if (node->nport->enable_tgt) in efc_d_send_prli_rsp()
33 rc = efc->tt.scsi_new_node(efc, node); in efc_d_send_prli_rsp()
47 struct efc_node *node = NULL; __efc_d_common() local
85 struct efc_node *node = ctx->app; __efc_d_wait_del_node() local
148 struct efc_node *node = ctx->app; __efc_d_wait_del_ini_tgt() local
201 struct efc_node *node = ctx->app; __efc_d_initiate_shutdown() local
317 struct efc_node *node = ctx->app; __efc_d_wait_loop() local
343 efc_send_ls_acc_after_attach(struct efc_node *node, struct fc_frame_header *hdr, enum efc_node_send_ls_acc ls) efc_send_ls_acc_after_attach() argument
358 efc_process_prli_payload(struct efc_node *node, void *prli) efc_process_prli_payload() argument
374 struct efc_node *node = ctx->app; __efc_d_wait_plogi_acc_cmpl() local
411 struct efc_node *node = ctx->app; __efc_d_wait_logo_rsp() local
450 efc_node_init_device(struct efc_node *node, bool send_plogi) efc_node_init_device() argument
463 efc_d_check_plogi_topology(struct efc_node *node, u32 d_id) efc_d_check_plogi_topology() argument
507 struct efc_node *node = ctx->app; __efc_d_init() local
692 struct efc_node *node = ctx->app; __efc_d_wait_plogi_rsp() local
814 struct efc_node *node = ctx->app; __efc_d_wait_plogi_rsp_recvd_prli() local
879 struct efc_node *node = ctx->app; __efc_d_wait_domain_attach() local
915 struct efc_node *node = ctx->app; __efc_d_wait_topology_notify() local
981 struct efc_node *node = ctx->app; __efc_d_wait_node_attach() local
1061 struct efc_node *node = ctx->app; __efc_d_wait_attach_evt_shutdown() local
1113 struct efc_node *node = ctx->app; __efc_d_port_logged_in() local
1262 struct efc_node *node = ctx->app; __efc_d_wait_logo_acc_cmpl() local
1295 struct efc_node *node = ctx->app; __efc_d_device_ready() local
1427 struct efc_node *node = ctx->app; __efc_d_device_gone() local
1550 struct efc_node *node = ctx->app; __efc_d_wait_adisc_rsp() local
[all...]
H A Defc_node.c14 struct efc_node *node = rnode->node; in efc_remote_node_cb() local
18 efc_node_post_event(node, event, NULL); in efc_remote_node_cb()
27 /* Find an FC node structure given the FC port ID */ in efc_node_find()
34 struct efc_node *node = container_of(arg, struct efc_node, ref); in _efc_node_free() local
35 struct efc *efc = node->efc; in _efc_node_free()
38 dma = &node->sparm_dma_buf; in _efc_node_free()
41 mempool_free(node, efc->node_pool); in _efc_node_free()
48 struct efc_node *node = NULL; in efc_node_alloc() local
53 efc_log_debug(efc, "node allocatio in efc_node_alloc()
120 efc_node_free(struct efc_node *node) efc_node_free() argument
192 efc_node_attach(struct efc_node *node) efc_node_attach() argument
246 efc_node_update_display_name(struct efc_node *node) efc_node_update_display_name() argument
259 efc_node_send_ls_io_cleanup(struct efc_node *node) efc_node_send_ls_io_cleanup() argument
270 efc_node_handle_implicit_logo(struct efc_node *node) efc_node_handle_implicit_logo() argument
292 efc_node_handle_explicit_logo(struct efc_node *node) efc_node_handle_explicit_logo() argument
346 efc_node_purge_pending(struct efc_node *node) efc_node_purge_pending() argument
366 struct efc_node *node = ctx->app; __efc_node_shutdown() local
425 efc_node_check_els_quiesced(struct efc_node *node) efc_node_check_els_quiesced() argument
451 efc_node_initiate_cleanup(struct efc_node *node) efc_node_initiate_cleanup() argument
468 struct efc_node *node = ctx->app; __efc_node_wait_els_shutdown() local
542 struct efc_node *node = ctx->app; __efc_node_wait_node_free() local
591 struct efc_node *node = ctx->app; __efc_node_wait_ios_shutdown() local
648 struct efc_node *node = NULL; __efc_node_common() local
763 efc_node_save_sparms(struct efc_node *node, void *payload) efc_node_save_sparms() argument
769 efc_node_post_event(struct efc_node *node, enum efc_sm_event evt, void *arg) efc_node_post_event() argument
801 efc_node_transition(struct efc_node *node, void (*state)(struct efc_sm_ctx *, enum efc_sm_event, void *), void *data) efc_node_transition() argument
825 efc_node_get_wwpn(struct efc_node *node) efc_node_get_wwpn() argument
834 efc_node_get_wwnn(struct efc_node *node) efc_node_get_wwnn() argument
861 efc_els_io_list_empty(struct efc_node *node, struct list_head *list) efc_els_io_list_empty() argument
873 efc_node_pause(struct efc_node *node, void (*state)(struct efc_sm_ctx *, enum efc_sm_event, void *)) efc_node_pause() argument
886 struct efc_node *node = ctx->app; __efc_node_paused() local
925 efc_node_recv_els_frame(struct efc_node *node, struct efc_hw_sequence *seq) efc_node_recv_els_frame() argument
966 efc_node_recv_ct_frame(struct efc_node *node, struct efc_hw_sequence *seq) efc_node_recv_ct_frame() argument
981 efc_node_recv_fcp_cmd(struct efc_node *node, struct efc_hw_sequence *seq) efc_node_recv_fcp_cmd() argument
993 efc_process_node_pending(struct efc_node *node) efc_process_node_pending() argument
1037 efc_scsi_sess_reg_complete(struct efc_node *node, u32 status) efc_scsi_sess_reg_complete() argument
1053 efc_scsi_del_initiator_complete(struct efc *efc, struct efc_node *node) efc_scsi_del_initiator_complete() argument
1064 efc_scsi_del_target_complete(struct efc *efc, struct efc_node *node) efc_scsi_del_target_complete() argument
1075 efc_scsi_io_list_empty(struct efc *efc, struct efc_node *node) efc_scsi_io_list_empty() argument
1084 efc_node_post_els_resp(struct efc_node *node, u32 evt, void *arg) efc_node_post_els_resp() argument
1094 efc_node_post_shutdown(struct efc_node *node, void *arg) efc_node_post_shutdown() argument
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__llist.c77 ares__llist_node_t *node) in ares__llist_attach_at()
79 if (list == NULL || node == NULL) { in ares__llist_attach_at()
83 node->parent = list; in ares__llist_attach_at()
91 node->next = list->head; in ares__llist_attach_at()
92 node->prev = NULL; in ares__llist_attach_at()
94 list->head->prev = node; in ares__llist_attach_at()
96 list->head = node; in ares__llist_attach_at()
99 node->next = NULL; in ares__llist_attach_at()
100 node->prev = list->tail; in ares__llist_attach_at()
102 list->tail->next = node; in ares__llist_attach_at()
74 ares__llist_attach_at(ares__llist_t *list, ares__llist_insert_type_t type, ares__llist_node_t *at, ares__llist_node_t *node) ares__llist_attach_at() argument
127 ares__llist_node_t *node = NULL; ares__llist_insert_at() local
155 ares__llist_insert_before(ares__llist_node_t *node, void *val) ares__llist_insert_before() argument
166 ares__llist_insert_after(ares__llist_node_t *node, void *val) ares__llist_insert_after() argument
197 ares__llist_node_next(ares__llist_node_t *node) ares__llist_node_next() argument
205 ares__llist_node_prev(ares__llist_node_t *node) ares__llist_node_prev() argument
213 ares__llist_node_val(ares__llist_node_t *node) ares__llist_node_val() argument
230 ares__llist_node_parent(ares__llist_node_t *node) ares__llist_node_parent() argument
248 ares__llist_node_detach(ares__llist_node_t *node) ares__llist_node_detach() argument
278 ares__llist_node_claim(ares__llist_node_t *node) ares__llist_node_claim() argument
293 ares__llist_node_destroy(ares__llist_node_t *node) ares__llist_node_destroy() argument
310 ares__llist_node_replace(ares__llist_node_t *node, void *val) ares__llist_node_replace() argument
328 ares__llist_node_t *node; ares__llist_destroy() local
340 ares__llist_node_move_parent_last(ares__llist_node_t *node, ares__llist_t *new_parent) ares__llist_node_move_parent_last() argument
351 ares__llist_node_move_parent_first(ares__llist_node_t *node, ares__llist_t *new_parent) ares__llist_node_move_parent_first() argument
[all...]
H A Dares__slist.c146 static void ares__slist_node_push(ares__slist_t *list, ares__slist_node_t *node) in ares__slist_node_push() argument
154 /* set left if left is NULL and the current node value is greater than the in ares__slist_node_push()
157 list->cmp(node->data, list->head[i]->data) > 0) { in ares__slist_node_push()
164 list->cmp(node->data, left->next[i]->data) > 0) { in ares__slist_node_push()
170 if (i >= node->levels) { in ares__slist_node_push()
176 node->next[i] = list->head[i]; in ares__slist_node_push()
177 node->prev[i] = NULL; in ares__slist_node_push()
178 list->head[i] = node; in ares__slist_node_push()
181 node->next[i] = left->next[i]; in ares__slist_node_push()
182 node in ares__slist_node_push()
200 ares__slist_node_t *node = NULL; ares__slist_insert() local
258 ares__slist_node_pop(ares__slist_node_t *node) ares__slist_node_pop() argument
284 ares__slist_node_claim(ares__slist_node_t *node) ares__slist_node_claim() argument
307 ares__slist_node_reinsert(ares__slist_node_t *node) ares__slist_node_reinsert() argument
324 ares__slist_node_t *node = NULL; ares__slist_node_find() local
397 ares__slist_node_next(ares__slist_node_t *node) ares__slist_node_next() argument
405 ares__slist_node_prev(ares__slist_node_t *node) ares__slist_node_prev() argument
413 ares__slist_node_val(ares__slist_node_t *node) ares__slist_node_val() argument
430 ares__slist_node_parent(ares__slist_node_t *node) ares__slist_node_parent() argument
448 ares__slist_node_destroy(ares__slist_node_t *node) ares__slist_node_destroy() argument
467 ares__slist_node_t *node; ares__slist_destroy() local
[all...]
/third_party/python/Lib/
H A Dast.py36 Parse the source into an AST node.
56 Evaluate an expression node or a string containing only a Python
57 expression. The string or node provided may only consist of the following
67 def _raise_malformed_node(node):
68 msg = "malformed node or string"
69 if lno := getattr(node, 'lineno', None):
71 raise ValueError(msg + f': {node!r}')
72 def _convert_num(node):
73 if not isinstance(node, Constant) or type(node
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-selector.cc18 #include "src/compiler/node-matchers.h"
19 #include "src/compiler/node-properties.h"
33 Smi NumberConstantToSmi(Node* node) { in NumberConstantToSmi() argument
34 DCHECK_EQ(node->opcode(), IrOpcode::kNumberConstant); in NumberConstantToSmi()
35 const double d = OpParameter<double>(node->op()); in NumberConstantToSmi()
284 bool InstructionSelector::CanCover(Node* user, Node* node) const { in CanCover()
285 // 1. Both {user} and {node} must be in the same basic block. in CanCover()
286 if (schedule()->block(node) != current_block_) { in CanCover()
289 // 2. Pure {node}s must be owned by the {user}. in CanCover()
290 if (node in CanCover()
359 SetRename(const Node* node, const Node* rename) SetRename() argument
368 GetVirtualRegister(const Node* node) GetVirtualRegister() argument
399 MarkAsDefined(Node* node) MarkAsDefined() argument
417 MarkAsUsed(Node* node) MarkAsUsed() argument
431 GetEffectLevel(Node* node, FlagsContinuation* cont) const GetEffectLevel() argument
439 SetEffectLevel(Node* node, int effect_level) SetEffectLevel() argument
480 MarkAsRepresentation(MachineRepresentation rep, Node* node) MarkAsRepresentation() argument
557 GetObjectId(Node* node) GetObjectId() argument
576 InsertObject(Node* node) InsertObject() argument
588 HasObjectId(Node* node) HasObjectId() argument
710 AddInputsToFrameStateDescriptor( StateValueList* values, InstructionOperandVector* inputs, OperandGenerator* g, StateObjectDeduplicator* deduplicator, Node* node, FrameStateInputKind kind, Zone* zone) AddInputsToFrameStateDescriptor() argument
969 Node* node = edge.from(); InitializeCallBuffer() local
1159 IsSourcePositionUsed(Node* node) IsSourcePositionUsed() argument
1263 << "# Node: " << *node; VisitControl() local
1351 MarkPairProjectionsAsWord32(Node* node) MarkPairProjectionsAsWord32() argument
1362 VisitNode(Node* node) VisitNode() argument
1928 MarkAsRepresentation(MachineType::PointerRepresentation(), node); VisitNode() local
2370 VisitStackPointerGreaterThan(Node* node) VisitStackPointerGreaterThan() argument
2376 VisitLoadStackCheckOffset(Node* node) VisitLoadStackCheckOffset() argument
2381 VisitLoadFramePointer(Node* node) VisitLoadFramePointer() argument
2386 VisitLoadParentFramePointer(Node* node) VisitLoadParentFramePointer() argument
2391 VisitFloat64Acos(Node* node) VisitFloat64Acos() argument
2395 VisitFloat64Acosh(Node* node) VisitFloat64Acosh() argument
2399 VisitFloat64Asin(Node* node) VisitFloat64Asin() argument
2403 VisitFloat64Asinh(Node* node) VisitFloat64Asinh() argument
2407 VisitFloat64Atan(Node* node) VisitFloat64Atan() argument
2411 VisitFloat64Atanh(Node* node) VisitFloat64Atanh() argument
2415 VisitFloat64Atan2(Node* node) VisitFloat64Atan2() argument
2419 VisitFloat64Cbrt(Node* node) VisitFloat64Cbrt() argument
2423 VisitFloat64Cos(Node* node) VisitFloat64Cos() argument
2427 VisitFloat64Cosh(Node* node) VisitFloat64Cosh() argument
2431 VisitFloat64Exp(Node* node) VisitFloat64Exp() argument
2435 VisitFloat64Expm1(Node* node) VisitFloat64Expm1() argument
2439 VisitFloat64Log(Node* node) VisitFloat64Log() argument
2443 VisitFloat64Log1p(Node* node) VisitFloat64Log1p() argument
2447 VisitFloat64Log2(Node* node) VisitFloat64Log2() argument
2451 VisitFloat64Log10(Node* node) VisitFloat64Log10() argument
2455 VisitFloat64Pow(Node* node) VisitFloat64Pow() argument
2459 VisitFloat64Sin(Node* node) VisitFloat64Sin() argument
2463 VisitFloat64Sinh(Node* node) VisitFloat64Sinh() argument
2467 VisitFloat64Tan(Node* node) VisitFloat64Tan() argument
2471 VisitFloat64Tanh(Node* node) VisitFloat64Tanh() argument
2510 VisitBitcastTaggedToWord(Node* node) VisitBitcastTaggedToWord() argument
2514 VisitBitcastWordToTagged(Node* node) VisitBitcastWordToTagged() argument
2522 VisitWord64And(Node* node) VisitWord64And() argument
2524 VisitWord64Or(Node* node) VisitWord64Or() argument
2526 VisitWord64Xor(Node* node) VisitWord64Xor() argument
2528 VisitWord64Shl(Node* node) VisitWord64Shl() argument
2530 VisitWord64Shr(Node* node) VisitWord64Shr() argument
2532 VisitWord64Sar(Node* node) VisitWord64Sar() argument
2534 VisitWord64Rol(Node* node) VisitWord64Rol() argument
2536 VisitWord64Ror(Node* node) VisitWord64Ror() argument
2538 VisitWord64Clz(Node* node) VisitWord64Clz() argument
2540 VisitWord64Ctz(Node* node) VisitWord64Ctz() argument
2542 VisitWord64ReverseBits(Node* node) VisitWord64ReverseBits() argument
2546 VisitWord64Popcnt(Node* node) VisitWord64Popcnt() argument
2548 VisitWord64Equal(Node* node) VisitWord64Equal() argument
2550 VisitInt64Add(Node* node) VisitInt64Add() argument
2552 VisitInt64AddWithOverflow(Node* node) VisitInt64AddWithOverflow() argument
2556 VisitInt64Sub(Node* node) VisitInt64Sub() argument
2558 VisitInt64SubWithOverflow(Node* node) VisitInt64SubWithOverflow() argument
2562 VisitInt64Mul(Node* node) VisitInt64Mul() argument
2564 VisitInt64Div(Node* node) VisitInt64Div() argument
2566 VisitInt64LessThan(Node* node) VisitInt64LessThan() argument
2568 VisitInt64LessThanOrEqual(Node* node) VisitInt64LessThanOrEqual() argument
2572 VisitUint64Div(Node* node) VisitUint64Div() argument
2574 VisitInt64Mod(Node* node) VisitInt64Mod() argument
2576 VisitUint64LessThan(Node* node) VisitUint64LessThan() argument
2578 VisitUint64LessThanOrEqual(Node* node) VisitUint64LessThanOrEqual() argument
2582 VisitUint64Mod(Node* node) VisitUint64Mod() argument
2584 VisitBitcastWord32ToWord64(Node* node) VisitBitcastWord32ToWord64() argument
2588 VisitChangeInt32ToInt64(Node* node) VisitChangeInt32ToInt64() argument
2592 VisitChangeInt64ToFloat64(Node* node) VisitChangeInt64ToFloat64() argument
2596 VisitChangeUint32ToUint64(Node* node) VisitChangeUint32ToUint64() argument
2600 VisitChangeFloat64ToInt64(Node* node) VisitChangeFloat64ToInt64() argument
2604 VisitChangeFloat64ToUint64(Node* node) VisitChangeFloat64ToUint64() argument
2608 VisitTruncateFloat64ToInt64(Node* node) VisitTruncateFloat64ToInt64() argument
2612 VisitTryTruncateFloat32ToInt64(Node* node) VisitTryTruncateFloat32ToInt64() argument
2616 VisitTryTruncateFloat64ToInt64(Node* node) VisitTryTruncateFloat64ToInt64() argument
2620 VisitTryTruncateFloat32ToUint64(Node* node) VisitTryTruncateFloat32ToUint64() argument
2624 VisitTryTruncateFloat64ToUint64(Node* node) VisitTryTruncateFloat64ToUint64() argument
2628 VisitTruncateInt64ToInt32(Node* node) VisitTruncateInt64ToInt32() argument
2632 VisitRoundInt64ToFloat32(Node* node) VisitRoundInt64ToFloat32() argument
2636 VisitRoundInt64ToFloat64(Node* node) VisitRoundInt64ToFloat64() argument
2640 VisitRoundUint64ToFloat32(Node* node) VisitRoundUint64ToFloat32() argument
2644 VisitRoundUint64ToFloat64(Node* node) VisitRoundUint64ToFloat64() argument
2648 VisitBitcastFloat64ToInt64(Node* node) VisitBitcastFloat64ToInt64() argument
2652 VisitBitcastInt64ToFloat64(Node* node) VisitBitcastInt64ToFloat64() argument
2656 VisitSignExtendWord8ToInt64(Node* node) VisitSignExtendWord8ToInt64() argument
2660 VisitSignExtendWord16ToInt64(Node* node) VisitSignExtendWord16ToInt64() argument
2664 VisitSignExtendWord32ToInt64(Node* node) VisitSignExtendWord32ToInt64() argument
2671 VisitInt32PairAdd(Node* node) VisitInt32PairAdd() argument
2673 VisitInt32PairSub(Node* node) VisitInt32PairSub() argument
2675 VisitInt32PairMul(Node* node) VisitInt32PairMul() argument
2677 VisitWord32PairShl(Node* node) VisitWord32PairShl() argument
2679 VisitWord32PairShr(Node* node) VisitWord32PairShr() argument
2681 VisitWord32PairSar(Node* node) VisitWord32PairSar() argument
2685 VisitWord32AtomicPairLoad(Node* node) VisitWord32AtomicPairLoad() argument
2689 VisitWord32AtomicPairStore(Node* node) VisitWord32AtomicPairStore() argument
2693 VisitWord32AtomicPairAdd(Node* node) VisitWord32AtomicPairAdd() argument
2697 VisitWord32AtomicPairSub(Node* node) VisitWord32AtomicPairSub() argument
2701 VisitWord32AtomicPairAnd(Node* node) VisitWord32AtomicPairAnd() argument
2705 VisitWord32AtomicPairOr(Node* node) VisitWord32AtomicPairOr() argument
2709 VisitWord32AtomicPairXor(Node* node) VisitWord32AtomicPairXor() argument
2713 VisitWord32AtomicPairExchange(Node* node) VisitWord32AtomicPairExchange() argument
2717 VisitWord32AtomicPairCompareExchange(Node* node) VisitWord32AtomicPairCompareExchange() argument
2725 VisitWord64AtomicLoad(Node* node) VisitWord64AtomicLoad() argument
2727 VisitWord64AtomicStore(Node* node) VisitWord64AtomicStore() argument
2731 VisitWord64AtomicAdd(Node* node) VisitWord64AtomicAdd() argument
2733 VisitWord64AtomicSub(Node* node) VisitWord64AtomicSub() argument
2735 VisitWord64AtomicAnd(Node* node) VisitWord64AtomicAnd() argument
2737 VisitWord64AtomicOr(Node* node) VisitWord64AtomicOr() argument
2739 VisitWord64AtomicXor(Node* node) VisitWord64AtomicXor() argument
2741 VisitWord64AtomicExchange(Node* node) VisitWord64AtomicExchange() argument
2745 VisitWord64AtomicCompareExchange(Node* node) VisitWord64AtomicCompareExchange() argument
2754 VisitI64x2SplatI32Pair(Node* node) VisitI64x2SplatI32Pair() argument
2757 VisitI64x2ReplaceLaneI32Pair(Node* node) VisitI64x2ReplaceLaneI32Pair() argument
2765 VisitI64x2Splat(Node* node) VisitI64x2Splat() argument
2766 VisitI64x2ExtractLane(Node* node) VisitI64x2ExtractLane() argument
2767 VisitI64x2ReplaceLane(Node* node) VisitI64x2ReplaceLane() argument
2775 VisitF64x2Qfma(Node* node) VisitF64x2Qfma() argument
2776 VisitF64x2Qfms(Node* node) VisitF64x2Qfms() argument
2777 VisitF32x4Qfma(Node* node) VisitF32x4Qfma() argument
2778 VisitF32x4Qfms(Node* node) VisitF32x4Qfms() argument
2785 VisitI8x16RelaxedLaneSelect(Node* node) VisitI8x16RelaxedLaneSelect() argument
2788 VisitI16x8RelaxedLaneSelect(Node* node) VisitI16x8RelaxedLaneSelect() argument
2791 VisitI32x4RelaxedLaneSelect(Node* node) VisitI32x4RelaxedLaneSelect() argument
2794 VisitI64x2RelaxedLaneSelect(Node* node) VisitI64x2RelaxedLaneSelect() argument
2797 VisitF32x4RelaxedMin(Node* node) VisitF32x4RelaxedMin() argument
2798 VisitF32x4RelaxedMax(Node* node) VisitF32x4RelaxedMax() argument
2799 VisitF64x2RelaxedMin(Node* node) VisitF64x2RelaxedMin() argument
2800 VisitF64x2RelaxedMax(Node* node) VisitF64x2RelaxedMax() argument
2801 VisitI32x4RelaxedTruncF64x2SZero(Node* node) VisitI32x4RelaxedTruncF64x2SZero() argument
2804 VisitI32x4RelaxedTruncF64x2UZero(Node* node) VisitI32x4RelaxedTruncF64x2UZero() argument
2807 VisitI32x4RelaxedTruncF32x4S(Node* node) VisitI32x4RelaxedTruncF32x4S() argument
2810 VisitI32x4RelaxedTruncF32x4U(Node* node) VisitI32x4RelaxedTruncF32x4U() argument
2821 VisitFinishRegion(Node* node) VisitFinishRegion() argument
2823 VisitParameter(Node* node) VisitParameter() argument
2854 VisitIfException(Node* node) VisitIfException() argument
2860 VisitOsrValue(Node* node) VisitOsrValue() argument
2867 VisitPhi(Node* node) VisitPhi() argument
2883 VisitProjection(Node* node) VisitProjection() argument
2916 VisitConstant(Node* node) VisitConstant() argument
2927 VisitCall(Node* node, BasicBlock* handler) VisitCall() argument
3022 VisitTailCall(Node* node) VisitTailCall() argument
3116 VisitDeoptimizeIf(Node* node) VisitDeoptimizeIf() argument
3124 VisitDeoptimizeUnless(Node* node) VisitDeoptimizeUnless() argument
3132 VisitSelect(Node* node) VisitSelect() argument
3139 VisitTrapIf(Node* node, TrapId trap_id) VisitTrapIf() argument
3145 VisitTrapUnless(Node* node, TrapId trap_id) VisitTrapUnless() argument
3151 EmitIdentity(Node* node) EmitIdentity() argument
3165 VisitThrow(Node* node) VisitThrow() argument
3170 VisitDebugBreak(Node* node) VisitDebugBreak() argument
3175 VisitUnreachable(Node* node) VisitUnreachable() argument
3180 VisitStaticAssert(Node* node) VisitStaticAssert() argument
3190 VisitDeadValue(Node* node) VisitDeadValue() argument
3196 VisitComment(Node* node) VisitComment() argument
3202 VisitUnsafePointerAdd(Node* node) VisitUnsafePointerAdd() argument
3210 VisitRetain(Node* node) VisitRetain() argument
3215 CanProduceSignalingNaN(Node* node) CanProduceSignalingNaN() argument
3226 ZeroExtendsWord32ToWord64(Node* node, int recursion_depth) ZeroExtendsWord32ToWord64() argument
3319 CanonicalizeShuffle(Node* node, uint8_t* shuffle, bool* is_swizzle) CanonicalizeShuffle() argument
3339 SwapShuffleInputs(Node* node) SwapShuffleInputs() argument
[all...]
/kernel/linux/linux-5.10/scripts/gdb/linux/
H A Drbtree.py15 node = root.address.cast(rb_root_type.get_type().pointer())
19 node = root['rb_node']
20 if node == 0:
23 while node['rb_left']:
24 node = node['rb_left']
26 return node
31 node = root.address.cast(rb_root_type.get_type().pointer())
35 node = root['rb_node']
36 if node
[all...]
/kernel/linux/linux-6.6/scripts/gdb/linux/
H A Drbtree.py15 node = root.address.cast(rb_root_type.get_type().pointer())
19 node = root['rb_node']
20 if node == 0:
23 while node['rb_left']:
24 node = node['rb_left']
26 return node
31 node = root.address.cast(rb_root_type.get_type().pointer())
35 node = root['rb_node']
36 if node
[all...]
/third_party/lame/ACM/tinyxml/
H A Dtinyxml.cpp95 TiXmlNode* node = firstChild; in ~TiXmlNode() local
98 while ( node ) in ~TiXmlNode()
100 temp = node; in ~TiXmlNode()
101 node = node->next; in ~TiXmlNode()
109 TiXmlNode* node = firstChild; in Clear() local
112 while ( node ) in Clear()
114 temp = node; in Clear()
115 node = node in Clear()
143 TiXmlNode* node = addThis.Clone(); InsertEndChild() local
240 TiXmlNode* node; FirstChild() local
252 TiXmlNode* node; LastChild() local
292 TiXmlNode* node; NextSibling() local
304 TiXmlNode* node; PreviousSibling() local
316 TiXmlAttribute* node = attributeSet.Find( name ); RemoveAttribute() local
327 TiXmlNode* node; FirstChildElement() local
342 TiXmlNode* node; FirstChildElement() local
357 TiXmlNode* node; NextSiblingElement() local
372 TiXmlNode* node; NextSiblingElement() local
388 const TiXmlNode* node; GetDocument() local
415 TiXmlAttribute* node = attributeSet.First(); ~TiXmlElement() local
423 TiXmlAttribute* node = attributeSet.Find( name ); Attribute() local
456 TiXmlAttribute* node = attributeSet.Find( name ); SetAttribute() local
497 TiXmlNode* node; Print() local
541 TiXmlNode* node; StreamOut() local
577 TiXmlNode* node = 0; Clone() local
678 TiXmlNode* node = 0; Clone() local
689 TiXmlNode* node; Print() local
700 TiXmlNode* node; StreamOut() local
979 TiXmlAttribute* node; Remove() local
998 TiXmlAttribute* node; Find() local
[all...]
/kernel/linux/linux-6.6/scripts/dtc/
H A Dchecks.c29 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
62 struct node *node, in check_msg()
76 else if (node && node->srcpos) in check_msg()
77 pos = node->srcpos; in check_msg()
92 if (node) { in check_msg()
94 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
96 xasprintf_append(&str, "%s: ", node in check_msg()
61 check_msg(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const char *fmt, ...) check_msg() argument
134 check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) check_nodes_props() argument
199 check_always_fail(struct check *c, struct dt_info *dti, struct node *node) check_always_fail() argument
206 check_is_string(struct check *c, struct dt_info *dti, struct node *node) check_is_string() argument
224 check_is_string_list(struct check *c, struct dt_info *dti, struct node *node) check_is_string_list() argument
253 check_is_cell(struct check *c, struct dt_info *dti, struct node *node) check_is_cell() argument
275 check_duplicate_node_names(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_node_names() argument
289 check_duplicate_property_names(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_property_names() argument
312 check_node_name_chars(struct check *c, struct dt_info *dti, struct node *node) check_node_name_chars() argument
323 check_node_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) check_node_name_chars_strict() argument
334 check_node_name_format(struct check *c, struct dt_info *dti, struct node *node) check_node_name_format() argument
342 check_node_name_vs_property_name(struct check *c, struct dt_info *dti, struct node *node) check_node_name_vs_property_name() argument
356 check_unit_address_vs_reg(struct check *c, struct dt_info *dti, struct node *node) check_unit_address_vs_reg() argument
383 check_property_name_chars(struct check *c, struct dt_info *dti, struct node *node) check_property_name_chars() argument
398 check_property_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) check_property_name_chars_strict() argument
437 check_duplicate_label(struct check *c, struct dt_info *dti, const char *label, struct node *node, struct property *prop, struct marker *mark) check_duplicate_label() argument
464 check_duplicate_label_node(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_label_node() argument
485 check_phandle_prop(struct check *c, struct dt_info *dti, struct node *node, const char *propname) check_phandle_prop() argument
532 check_explicit_phandles(struct check *c, struct dt_info *dti, struct node *node) check_explicit_phandles() argument
568 check_name_properties(struct check *c, struct dt_info *dti, struct node *node) check_name_properties() argument
602 fixup_phandle_references(struct check *c, struct dt_info *dti, struct node *node) fixup_phandle_references() argument
637 fixup_path_references(struct check *c, struct dt_info *dti, struct node *node) fixup_path_references() argument
668 fixup_omit_unused_nodes(struct check *c, struct dt_info *dti, struct node *node) fixup_omit_unused_nodes() argument
691 check_names_is_string_list(struct check *c, struct dt_info *dti, struct node *node) check_names_is_string_list() argument
706 check_alias_paths(struct check *c, struct dt_info *dti, struct node *node) check_alias_paths() argument
731 fixup_addr_size_cells(struct check *c, struct dt_info *dti, struct node *node) fixup_addr_size_cells() argument
755 check_reg_format(struct check *c, struct dt_info *dti, struct node *node) check_reg_format() argument
784 check_ranges_format(struct check *c, struct dt_info *dti, struct node *node) check_ranges_format() argument
832 check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node) check_pci_bridge() argument
873 check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node) check_pci_device_bus_num() argument
903 check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node) check_pci_device_reg() argument
950 node_is_compatible(struct node *node, const char *compat) node_is_compatible() argument
967 check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_simple_bus_bridge() argument
975 check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_simple_bus_reg() argument
1018 check_i2c_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_i2c_bus_bridge() argument
1047 check_i2c_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_i2c_bus_reg() argument
1095 check_spi_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_spi_bus_bridge() argument
1136 check_spi_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_spi_bus_reg() argument
1167 check_unit_address_format(struct check *c, struct dt_info *dti, struct node *node) check_unit_address_format() argument
1192 check_avoid_default_addr_size(struct check *c, struct dt_info *dti, struct node *node) check_avoid_default_addr_size() argument
1215 check_avoid_unnecessary_addr_size(struct check *c, struct dt_info *dti, struct node *node) check_avoid_unnecessary_addr_size() argument
1239 node_is_disabled(struct node *node) node_is_disabled() argument
1253 check_unique_unit_address_common(struct check *c, struct dt_info *dti, struct node *node, bool disable_check) check_unique_unit_address_common() argument
1290 check_unique_unit_address(struct check *c, struct dt_info *dti, struct node *node) check_unique_unit_address() argument
1297 check_unique_unit_address_if_enabled(struct check *c, struct dt_info *dti, struct node *node) check_unique_unit_address_if_enabled() argument
1305 check_obsolete_chosen_interrupt_controller(struct check *c, struct dt_info *dti, struct node *node) check_obsolete_chosen_interrupt_controller() argument
1329 check_chosen_node_is_root(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_is_root() argument
1340 check_chosen_node_bootargs(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_bootargs() argument
1357 check_chosen_node_stdout_path(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_stdout_path() argument
1384 check_property_phandle_args(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const struct provider *provider) check_property_phandle_args() argument
1464 check_provider_cells_property(struct check *c, struct dt_info *dti, struct node *node) check_provider_cells_property() argument
1514 check_gpios_property(struct check *c, struct dt_info *dti, struct node *node) check_gpios_property() argument
1539 check_deprecated_gpio_property(struct check *c, struct dt_info *dti, struct node *node) check_deprecated_gpio_property() argument
1559 node_is_interrupt_provider(struct node *node) node_is_interrupt_provider() argument
1574 check_interrupt_provider(struct check *c, struct dt_info *dti, struct node *node) check_interrupt_provider() argument
1596 check_interrupt_map(struct check *c, struct dt_info *dti, struct node *node) check_interrupt_map() argument
1680 check_interrupts_property(struct check *c, struct dt_info *dti, struct node *node) check_interrupts_property() argument
1758 check_graph_nodes(struct check *c, struct dt_info *dti, struct node *node) check_graph_nodes() argument
1781 check_graph_child_address(struct check *c, struct dt_info *dti, struct node *node) check_graph_child_address() argument
1806 check_graph_reg(struct check *c, struct dt_info *dti, struct node *node) check_graph_reg() argument
1837 check_graph_port(struct check *c, struct dt_info *dti, struct node *node) check_graph_port() argument
1854 struct node *node; get_remote_endpoint() local
1873 check_graph_endpoint(struct check *c, struct dt_info *dti, struct node *node) check_graph_endpoint() argument
[all...]
H A Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, char *name) in name_node() argument
121 assert(node in name_node()
128 omit_node_if_unused(struct node *node) omit_node_if_unused() argument
135 reference_node(struct node *node) reference_node() argument
231 struct node *node; add_orphan_node() local
266 add_property(struct node *node, struct property *prop) add_property() argument
279 delete_property_by_name(struct node *node, char *name) delete_property_by_name() argument
314 struct node *node = parent->children; delete_node_by_name() local
325 delete_node(struct node *node) delete_node() argument
338 append_to_property(struct node *node, char *name, const void *data, int len, enum markertype type) append_to_property() argument
416 get_unitname(struct node *node) get_unitname() argument
424 get_property(struct node *node, const char *propname) get_property() argument
447 get_property_by_label(struct node *tree, const char *label, struct node **node) get_property_by_label() argument
473 get_marker_label(struct node *tree, const char *label, struct node **node, struct property **prop) get_marker_label() argument
501 get_subnode(struct node *node, const char *nodename) get_subnode() argument
540 struct node *child, *node; get_node_by_label() local
560 struct node *child, *node; get_node_by_phandle() local
619 get_node_phandle(struct node *root, struct node *node) get_node_phandle() argument
732 sort_properties(struct node *node) sort_properties() argument
768 sort_subnodes(struct node *node) sort_subnodes() argument
794 sort_node(struct node *node) sort_node() argument
813 struct node *node; build_and_name_child_node() local
836 any_label_tree(struct dt_info *dti, struct node *node) any_label_tree() argument
850 generate_label_tree_internal(struct dt_info *dti, struct node *an, struct node *node, bool allocph) generate_label_tree_internal() argument
891 any_fixup_tree(struct dt_info *dti, struct node *node) any_fixup_tree() argument
913 add_fixup_entry(struct dt_info *dti, struct node *fn, struct node *node, struct property *prop, struct marker *m) add_fixup_entry() argument
939 generate_fixups_tree_internal(struct dt_info *dti, struct node *fn, struct node *node) generate_fixups_tree_internal() argument
962 any_local_fixup_tree(struct dt_info *dti, struct node *node) any_local_fixup_tree() argument
984 add_local_fixup_entry(struct dt_info *dti, struct node *lfn, struct node *node, struct property *prop, struct marker *m, struct node *refnode) add_local_fixup_entry() argument
1020 generate_local_fixups_tree_internal(struct dt_info *dti, struct node *lfn, struct node *node) generate_local_fixups_tree_internal() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Dbootconfig.c42 * xbc_parse() parses the text to build a simple tree. Each tree node is
43 * simply a key word or a value. A key node may have a next key node or/and
44 * a child node (both key and value). A value node may have a next value
45 * node (for array).
111 * xbc_root_node() - Get the root node of extended boot config
113 * Return the address of root node of extended boot config. If the
125 * xbc_node_index() - Get the index of XBC node
126 * @node
130 xbc_node_index(struct xbc_node *node) xbc_node_index() argument
142 xbc_node_get_parent(struct xbc_node *node) xbc_node_get_parent() argument
154 xbc_node_get_child(struct xbc_node *node) xbc_node_get_child() argument
168 xbc_node_get_next(struct xbc_node *node) xbc_node_get_next() argument
180 xbc_node_get_data(struct xbc_node *node) xbc_node_get_data() argument
191 xbc_node_match_prefix(struct xbc_node *node, const char **prefix) xbc_node_match_prefix() argument
221 struct xbc_node *node; xbc_node_find_subkey() local
259 struct xbc_node *node = xbc_node_find_subkey(parent, key); xbc_node_find_value() local
290 xbc_node_compose_key_after(struct xbc_node *root, struct xbc_node *node, char *buf, size_t size) xbc_node_compose_key_after() argument
339 xbc_node_find_next_leaf(struct xbc_node *root, struct xbc_node *node) xbc_node_find_next_leaf() argument
409 xbc_init_node(struct xbc_node *node, char *data, uint32_t flag) xbc_init_node() argument
425 struct xbc_node *node; xbc_add_node() local
437 xbc_last_sibling(struct xbc_node *node) xbc_last_sibling() argument
445 xbc_last_child(struct xbc_node *node) xbc_last_child() argument
455 struct xbc_node *sib, *node = xbc_add_node(data, flag); __xbc_add_sibling() local
492 struct xbc_node *node = xbc_add_sibling(data, flag); xbc_add_child() local
611 struct xbc_node *node; xbc_parse_array() local
634 find_match_node(struct xbc_node *node, char *k) find_match_node() argument
646 struct xbc_node *node, *child; __xbc_add_key() local
[all...]
/kernel/linux/linux-5.10/scripts/dtc/
H A Dchecks.c29 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
62 struct node *node, in check_msg()
76 else if (node && node->srcpos) in check_msg()
77 pos = node->srcpos; in check_msg()
92 if (node) { in check_msg()
94 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
96 xasprintf_append(&str, "%s: ", node in check_msg()
61 check_msg(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const char *fmt, ...) check_msg() argument
134 check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) check_nodes_props() argument
191 check_always_fail(struct check *c, struct dt_info *dti, struct node *node) check_always_fail() argument
198 check_is_string(struct check *c, struct dt_info *dti, struct node *node) check_is_string() argument
216 check_is_string_list(struct check *c, struct dt_info *dti, struct node *node) check_is_string_list() argument
245 check_is_cell(struct check *c, struct dt_info *dti, struct node *node) check_is_cell() argument
267 check_duplicate_node_names(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_node_names() argument
281 check_duplicate_property_names(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_property_names() argument
303 check_node_name_chars(struct check *c, struct dt_info *dti, struct node *node) check_node_name_chars() argument
314 check_node_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) check_node_name_chars_strict() argument
325 check_node_name_format(struct check *c, struct dt_info *dti, struct node *node) check_node_name_format() argument
333 check_unit_address_vs_reg(struct check *c, struct dt_info *dti, struct node *node) check_unit_address_vs_reg() argument
360 check_property_name_chars(struct check *c, struct dt_info *dti, struct node *node) check_property_name_chars() argument
375 check_property_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) check_property_name_chars_strict() argument
414 check_duplicate_label(struct check *c, struct dt_info *dti, const char *label, struct node *node, struct property *prop, struct marker *mark) check_duplicate_label() argument
441 check_duplicate_label_node(struct check *c, struct dt_info *dti, struct node *node) check_duplicate_label_node() argument
462 check_phandle_prop(struct check *c, struct dt_info *dti, struct node *node, const char *propname) check_phandle_prop() argument
509 check_explicit_phandles(struct check *c, struct dt_info *dti, struct node *node) check_explicit_phandles() argument
545 check_name_properties(struct check *c, struct dt_info *dti, struct node *node) check_name_properties() argument
579 fixup_phandle_references(struct check *c, struct dt_info *dti, struct node *node) fixup_phandle_references() argument
614 fixup_path_references(struct check *c, struct dt_info *dti, struct node *node) fixup_path_references() argument
645 fixup_omit_unused_nodes(struct check *c, struct dt_info *dti, struct node *node) fixup_omit_unused_nodes() argument
669 check_names_is_string_list(struct check *c, struct dt_info *dti, struct node *node) check_names_is_string_list() argument
685 check_alias_paths(struct check *c, struct dt_info *dti, struct node *node) check_alias_paths() argument
710 fixup_addr_size_cells(struct check *c, struct dt_info *dti, struct node *node) fixup_addr_size_cells() argument
734 check_reg_format(struct check *c, struct dt_info *dti, struct node *node) check_reg_format() argument
763 check_ranges_format(struct check *c, struct dt_info *dti, struct node *node) check_ranges_format() argument
811 check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node) check_pci_bridge() argument
852 check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node) check_pci_device_bus_num() argument
882 check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node) check_pci_device_reg() argument
929 node_is_compatible(struct node *node, const char *compat) node_is_compatible() argument
946 check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_simple_bus_bridge() argument
954 check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_simple_bus_reg() argument
997 check_i2c_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_i2c_bus_bridge() argument
1026 check_i2c_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_i2c_bus_reg() argument
1074 check_spi_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) check_spi_bus_bridge() argument
1115 check_spi_bus_reg(struct check *c, struct dt_info *dti, struct node *node) check_spi_bus_reg() argument
1146 check_unit_address_format(struct check *c, struct dt_info *dti, struct node *node) check_unit_address_format() argument
1171 check_avoid_default_addr_size(struct check *c, struct dt_info *dti, struct node *node) check_avoid_default_addr_size() argument
1194 check_avoid_unnecessary_addr_size(struct check *c, struct dt_info *dti, struct node *node) check_avoid_unnecessary_addr_size() argument
1218 node_is_disabled(struct node *node) node_is_disabled() argument
1232 check_unique_unit_address_common(struct check *c, struct dt_info *dti, struct node *node, bool disable_check) check_unique_unit_address_common() argument
1269 check_unique_unit_address(struct check *c, struct dt_info *dti, struct node *node) check_unique_unit_address() argument
1276 check_unique_unit_address_if_enabled(struct check *c, struct dt_info *dti, struct node *node) check_unique_unit_address_if_enabled() argument
1284 check_obsolete_chosen_interrupt_controller(struct check *c, struct dt_info *dti, struct node *node) check_obsolete_chosen_interrupt_controller() argument
1308 check_chosen_node_is_root(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_is_root() argument
1319 check_chosen_node_bootargs(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_bootargs() argument
1336 check_chosen_node_stdout_path(struct check *c, struct dt_info *dti, struct node *node) check_chosen_node_stdout_path() argument
1363 check_property_phandle_args(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const struct provider *provider) check_property_phandle_args() argument
1440 check_provider_cells_property(struct check *c, struct dt_info *dti, struct node *node) check_provider_cells_property() argument
1496 check_gpios_property(struct check *c, struct dt_info *dti, struct node *node) check_gpios_property() argument
1521 check_deprecated_gpio_property(struct check *c, struct dt_info *dti, struct node *node) check_deprecated_gpio_property() argument
1544 node_is_interrupt_provider(struct node *node) node_is_interrupt_provider() argument
1559 check_interrupt_provider(struct check *c, struct dt_info *dti, struct node *node) check_interrupt_provider() argument
1580 check_interrupts_property(struct check *c, struct dt_info *dti, struct node *node) check_interrupts_property() argument
1658 check_graph_nodes(struct check *c, struct dt_info *dti, struct node *node) check_graph_nodes() argument
1681 check_graph_child_address(struct check *c, struct dt_info *dti, struct node *node) check_graph_child_address() argument
1706 check_graph_reg(struct check *c, struct dt_info *dti, struct node *node) check_graph_reg() argument
1737 check_graph_port(struct check *c, struct dt_info *dti, struct node *node) check_graph_port() argument
1754 struct node *node; get_remote_endpoint() local
1773 check_graph_endpoint(struct check *c, struct dt_info *dti, struct node *node) check_graph_endpoint() argument
[all...]
H A Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, char *name) in name_node() argument
121 assert(node in name_node()
128 omit_node_if_unused(struct node *node) omit_node_if_unused() argument
135 reference_node(struct node *node) reference_node() argument
231 struct node *node; add_orphan_node() local
266 add_property(struct node *node, struct property *prop) add_property() argument
279 delete_property_by_name(struct node *node, char *name) delete_property_by_name() argument
314 struct node *node = parent->children; delete_node_by_name() local
325 delete_node(struct node *node) delete_node() argument
338 append_to_property(struct node *node, char *name, const void *data, int len, enum markertype type) append_to_property() argument
416 get_unitname(struct node *node) get_unitname() argument
424 get_property(struct node *node, const char *propname) get_property() argument
447 get_property_by_label(struct node *tree, const char *label, struct node **node) get_property_by_label() argument
473 get_marker_label(struct node *tree, const char *label, struct node **node, struct property **prop) get_marker_label() argument
501 get_subnode(struct node *node, const char *nodename) get_subnode() argument
540 struct node *child, *node; get_node_by_label() local
560 struct node *child, *node; get_node_by_phandle() local
592 get_node_phandle(struct node *root, struct node *node) get_node_phandle() argument
705 sort_properties(struct node *node) sort_properties() argument
741 sort_subnodes(struct node *node) sort_subnodes() argument
767 sort_node(struct node *node) sort_node() argument
786 struct node *node; build_and_name_child_node() local
809 any_label_tree(struct dt_info *dti, struct node *node) any_label_tree() argument
823 generate_label_tree_internal(struct dt_info *dti, struct node *an, struct node *node, bool allocph) generate_label_tree_internal() argument
864 any_fixup_tree(struct dt_info *dti, struct node *node) any_fixup_tree() argument
886 add_fixup_entry(struct dt_info *dti, struct node *fn, struct node *node, struct property *prop, struct marker *m) add_fixup_entry() argument
906 generate_fixups_tree_internal(struct dt_info *dti, struct node *fn, struct node *node) generate_fixups_tree_internal() argument
929 any_local_fixup_tree(struct dt_info *dti, struct node *node) any_local_fixup_tree() argument
951 add_local_fixup_entry(struct dt_info *dti, struct node *lfn, struct node *node, struct property *prop, struct marker *m, struct node *refnode) add_local_fixup_entry() argument
987 generate_local_fixups_tree_internal(struct dt_info *dti, struct node *lfn, struct node *node) generate_local_fixups_tree_internal() argument
[all...]
/kernel/linux/linux-5.10/kernel/gcov/
H A Dfs.c33 * @list: list head for child node list
36 * @parent: parent node
141 * Return a profiling data set associated with the given node. This is
145 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
147 if (node->num_loaded > 0) in get_node_info()
148 return node->loaded_info[0]; in get_node_info()
150 return node->unloaded_info; in get_node_info()
155 * all profiling data associated with the given node.
157 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
162 if (node in get_accumulated_info()
180 struct gcov_node *node = inode->i_private; gcov_seq_open() local
240 struct gcov_node *node; get_node_by_name() local
255 reset_node(struct gcov_node *node) reset_node() argument
277 struct gcov_node *node; gcov_seq_write() local
366 add_links(struct gcov_node *node, struct dentry *parent) add_links() argument
410 init_node(struct gcov_node *node, struct gcov_info *info, const char *name, struct gcov_node *parent) init_node() argument
432 struct gcov_node *node; new_node() local
464 remove_links(struct gcov_node *node) remove_links() argument
480 release_node(struct gcov_node *node) release_node() argument
493 remove_node(struct gcov_node *node) remove_node() argument
511 struct gcov_node *node; get_child_by_name() local
528 struct gcov_node *node; reset_write() local
570 struct gcov_node *node; add_node() local
614 add_info(struct gcov_node *node, struct gcov_info *info) add_info() argument
667 get_info_index(struct gcov_node *node, struct gcov_info *info) get_info_index() argument
681 save_info(struct gcov_node *node, struct gcov_info *info) save_info() argument
699 remove_info(struct gcov_node *node, struct gcov_info *info) remove_info() argument
730 struct gcov_node *node; gcov_event() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Djs-intrinsic-lowering.cc14 #include "src/compiler/node-matchers.h"
15 #include "src/compiler/node-properties.h"
29 Reduction JSIntrinsicLowering::Reduce(Node* node) { in Reduce() argument
30 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange(); in Reduce()
32 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id()); in Reduce()
35 return ReduceIsBeingInterpreted(node); in Reduce()
37 return ReduceTurbofanStaticAssert(node); in Reduce()
39 return ReduceVerifyType(node); in Reduce()
46 return ReduceCopyDataProperties(node); in Reduce()
48 return ReduceCopyDataPropertiesWithExcludedPropertiesOnStack(node); in Reduce()
89 ReduceCopyDataProperties(Node* node) ReduceCopyDataProperties() argument
95 ReduceCopyDataPropertiesWithExcludedPropertiesOnStack( Node* node) ReduceCopyDataPropertiesWithExcludedPropertiesOnStack() argument
113 ReduceCreateIterResultObject(Node* node) ReduceCreateIterResultObject() argument
122 ReduceDeoptimizeNow(Node* node) ReduceDeoptimizeNow() argument
139 ReduceCreateJSGeneratorObject(Node* node) ReduceCreateJSGeneratorObject() argument
152 ReduceGeneratorClose(Node* node) ReduceGeneratorClose() argument
166 ReduceAsyncFunctionAwaitCaught(Node* node) ReduceAsyncFunctionAwaitCaught() argument
172 ReduceAsyncFunctionAwaitUncaught(Node* node) ReduceAsyncFunctionAwaitUncaught() argument
179 ReduceAsyncFunctionEnter(Node* node) ReduceAsyncFunctionEnter() argument
184 ReduceAsyncFunctionReject(Node* node) ReduceAsyncFunctionReject() argument
190 ReduceAsyncFunctionResolve(Node* node) ReduceAsyncFunctionResolve() argument
196 ReduceAsyncGeneratorAwaitCaught(Node* node) ReduceAsyncGeneratorAwaitCaught() argument
202 ReduceAsyncGeneratorAwaitUncaught(Node* node) ReduceAsyncGeneratorAwaitUncaught() argument
209 ReduceAsyncGeneratorReject(Node* node) ReduceAsyncGeneratorReject() argument
215 ReduceAsyncGeneratorResolve(Node* node) ReduceAsyncGeneratorResolve() argument
221 ReduceAsyncGeneratorYield(Node* node) ReduceAsyncGeneratorYield() argument
226 ReduceGeneratorGetResumeMode(Node* node) ReduceGeneratorGetResumeMode() argument
236 ReduceIsInstanceType( Node* node, InstanceType instance_type) ReduceIsInstanceType() argument
277 ReduceIsJSReceiver(Node* node) ReduceIsJSReceiver() argument
281 ReduceTurbofanStaticAssert(Node* node) ReduceTurbofanStaticAssert() argument
295 ReduceVerifyType(Node* node) ReduceVerifyType() argument
299 ReduceIsBeingInterpreted(Node* node) ReduceIsBeingInterpreted() argument
304 Change(Node* node, const Operator* op) Change() argument
314 ReduceToLength(Node* node) ReduceToLength() argument
319 ReduceToObject(Node* node) ReduceToObject() argument
324 ReduceToString(Node* node) ReduceToString() argument
335 ReduceCall(Node* node) ReduceCall() argument
348 ReduceIncBlockCounter(Node* node) ReduceIncBlockCounter() argument
356 ReduceGetImportMetaObject(Node* node) ReduceGetImportMetaObject() argument
361 Change(Node* node, const Operator* op, Node* a, Node* b) Change() argument
371 Change(Node* node, const Operator* op, Node* a, Node* b, Node* c) Change() argument
382 Change(Node* node, const Operator* op, Node* a, Node* b, Node* c, Node* d) Change() argument
394 Change(Node* node, Callable const& callable, int stack_parameter_count, enum FrameStateFlag frame_state_flag) Change() argument
[all...]
H A Ddead-code-elimination.cc10 #include "src/compiler/node-properties.h"
30 // True if we can guarantee that {node} will never actually produce a value or
32 bool NoReturn(Node* node) { in NoReturn() argument
33 return node->opcode() == IrOpcode::kDead || in NoReturn()
34 node->opcode() == IrOpcode::kUnreachable || in NoReturn()
35 node->opcode() == IrOpcode::kDeadValue || in NoReturn()
36 NodeProperties::GetTypeOrAny(node).IsNone(); in NoReturn()
39 Node* FindDeadInput(Node* node) { in FindDeadInput() argument
40 for (Node* input : node->inputs()) { in FindDeadInput()
48 Reduction DeadCodeElimination::Reduce(Node* node) { in Reduce() argument
80 PropagateDeadControl(Node* node) PropagateDeadControl() argument
87 ReduceEnd(Node* node) ReduceEnd() argument
111 ReduceLoopOrMerge(Node* node) ReduceLoopOrMerge() argument
182 RemoveLoopExit(Node* node) RemoveLoopExit() argument
195 ReduceNode(Node* node) ReduceNode() argument
214 ReducePhi(Node* node) ReducePhi() argument
234 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument
262 ReducePureNode(Node* node) ReducePureNode() argument
271 ReduceUnreachableOrIfException(Node* node) ReduceUnreachableOrIfException() argument
286 ReduceEffectNode(Node* node) ReduceEffectNode() argument
311 ReduceDeoptimizeOrReturnOrTerminateOrTailCall( Node* node) ReduceDeoptimizeOrReturnOrTerminateOrTailCall() argument
338 ReduceLoopExit(Node* node) ReduceLoopExit() argument
348 ReduceBranchOrSwitch(Node* node) ReduceBranchOrSwitch() argument
369 TrimMergeOrPhi(Node* node, int size) TrimMergeOrPhi() argument
375 DeadValue(Node* node, MachineRepresentation rep) DeadValue() argument
[all...]
/kernel/linux/linux-5.10/fs/hfs/
H A Dbnode.c9 * Handle basic btree node operations
18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
26 off += node->page_offset; in hfs_bnode_read()
31 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
33 page = node->page[pagenum]; in hfs_bnode_read()
45 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
49 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
53 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
57 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
61 void hfs_bnode_read_key(struct hfs_bnode *node, voi argument
76 hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len) hfs_bnode_write() argument
88 hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data) hfs_bnode_write_u16() argument
95 hfs_bnode_write_u8(struct hfs_bnode *node, int off, u8 data) hfs_bnode_write_u8() argument
101 hfs_bnode_clear(struct hfs_bnode *node, int off, int len) hfs_bnode_clear() argument
132 hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len) hfs_bnode_move() argument
149 hfs_bnode_dump(struct hfs_bnode *node) hfs_bnode_dump() argument
186 hfs_bnode_unlink(struct hfs_bnode *node) hfs_bnode_unlink() argument
235 struct hfs_bnode *node; hfs_bnode_findhash() local
253 struct hfs_bnode *node, *node2; __hfs_bnode_create() local
313 hfs_bnode_unhash(struct hfs_bnode *node) hfs_bnode_unhash() argument
330 struct hfs_bnode *node; hfs_bnode_find() local
411 hfs_bnode_free(struct hfs_bnode *node) hfs_bnode_free() argument
423 struct hfs_bnode *node; hfs_bnode_create() local
459 hfs_bnode_get(struct hfs_bnode *node) hfs_bnode_get() argument
470 hfs_bnode_put(struct hfs_bnode *node) hfs_bnode_put() argument
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_tree.c44 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t *hll_line, char **path) in cil_tree_get_next_path() argument
48 if (!node) { in cil_tree_get_next_path()
52 node = node->parent; in cil_tree_get_next_path()
54 while (node) { in cil_tree_get_next_path()
55 if (node->flavor == CIL_NODE && node->data == NULL) { in cil_tree_get_next_path()
56 if (node->cl_head && node->cl_head->data == CIL_KEY_SRC_INFO) { in cil_tree_get_next_path()
57 if (!node in cil_tree_get_next_path()
97 cil_tree_get_cil_path(struct cil_tree_node *node) cil_tree_get_cil_path() argument
113 cil_tree_log(struct cil_tree_node *node, enum cil_log_level lvl, const char* msg, ...) cil_tree_log() argument
152 cil_tree_subtree_has_decl(struct cil_tree_node *node) cil_tree_subtree_has_decl() argument
190 cil_tree_subtree_destroy(struct cil_tree_node *node) cil_tree_subtree_destroy() argument
196 cil_tree_children_destroy(struct cil_tree_node *node) cil_tree_children_destroy() argument
215 cil_tree_node_init(struct cil_tree_node **node) cil_tree_node_init() argument
230 cil_tree_node_destroy(struct cil_tree_node **node) cil_tree_node_destroy() argument
267 cil_tree_walk_core(struct cil_tree_node *node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, void *extra_args), int (*last_child)(struct cil_tree_node *node, void *extra_args), void *extra_args) cil_tree_walk_core() argument
303 cil_tree_walk(struct cil_tree_node *node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, void *extra_args), int (*last_child)(struct cil_tree_node *node, void *extra_args), void *extra_args) cil_tree_walk() argument
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dscheduler.c106 * stores. Each input node on the ready list represents a live value register
111 * An input node is a "max node" if it has a use two cycles ago, which must be
112 * connected to a definition this cycle. Otherwise it may be a "next max node"
113 * if it will be a max node on the next instruction (i.e. it has a use at most
118 * rewritten to be uses of the move so that the original node returns to
121 * slots, we reserve a slot for each max node, so that we can connect a
123 * slot for every next-max node above 5, so that for the next instruction
124 * there are no more than 5 max nodes. When a max or next-max node gets
135 * of slots. So, thanks to the total input node restrictio
351 schedule_update_distance(gpir_node *node) schedule_update_distance() argument
370 gpir_is_input_node(gpir_node *node) gpir_is_input_node() argument
382 gpir_get_slots_required(gpir_node *node) gpir_get_slots_required() argument
465 gpir_get_max_start(gpir_node *node) gpir_get_max_start() argument
483 gpir_get_min_end(gpir_node *node) gpir_get_min_end() argument
501 gpir_sched_instr_has_load(gpir_instr *instr, gpir_node *node) gpir_sched_instr_has_load() argument
524 _try_place_node(sched_ctx *ctx, gpir_instr *instr, gpir_node *node) _try_place_node() argument
604 schedule_try_place_node(sched_ctx *ctx, gpir_node *node, bool speculative) schedule_try_place_node() argument
655 create_replacement(sched_ctx *ctx, gpir_node *node, gpir_op op) create_replacement() argument
685 create_move(sched_ctx *ctx, gpir_node *node) create_move() argument
692 create_postlog2(sched_ctx *ctx, gpir_node *node) create_postlog2() argument
722 _schedule_try_node(sched_ctx *ctx, gpir_node *node, bool speculative) _schedule_try_node() argument
779 schedule_undo_node(sched_ctx *ctx, gpir_node *node) schedule_undo_node() argument
796 schedule_try_node(sched_ctx *ctx, gpir_node *node, bool speculative) schedule_try_node() argument
824 get_available_regs(sched_ctx *ctx, gpir_node *node, int *min_index) get_available_regs() argument
913 spill_node(sched_ctx *ctx, gpir_node *node, gpir_store_node *store) spill_node() argument
964 used_by_store(gpir_node *node, gpir_instr *instr) used_by_store() argument
978 consuming_postlog2(gpir_node *node) consuming_postlog2() argument
995 try_spill_node(sched_ctx *ctx, gpir_node *node) try_spill_node() argument
1141 gpir_get_min_end_as_move(gpir_node *node) gpir_get_min_end_as_move() argument
1178 can_use_complex(gpir_node *node) can_use_complex() argument
1343 place_move(sched_ctx *ctx, gpir_node *node) place_move() argument
1376 can_place_move(sched_ctx *ctx, gpir_node *node) can_place_move() argument
[all...]
H A Dinstr.c62 static bool gpir_instr_check_acc_same_op(gpir_instr *instr, gpir_node *node, int slot) in gpir_instr_check_acc_same_op() argument
67 /* spill move case may get acc_node == node */ in gpir_instr_check_acc_same_op()
68 if (acc_node && acc_node != node && in gpir_instr_check_acc_same_op()
69 !gpir_codegen_acc_same_op(node->op, acc_node->op)) in gpir_instr_check_acc_same_op()
75 static int gpir_instr_get_consume_slot(gpir_instr *instr, gpir_node *node) in gpir_instr_get_consume_slot() argument
77 if (gpir_op_infos[node->op].may_consume_two_slots) { in gpir_instr_get_consume_slot()
78 gpir_node *acc_node = gpir_instr_get_the_other_acc_node(instr, node->sched.pos); in gpir_instr_get_consume_slot()
80 /* at this point node must have the same acc op with acc_node, in gpir_instr_get_consume_slot()
90 static bool gpir_instr_insert_alu_check(gpir_instr *instr, gpir_node *node) in gpir_instr_insert_alu_check() argument
92 if (!gpir_instr_check_acc_same_op(instr, node, nod in gpir_instr_insert_alu_check()
159 gpir_instr_remove_alu(gpir_instr *instr, gpir_node *node) gpir_instr_remove_alu() argument
184 gpir_instr_insert_reg0_check(gpir_instr *instr, gpir_node *node) gpir_instr_insert_reg0_check() argument
208 gpir_instr_remove_reg0(gpir_instr *instr, gpir_node *node) gpir_instr_remove_reg0() argument
215 gpir_instr_insert_reg1_check(gpir_instr *instr, gpir_node *node) gpir_instr_insert_reg1_check() argument
234 gpir_instr_remove_reg1(gpir_instr *instr, gpir_node *node) gpir_instr_remove_reg1() argument
239 gpir_instr_insert_mem_check(gpir_instr *instr, gpir_node *node) gpir_instr_insert_mem_check() argument
263 gpir_instr_remove_mem(gpir_instr *instr, gpir_node *node) gpir_instr_remove_mem() argument
270 gpir_instr_insert_store_check(gpir_instr *instr, gpir_node *node) gpir_instr_insert_store_check() argument
370 gpir_instr_remove_store(gpir_instr *instr, gpir_node *node) gpir_instr_remove_store() argument
404 gpir_node *node = instr->slots[slot]; gpir_instr_spill_move() local
427 gpir_instr_slot_free(gpir_instr *instr, gpir_node *node) gpir_instr_slot_free() argument
453 gpir_instr_try_insert_node(gpir_instr *instr, gpir_node *node) gpir_instr_try_insert_node() argument
495 gpir_instr_remove_node(gpir_instr *instr, gpir_node *node) gpir_instr_remove_node() argument
565 gpir_node *node = instr->slots[j]; gpir_instr_print_prog() local
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DAsNode.h28 static ANGLE_INLINE TIntermNode *exec(TIntermNode *node) { return node; } in exec()
34 static ANGLE_INLINE TIntermTyped *exec(TIntermNode *node) in exec()
36 return node ? node->getAsTyped() : nullptr; in exec()
43 static ANGLE_INLINE TIntermSymbol *exec(TIntermNode *node) in exec()
45 return node ? node->getAsSymbolNode() : nullptr; in exec()
52 static ANGLE_INLINE TIntermConstantUnion *exec(TIntermNode *node) in exec()
54 return node in exec()
205 asNode(TIntermNode *node) asNode() argument
[all...]
/kernel/linux/linux-5.10/lib/
H A Dbootconfig.c21 * xbc_parse() parses the text to build a simple tree. Each tree node is
22 * simply a key word or a value. A key node may have a next key node or/and
23 * a child node (both key and value). A value node may have a next value
24 * node (for array).
46 * xbc_root_node() - Get the root node of extended boot config
48 * Return the address of root node of extended boot config. If the
60 * xbc_node_index() - Get the index of XBC node
61 * @node
65 xbc_node_index(struct xbc_node *node) xbc_node_index() argument
77 xbc_node_get_parent(struct xbc_node *node) xbc_node_get_parent() argument
89 xbc_node_get_child(struct xbc_node *node) xbc_node_get_child() argument
103 xbc_node_get_next(struct xbc_node *node) xbc_node_get_next() argument
115 xbc_node_get_data(struct xbc_node *node) xbc_node_get_data() argument
126 xbc_node_match_prefix(struct xbc_node *node, const char **prefix) xbc_node_match_prefix() argument
156 struct xbc_node *node; xbc_node_find_child() local
194 struct xbc_node *node = xbc_node_find_child(parent, key); xbc_node_find_value() local
225 xbc_node_compose_key_after(struct xbc_node *root, struct xbc_node *node, char *buf, size_t size) xbc_node_compose_key_after() argument
274 xbc_node_find_next_leaf(struct xbc_node *root, struct xbc_node *node) xbc_node_find_next_leaf() argument
334 xbc_init_node(struct xbc_node *node, char *data, u32 flag) xbc_init_node() argument
350 struct xbc_node *node; xbc_add_node() local
362 xbc_last_sibling(struct xbc_node *node) xbc_last_sibling() argument
372 struct xbc_node *sib, *node = xbc_add_node(data, flag); xbc_add_sibling() local
397 struct xbc_node *node = xbc_add_sibling(data, flag); xbc_add_child() local
516 struct xbc_node *node; xbc_parse_array() local
536 find_match_node(struct xbc_node *node, char *k) find_match_node() argument
548 struct xbc_node *node, *child; __xbc_add_key() local
[all...]

Completed in 22 milliseconds

12345678910>>...386