This file is indexed.

/usr/share/pyshared/asrun/thread.py is in code-aster-run 1.13.1-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
# -*- coding: utf-8 -*-

# ==============================================================================
# COPYRIGHT (C) 1991 - 2003  EDF R&D                  WWW.CODE-ASTER.ORG
# THIS PROGRAM IS FREE SOFTWARE; YOU CAN REDISTRIBUTE IT AND/OR MODIFY
# IT UNDER THE TERMS OF THE GNU GENERAL PUBLIC LICENSE AS PUBLISHED BY
# THE FREE SOFTWARE FOUNDATION; EITHER VERSION 2 OF THE LICENSE, OR
# (AT YOUR OPTION) ANY LATER VERSION.
#
# THIS PROGRAM IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL, BUT
# WITHOUT ANY WARRANTY; WITHOUT EVEN THE IMPLIED WARRANTY OF
# MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. SEE THE GNU
# GENERAL PUBLIC LICENSE FOR MORE DETAILS.
#
# YOU SHOULD HAVE RECEIVED A COPY OF THE GNU GENERAL PUBLIC LICENSE
# ALONG WITH THIS PROGRAM; IF NOT, WRITE TO EDF R&D CODE_ASTER,
#    1 AVENUE DU GENERAL DE GAULLE, 92141 CLAMART CEDEX, FRANCE.
# ==============================================================================

"""
This module defines the Dispatcher class.
"""

import os
import traceback
from Queue import Queue, Empty

try:
    import threading as _threading
except ImportError:
    import dummy_threading as _threading


Lock  = _threading.Lock
RLock = _threading.RLock


def is_main_thread():
    """Tell if current thread is the main thread.
    """
    return _threading.currentThread().getName() == "MainThread"


class TaskAbort(Exception):
    """Exception to abort execution of all workers.
    """
    def __init__(self, reason, result=None):
        self.reason = reason          # reason (text)
        if result is None:
            result = []
        self.current_result = result  # result of tasks already done


class Task:
    """Task object (will be dispatched in different thread).
    """
    def __init__(self, **kwargs):
        """Constructor - initialization : store kwargs items as attributes.
        Attributes 'OUT' should also be initialized.
        """
        self.queue = None
        self.done  = []
        self.done_lock = Lock()
        for k, v in kwargs.items():
            setattr(self, k, v)
        # how many items treated at each call
        if getattr(self, 'nbmaxitem', None) is None:
            self.nbmaxitem = 1
    
    def execute(self, item, **kwargs):
        """Function called for each item of the stack
        (up to 'nbmaxitem' at each called).
        Warning : 'execute' should not modify attributes.
        """
        raise NotImplementedError, 'must be overridden in a subclass'

    def result(self, **kwargs):
        """Function called after each task to treat results of 'execute'.
        Arguments are 'execute' results + keywords args.
        'result' is called thread-safely, so can store results in attributes.
        """
        raise NotImplementedError, 'must be overridden in a subclass'

    def queue_get(self):
        """Get an item from the queue.
        """
        return self.queue.get_nowait()

    def queue_put(self, item):
        """Re-put an item into the queue.
        """
        self.queue.put_nowait(item)

    def is_queue_empty(self):
        """Return True if the queue is empty, False otherwise (not reliable!).
        """
        return self.queue.empty()

    def is_done(self, item):
        """Store item as done.
        """
        self.done_lock.acquire()
        self.done.append(item)
        nb = len(self.done)
        self.done_lock.release()
        return nb


