/external/v8/src/compiler/ |
H A D | control-equivalence.h | 10 #include "src/compiler/node.h" 43 // Run the main algorithm starting from the {exit} control node. This causes 52 size_t ClassOf(Node* node) { argument 53 DCHECK_NE(kInvalidClass, GetClass(node)); 54 return GetClass(node); 69 // The set of brackets for each node during the DFS walk. 76 Node* parent_node; // Parent node of entry during DFS walk. 77 Node* node; // Node that this stack entry belongs to. member in struct:v8::internal::compiler::final::DFSStackEntry 84 size_t class_number; // Equivalence class number assigned to node. 85 size_t dfs_number; // Pre-order DFS number assigned to node 127 GetData(Node* node) argument 137 GetNumber(Node* node) argument 138 SetNumber(Node* node, size_t number) argument 143 GetClass(Node* node) argument 144 SetClass(Node* node, size_t number) argument 149 GetBracketList(Node* node) argument 150 SetBracketList(Node* node, BracketList& list) argument [all...] |
H A D | loop-peeling.cc | 8 #include "src/compiler/node-marker.h" 9 #include "src/compiler/node-properties.h" 10 #include "src/compiler/node.h" 105 // Maps a node to its index in the {pairs} vector. 113 Node* map(Node* node) { argument 114 if (node_map.Get(node) == 0) return node; 115 return pairs->at(node_map.Get(node)); 127 for (Node* node : nodes) { 129 for (Node* input : node 148 Marked(Node* node) argument 159 map(Node* node) argument 326 EliminateLoopExit(Node* node) argument 367 Node* node = queue.front(); local [all...] |
H A D | simd-scalar-lowering.h | 11 #include "src/compiler/node-marker.h" 36 Node* node[kMaxLanes]; member in struct:v8::internal::compiler::SimdScalarLowering::Replacement 46 void LowerNode(Node* node); 47 bool DefaultLowering(Node* node); 50 bool HasReplacement(size_t index, Node* node); 51 Node** GetReplacements(Node* node); 52 Node** GetReplacementsWithType(Node* node, SimdType type); 53 SimdType ReplacementType(Node* node); 55 void SetLoweredType(Node* node, Node* output); 58 Node* node; member in struct:v8::internal::compiler::SimdScalarLowering::NodeState [all...] |
H A D | typed-optimization.h | 42 Reduction Reduce(Node* node) final; 45 Reduction ReduceCheckHeapObject(Node* node); 46 Reduction ReduceCheckMaps(Node* node); 47 Reduction ReduceCheckString(Node* node); 48 Reduction ReduceLoadField(Node* node); 49 Reduction ReduceNumberRoundop(Node* node); 50 Reduction ReduceNumberToUint8Clamped(Node* node); 51 Reduction ReducePhi(Node* node); 52 Reduction ReduceSelect(Node* node);
|
/external/v8/src/interpreter/ |
H A D | bytecode-dead-code-optimizer.cc | 24 void BytecodeDeadCodeOptimizer::Write(BytecodeNode* node) { argument 28 switch (node->bytecode()) { 38 next_stage_->Write(node); 42 void BytecodeDeadCodeOptimizer::WriteJump(BytecodeNode* node, argument 49 switch (node->bytecode()) { 58 next_stage_->WriteJump(node, label);
|
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
H A D | Graph.py | 26 that operate on the outgoing, incoming or all edges of that node. 28 For example: :py:meth:`inc_degree` will refer to the degree of the node 30 the node). 33 orientation of the edges used in the method with respect to the node. 35 For example: :py:meth:`forw_bfs` will start at the node then use the outgoing 64 def add_node(self, node, node_data=None): 66 Adds a new node to the graph. Arbitrary data can be attached to the 67 node via the node_data parameter. Adding the same node twice will be 70 The node mus [all...] |
H A D | GraphUtil.py | 29 for node in nodes: 30 g.add_node(node) 71 for node in range(growth_num, steps * growth_num): 72 graph.add_node(node) 73 while ( graph.out_degree(node) < growth_num ): 77 if node == nbr and not self_loops: 81 if graph.edge_by_node(node, nbr) and not multi_edges: 84 graph.add_edge(node, nbr) 87 for nbr in graph.out_nbrs(node): 88 store.append(node) [all...] |
/external/selinux/libsepol/cil/src/ |
H A D | cil_parser.c | 81 static void create_node(struct cil_tree_node **node, struct cil_tree_node *current, int line, int hll_line, void *value) argument 83 cil_tree_node_init(node); 84 (*node)->parent = current; 85 (*node)->flavor = CIL_NODE; 86 (*node)->line = line; 87 (*node)->hll_line = hll_line; 88 (*node)->data = value; 91 static void insert_node(struct cil_tree_node *node, struct cil_tree_node *current) argument 94 current->cl_head = node; 96 current->cl_tail->next = node; 104 struct cil_tree_node *node; local 183 struct cil_tree_node *node; local 205 struct cil_tree_node *node = NULL; local [all...] |
/external/fio/lib/ |
H A D | prio_tree.h | 67 static inline int prio_tree_root(const struct prio_tree_node *node) argument 69 return node->parent == node; 72 static inline int prio_tree_left_empty(const struct prio_tree_node *node) argument 74 return node->left == node; 77 static inline int prio_tree_right_empty(const struct prio_tree_node *node) argument 79 return node->right == node; 84 struct prio_tree_node *old, struct prio_tree_node *node); [all...] |
/external/v8/tools/ |
H A D | profile_view.js | 52 callTree.traverse(function(node, viewParent) { 53 var totalWeight = node.totalWeight * samplingRate; 54 var selfWeight = node.selfWeight * samplingRate; 62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head); 78 * @param {ProfileView.Node} head View head node. 87 * Factory method for a profile view node. 96 * @return {ProfileView.Node} Profile view node. 109 * @param {ProfileView.Node} head Head (root) node. 125 this.traverse(function (node) { 126 node [all...] |
/external/freetype/src/base/ |
H A D | ftdbgmem.c | 278 FT_MemNode node, next, *pnode; local 282 node = table->buckets[i]; 283 while ( node ) 285 next = node->link; 286 hash = FT_MEM_VAL( node->address ) % (FT_PtrDist)new_size; 289 node->link = pnode[0]; 290 pnode[0] = node; 292 node = next; 358 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local 361 while ( node ) 432 FT_MemNode *pnode, node; local 457 FT_MemSource node, *pnode; local 512 FT_MemNode *pnode, node; local 612 FT_MemNode *pnode, node; local 744 FT_MemNode node, *pnode; local [all...] |
/external/pdfium/third_party/freetype/src/base/ |
H A D | ftdbgmem.c | 278 FT_MemNode node, next, *pnode; local 282 node = table->buckets[i]; 283 while ( node ) 285 next = node->link; 286 hash = FT_MEM_VAL( node->address ) % (FT_PtrDist)new_size; 289 node->link = pnode[0]; 290 pnode[0] = node; 292 node = next; 358 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local 361 while ( node ) 431 FT_MemNode *pnode, node; local 456 FT_MemSource node, *pnode; local 511 FT_MemNode *pnode, node; local 611 FT_MemNode *pnode, node; local 743 FT_MemNode node, *pnode; local [all...] |
/external/v8/src/compiler/x64/ |
H A D | instruction-selector-x64.cc | 9 #include "src/compiler/node-matchers.h" 10 #include "src/compiler/node-properties.h" 22 bool CanBeImmediate(Node* node) { argument 23 switch (node->opcode()) { 28 const int64_t value = OpParameter<int64_t>(node); 32 const double value = OpParameter<double>(node); 40 int32_t GetImmediateIntegerValue(Node* node) { argument 41 DCHECK(CanBeImmediate(node)); 42 if (node->opcode() == IrOpcode::kInt32Constant) { 43 return OpParameter<int32_t>(node); 49 CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input, int effect_level) argument 210 VisitLoad(Node* node) argument 225 VisitProtectedLoad(Node* node) argument 244 VisitStore(Node* node) argument 334 VisitUnalignedLoad(Node* node) argument 337 VisitUnalignedStore(Node* node) argument 339 VisitCheckedLoad(Node* node) argument 393 VisitCheckedStore(Node* node) argument 452 VisitBinop(InstructionSelector* selector, Node* node, InstructionCode opcode, FlagsContinuation* cont) argument 513 VisitBinop(InstructionSelector* selector, Node* node, InstructionCode opcode) argument 520 VisitWord32And(Node* node) argument 533 VisitWord64And(Node* node) argument 538 VisitWord32Or(Node* node) argument 543 VisitWord64Or(Node* node) argument 548 VisitWord32Xor(Node* node) argument 559 VisitWord64Xor(Node* node) argument 574 VisitWord32Shift(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 593 VisitWord64Shift(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 640 VisitWord32Shl(Node* node) argument 653 VisitWord64Shl(Node* node) argument 679 VisitWord32Shr(Node* node) argument 684 TryMatchLoadWord64AndShiftRight(InstructionSelector* selector, Node* node, InstructionCode opcode) argument 763 VisitWord64Shr(Node* node) argument 768 VisitWord32Sar(Node* node) argument 784 VisitWord64Sar(Node* node) argument 790 VisitWord32Ror(Node* node) argument 795 VisitWord64Ror(Node* node) argument 800 VisitWord64Clz(Node* node) argument 806 VisitWord32Clz(Node* node) argument 812 VisitWord64Ctz(Node* node) argument 818 VisitWord32Ctz(Node* node) argument 824 VisitWord32ReverseBits(Node* node) argument 827 VisitWord64ReverseBits(Node* node) argument 829 VisitWord64ReverseBytes(Node* node) argument 831 VisitWord32ReverseBytes(Node* node) argument 833 VisitWord32Popcnt(Node* node) argument 839 VisitWord64Popcnt(Node* node) argument 845 VisitInt32Add(Node* node) argument 862 VisitInt64Add(Node* node) argument 879 VisitInt64AddWithOverflow(Node* node) argument 889 VisitInt32Sub(Node* node) argument 908 VisitInt64Sub(Node* node) argument 927 VisitInt64SubWithOverflow(Node* node) argument 939 VisitMul(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 956 VisitMulHigh(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 972 VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 981 VisitMod(InstructionSelector* selector, Node* node, ArchOpcode opcode) argument 992 VisitInt32Mul(Node* node) argument 1004 VisitInt32MulWithOverflow(Node* node) argument 1014 VisitInt64Mul(Node* node) argument 1018 VisitInt32MulHigh(Node* node) argument 1023 VisitInt32Div(Node* node) argument 1028 VisitInt64Div(Node* node) argument 1033 VisitUint32Div(Node* node) argument 1038 VisitUint64Div(Node* node) argument 1043 VisitInt32Mod(Node* node) argument 1048 VisitInt64Mod(Node* node) argument 1053 VisitUint32Mod(Node* node) argument 1058 VisitUint64Mod(Node* node) argument 1063 VisitUint32MulHigh(Node* node) argument 1068 VisitChangeFloat32ToFloat64(Node* node) argument 1074 VisitChangeInt32ToFloat64(Node* node) argument 1080 VisitChangeUint32ToFloat64(Node* node) argument 1086 VisitChangeFloat64ToInt32(Node* node) argument 1092 VisitChangeFloat64ToUint32(Node* node) argument 1098 VisitTruncateFloat64ToUint32(Node* node) argument 1104 VisitTruncateFloat32ToInt32(Node* node) argument 1110 VisitTruncateFloat32ToUint32(Node* node) argument 1116 VisitTryTruncateFloat32ToInt64(Node* node) argument 1132 VisitTryTruncateFloat64ToInt64(Node* node) argument 1148 VisitTryTruncateFloat32ToUint64(Node* node) argument 1164 VisitTryTruncateFloat64ToUint64(Node* node) argument 1180 VisitChangeInt32ToInt64(Node* node) argument 1216 ZeroExtendsWord32ToWord64(Node* node) argument 1273 VisitChangeUint32ToUint64(Node* node) argument 1287 VisitRO(InstructionSelector* selector, Node* node, InstructionCode opcode) argument 1294 VisitRR(InstructionSelector* selector, Node* node, InstructionCode opcode) argument 1301 VisitRRO(InstructionSelector* selector, Node* node, InstructionCode opcode) argument 1308 VisitFloatBinop(InstructionSelector* selector, Node* node, ArchOpcode avx_opcode, ArchOpcode sse_opcode) argument 1321 VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input, ArchOpcode avx_opcode, ArchOpcode sse_opcode) argument 1334 VisitTruncateFloat64ToFloat32(Node* node) argument 1338 VisitTruncateFloat64ToWord32(Node* node) argument 1343 VisitTruncateInt64ToInt32(Node* node) argument 1368 VisitRoundFloat64ToInt32(Node* node) argument 1372 VisitRoundInt32ToFloat32(Node* node) argument 1378 VisitRoundInt64ToFloat32(Node* node) argument 1384 VisitRoundInt64ToFloat64(Node* node) argument 1390 VisitRoundUint32ToFloat32(Node* node) argument 1396 VisitRoundUint64ToFloat32(Node* node) argument 1404 VisitRoundUint64ToFloat64(Node* node) argument 1412 VisitBitcastFloat32ToInt32(Node* node) argument 1418 VisitBitcastFloat64ToInt64(Node* node) argument 1424 VisitBitcastInt32ToFloat32(Node* node) argument 1430 VisitBitcastInt64ToFloat64(Node* node) argument 1436 VisitFloat32Add(Node* node) argument 1441 VisitFloat32Sub(Node* node) argument 1445 VisitFloat32Mul(Node* node) argument 1450 VisitFloat32Div(Node* node) argument 1455 VisitFloat32Abs(Node* node) argument 1460 VisitFloat32Sqrt(Node* node) argument 1464 VisitFloat32Max(Node* node) argument 1468 VisitFloat32Min(Node* node) argument 1472 VisitFloat64Add(Node* node) argument 1477 VisitFloat64Sub(Node* node) argument 1481 VisitFloat64Mul(Node* node) argument 1486 VisitFloat64Div(Node* node) argument 1491 VisitFloat64Mod(Node* node) argument 1500 VisitFloat64Max(Node* node) argument 1505 VisitFloat64Min(Node* node) argument 1510 VisitFloat64Abs(Node* node) argument 1514 VisitFloat64Sqrt(Node* node) argument 1519 VisitFloat32RoundDown(Node* node) argument 1524 VisitFloat64RoundDown(Node* node) argument 1529 VisitFloat32RoundUp(Node* node) argument 1534 VisitFloat64RoundUp(Node* node) argument 1539 VisitFloat32RoundTruncate(Node* node) argument 1544 VisitFloat64RoundTruncate(Node* node) argument 1549 VisitFloat64RoundTiesAway(Node* node) argument 1554 VisitFloat32RoundTiesEven(Node* node) argument 1559 VisitFloat64RoundTiesEven(Node* node) argument 1563 VisitFloat32Neg(Node* node) argument 1567 VisitFloat64Neg(Node* node) argument 1571 VisitFloat64Ieee754Binop(Node* node, InstructionCode opcode) argument 1579 VisitFloat64Ieee754Unop(Node* node, InstructionCode opcode) argument 1586 EmitPrepareArguments( ZoneVector<PushParameter>* arguments, const CallDescriptor* descriptor, Node* node) argument 1739 VisitWordCompare(InstructionSelector* selector, Node* node, InstructionCode opcode, FlagsContinuation* cont) argument 1788 VisitWord64Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) argument 1841 VisitCompareZero(InstructionSelector* selector, Node* node, InstructionCode opcode, FlagsContinuation* cont) argument 1849 VisitFloat32Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) argument 1860 VisitFloat64Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) argument 1977 Node* const node = value->InputAt(0); local 2027 VisitDeoptimizeIf(Node* node) argument 2033 VisitDeoptimizeUnless(Node* node) argument 2039 VisitSwitch(Node* node, const SwitchInfo& sw) argument 2070 VisitWord32Equal(Node* const node) argument 2106 VisitInt32LessThan(Node* node) argument 2112 VisitInt32LessThanOrEqual(Node* node) argument 2119 VisitUint32LessThan(Node* node) argument 2125 VisitUint32LessThanOrEqual(Node* node) argument 2132 VisitWord64Equal(Node* const node) argument 2154 VisitInt32AddWithOverflow(Node* node) argument 2164 VisitInt32SubWithOverflow(Node* node) argument 2174 VisitInt64LessThan(Node* node) argument 2180 VisitInt64LessThanOrEqual(Node* node) argument 2187 VisitUint64LessThan(Node* node) argument 2193 VisitUint64LessThanOrEqual(Node* node) argument 2200 VisitFloat32Equal(Node* node) argument 2206 VisitFloat32LessThan(Node* node) argument 2213 VisitFloat32LessThanOrEqual(Node* node) argument 2220 VisitFloat64Equal(Node* node) argument 2225 VisitFloat64LessThan(Node* node) argument 2247 VisitFloat64LessThanOrEqual(Node* node) argument 2254 VisitFloat64ExtractLowWord32(Node* node) argument 2261 VisitFloat64ExtractHighWord32(Node* node) argument 2268 VisitFloat64InsertLowWord32(Node* node) argument 2282 VisitFloat64InsertHighWord32(Node* node) argument 2290 VisitFloat64SilenceNaN(Node* node) argument 2296 VisitAtomicLoad(Node* node) argument 2305 VisitAtomicStore(Node* node) argument 2343 VisitCreateInt32x4(Node* node) argument 2348 VisitInt32x4ExtractLane(Node* node) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
H A D | TreeWalker2Result.java | 65 * @param pos Start node for traversal 78 * End processing of given node 81 * @param node Node we just finished processing 85 protected void endNode(int node) throws org.xml.sax.SAXException argument 87 super.endNode(node); 88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node)) 95 * Start traversal of the tree at the given node 98 * @param node Starting node for traversal 102 protected void startNode(int node) throw argument [all...] |
/external/clang/test/CodeGen/ |
H A D | tbaa-thread-sanitizer.cpp | 5 struct iterator { void *node; }; member in struct:iterator
|
/external/dtc/tests/ |
H A D | overlay_base_manual_symbols.dts | 11 test: test-node { 16 subtest: sub-test-node {
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
H A D | Node.java | 3 package com.google.clearsilver.jsilver.syntax.node; 28 public void replaceBy(Node node) argument 30 this.parent.replaceChild(this, node); 33 protected String toString(Node node) argument 35 if(node != null) 37 return node.toString(); 56 protected <T extends Node> T cloneNode(T node) argument 58 if(node != null) 60 return (T) node.clone();
|
/external/libmojo/third_party/jinja2/ |
H A D | meta.py | 72 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import, 74 if not isinstance(node.template, nodes.Const): 76 if isinstance(node.template, (nodes.Tuple, nodes.List)): 77 for template_name in node.template.items: 91 if isinstance(node.template.value, string_types): 92 yield node.template.value 96 elif isinstance(node, nodes.Include) and \ 97 isinstance(node.template.value, (tuple, list)): 98 for template_name in node.template.value:
|
/external/libxml2/doc/examples/ |
H A D | tree2.c | 29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ local 37 * Creates a new document, a node and set it as a root node 49 * xmlNewChild() creates a new node, which is "attached" as child node 50 * of root_node node. 53 BAD_CAST "content of node 1"); 55 * The same as above, but the new child node doesn't have a content 60 * xmlNewProp() creates attributes, which is "attached" to an node [all...] |
/external/ltp/utils/ffsb-6.0-rc2/ |
H A D | rbt.h | 28 * 1. Every node is either red or black 29 * 2. The root node is black 31 * 4. If a node is red, both its children are black 32 * 5. For each node, all paths from the node to descendant leaf nodes 64 /*! Representation of a node in a red-black tree */ 67 rb_color color; /* the color of the node */ 68 struct red_black_node *parent; /* points to the parent node */ 77 /* Construct of a red-black tree node 78 * - The object stored in the node [all...] |
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
H A D | AnchorGenerator.java | 22 String nextAnchor(Node node); argument
|
/external/libdrm/amdgpu/ |
H A D | util_hash.c | 105 static void util_free_node(struct util_node *node) argument 107 free(node); 115 struct util_node *node = util_data_allocate_node(hash->data.d); local 117 if (!node) 120 node->key = akey; 121 node->value = avalue; 123 node->next = (struct util_node*)(*anextNode); 124 *anextNode = node; 126 return node; 208 struct util_node **node; local 228 struct util_node *node = util_hash_create_node(hash, key, data, nextNode); local 304 util_hash_data_next(struct util_node *node) argument 350 struct util_node **node = util_hash_find_node(hash, akey); local 373 struct util_node *node = iter.node; local [all...] |
/external/toybox/lib/ |
H A D | dirtree.c | 24 // Create a dirtree node from a path, with stat and symlink info. 35 // open code this because haven't got node to call dirtree_parentfd() on yet 69 // Return path to this node, assembled recursively. 75 char *dirtree_path(struct dirtree *node, int *plen) argument 80 if (!node) { 86 len = (plen ? *plen : 0)+strlen(node->name)+1; 87 path = dirtree_path(node->parent, &len); 89 len = (stpcpy(path+len, node->name) - path); 95 int dirtree_parentfd(struct dirtree *node) argument 97 return node 105 dirtree_handle_callback(struct dirtree *new, int (*callback)(struct dirtree *node)) argument 130 dirtree_recurse(struct dirtree *node, int (*callback)(struct dirtree *node), int dirfd, int flags) argument 183 dirtree_flagread(char *path, int flags, int (*callback)(struct dirtree *node)) argument 190 dirtree_read(char *path, int (*callback)(struct dirtree *node)) argument [all...] |
/external/selinux/libsepol/src/ |
H A D | node_record.c | 265 ERR(handle, "could not create node key for (%s, %s, %s)", 284 const sepol_node_t * node, 293 tmp_key->addr = malloc(node->addr_sz); 294 tmp_key->mask = malloc(node->mask_sz); 299 memcpy(tmp_key->addr, node->addr, node->addr_sz); 300 memcpy(tmp_key->mask, node->mask, node->mask_sz); 301 tmp_key->addr_sz = node->addr_sz; 302 tmp_key->mask_sz = node 345 sepol_node_compare2(const sepol_node_t * node, const sepol_node_t * node2) argument 365 sepol_node_get_addr(sepol_handle_t * handle, const sepol_node_t * node, char **addr) argument 636 sepol_node_free(sepol_node_t * node) argument [all...] |
/external/libxml2/ |
H A D | debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt 54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node); 66 ctxt->node = NULL; 83 * @node: the node 84 * @ns: the namespace node 86 * Check that a given namespace is in scope on a node. 90 * an ancestor node. 93 xmlNsCheckScope(xmlNodePtr node, xmlNsPt argument 197 xmlCtxtNsCheckScope(xmlDebugCtxtPtr ctxt, xmlNodePtr node, xmlNsPtr ns) argument 275 xmlCtxtGenericNodeCheck(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 879 xmlCtxtDumpOneNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1062 xmlCtxtDumpNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1089 xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1439 xmlDebugDumpOneNode(FILE * output, xmlNodePtr node, int depth) argument 1460 xmlDebugDumpNode(FILE * output, xmlNodePtr node, int depth) argument 1482 xmlDebugDumpNodeList(FILE * output, xmlNodePtr node, int depth) argument 1604 xmlLsCountNode(xmlNodePtr node) argument 1661 xmlLsOneNode(FILE *output, xmlNodePtr node) argument 1890 xmlShellPrintNodeCtxt(xmlShellCtxtPtr ctxt,xmlNodePtr node) argument 1918 xmlShellPrintNode(xmlNodePtr node) argument 2004 xmlShellList(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2047 xmlShellBase(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2084 xmlShellSetBase(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2197 xmlShellGrep(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2275 xmlShellDir(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2309 xmlShellSetContent(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *value, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2411 xmlShellCat(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2512 xmlShellWrite(xmlShellCtxtPtr ctxt, char *filename, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2687 xmlNodePtr node; local 2768 xmlShellPwd(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *buffer, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument [all...] |