/third_party/libinput/test/ |
H A D | litest-int.h | 38 struct list node; /* global test device list */ member
|
/third_party/ltp/testcases/kernel/mem/vma/ |
H A D | vma04.c | 88 int lc, node, err; in main() local
|
/third_party/ltp/testcases/kernel/syscalls/move_pages/ |
H A D | move_pages12.c | 210 static void alloc_free_huge_on_node(unsigned int node, size_t size) in alloc_free_huge_on_node() argument [all...] |
/third_party/lwip/src/apps/snmp/ |
H A D | snmp_mib2_system.c | 230 system_get_value(const struct snmp_scalar_array_node_def *node, void *value) in system_get_value() argument 281 system_set_test(const struct snmp_scalar_array_node_def *node, u16_t len, void *value) in system_set_test() argument 327 system_set_value(const struct snmp_scalar_array_node_def *node, u16_t len, void *value) in system_set_value() argument [all...] |
H A D | snmp_snmpv2_usm.c | 331 static s16_t usmstats_scalars_get_value(const struct snmp_scalar_array_node_def *node, void *value) in usmstats_scalars_get_value() argument [all...] |
/third_party/ltp/include/lapi/ |
H A D | sched.h | 89 static inline int getcpu(unsigned *cpu, unsigned *node) in getcpu() argument
|
/third_party/ltp/tools/sparse/sparse-src/ |
H A D | c2xml.c | 46 static xmlAttrPtr newProp(xmlNodePtr node, const char *name, const char *value) in newProp() argument 51 static xmlAttrPtr newNumProp(xmlNodePtr node, const char *name, int value) in newNumProp() argument 58 static xmlAttrPtr newIdProp(xmlNodePtr node, const char *name, unsigned int id) in newIdProp() argument 67 xmlNodePtr node; in new_sym_node() local 100 examine_members(struct symbol_list *list, xmlNodePtr node) examine_members() argument 109 examine_modifiers(struct symbol *sym, xmlNodePtr node) examine_modifiers() argument 158 examine_layout(struct symbol *sym, xmlNodePtr node) examine_layout() argument 170 examine_symbol(struct symbol *sym, xmlNodePtr node) examine_symbol() argument 237 examine_macro(struct symbol *sym, xmlNodePtr node) examine_macro() argument [all...] |
H A D | ast-model.c | 44 void inspect_child_node(AstNode *node) in inspect_child_node() argument 54 AstNode* ast_nth_child(AstNode *node, int n) in ast_nth_child() argument 68 ast_set_iter(GtkTreeIter *iter, AstNode *node) ast_set_iter() argument 177 ast_init(AstNode *node) ast_init() argument 264 AstNode *node; ast_get_iter() local 292 AstNode *node = AST_NODE(iter->user_data); ast_get_path() local 316 AstNode *node = iter->user_data; ast_get_value() local 341 AstNode *node = iter->user_data; ast_iter_next() local 382 AstNode *node = iter->user_data; ast_iter_has_child() local 404 AstNode *node = iter ? iter->user_data ast_iter_n_children() local 429 AstNode *node = parent ? parent->user_data : (AstNode*) tree_model; ast_iter_nth_child() local 451 AstNode *node = (AstNode *) child->user_data; ast_iter_parent() local 460 AstNode *node = (AstNode*) g_object_new (AST_TYPE_NODE, NULL); ast_new() local [all...] |
H A D | ssa.c | 202 struct instruction *node = insert_phi_node(bb, var); in ssa_convert_one_var() local 306 struct instruction *node; in mark_phi_used() local
|
/third_party/node/deps/v8/src/compiler/ |
H A D | common-operator-reducer.cc | 39 Reduction CommonOperatorReducer::Reduce(Node* node) { in Reduce() argument 92 ReduceBranch(Node* node) ReduceBranch() argument 143 ReduceDeoptimizeConditional(Node* node) ReduceDeoptimizeConditional() argument 178 ReduceMerge(Node* node) ReduceMerge() argument 214 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument 239 ReducePhi(Node* node) ReducePhi() argument 305 ReduceReturn(Node* node) ReduceReturn() argument 389 ReduceSelect(Node* node) ReduceSelect() argument 432 ReduceSwitch(Node* node) ReduceSwitch() argument 469 ReduceStaticAssert(Node* node) ReduceStaticAssert() argument 505 Change(Node* node, Operator const* op, Node* a) Change() argument 514 Change(Node* node, Operator const* op, Node* a, Node* b) Change() argument [all...] |
H A D | state-values-utils.cc | 50 bool StateValuesCache::IsKeysEqualToNode(StateValuesKey* key, Node* node) { in IsKeysEqualToNode() argument 125 Node* node; GetValuesNodeFromCache() local 305 iterator(Node* node) iterator() argument 317 Push(Node* node) Push() argument 380 Node* StateValuesAccess::iterator::node() { node() function in v8::internal::compiler::StateValuesAccess::iterator [all...] |
H A D | graph-reducer.cc | 32 Reduction Reducer::Reduce(Node* node, in Reduce() argument 36 observe_node_manager->OnNodeChanged(reducer_name(), node, in Reduce() local 67 void GraphReducer::ReduceNode(Node* node) { in ReduceNode() argument 100 Reduce(Node* const node) Reduce() argument 150 Node* node = entry.node; ReduceTop() local 212 Replace(Node* node, Node* replacement) Replace() argument 217 Replace(Node* node, Node* replacement, NodeId max_id) Replace() argument 251 ReplaceWithValue(Node* node, Node* value, Node* effect, Node* control) ReplaceWithValue() argument 290 Node* node = stack_.top().node; Pop() local 296 Push(Node* const node) Push() argument 303 Recurse(Node* node) Recurse() argument 310 Revisit(Node* node) Revisit() argument [all...] |
H A D | graph-reducer.h | 71 static Reduction Replace(Node* node) { return Reduction(node); } in Replace() argument 72 static Reduction Changed(Node* node) { retur in Replace() argument 103 Replace(Node* node) Replace() argument 106 Replace(Node* node, Node* replacement) Replace() argument 110 Revisit(Node* node) Revisit() argument 114 ReplaceWithValue(Node* node, Node* value, Node* effect = nullptr, Node* control = nullptr) ReplaceWithValue() argument 123 RelaxEffectsAndControls(Node* node) RelaxEffectsAndControls() argument 129 RelaxControls(Node* node) RelaxControls() argument 162 Node* node; global() member in v8::internal::compiler::GraphReducer::State [all...] |
H A D | loop-variable-optimizer.cc | 40 Node* node = queue.front(); in Run() local 120 VisitNode(Node* node) VisitNode() argument 139 VisitMerge(Node* node) VisitMerge() argument 148 VisitLoop(Node* node) VisitLoop() argument 154 VisitIf(Node* node, bool polarity) VisitIf() argument 182 AddCmpToLimits( VariableLimits* limits, Node* node, InductionVariable::ConstraintKind kind, bool polarity) AddCmpToLimits() argument 199 VisitStart(Node* node) VisitStart() argument 201 VisitLoopExit(Node* node) VisitLoopExit() argument 205 VisitOtherControl(Node* node) VisitOtherControl() argument 210 TakeConditionsFromFirstControl(Node* node) TakeConditionsFromFirstControl() argument 214 FindInductionVariable( Node* node) FindInductionVariable() argument [all...] |
H A D | node-origin-table.h | 73 Scope(NodeOriginTable* origins, const char* reducer_name, Node* node) in Scope() argument
|
H A D | redundancy-elimination.cc | 19 Reduction RedundancyElimination::Reduce(Node* node) { in Reduce() argument 213 TypeSubsumes(Node* node, Node* replacement) TypeSubsumes() argument 256 Set( Node* node, EffectPathChecks const* checks) Set() argument 263 ReduceCheckNode(Node* node) ReduceCheckNode() argument 279 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument 307 ReduceSpeculativeNumberComparison(Node* node) ReduceSpeculativeNumberComparison() argument 365 ReduceSpeculativeNumberOperation(Node* node) ReduceSpeculativeNumberOperation() argument 398 ReduceStart(Node* node) ReduceStart() argument 402 ReduceOtherNode(Node* node) ReduceOtherNode() argument 416 TakeChecksFromFirstEffect(Node* node) TakeChecksFromFirstEffect() argument 428 UpdateChecks(Node* node, EffectPathChecks const* checks) UpdateChecks() argument [all...] |
H A D | control-equivalence.h | 52 size_t ClassOf(Node* node) { in ClassOf() argument 77 Node* node; // Node that this stack entry belongs to. member 131 GetData(Node* node) GetData() argument 136 AllocateData(Node* node) AllocateData() argument 145 Participates(Node* node) Participates() argument 148 GetClass(Node* node) GetClass() argument 149 SetClass(Node* node, size_t number) SetClass() argument 155 GetBracketList(Node* node) GetBracketList() argument 159 SetBracketList(Node* node, BracketList& list) SetBracketList() argument [all...] |
H A D | escape-analysis-reducer.cc | 78 Node* node = jsgraph()->graph()->NewNode(jsgraph()->common()->ObjectId(id)); in ObjectIdNode() local 85 Reduction EscapeAnalysisReducer::Reduce(Node* node) { in Reduce() argument 144 ReduceFrameStateInputs(Node* node) ReduceFrameStateInputs() argument 157 ReduceDeoptState(Node* node, Node* effect, Deduplicator* deduplicator) ReduceDeoptState() argument 363 Query(Node* node) Query() argument 399 Node* node; Get() local [all...] |
H A D | dead-code-elimination.cc | 32 bool NoReturn(Node* node) { in NoReturn() argument 39 Node* FindDeadInput(Node* node) { in FindDeadInput() argument 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...] |
H A D | js-inlining-heuristic.h | 66 Node* node = nullptr; // The call site at which to inline. member
|
H A D | loop-analysis.h | 76 Loop* ContainingLoop(Node* node) { in ContainingLoop() argument 84 Contains(const Loop* loop, Node* node) Contains() argument 214 map(Node* node) map() argument 251 Marked(Node* node) Marked() argument [all...] |
H A D | memory-optimizer.cc | 23 bool CanAllocate(const Node* node) { in CanAllocate() argument 145 void WriteBarrierAssertFailed(Node* node, Node* object, const char* name, in WriteBarrierAssertFailed() argument 207 VisitNode(Node* node, AllocationState const* state) VisitNode() argument 245 AllocationTypeNeedsUpdateToOld(Node* const node, const Edge edge) AllocationTypeNeedsUpdateToOld() argument 259 ReplaceUsesAndKillNode(Node* node, Node* replacement) ReplaceUsesAndKillNode() argument 268 VisitAllocateRaw(Node* node, AllocationState const* state) VisitAllocateRaw() argument 310 VisitLoadFromObject(Node* node, AllocationState const* state) VisitLoadFromObject() argument 321 VisitStoreToObject(Node* node, AllocationState const* state) VisitStoreToObject() argument 329 VisitLoadElement(Node* node, AllocationState const* state) VisitLoadElement() argument 336 VisitLoadField(Node* node, AllocationState const* state) VisitLoadField() argument 356 VisitStoreElement(Node* node, AllocationState const* state) VisitStoreElement() argument 363 VisitStoreField(Node* node, AllocationState const* state) VisitStoreField() argument 369 VisitStore(Node* node, AllocationState const* state) VisitStore() argument 375 VisitCall(Node* node, AllocationState const* state) VisitCall() argument 384 VisitOtherEffect(Node* node, AllocationState const* state) VisitOtherEffect() argument 415 EnqueueMerge(Node* node, int index, AllocationState const* state) EnqueueMerge() argument 458 EnqueueUses(Node* node, AllocationState const* state) EnqueueUses() argument 466 EnqueueUse(Node* node, int index, AllocationState const* state) EnqueueUse() argument [all...] |
H A D | wasm-inlining.h | 67 Node* node; member
|
/third_party/node/deps/v8/include/v8-include/cppgc/ |
H A D | persistent.h | 32 void SetNode(PersistentNode* node) { node_ = node; } in SetNode() argument
|
/third_party/node/deps/v8/src/codegen/ |
H A D | tnode.h | 374 static TNode UncheckedCast(compiler::Node* node) { return TNode(node); } in UncheckedCast() argument 377 explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); } in TNode() argument
|