class Dispatcher:
    """Execute a function in parallel.
    """
    result_lock = None
    WorkerClass = None
    
    def __init__(self, l_stack, task, numthread=1):
        """Execute in numthread separated threads (in parallel) using numthread Worker :
        
            for value in l_stack:
                out = task.execute(value)
                task.result(out) # vars_out allows to store "global" result.
        """
        queue = NumQueue()               # job queue
        if numthread > 1:
            Dispatcher.WorkerClass = ThreadWorker
        else:
            Dispatcher.WorkerClass = SequentialWorker
        Dispatcher.WorkerClass.numthread = 0   # thread creation count
        self.l_thread = []               # threads
        Dispatcher.result_lock = Lock()
        
        assert isinstance(task, Task), "'task' argument must be a Task instance !"
        
        # fill the queue
        for item in l_stack:
            queue.put(item)
        nbitem = len(l_stack)
        task.nbitem   = nbitem
        task.nbthread = numthread
        task.queue    = queue
        # spawn threads
        for i in range(numthread):
            t = Dispatcher.WorkerClass(task, i)
            self.l_thread.append(t)
            t.start()
        # wait for threads to finish
        for t in self.l_thread:
            t.join()
    
    def store_result(func, args, **kwargs):
        """Store/print result from threads.
        """
        Dispatcher.result_lock.acquire()
        nb = 1
        if type(kwargs['itemid']) in (list, tuple):
            nb = len(kwargs['itemid'])
        Dispatcher.WorkerClass.done += nb
        tberr = None
        try:
            func(done=Dispatcher.WorkerClass.done, *args, **kwargs)
        except Exception:
            tberr = traceback.format_exc()
        Dispatcher.result_lock.release()
        if tberr:
            raise TaskAbort(tberr)
    store_result = staticmethod(store_result)
    
    def report(self):
        """Report.
        """
        tot = 0
        occ = []
        txt = []
        for t in self.l_thread:
            thr_id, nb = t.report()
            tot += nb
            occ.append((thr_id, nb))
        for thr_id, nb in occ:
            txt.append('Thread %3d visited %6d times - %3d%%' \
                % (thr_id, nb, int(100.*nb/max(tot, 1))))
        txt.insert(0, 'Dispatcher report - %6d calls' % tot)
        return os.linesep.join(txt)


class Worker:
    """Worker for sequential execution.
    """
    numthread = 0                        # thread creation count
    done      = 0                        # global number of completed tasks
    
    def __init__(self, task, threadid):
        self.queue = task.queue           # Queue of sorting jobs to do
        Worker.numthread += 1             # update count of created threads
        self.threadid = threadid          # unique id of this thread
        self.loop = 0                     # work done by thread
        self.task = task
    
    def run(self):
        """Thread loops taking jobs from queue until none are left.
        """
        while True:
            l_item, l_ids = [], []
            is_empty = False
            for ibid in range(self.task.nbmaxitem):
                try:
                    # get job, Queue handles the locks for us
                    iid, item = self.queue.get_nowait()
                    l_item.append(item)
                    l_ids.append(iid)
                except Empty:
                    is_empty = True
            if self.task.nbmaxitem == 0:
                is_empty = self.queue.empty()
            # no more item in queue
            if is_empty:
                break
            if self.task.nbmaxitem == 1:
                l_item = l_item[0]
                l_ids  = l_ids[0]
            
            self.loop += 1
            success = False
            result = []
            try:
                # call the function
                result = self.task.execute(l_item, threadid=self.threadid, itemid=l_ids)
                success = True
            except TaskAbort, err:
                print 'Interruption : %s' % err.reason
                result = err.current_result
            except Exception, err:
                print 'EXCEPTION (task.execute) :\n%s' % traceback.format_exc()
            if result:
                try:
                    Dispatcher.store_result(self.task.result, result,
                                                    threadid=self.threadid,
                                                    itemid=l_ids)
                except TaskAbort, err:
                    print 'EXCEPTION (task.result) :\n%s' % err.reason
                    success = False
            if not success:
                # Empty the queue to interrupt all workers
                self.queue.clear()
                break
    
    def report(self):
        """Report."""
        return (self.threadid, self.loop)


class ThreadWorker(Worker, _threading.Thread):
    """Worker thread for parallel execution.
    """
    def __init__(self, task, threadid):
        Worker.__init__(self, task, threadid)
        _threading.Thread.__init__(self)


class SequentialWorker(Worker):
    """Worker thread for sequential execution.
    """
    def start(self):
        """Fake start function."""
        self.run()
    
    def join(self):
        """Fake start function."""


class NumQueue(Queue):
    """Similar to a Queues object with a counter of extracted elements.
    """
    def __init__(self, **kwargs):
        """Initializations
        """
        Queue.__init__(self, **kwargs)
        self.counter = 0
    
    def _get(self):
        """Get an item from the queue
        """
        self.counter += 1
        return self.counter, self.queue.popleft()

    def _put(self, item):
        """Put an item into the queue
        """
        self.queue.append(item)

    def clear(self):
        """Empty the queue.
        """
        self.counter = 0
        self.queue.clear()