HashMap-死锁导致cpu占用100%分析（转）

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

private AlimamaCodeDAO alimamaCodeDAO;

   private Cache cache;

   /**

    * @param cache the cache to set

    */

   public void setCache(Cache cache) {

       this.cache = cache;

   }

   private Map codeMap; // KEYCODE与KEYNAME

   public List<AlimamaCodeDO> getAlimamaCodeByKey(String key) throws BOException {

       initCodeMap();

       return (List<AlimamaCodeDO>) codeMap.get(key);

   }

   private void initCodeMap() throws BOException {

       try {

           //Element element = cache.get(CacheKeyConstants.ALIMAMACODE_KEY);

           //if (element == null) {

               List codes = alimamaCodeDAO.findAllAlimamaCode();

               codeMap = new HashMap();

               for (int i = 0; i < codes.size(); i++) {

                   AlimamaCodeDO codeDo = (AlimamaCodeDO) codes.get(i);

                   if (!codeMap.containsKey(codeDo.getKey())) {

                       List list = new ArrayList();

                       list.add(codeDo);

                       codeMap.put(codeDo.getKey(), list);

                   } else {

                       ((List) codeMap.get(codeDo.getKey())).add(codeDo);

                   }

               }

               //element = new Element(CacheKeyConstants.ALIMAMACODE_KEY, (Serializable) codeMap);

               //cache.put(element);

           //}

           //codeMap = (Map) element.getValue();

       } catch (DAOException e) {

           throw new BOException("获取系统编码表时出现异常", e);

       }

   }

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

void transfer(Entry[] newTable) {

        Entry[] src = table;

        int newCapacity = newTable.length;

        for (int j = 0; j < src.length; j++) {

            Entry<K,V> e = src[j];

            if (e != null) {

                src[j] = null;

                do {

                    Entry<K,V> next = e.next;

                    int i = indexFor(e.hash, newCapacity);

                    e.next = newTable[i];

                    newTable[i] = e;

                    e = next;

                } while (e != null);

            }

        }

    }