File: idl_visitor.py

package info (click to toggle)
chromium 138.0.7204.183-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 6,071,908 kB
  • sloc: cpp: 34,937,088; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,953; asm: 946,768; xml: 739,971; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,806; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (45 lines) | stat: -rw-r--r-- 1,472 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
# Copyright 2012 The Chromium Authors
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.

""" Visitor Object for traversing AST """

#
# IDLVisitor
#
# The IDLVisitor class will traverse an AST truncating portions of the tree
# when 'VisitFilter' returns false.  After the filter returns true, for each
# node, the visitor will call the 'Arrive' member passing in the node and
# and generic data object from the parent call.  The returned value is then
# passed to all children who's results are aggregated into a list.  The child
# results along with the original Arrive result are passed to the Depart
# function which returns the final result of the Visit.  By default this is
# the exact value that was return from the original arrive.
#

class IDLVisitor(object):
  def __init__(self):
    pass

  # Return TRUE if the node should be visited
  def VisitFilter(self, node, data):
    return True

  def Visit(self, node, data):
    if not self.VisitFilter(node, data): return None

    childdata = []
    newdata = self.Arrive(node, data)
    for child in node.GetChildren():
      ret = self.Visit(child, newdata)
      if ret is not None:
        childdata.append(ret)
    return self.Depart(node, newdata, childdata)

  def Arrive(self, node, data):
    __pychecker__ = 'unusednames=node'
    return data

  def Depart(self, node, data, childdata):
    __pychecker__ = 'unusednames=node,childdata'
    return data